Search results

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 information. However, despite these significant disadvantages, hierarchical and geographical routing remains the routing option most often used in health, military, agriculture, robotic, and environmental and structural monitoring.