Skip to main content

Advertisement

Log in

A route maintaining algorithm using neighbor table for mobile sinks

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

In the wireless microsensor networks, both source and sink nodes can be changed or mobile. The movement of source and sink may lead to the breakage of existing routes. In most routing protocols, query packets are broadcasted to correct a broken route between source and sink, which causes significant communication overhead in terms of both energy and delay. In order to support the sink mobility of conventional routing protocols, we propose a simple route maintaining algorithm which does not use the flooding method. Since the proposed algorithm does not require the information on the geometric location of sensor nodes, it can be easily adopted in most existing routing protocols including Ad Hoc On Demand Distance Vector (AODV) and Direct Diffusion (DD). Experimental results show that the proposed algorithm drastically improves the conventional routing protocols in terms of both energy and delay in case of mobile sinks.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Subramanian, L., & Katz, R. H. (2000). Mobile and ad hoc networking and computing. In Proc MobiHOC (pp. 63–73). First Annual Workshop August 2000.

  2. Maddes, S., Szewczy, R., Franklin, M. J., & Culler, D. (2002). Supporting aggregate queries over ad-hoc wireless sensor network. In Proc IEEE Workshop on Mobile Computing Systems and Applications, May 2002.

  3. Chen, B., Jamieson, K., Balakrishnan, H., & Morris, R. (2001) Span: An energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks. In Proc 7th Annual International Conf. on Mobile Computing and Networking, July 2001, pp. 85–96.

  4. Kulik, J., Heinzelman, W. R., & Balakrishnan, H. (2002). Negotiation-based protocols for disseminating information in wireless sensor networks. Wireless Networks, 8, 169–185.

    Article  MATH  Google Scholar 

  5. Setvetto, S., & Barrenechea, G. (2002). Constrained random walks on random graphs: Routing algorithms for large scale wireless sensor network. In Proc 1st ACM International Workshop on Wireless Sensor Networks and Applications, September 2002, pp. 12–21.

  6. Perkins, C. E., Belding-Royer, E. M., & Das, S. (2002). Ad hoc on demand distance vector (aodv) routing. IETF Internet draft, draft-ietf-manet-aodv11.txt.

  7. Intanagonwiwat, C., Govindan, R., & Estrin, D. (2000). Directed diffusion: A scalable and robust communication paradigm for sensor networks. In Proc ACM MOBICOM Conference, August 2000, pp. 56–67.

  8. Coffin, D., Hook, D. V., McGarry, S., & Kolek, S. (2000). Declarative ad-hoc sensor networking. In Proc SPIE Integrated Command Environments, July 2000, pp. 109–120.

  9. Ye, F., Lu, S., & Zhang, L. (2001). Gradient Broadcast: A Robust, Long-lived Large Sensor Network http://irl.cs.ucla.edu/ papers/grab-tech-report.ps

  10. Kim, H. S., Abdelzaher, T., & Kwon, W. H. (2003). Minimum-Energy asynchronous dissemination to mobile sinks in wireless sensor networks. In Proc ACM Conference on Embedded Networked Sensor Systems, November 2003, pp. 193–204.

  11. Luo, H., Ye, F., Cheng, J., Lu, S., & Zhang, L. (2005). TTDD: Two-tier data dissemination in large-scale wireless sensor networks. In Proc ACM/Kluwer Mobile Networks and Applications (MONET). Wireless Networks, 11, 161–175.

  12. Song, L., & Hatzinakos, D. (2005) Dense wireless sensor networks with mobile sinks. In Proc IEEE International Conference on Acoustics, Speech, and Signal Processing, March 2005, pp. 677–680.

  13. Wang, Z. M., Basagni, S., Melachrinoudis, E., & Petrioli, C. (2005). Exploiting sink mobility for maximizing sensor networks lifetime. In Proc 38th Annual Hawaii International Conference, January 2005.

  14. Raju, L., Ganu, S., Anepu, B., Seskar, I., & Raychaudhuri, D. (2004). Beacon assisted discovery protocol (BEAD) for self-organizing hierarchical ad-hoc networks. In Proc Global Telecommunications Conference, November 2004, pp. 1676–1680.

  15. Radha, S., Ravindran, N., Mani, S., & Kandasamy, V. (2005). A new solution to improve the link failure tolerance in mobile ad hoc networks. In Proc INDICON, 2005 Annual IEEE Conference, December 2005, pp. 539–542.

  16. Lin, H. C., Wang, C. H., & Tung, L. C. (2005). Minimizing the number of detectors in poll-based link failure detection and identification. In Proc. ICC, May 2005, pp. 875–880.

  17. Orecchia, L., Panconesi, A., Petrioli, C., & Vitaletti, A. (2004). Localized techniques for broadcasting in wireless sensor networks. In Proc Joint Workshop on Foundations of Mobile Computing (pp. 41–51) October 2004.

  18. http://www.isi.edu/nsnam

Download references

Acknowledgment

This research was supported by Seoul Future Contents Convergence (SFCC) Cluster established by Seoul R&BD Program

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chun-Su Park.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Park, CS., Lee, KW., Kim, YS. et al. A route maintaining algorithm using neighbor table for mobile sinks. Wireless Netw 15, 541–551 (2009). https://doi.org/10.1007/s11276-007-0068-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-007-0068-z

Keywords

Navigation