An approach for routing in delay tolerant mobile ad-hoc networks using quadrant-based look-ahead method
01 Jan 2016-International Journal of Wireless and Mobile Computing (Inderscience Publishers (IEL))-Vol. 10, Iss: 3, pp 301-307
TL;DR: The proposed algorithm works based on quadrant-based look-ahead approach, which is highly efficient in managing the traffic uniformly, conserving energy, and increasing the lifetime of nodes as well as improving the route network stability.
Abstract: It is difficult for delay tolerant Mobile Ad-Hoc Networks MANETs to render the end-to-end paths from source to the destination where there is no proper connectivity. Opportunistic routing overcomes the deficiencies of conventional MANET routing, and the proposed algorithm works based on quadrant-based look-ahead approach, which is highly efficient in managing the traffic uniformly, conserving energy, and increasing the lifetime of nodes as well as improving the route network stability. The proposed method aimed at reducing the amount of time that packet spends in the buffers. Simulation studies reveal that the proposed novel routing approach outperforms the existing methods.
Citations
More filters
TL;DR: A novel Energy Efficient Node Rank-based Routing (EENRR algorithm) which includes certain performance metrics such as control overhead and residual energy in order to improve the Packet Delivery Ratio (PDR), and Network Life Time (NLT) from its originally observed routing performance obtained through other existing protocols.
Abstract: Mobile Ad-hoc Network (MANET) is an emerging technology, infrastructure less with self-organizing, selfhealing, multi-hop wireless routing networks in real time. In such networks, many routing problems arise due to complexity in the network mobility which results from difficulty in achieving energy efficient routing in the field of MANET. Due to the dynamic nature and the limited battery energy of the mobile nodes, the communication links between intermediate relay nodes may fail frequently, thus affecting the routing performance of the network and also the availability of the nodes. Though existing protocols are not concentrating about communication links and battery energy, node links are very important factor for improving quality of routing protocols because Node Rank helps us to determine whether the node is within transmission range or out of transmission range through considering residual energy of the node during the routing process. This paper proposes a novel Energy Efficient Node Rank-based Routing (EENRR algorithm which includes certain performance metrics such as control overhead and residual energy in order to improve the Packet Delivery Ratio (PDR), and Network Life Time (NLT) from its originally observed routing performance obtained through other existing protocols. Simulation results show that, when the number of nodes increases from 10 to 100 nodes, EENRR algorithm increases the average residual energy by 31.08% and 21.26% over the existing Dynamic Source Routing (DSR) and Energy Efficient Delay Time Routing (EEDTR) protocols, respectively. Similarly it increases the PDR by 45.38% and 28.3% over the existing DSR and EEDTR protocols respectively.
15 citations
TL;DR: The proposed routing algorithm introduces node degree deviation as an indicator of high-or low-degree nodes, and adopts a combination of the distance and consumed energy as the forwarding criterion, and extends the network lifetime and balances the energy consumption between the two node types.
Abstract: Wireless Sensor Networks WSNs have practical application in various fields. Routing in WSNs focuses on reduction of energy consumption and extension of the network lifetime owing to the limited energy, storage space and computing ability. In recent years, complex network-based approaches, which attempt to exploit the structure of WSNs to make better routing decision, are becoming increasingly popular. Since data transmission in WSNs follows a multi-hop pattern, the selection of the best forwarding sensor node is very important in routing. In order to let all sensor nodes take part in routing as evenly as possible and extend the network lifetime of WSNs, an energy-aware routing strategy is proposed with the aid of complex network theory. The proposed routing algorithm introduces node degree deviation as an indicator of high-or low-degree nodes, and adopts a combination of the distance and consumed energy as the forwarding criterion. By shifting traffic from high-degree to low-degree nodes, the proposed routing algorithm extends the network lifetime and balances the energy consumption between the two node types. Simulation results show that the proposed algorithm dramatically extends the network lifetime and balances the network energy consumption compared with local betweenness centrality-based energy-aware routing algorithm and the shortest path routing algorithm.
1 citations
TL;DR: In this paper , a fault-tolerant routing mechanism is designed and implemented to address the fault conditions such as node failure, link failure, and critical battery issues called Fault tolerant cluster based AODV with Error Reporting Routing (CAODVERR) protocol, and to improve the stability of the MANET.
Abstract: A Mobile Ad-hoc Network (MANET) is a self-constructed network consisting of spatially distributed nodes that cooperatively arrange themselves without any centralized manager or fixed based stations. In MANET, the nodes are deployed in a dynamic scenario, so, the nodes may fail as a result of energy depletion, hardware failure, communication link errors, and malicious attacks. Therefore, it is necessary to design energy-efficient fault-tolerant algorithms and protocols for MANETs. Since the development of Mobile Ad-hoc networks was originally motivated by military applications, such as battlefield surveillance and healthcare applications it is required to have a fast recovery mechanism to overcome the fault condition. In this research work, a fault-tolerant Routing mechanism is designed and implemented to address the fault conditions such as node failure, link failure, and critical battery issues called Fault tolerant cluster based AODV with Error Reporting Routing (CAODVERR) protocol, and to improve the stability of the MANET. Also, an Error reporting mechanism has been incorporated with the Ad-hoc On-Demand Distance Vector (AODV) routing protocol.
References
More filters
01 Aug 2000
TL;DR: Greedy Perimeter Stateless Routing is presented, a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions and its scalability on densely deployed wireless networks is demonstrated.
Abstract: We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions. GPSR makes greedy forwarding decisions using only information about a router's immediate neighbors in the network topology. When a packet reaches a region where greedy forwarding is impossible, the algorithm recovers by routing around the perimeter of the region. By keeping state only about the local topology, GPSR scales better in per-router state than shortest-path and ad-hoc routing protocols as the number of network destinations increases. Under mobility's frequent topology changes, GPSR can use local topology information to find correct new routes quickly. We describe the GPSR protocol, and use extensive simulation of mobile wireless networks to compare its performance with that of Dynamic Source Routing. Our simulations demonstrate GPSR's scalability on densely deployed wireless networks.
7,384 citations
01 Jan 2000
TL;DR: This work introduces Epidemic Routing, where random pair-wise exchanges of messages among mobile hosts ensure eventual message delivery and achieves eventual delivery of 100% of messages with reasonable aggregate resource consumption in a number of interesting scenarios.
Abstract: Mobile ad hoc routing protocols allow nodes with wireless adaptors to communicate with one another without any pre-existing network infrastructure. Existing ad hoc routing protocols, while robust to rapidly changing network topology, assume the presence of a connected path from source to destination. Given power limitations, the advent of short-range wireless networks, and the wide physical conditions over which ad hoc networks must be deployed, in some scenarios it is likely that this assumption is invalid. In this work, we develop techniques to deliver messages in the case where there is never a connected path from source to destination or when a network partition exists at the time a message is originated. To this end, we introduce Epidemic Routing, where random pair-wise exchanges of messages among mobile hosts ensure eventual message delivery. The goals of Epidemic Routing are to: i) maximize message delivery rate, ii) minimize message latency, and iii) minimize the total resources consumed in message delivery. Through an implementation in the Monarch simulator, we show that Epidemic Routing achieves eventual delivery of 100% of messages with reasonable aggregate resource consumption in a number of interesting scenarios.
4,355 citations
"An approach for routing in delay to..." refers background in this paper
...Epidemic (Vahdat and Becker, 2000), the prophet (Lindgren et al., 2003) and spray and wait (Spyropoulos et al., 2005) are good examples of non-deterministic or opportunistic approaches....
[...]
...Epidemic (Vahdat and Becker, 2000), the prophet (Lindgren et al....
[...]
22 Aug 2005
TL;DR: A new routing scheme, called Spray and Wait, that "sprays" a number of copies into the network, and then "waits" till one of these nodes meets the destination, which outperforms all existing schemes with respect to both average message delivery delay and number of transmissions per message delivered.
Abstract: Intermittently connected mobile networks are sparse wireless networks where most of the time there does not exist a complete path from the source to the destination. These networks fall into the general category of Delay Tolerant Networks. There are many real networks that follow this paradigm, for example, wildlife tracking sensor networks, military networks, inter-planetary networks, etc. In this context, conventional routing schemes would fail.To deal with such networks researchers have suggested to use flooding-based routing schemes. While flooding-based schemes have a high probability of delivery, they waste a lot of energy and suffer from severe contention, which can significantly degrade their performance. Furthermore, proposed efforts to significantly reduce the overhead of flooding-based schemes have often be plagued by large delays. With this in mind, we introduce a new routing scheme, called Spray and Wait, that "sprays" a number of copies into the network, and then "waits" till one of these nodes meets the destination.Using theory and simulations we show that Spray and Wait outperforms all existing schemes with respect to both average message delivery delay and number of transmissions per message delivered; its overall performance is close to the optimal scheme. Furthermore, it is highly scalable retaining good performance under a large range of scenarios, unlike other schemes. Finally, it is simple to implement and to optimize in order to achieve given performance goals in practice.
2,712 citations
"An approach for routing in delay to..." refers background in this paper
..., 2003) and spray and wait (Spyropoulos et al., 2005) are good examples of non-deterministic or opportunistic approaches....
[...]
...Epidemic (Vahdat and Becker, 2000), the prophet (Lindgren et al., 2003) and spray and wait (Spyropoulos et al., 2005) are good examples of non-deterministic or opportunistic approaches....
[...]
TL;DR: A probabilistic routing protocol for intermittently connected networks where there is no guarantee that a fully connected path between source and destination exist at any time, rendering traditional routing protocols unable to deliver messages between hosts.
Abstract: We consider the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exist at any time, rendering traditional routing protocols unable to deliver messages between hosts. We propose a probabilistic routing protocol for such networks.
2,530 citations
Book•
[...]
01 Jan 2008
TL;DR: In this article, the authors present a series of technical papers about ad hoc networks from a variety of laboratories and experts, and explain the latest thinking on how mobile devices can best discover, identify, and communicate with other devices in the vicinity.
Abstract: Ad hoc networks are to computing devices what Yahoo Personals are to single people: both help individuals communicate productively with strangers while maintaining security. Under the rules of ad hoc networking--which continue to evolve--your mobile phone can, when placed in proximity to your handheld address book, establish a little network on its own and enable data sharing between the two devices. In Ad Hoc Networking, Charles Perkins has compiled a series of technical papers about networking on the fly from a variety of laboratories and experts. The collection explains the latest thinking on how mobile devices can best discover, identify, and communicate with other devices in the vicinity. In this treatment, ad hoc networking covers a broad swath of situations. An ad hoc network might consist of several home-computing devices, plus a notebook computer that must exist on home and office networks without extra administrative work. Such a network might also need to exist when the people and equipment in normally unrelated military units need to work together in combat. Though the papers in this book are much more descriptive of protocols and algorithms than of their implementations, they aim individually and collectively at commercialization and popularization of mobile devices that make use of ad hoc networking. You'll enjoy this book if you're involved in researching or implementing ad hoc networking capabilities for mobile devices. --David Wall Topics covered: The state-of-the-art in protocols and algorithms to be used in ad hoc networks of mobile devices that move in and out of proximity to one another, to fixed resources like printers, and to Internet connectivity. Routing with Destination-Sequenced Distance Vector (DSDV), Dynamic Source Routing (DSR), Ad hoc On-Demand Distance Vector (AODV), and other resource-discovery and routing protocols; the effects of ad hoc networking on bandwidth consumption; and battery life.
2,022 citations