Optimized Replication Strategy for Intermittently Connected Mobile Networks

2012 ◽  
Vol 8 (1) ◽  
pp. 1-18 ◽  
Author(s):  
C. Poongodi ◽  
A. M. Natarajan
Keyword(s):  
Mobile Networks ◽  
Mobile Ad Hoc Network ◽  
Relay Node ◽  
Resource Consumption ◽  
Delivery Ratio ◽  
High Resource ◽  
Maximum Delay ◽  
Replication Strategy ◽  
Network Overhead ◽  
Intermittently Connected

Intermittently Connected Mobile Networks (ICMNs) are wireless networks where due to mobility of nodes and lack of connectivity, there may be disconnection among the nodes. Hence, the routing path from source to destination is not always available. In this case, Mobile Ad-hoc Network (MANET) protocols will not be utilized. In these networks, messages are to be flooded or multiple replications are needed to withstand the maximum delay and achieve the high delivery ratio. But multiple replication based protocols result in increased network overhead and high resource consumption because of uncontrolled replication. In this paper, the authors introduce a new simple scheme which applies knapsack policy based replication strategy in replicating the messages. The number of replication is reduced by appropriately selecting only limited messages based on the number of duplications of its own and its size. The messages are selected for forwarding to relay node based on the goodness of the relay node in contacting the destination and the buffer size of the relay node. Therefore, only limited messages will be replicated in the network and it will reduce the network overhead, resource consumption, delivery delay and increases the delivery ratio.

Buffer Managed Multiple Replication Strategy Using Knapsack Policy for Intermittently Connected Mobile Networks

2014 ◽  
pp. 1-22
Author(s):  
C. Poongodi ◽  
A. M. Natarajan
Keyword(s):  
Mobile Networks ◽  
Relay Node ◽  
Resource Consumption ◽  
Delivery Ratio ◽  
Global Knowledge ◽  
High Resource ◽  
Replication Strategy ◽  
Long Time ◽  
Network Overhead ◽  
Intermittently Connected

Intermittently Connected Mobile Networks (ICMNs) are a kind of wireless network where, due to mobility of nodes and lack of connectivity, there may be disconnections among the nodes for a long time. To deal with such networks, store-carry-forward method is adopted for routing. This method buffers the messages in each node for a long time until a forwarding opportunity comes. Multiple replications are made for each message. It results in an increase in network overhead and high resource consumption because of uncontrolled replications. Uncontrolled replications are done due to lack of global knowledge about the messages and the forwarding nodes. The authors introduce a new simple scheme that applies knapsack policy-based replication strategy while replicating the messages residing in a node buffer. The numbers of replications are controlled by appropriately selecting messages based on the total count on replications already made and the message size. In addition, the messages are selected for forwarding based on the relay node goodness in contacting the destination and the remaining buffer size of that relay node. Therefore, useful replications are made based on the dynamic environment of a network, and it reduces the network overhead, resource consumption, delivery delay, and in turn, increases the delivery ratio.

scholarly journals A Social-Based DTN Routing in Cooperative Vehicular Sensor Networks

2018 ◽  
Vol 27 (01) ◽  
pp. 1741003 ◽  
Author(s):  
Tong Wang ◽  
Yongzhe Zhou ◽  
Xibo Wang ◽  
Yue Cao
Keyword(s):  
Information System ◽  
Sensor Networks ◽  
High Speed ◽  
Delivery Ratio ◽  
Dtn Routing ◽  
Replication Strategy ◽  
Social Metrics ◽  
Routing Mechanism ◽  
Network Overhead ◽  
Overhead Ratio

