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%.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Haas, Z.J., et al.: Gossip-Based Ad Hoc Routing. In: IEEE Inforcom, New York, NY, USA (June 2002)
Scott, K., et al.: Routing and Channel Assignment for Low Power Transmission in PCS. In: International Conference on Universal Personal Communications, Cambridge, MA, USA (September 1996)
Karp, B., et al.: GPSR: Greedy Perimeter Stateless Routing for Wireles Networks. In: The 6th International Conference on Mobile Computing and Networking (ACM Mobicom), Boston, MA, USA (2000)
Kranakis, E., et al.: Compas Routing on Geometric Networks. In: The 11th Canadian Conference on Computational Geometry, Vancouver, BC, Canada (August 1999)
Hammoudeh, M., et al.: MuMHR: Multi-path, Multi-hop Hierarchical Routing. In: International Conference on Sensor Technologies and Applications (SENSORCOMM 2007), Valencia, Spain, October 14-20 (2007)
Newsome, J., et al.: GEM: Graph Embedding for Routing and Data-Ccentric Storage in Sensor Networks without Geographic Information. In: ACM SenSys, Los Angeles, CA, November 5-7 (2003)
Rosenberg, A.L., et al.: Graph Separators With Applications. Kluwer Academic/Plenum Publishers (2000)
Heath, L.S.: Graph Embeddings and Simplicial maps. Theory of Computer Systems 30, 599–625 (1997)
Koch, R., et al.: Work-Preserving Emulations of Fixed-Connection Networks. Journal of the ACM 44, 104–147 (1997)
Mueller, S., et al.: Multipath Routing in Mobile Ad Hoc Networks: Issues and Challenges. In: Calzarossa, M.C., Gelenbe, E. (eds.) MASCOTS 2003. LNCS, vol. 2965, pp. 209–234. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ye, Q., Huang, Y., Reddin, A., Wang, L., Luo, W. (2008). Multi-path GEM for Routing in Wireless Sensor Networks. In: Li, Y., Huynh, D.T., Das, S.K., Du, DZ. (eds) Wireless Algorithms, Systems, and Applications. WASA 2008. Lecture Notes in Computer Science, vol 5258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88582-5_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-88582-5_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88581-8
Online ISBN: 978-3-540-88582-5
eBook Packages: Computer ScienceComputer Science (R0)