By Topic

Clusterization for Robust Geographic Routing in Wireless Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Lima, C. ; Univ. of Oulu, Oulu ; de Abreu, G.T.F.

A cross-layer algorithm for geographic routing in wireless sensor networks (WSNs) is proposed, which is robust to dead-ends and resilient to topological variations due to network dynamics. The solution combines ideas of network tessellation (clusterization) with greedy forwarding, without suffering from the problems afflicting landmark-based alternatives. The clusterization algorithm is based on a discovered graph-spectral property and relies on connectivity information only. Cluster sizes can be varied, allowing for different trade-offs between packet delivery success ratio (PDSR) and average packet delivery latency (APDL) to be reached. Simulation results show that the technique can substantially improve the PDSR in networks where large concave holes (dead-ends) are present, with no or little impact on APDL.

Published in:

Wireless Communications and Networking Conference, 2008. WCNC 2008. IEEE

Date of Conference:

March 31 2008-April 3 2008