scispace - formally typeset
Open AccessJournal ArticleDOI

Survey Paper: Routing protocols in ad hoc networks: A survey

TLDR
A taxonomy of the ad hoc routing protocols is created to uncover the requirements considered by the different protocols, the resource limitations under which they operate, and the design decisions made by the authors.
About
This article is published in Computer Networks.The article was published on 2011-09-01 and is currently open access. It has received 554 citations till now. The article focuses on the topics: Optimized Link State Routing Protocol & Link-state routing protocol.

read more

Citations
More filters
Journal ArticleDOI

DRINA: A Lightweight and Reliable Routing Approach for In-Network Aggregation in Wireless Sensor Networks

TL;DR: This work proposes a novel Data Routing for In-Network Aggregation, called DRINA, that has some key aspects such as a reduced number of messages for setting up a routing tree, maximized number of overlapping routes, high aggregation rate, and reliable data aggregation and transmission.
Journal ArticleDOI

Routing in Flying Ad Hoc Networks: Survey, Constraints, and Future Challenge Perspectives

TL;DR: A comprehensive survey is presented covering the architecture, the constraints, the mobility models, the routing techniques, and the simulation tools dedicated to FANETs, better presenting the state of the art of this specific area of research.
Journal ArticleDOI

Surveying wearable human assistive technology for life and safety critical applications: standards, challenges and opportunities

TL;DR: This survey presents a comprehensive study on the applications scenarios, their context and specific requirements, and explores details of the key enabling standards, existing state-of-the-art research studies, and projects to understand their limitations before realizing aforementioned applications.
Journal ArticleDOI

A survey on probabilistic broadcast schemes for wireless ad hoc networks

TL;DR: A classification of the probabilistic schemes, an exhaustive review of the evaluation methodology including their performance metrics, types of network simulators, their comparisons, and some examples of real implementations are presented in this paper.
References
More filters
Proceedings ArticleDOI

Ad-hoc on-demand distance vector routing

TL;DR: An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure and the proposed routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad- hoc networks.
Proceedings ArticleDOI

GPSR: greedy perimeter stateless routing for wireless networks

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.
Proceedings ArticleDOI

Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

TL;DR: The modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile hosts.
Proceedings ArticleDOI

A performance comparison of multi-hop wireless ad hoc network routing protocols

TL;DR: The results of a derailed packet-levelsimulationcomparing fourmulti-hopwirelessad hoc networkroutingprotocols, which cover a range of designchoices: DSDV,TORA, DSR and AODV are presented.
Proceedings ArticleDOI

Location-aided routing (LAR) in mobile ad hoc networks

TL;DR: An approach to utilize location information (for instance, obtained using the global positioning system) to improve performance of routing protocols for ad hoc networks is suggested.
Frequently Asked Questions (13)
Q1. What are the contributions mentioned in the paper "Routing protocols in ad hoc networks: a survey" ?

The objective of this paper is to create a taxonomy of the ad hoc routing protocols, and to survey and compare representative examples for each class of protocols. The authors strive to uncover the requirements considered by the different protocols, the resource limitations under which they operate, and the design decisions made by the authors. 

The main advantage of discovering multiple paths is that the bandwidth between links is used more effectively with greater delivery reliability. 

Wireless local area networks based on the 802.11a,b,g and n standards became one of the most ubiquitous ways of networking with mobile nodes. 

The mechanism is trustworthy and builds the reputation of each node with a set of forwarding policies while avoiding unreliable routes and balance network utilization simultaneously. 

the location independent addressing is used by TLR; on the other hand, TRR uses direct paths, perimeter modes and anchors. 

The main problem with source routing is the fact that large amounts of overhead is generated by storing the entire route in the packet itself. 

The proposed strategies try to mitigate the near-far effect at the network layer by making appropriate selections of routes within the network instead of using more sophisticated power control techniques. 

Using the error statistic, the objective function calculates a maximum expectation for each node in which the nodes with the highest expectation are chosen as the next node for packet forwarding. 

Other protocols do not establish a core but consider the available resources of the nodes on a case-by-case basis: energy efficient multicast routing [69] and PPMA[95] where energy is part of the probabilistic link cost. 

Weights are assigned to different routes during route discovery using the route expiration time (RET), the error count (EC) and the hop count (HC). 

The assumption is that nodes in the backbone will use table driven routing, while nodes outside the backbone will be reached with source initiated routing. 

Mobility aware protocol synthesis for efficient routing [9]: Bamis et al. propose a new stability metric to determine the mobility level of nodes in a network. 

These types of protocols are not suitable for highly dynamic networks due to the extra control overhead generated to keep the routing tables consistent and fresh for each node in the network.