M-Geocast: Robust and energy-efficient geometric routing for mobile sensor networks

11Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper we investigate a practical routing solution for a new class of wireless sensor networks where any node can be mobile anytime. Assuming GPS-enabled sensor nodes we propose a new geometric routing protocol called M-Geocast that is designed to efficiently support node mobility as well as location service for such mobile sensor networks. Unlike existing geometric routing schemes, M-Geocast can also discover a non-geometric path to the destination by exploiting the path history of location updates. Thus, the routing void can be minimized by alternating the two. In addition, M-Geocast employs two location-based optimizations to further reduce the overhead of on-demand route discovery on inevitable routing voids. Through detailed NS-2 simulations we demonstrate that M-Geocast can not only increase network performance but can also reduce energy consumption compared to the existing protocols based on on-demand route discovery or a plain geometric routing. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Choi, L., Jung, J. K., Cho, B. H., & Choi, H. (2008). M-Geocast: Robust and energy-efficient geometric routing for mobile sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5287 LNCS, pp. 304–316). https://doi.org/10.1007/978-3-540-87785-1_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free