As a cooperative information system, vehicles in Vehicular Sensor Networks deliver messages based on collaboration. Due to the high speed of vehicles, the topology of the network is highly dynamic, and the network may be disconnected frequently. So how to transfer large files in such network is worth considering. The encountering nodes which never meet before flood messages blindly cause tremendous network overhead. We address this challenge by introducing the Encounter Utility Rank Router (EURR) based on social metrics. EURR includes three cases: Utility Replication Strategy, Lifetime Replication Strategy and SocialRank Replication Strategy. The Lifetime Replication is promising and complements Utility Replication. It enhances the delivery ratio by relaying the copy via the remaining lifetime. Considering the network overhead, the SocialRank Replication replicates a copy according to the SocialRank when two communicating nodes have not met before. The routing mechanism explores the utility of history encounter information and social opportunistic forwarding. The results under the scenario show an advantage of the proposed EURR over the compared algorithms in terms of delivery ratio, average delivery latency and overhead ratio.

scholarly journals Impact of buffer size and TTL on DTN routing protocols in intermittently connected mobile networks

2018 ◽  
Vol 7 (3) ◽  
pp. 1735 ◽  
Author(s):  
Md. Sharif Hossen ◽  
Md. Masum Billah ◽  
Suraiya Yasmin
Keyword(s):  
Mobile Networks ◽  
Routing Protocols ◽  
Network Performance ◽  
Performance Metrics ◽  
Limited Resources ◽  
Buffer Size ◽  
Delivery Ratio ◽  
Dtn Routing ◽  
The Impact ◽  
Intermittently Connected

Delay-Tolerant Networks (DTNs) are kinds of networks where there does not exist any complete end-to-end route from source to destination. Such networks can also be referred to as Intermittently Connected Mobile Networks (ICMNs), which are featured by asymmetric data rates, large delay, limited resources and high error rates. In this network, size of buffer and Time-to-Live (TTL) for fixed number of nodes and message generation rates contribute to the network performance because of limited resources and short life span of a packet in the net-work. Therefore, investigating efficient routing for altering TTL and size of buffer is very important for overall network performance. This paper presents a performance analysis based on simulation of the impact of buffer size and TTL for several DTN routing protocols in ICMNs scenario. ONE, i.e., Opportunistic Network Environment is used to simulate the routing protocols considering three performance metrics: delivery ratio, mean latency and overhead ratio. Investigated results mention that Spray-and-Focus (SNF) routing exhibits the best performance for altering TTL and size of buffer than other DTN routing protocols, i.e., Epidemic, PRoPHET, PRoPHETv2, MaxProp, RAPID, and Binary-SNW in the considered performance metrics and simulation scenario. 

scholarly journals Multipath Routing for Balancing the Load in Manet

2019 ◽  
Vol 9 (2) ◽  
pp. 3466-3468
Keyword(s):  
Data Transmission ◽  
Ad Hoc ◽  
Multipath Routing ◽  
Relay Node ◽  
Delivery Ratio ◽  
Routing Strategy ◽  
Routing Performance ◽  
Potential Applications ◽  
Hoc Networks ◽  
Network Overhead

Mobile Ad hoc Networks (MANETs) have attracted quite a concentration owing to their extensive potential applications. Load balancing is vital for enhancing performance in MANETs. Routing overload is the major causes of breaking routing performance in the network. To resolve these challenges, this paper intends a novel routing scheme is called Multipath Routing for Balancing the Load (MRBL) in MANET. In this scheme, the relay node is selected based on the received signal strength. During data transmission, the route node is overload due to heavy data transmission. When utilizing the multipath routing strategy. As a result, decreased network overhead and increased the packet delivery ratio. This work is simulated in NS-2 simulator, and the results show that MRBL scheme performs better than the baseline protocol.

Mobility-Based Routing in Opportunistic Networks

2012 ◽  
Vol 3 (2) ◽  
pp. 28-35
Author(s):  
Shivan Fazil Kurdi
Keyword(s):  
Opportunistic Networks ◽  
Routing Algorithms ◽  
Resource Consumption ◽  
Delivery Ratio ◽  
Node Mobility ◽  
Mobile Objects ◽  
Network Bandwidth ◽  
Research Findings ◽  
Complete Path ◽  
Intermittently Connected

