Abstract
The geographic routing is an ideal approach to realize point-to-point routing in wireless sensor networks because packets can be delivered by only maintaining a small set of neighbors’ physical positions. The geographic routing assumes that a packet can be moved closer to the destination in the network topology if it is moved geographically closer to the destination in the physical space. This assumption, however, only holds in an ideal model where uniformly distributed nodes communicate with neighbors through wireless channels with perfect reception. Because this model oversimplifies the spatial complexity of a wireless sensor network, the geographic routing may often lead a packet to the local minimum or low quality route. Unlike the geographic forwarding, the ETX-embedding proposed in this paper can accurately encode both a network’s topological structure and channel quality to small size nodes’ virtual coordinates, which makes it possible for greedy forwarding to guide a packet along an optimal routing path. Our performance evaluation based on both the MICA2 sensor platform and TOSSIM simulator shows that the greedy forwarding based on ETX-embedding outperforms previous geographic routing approaches.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Perkins, C., Royer, E.: Ad-hoc on-demand distance vector (AODV) routing. Internet Draft (1998)
Karp, B., Kung, H.T.: GPSR: Greedy Perimeter Stateless Routing for Wireless Networks. In: MobiCom (2000)
Seada, K., Zuniga, M., Helmy, A., Krishnamachari, B.: Energy-efficient forwarding strategies for geographic routing in lossy wireless sensor networks. In: SenSys (2004)
Lee, S., Bhattacharjee, B., Banerjee, S.: Efficient geographic routing in multihop wireless networks. In: MobiHoc (2005)
Wu, S., Candan, K.S.: GPER: Geographic power efficient routing in sensor networks. In: ICNP (2004)
Wu, S., Candan, K.S.: Gper: Geographic power efficient routing in sensor networks. In: ICNP (2004)
De Couto, D.S.J., Aguayo, D., Bicket, J., Morris, R.: A high-throughput path metric for multi-hop wireless routing. In: MobiCom (2003)
Adya, A., Bahl, P., Padhye, J., Wolman, A., Zhou, L.: A multi-radio unification protocol for ieee 802.11 wireless networks. In: Broadnets (2004)
Draves, R., Padhye, J., Zill, B.: Comparison of routing metrics for static multi-hop wireless networks. In: SIGCOMM (2004)
Stann, F., Heidemann, J.: RMST: Reliable data transport in sensor networks. In: SNPA (2003)
Cox, T.F., Cox, M.A.A.: Multidimensional Scaling. Chapman and Hall, Sydney, Australia (1994)
Tenenbaum, J.B., de Silva, V., Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science (2000)
Levis, P., Lee, N., Culler, M.W.D.: Tossim: Accurate and scalable simulation of entire tinyos applications. In: SenSys (2003)
Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. In: ACM Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, ACM Press, New York (1999)
Ko, Y., Vaidya, N.H.: Location-aided routing (LAR) in mobile ad hoc networks. In: MobiCom (1998)
Kim, Y.-J., Govindan, R., Karp, B., Shenker, S.: Geographic routing made practical. In: NSDI (2005)
Seada, K., Helmy, A., Govindan, R.: On the effect of localization errors on geographic face routing in sensor networks. In: IPSN (2004)
Kuhn, F., Wattenhofer, R., Zhang, Y., Zollinger, A.: Geometric adhoc routing: Of theory and practice. In: PODC (2003)
Xing, G., Lu, C., Pless, R., Huang, Q.: On greedy geographic routing algorithms in sensing covered networks. In: MobiHoc (2004)
Bruck, J., Gao, J., Jiang, A.: Localization and routing in sensor networks by local angle information. In: MobiHoc (2005)
Melodia, T., Pompili, D., Akyildiz, I.: On the interdependence of distributed topology control and geographical routing in ad hoc and sensor networks. In: JSAC (2005)
Fang, Q., Gao, J., Guibas, L.J.: Locating and bypassing routing holes in sensor networks. In: InfoCom (2004)
Fonseca, R., Ratnasamy, S., Zhao, J., Ee, C.T., Culler, D., Shenker, S., Stoica, I.: Beacon-vector routing: Scalable point-to-point routing in wireless sensor networks. In: NSDI (2005)
Newsome, J., Song, D.: Gem: Graph embedding for routing and data-centric storage in sensor networks without geographic information. In: SenSys (2003)
Rao, A., Ratnasamy, S., Papadimitriou, C., Shenker, S., Stoica, I.: Geographic routing without location information. In: MobiCom (2003)
Leong, B., Mitra, S., Liskov, B.: Path vector face routing: Geographic routing with local face information. In: ICNP (2005)
Lim, M., Greenhalgh, A., ChesterField, J., Crowcroft, J.: Landmark guided forwarding. In: ICNP (2005)
Zhao, Y., Li, B., Zhang, Q., Chen, Y., Zhu, W.: Efficient hop id based routing for sparse ad hoc networks. In: ICNP (2005)
Cao, Q., Abdelzaher, T.F.: A scalable logical coordinates framework for routing in wireless sensor networks. In: RTSS (2004)
Caruso, A., Chessa, S., De, S., Urpi, A.: GPS free coordinate assignment and routing in wireless sensor networks. In: InfoCom (2005)
Zhang, H., Arora, A., Sinha, P.: Learn on the fly: Data-driven link estimation and routing in sensor network backbones. In: InfoCom (2006)
Woo, A., Tong, T., Culler, D.: Taming the underlying challenges of reliable multihop routing in sensor networks. In: SenSys (2003)
Zhao, J., Govindan, R.: Understanding packet delivery performance in dense wireless sensor networks. In: SenSys (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Wang, C., Zeng, G., Xiao, L. (2007). Optimizing End to End Routing Performance in Wireless Sensor Networks. In: Aspnes, J., Scheideler, C., Arora, A., Madden, S. (eds) Distributed Computing in Sensor Systems. DCOSS 2007. Lecture Notes in Computer Science, vol 4549. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73090-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-73090-3_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73089-7
Online ISBN: 978-3-540-73090-3
eBook Packages: Computer ScienceComputer Science (R0)