Loop-based topology maintenance and route discovery for wireless sensor networks

Clustering is an effective topology maintenance technology to provide better scalability for WSN. When loop structures are deployed to clustering, it can provide better robustness and convenient routing, because the topology information can be disseminated within a loop instead of a single clusterhead 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 loop-based approach to combine clustering and routing for cost saving, which consists of setup procedure, regular procedure and recovery procedure. For the setup procedure, we propose a loop discovery algorithm, which is a fully distributed, on-demand and configurable algorithm achieving route discovery and clustering at the same time. The algorithm prefers a low-mobility network which is typically suitable for wireless sensor networks

[1]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

[2]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 2002, Wirel. Networks.

[3]  Hiroaki Higaki,et al.  Loop-based source routing protocol for mobile ad-hoc networks , 2003, 17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003..

[4]  Anthony Ephremides,et al.  The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm , 1981, IEEE Trans. Commun..

[5]  Gregory J. Pottie,et al.  Instrumenting the world with wireless sensor networks , 2001, 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221).

[6]  David B. Johnson,et al.  The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks , 2003 .

[7]  Ossama Younis,et al.  Distributed clustering in ad-hoc sensor networks: a hybrid, energy-efficient approach , 2004, IEEE INFOCOM 2004.

[8]  Mario Gerla,et al.  On-demand routing in large ad hoc wireless networks with passive clustering , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).

[9]  Arthur L. Liestman,et al.  CLUSTERING ALGORITHMS FOR AD HOC WIRELESS NETWORKS , 2004 .

[10]  Ravi Prakash,et al.  Max-min d-cluster formation in wireless ad hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[11]  Satish Kumar,et al.  Next century challenges: scalable coordination in sensor networks , 1999, MobiCom.

[12]  Taieb Znati,et al.  A mobility-based framework for adaptive clustering in wireless ad hoc networks , 1999, IEEE J. Sel. Areas Commun..

[13]  Hiroaki Higaki,et al.  Loop-Based Source Routing Protocol for Mobil. , 2003 .

[14]  Mario Gerla,et al.  Multicluster, mobile, multimedia radio network , 1995, Wirel. Networks.