In Opportunistic Networks (OppNets) nodes are only intermittently connected. A complete path from the sender node to the receiver does not exist. Mobile objects exploit direct contact for message transmission without relying on an existing end to end infrastructure. In such networks, routing is a challenging issue. Nevertheless, routing protocols in the mobility-based class of OppNets exploit some context information such as node mobility information and patterns to make forwarding decision, since the effectiveness of routing depends on node mobility. The aim of this research is to identify, evaluate, and compare the mobility-based routing algorithms of OppNets based on the simulation results obtained from published literature. The research findings indicate that mobility-based algorithms are suitable for conditions where network bandwidth and devices are considered significant constraints. They provide average delivery ratio with less resource consumption. In brief, they are ideal when network traffic and resource consumption are taken into consideration.

scholarly journals A Secure 3-Way Routing Protocols for Intermittently Connected Mobile Ad Hoc Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
Ramesh Sekaran ◽  
Ganesh Kumar Parasuraman
Keyword(s):  
Routing Protocols ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Network Routing ◽  
Secure Routing ◽  
Delivery Ratio ◽  
Security Level ◽  
Mobile Ad Hoc ◽  
Intermittently Connected

The mobile ad hoc network may be partially connected or it may be disconnected in nature and these forms of networks are termed intermittently connected mobile ad hoc network (ICMANET). The routing in such disconnected network is commonly an arduous task. Many routing protocols have been proposed for routing in ICMANET since decades. The routing techniques in existence for ICMANET are, namely, flooding, epidemic, probabilistic, copy case, spray and wait, and so forth. These techniques achieve an effective routing with minimum latency, higher delivery ratio, lesser overhead, and so forth. Though these techniques generate effective results, in this paper, we propose novel routing algorithms grounded on agent and cryptographic techniques, namely, location dissemination service (LoDiS) routing with agent AES, A-LoDiS with agent AES routing, and B-LoDiS with agent AES routing, ensuring optimal results with respect to various network routing parameters. The algorithm along with efficient routing ensures higher degree of security. The security level is cited testing with respect to possibility of malicious nodes into the network. This paper also aids, with the comparative results of proposed algorithms, for secure routing in ICMANET.

scholarly journals Enhanced replica detection scheme for efficient analysis of intrusion detection in MANET

2017 ◽  
Vol 7 (1.1) ◽  
pp. 565
Author(s):  
P. Bakeyalakshmi ◽  
S. K. Mahendran
Keyword(s):  
Intrusion Detection ◽  
Secure Communication ◽  
Mobile Ad Hoc Network ◽  
Delivery Ratio ◽  
Ratio Test ◽  
Network Simulator ◽  
Efficient Manner ◽  
Detection Scheme ◽  
Efficient Detection ◽  
Replica Detection

Nowadays, detection scheme of intrusion is placing a major role for efficient access and analysis in Mobile Ad-hoc network (MANET). In the past, the detection scheme of Intrusion was used to identify the efficiency of the network and in maximum systems it performs with huge rate of false alarm. In this paper, an Effective approach of the Enhanced Replica Detection scheme (ERDS) based on Sequential Probability Ratio Test (SPRT) is proposed to detect the malicious actions and to have a secure path without claim in an efficient manner. Also, provides strategies to avoid attacker and to provide secure communication. In order to have an efficient analysis of intrusion detection the proposed approach is implemented based on the anomaly. To achieve this, the detection scheme is established based on SPRT and demonstrated the performances of detection with less claim. The simulation results of control overhead, packet delivery ratio, efficient detection, energy consumption and average claims are carried out for the analysis of performance to show the improvement than the existing by using the network simulator tool. Also, the performance of the proposed system illustrated the detection of intrusion in the normal and attacker states of the network.

scholarly journals Comparative study of energy efficient MAC protocol with channel aware packet Scheduling in MANET

2018 ◽  
Vol 7 (1.9) ◽  
pp. 16
Author(s):  
T Dheepak ◽  
S Neduncheliyan
Keyword(s):  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Packet Scheduling ◽  
Mac Protocol ◽  
Mobile Node ◽  
Delivery Ratio ◽  
Link Failure ◽  
Failure State ◽  
Utility Factor ◽  
Mobile Ad Hoc

