Performance analysis of routing strategies for wireless sensor networks

Fuente: Redalyc
Saved in:
Bibliographic Details
Main Author: Raúl Aquino-Santos
Format: Artículo científico
Language:en
Published: Universidad de Antioquia 2010
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1876483331272474624
author Raúl Aquino-Santos
author_facet Raúl Aquino-Santos
contents Performance analysis of routing strategies for wireless sensor networks Raúl Aquino-Santos Luis A. Villaseñor-González Víctor Rangel Licea Omar Álvarez Cárdenas Arthur Edwards Block Ingeniería multi hop networks unicast routing Wireless sensor networks hierarchical and flat routing mechanisms for wireless sensor networks 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. 2010 artículo científico 0120-6230 https://www.redalyc.org/articulo.oa?id=43016342016 en http://www.redalyc.org/revista.oa?id=430 Revista Facultad de Ingeniería Universidad de Antioquia application/pdf Universidad de Antioquia Revista Facultad de Ingeniería Universidad de Antioquia (Colombia) Num.52
format Artículo científico
id redalyc_43016342016
institution Redalyc
language en
publishDate 2010
publisher Universidad de Antioquia
spellingShingle Performance analysis of routing strategies for wireless sensor networks
Raúl Aquino-Santos
Ingeniería
multi
hop networks
unicast routing
Wireless sensor networks
hierarchical and flat routing mechanisms for wireless sensor networks
Performance analysis of routing strategies for wireless sensor networks Raúl Aquino-Santos Luis A. Villaseñor-González Víctor Rangel Licea Omar Álvarez Cárdenas Arthur Edwards Block Ingeniería multi hop networks unicast routing Wireless sensor networks hierarchical and flat routing mechanisms for wireless sensor networks 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. 2010 artículo científico 0120-6230 https://www.redalyc.org/articulo.oa?id=43016342016 en http://www.redalyc.org/revista.oa?id=430 Revista Facultad de Ingeniería Universidad de Antioquia application/pdf Universidad de Antioquia Revista Facultad de Ingeniería Universidad de Antioquia (Colombia) Num.52
title Performance analysis of routing strategies for wireless sensor networks
topic Ingeniería
multi
hop networks
unicast routing
Wireless sensor networks
hierarchical and flat routing mechanisms for wireless sensor networks
url https://www.redalyc.org/articulo.oa?id=43016342016