Abstract
Clustering is recognized as an effective topology maintenance framework to provide better scalability for Wireless Sensor Networks. When loop structures are deployed to topology maintenance, it can provide better robustness and convenient route recovery, for the topology information is disseminated within a loop instead of a single node and the nature of the loop that there are two paths between each pair of nodes within a loop provides backup routes. In this paper, we propose a novel topology maintenance approach based on loop structures. The algorithm is a distributed, on-demand and configurable. It prefers a low-mobility network which is typically suitable for wireless sensor networks.
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
Estrin, D., Govindan, R., Heidemann, J., Kumar, S.: Next century challenges: Scalable coordination in sensor networks. In: Proc. MOBICOM 1999, Seattle, pp. 263–270 (1999)
Estrin, D., Girod, L., Pottie, G., Srivastava, M.: Instrumenting the World with Wireless Sensor Networks. In: International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2001), Salt Lake City, Utah (May 2001)
Chen, Y.P., Liestman, A.L., Liu, J.: Clustering Algorithms for Ad Hoc Wireless Networks. In: Pan, Y., Xiao, Y. (eds.) Ad Hoc and Sensor Networks. Nova Science Publishers (2004)
Baker, D.J., Ephremides, A.: The architectural organization of a mobile radio network via a distributed algorithm. IEEE Transactions on Communications, COM-29, 1694–1701 (1981)
Gerla, M., Tsai, J.T.-C.: Multicluster, mobile, multimedia radio network. Wireless Networks 1, 255–265 (1995)
Amis, A.D., Prakash, R., Vuong, T.H.P., Huynh, D.T.: Max-min d-cluster formation in wireless ad hoc networks. In: Proc. IEEE INFOCOM, pp. 32–34 (2000)
Gerla, M., Kwon, T.J., Pei, G.: On demand routing in large ad hoc wireless networks with passive clustering. In: Proc. IEEE WCNC (September 2000)
Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Mathematics 86, 165–177 (1990)
Alzoubi, K.M., Wan, P.-J., Frieder, O.: New distributed algorithm for connected dominating set in wireless ad hoc networks. In: Proc. HICSS 2002 (2002)
Feige, U.: A threshold of ln n for approximating set cover. In: Proc. ACM Symposium on Theory of Computing, pp. 314–318 (1996)
Basagni, S.: Distributed clustering for ad hoc networks. In: Proc. ISPAN 1999 Int. Symp. on Parallel Architectures, Algorithms, and Networks, pp. 310–315 (1999)
Johnson, D.B., Maltz, D.A., Hu, Y.-C.: The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR), Internet Draft, draft-ietf-manet-dsr-10.txt (July 2004) (work in progress)
Sagawa, Y., Asano, T., Higaki, H.: Loop-Based Source Routing Protocol for Mobil. In: Proc. AINA 2003, Xi’an, China, March 27-29, pp. 834–837 (2003)
Chen, Y., Ni, S., Tseng, Y., Sheu, J.: The broadcast storm problem in a mobile ad hoc network. In: Proc. MOBICOM, Seattle, Washington (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, Y., Wang, X., Baueregger, F., Xue, X., Toh, C.K. (2005). Loop-Based Topology Maintenance in Wireless Sensor Networks. In: Lu, X., Zhao, W. (eds) Networking and Mobile Computing. ICCNMC 2005. Lecture Notes in Computer Science, vol 3619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11534310_120
Download citation
DOI: https://doi.org/10.1007/11534310_120
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28102-3
Online ISBN: 978-3-540-31868-2
eBook Packages: Computer ScienceComputer Science (R0)