Mobile Ad Hoc Network is the centralized communication system which is used for transferring information through a secured mode from one end to another end. However, there is an energy loss that has been noticed in MANET. In this work, an efficient energy based Link Failure State Neighbor Detection Effective Efficient Protocol (LFSNDEEP) is to enhance the energy efficiency of the mobile node, and optimal transmission ratio computes Data, Audio, and Video packets. The proposed research on LFSNDEEP protocol is compared to Effective Efficient Neighbor Detection Protocol (EENDP) and which assigns the channel utilization. In this technique, the hello packet exchanges transmit based height and wavelength of the transmitter with particular distance. The computation of channel utility factor is the best method at link failure without data loss. The vitality utilization mathematical model is illustrated to show the nodes of least consumption by the broad recreation of utilization. The results observed from the proposed scheme shows that the energy level is minimized regarding the packet that loss is improved efficiently. In further, there are two results which can be gained in comparing with EENDP; firstly, packet delivery ratio and throughput get increased. And secondly, the end to end delay is decreased.

scholarly journals A Bioinspired Adaptive Congestion-Avoidance Routing for Mobile Ad Hoc Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Huang Qiong ◽  
Yin Pengfei ◽  
Chen Qianbin ◽  
Gong Pu ◽  
Yang Xiaolong
Keyword(s):  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Threshold Value ◽  
Recovery Phase ◽  
Network Routing ◽  
Delivery Ratio ◽  
Route Maintenance ◽  
Random Manner ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Traditional mobile Ad Hoc network routing protocols are mainly based on the Shortest Path, which possibly results in many congestion nodes that incur routing instability and rerouting. To mitigate the side-efforts, this paper proposed a new bioinspired adaptive routing protocol (ATAR) based on a mathematics biology model ARAS. This paper improved the ARAS by reducing the randomness and by introducing a new routing-decision metric “the next-hop fitness” which was denoted as the congestion level of node and the length of routing path. In the route maintenance, the nodes decide to forward the data to next node according to a threshold value of the fitness. In the recovery phase, the node will adopt random manner to select the neighbor as the next hop by calculation of the improved ARAS. With this route mechanism, the ATAR could adaptively circumvent the congestion nodes and the rerouting action is taken in advance. Theoretical analysis and numerical simulation results show that the ATAR protocol outperforms AODV and MARAS in terms of delivery ratio, ETE delay, and the complexity. In particular, ATAR can efficiently mitigate the congestion.

scholarly journals A Novel Clustering Algorithm Based on Agent Technology for VANET

2016 ◽  
Vol 8 (2) ◽  
pp. 1 ◽  
Author(s):  
Samira Harrabi ◽  
Ines Ben Jaafar ◽  
Khaled Ghedira
Keyword(s):  
Traffic Congestion ◽  
Ad Hoc Network ◽  
Clustering Algorithm ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Clustering Algorithms ◽  
High Mobility ◽  
Agent Technology ◽  
Related Data ◽  
Network Overhead

Vehicular Ad-hoc Network (VANET) is a sub-family of Mobile Ad-hoc Network (MANET).The means goal of VANET is to provide communications between nearby nodes or between nodes and fixed infrastructure. Despite that VANET is considered as a subclass of MANET, it has for particularity the high mobility of vehicles producing the frequent changes of network topology that involve changing of road, varying node density and locations of vehicles existing in this road. That‘s why, the most proposed clustering algorithms for MANET are unsuitable for VANET. Various searches have been recently published deal with clustering for VANETs. But most of them are focused on minimizing network overhead value, number of created clusters and had not considered the vehicles interests which defined as any related data used to differentiate vehicle from another (such as traffic congestion, looking for free parking space etc). In this paper, we propose a novel clustering algorithm based on agent technology to solve the problems mentioned above and improve routing in VANET. Experimental part show promising results regarding the adoption of the proposed approach.

Sign in / Sign up

Export Citation Format

Share Document