An Exploration of Geographic Routing with k-Hop Based Searching in Wireless Sensor Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

An Exploration of Geographic Routing with k-Hop Based Searching in Wireless Sensor Networks

Abstract

We explore the asymptotic performance of existing geographic routing with a utilization of k-hop neighborhood information. The reachability from source to sink improves as we use more information for routing decision and the average number of hops required decreases significantly from 1-hop to 2-hop searching, which indicates a potential tradeoff between performance enhancement and system complexity. As simple greedy geographic routing is insufficient in lossy wireless environment, we propose a new metric incorporating both advance in distance and link quality. Through simulations, we show its effectiveness over the conventional simple greedy method. The generalization to k-hop based routing and resulting performance are also presented. Simulation results show that with the multi-hop based searching, there is a good improvement in the number of transmissions required from source to sink, which also indicates potential improvement in routing delay and energy consumption in transmissions.
Fichier principal
Vignette du fichier
latex5_1802.pdf (164.64 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00332767 , version 1 (21-10-2008)

Identifiers

Cite

Chung Shue Chen, Yanjun Li, Ye-Qiong Song. An Exploration of Geographic Routing with k-Hop Based Searching in Wireless Sensor Networks. Third International Conference on Communications and Networking in China - ChinaCom 2008, Aug 2008, Hangzhou, China. pp.376-381, ⟨10.1109/CHINACOM.2008.4685045⟩. ⟨inria-00332767⟩
121 View
337 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More