Scrutinizing Performance of Ad Hoc Routing Protocols on Wireless Sensor Networks (original) (raw)

An evaluation of ad-hoc routing protocols for wireless sensor networks

Master's thesis, School of Computing Science, …, 2004

Wireless sensor networks are formed by a large number of sensor nodes which are commonly known as motes. These motes are small in size and have limited processing power, memory and battery life. Motes typically have sensors such as thermometers attached to them in ...

Performance Analysis of Routing Protocols in Ad-hoc and Sensor Networking Environments

2008

Ad-hoc and sensor networks are becoming an increasingly popular wireless networking concepts lately. This paper analyzes and compares prominent routing schemes in these networking environments. The knowledge obtained can serve users to better understand short range wireless network solutions thus leading to options for implementation in various scenarios. In addition, it should aid researchers develop protocol improvements reliable for the technologies of interest.

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

Proceedings of the 4th …, 1998

An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administration. Due to the limited transmission range of wireless network interfaces, multiple network "hops" may be needed for one node to exchange data with another across the network. In recent years, a variety of new routing protocols targeted specifically at this environment have been developed, but little performance information on each protocol and no realistic performance comparison between them is available. This paper presents the results of a detailed packet-level simulation comparing four multi-hop wireless ad hoc network routing protocols that cover a range of design choices: DSDV, TORA, DSR, and AODV. We have extended the ns-2 network simulator to accurately model the MAC and physical-layer behavior of the IEEE 802.11 wireless LAN standard, including a realistic wireless transmission channel model, and present the results of simulations of networks of 50 mobile nodes.

Performance of Routing Protocols for Mobile Adhoc and Wireless Sensor Networks: A Comparative Study

2009

Mobile Ad hoc Networks (MANETs) as well as Wireless Sensor Networks (WSNs) suffer from various challenges like low bandwidth, overhead and velocity of nodes. This research contribution is the characterization study between MANETs and WSNs environment with respect to various routing protocols. This study investigates the routing protocols corresponding to packet delivery ratio, routing overhead, throughput and average to end-to-end delay. For MANETs, three protocols AODV, DSDV and TORA are selected and a performance study is done. The AODV perform better in MANETs and given better output, but performance of TORA is very poor and not reliable for MANETs. For WSNs, four protocols AODV, DSDV, TORA and LEACH are selected and evaluated. The AODV and LEACH both perform better but AODV is less reliable than LEACH because the result of AODV is fluctuated but LEACH shows stability. It is concluded that AODV shows better performance in both environments compared to DSDV and TORA. But average e...

Performance evaluation of routing protocols for ad hoc wireless networks

Mobile Networks and Applications, 2004

The assessment of routing protocols for mobile wireless networks is a difficult task, because of the networks' dynamic behavior and the absence of benchmarks. However, some of these networks, such as intermittent wireless sensors networks, periodic or cyclic networks, and some delay tolerant networks (DTNs), have more predictable dynamics, as the temporal variations in the network topology can be considered as deterministic, which may make them easier to study. Recently, a graph theoretic model -the evolving graphs -was proposed to help capture the dynamic behavior of such networks, in view of the construction of least cost routing and other algorithms. The algorithms and insights obtained through this model are theoretically very efficient and intriguing. However, there is no study about the use of such theoretical results into practical situations. Therefore, the objective of our work is to analyze the applicability of the evolving graph theory in the construction of efficient routing protocols in realistic scenarios. In this paper, we use the NS2 network simulator to first implement an evolving graph based routing protocol, and then to use it as a benchmark when comparing the four major ad-hoc routing protocols (AODV, DSR, OLSR and DSDV). Interest-This paper extends the initial results presented at the IEEE WiMob 2006, Montreal (Canada).

A MULTI-HOP AD HOC NETWORK ROUTING ALGORITHM BASED ON PERFORMANCE MAXIMIZATION

The criteria of ideal ad hoc routing protocols for selecting paths should consider and analyze the important performance parameters such as transmission reliability and network throughput. The optimal choice for a route would be a path with small number of hops and high transmission rates. In this paper, a theoretical model of performance maximization is proposed for a routing algorithm. A routing protocol using this model is proposed. A great increase on performance is shown compared with other methods. Finally, suggestions on the evaluation of different routing protocols are proposed too.

Performance analysis of routing strategies for wireless sensor networks

Revista Facultad De Ingenieria Universidad De Antioquia, 2010

This paper presents a performance analysis of source, shortest path, hierarchical and geographical routing strategies, which are the three most commonly, implemented strategies employed by wireless ad-hoc and sensor networks. Source routing was selected because it does not require costly topology maintenance, while shortest path routing was chosen because of its simple discovery routing approach and hierarchical and geographical routing was elected because it uses location information via Global Positioning System (GPS). Many current applications require precise knowledge of physical positioning information, particularly in the areas of health, military, agriculture, robotics, and environmental and structural monitoring. Additionally, the shortest path routing technique was chosen because it is employed in several data-centric wireless sensor network algorithms such as Direct Diffusion, Rumor Routing, Gradient-Based Routing and the ZigBee standard. The performance of these three routing strategies is evaluated by providing simulation results based on latency, End to End Delay (EED), packet delivery ratio, routing overhead, overhead and routing load. Source routing only improves shortest path and hierarchical and geographical routing in terms of latency, hierarchical and geographical routing performs the worst because it must send hello packets in order to acquire and transmit location