Abstract
In localized geographic routing, the beaconless recovery problem with guaranteed delivery refers to a nodes’ task of selecting the next hop on a local minimum recovery path without use of beaconing. The state-of-the-art solution, the Rotational Sweep algorithm (RS), solves this problem using only three messages per hop. However, immediate data forwarding, as part of the next-hop selection process, causes problems concerning routing efficiency. Within transmission range of a single forwarding node the RS recovery path may consist of multiple nodes each of which transmits the data. In this paper, we suggest and evaluate a simple, yet promising extension of RS to avoid this. Instead of immediate data forwarding, a lightweight probing packet is used to explore the RS recovery path and to determine a locally optimal hop for data transmission (w.r.t. some user-defined optimization function). Our simulations suggest that independent of the node density, our extension can lead to significant reductions of data packet transmissions, and reduced energy consumption, compared to RS, which helps, e.g., to save valuable energy resources of nodes.
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.
References
Bose, P., Morin, P., Stojmenović, I., Urrutia, J.: Routing with Guaranteed Delivery in Ad Hoc Wireless Networks. Wireless Networks 7(6), 609–616 (2001)
Finn, G.: Routing and addressing problems in large metropolitan-scale internetworks. Tech. Rep. ISI/RR-87-180, University of Southern California (March 1987)
Rührup, S., Kalosha, H., Nayak, A., Stojmenović, I.: Message-Efficient Beaconless Georouting With Guaranteed Delivery in Wireless Sensor, Ad Hoc, and Actuator Networks. IEEE/ACM Trans. Netw. 18(1), 95–108 (2010)
Rührup, S., Stojmenović, I.: Optimizing Communication Overhead while Reducing Path Length in Beaconless Georouting with Guaranteed Delivery for Wireless Sensor Networks. IEEE Trans. Comput. 62(12), 2440–2453 (2013)
Neumann, F., Frey, H.: Path Properties and Improvements of Sweep Circle Traversals. In: Proc. of the IEEE 9th Intl. Conference on Mobile Ad-hoc and Sensor Networks (MSN), Dalian, China, pp. 101–108 (December 2013)
Rodoplu, V., Meng, T.H.: Minimum energy mobile wireless networks. IEEE J. Sel. Areas Commun. 17(8), 1333–1344 (1999)
Kuruvila, J., Nayak, A., Stojmenović, I.: Greedy localized routing for maximizing probability of delivery in wireless ad hoc networks with a realistic physical layer. Journal of Parallel and Distributed Computing 66(4), 499–506 (2006)
Distributed Computing Group at ETH Zurich, Switzerland: Sinalgo – Simulator for Network Algorithms. Online ressource, http://www.disco.ethz.ch/projects/sinalgo/ (accessed last: January 4, 2014)
Frey, H., Stojmenović, I.: On Delivery Guarantees and Worst-Case Forwarding Bounds of Elementary Face Routing Components in Ad Hoc and Sensor Networks. IEEE Trans. Comput. 59(9), 1224–1238 (2010)
Benter, M., Neumann, F., Frey, H.: Reactive Planar Spanner Construction in Wireless Ad Hoc and Sensor Networks. In: Proc. of the 32nd IEEE Intl. Conference on Computer Communications (INFOCOM), Turin, Italy, pp. 2193–2201 (April 2013)
Neumann, F., Frey, H.: On the Spanning Ratio of Partial Delaunay Triangulation. In: Proc. of the 9th IEEE Intl. Conference on Mobile Ad-hoc and Sensor Systems (MASS), Las Vegas, NV, USA, pp. 434–442 (October 2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Neumann, F., Botterbusch, C., Frey, H. (2014). Probing Message Based Local Optimization of Rotational Sweep Paths. In: Guo, S., Lloret, J., Manzoni, P., Ruehrup, S. (eds) Ad-hoc, Mobile, and Wireless Networks. ADHOC-NOW 2014. Lecture Notes in Computer Science, vol 8487. Springer, Cham. https://doi.org/10.1007/978-3-319-07425-2_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-07425-2_5
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07424-5
Online ISBN: 978-3-319-07425-2
eBook Packages: Computer ScienceComputer Science (R0)