Multi-path GEM for Routing in Wireless Sensor Networks

Authors:
Qiang Ye;Yuxing Huang;Andrew Reddin;Lei Wang;Wuman Luo
Affiliations:
Dept. of Computer Science and Information Technology, UPEI, Charlottetown, Canada C1A 4P3;Dept. of Computer Science and Information Technology, UPEI, Charlottetown, Canada C1A 4P3;Dept. of Computer Science and Information Technology, UPEI, Charlottetown, Canada C1A 4P3;School of Computer Science, Beihang University, Beijing, P.R. China 100083;School of Software Engineering, Univ. of Elec. Science & Tech of China, Chengdu, P.R. China 610054
Venue:
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Year:
2008

Citing 4
Cited 0

Work-preserving emulations of fixed-connection networks

Journal of the ACM (JACM)
GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GEM: Graph EMbedding for routing and data-centric storage in sensor networks without geographic information

Proceedings of the 1st international conference on Embedded networked sensor systems
MuMHR: Multi-path, Multi-hop Hierarchical Routing

SENSORCOMM '07 Proceedings of the 2007 International Conference on Sensor Technologies and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Wireless sensor networks are expected to be used in many different applications such as disaster relief and environmental control. Efficient routing protocols need to be thoroughly studied before wireless sensor networks are widely deployed. GEM is an ingenious routing algorithm that is based on the idea of graph embedding. Using a well designed virtual coordinate system, GEM provides a remarkably simple route selection mechanism. However, GEM does not survive edge failures well. In this paper, we propose R-GEM and S-GEM that use the idea of GEM and improve its reliability performance significantly. Both of them outperform GEM in all of the experimental scenarios. Specifically, in the case that 2% of all edges in the network fail to transfer packets, when only disjoint pairs are taken into consideration, GEM leads to a path error rate of 10% while R-GEM and S-GEM only result in a path error rate of 2%.