Mobility increases the connectivity of K-hop clustered wireless networks

In this paper we investigate the connectivity for large-scale clustered wireless sensor and ad hoc networks. We study the effect of mobility on the critical transmission range for asymptotic connectivity in k-hop clustered networks, and compare to existing results on non-clustered stationary networks. By introducing k-hop clustering, any packet from a cluster member can reach a cluster head within k hops, and thus the transmission delay is bounded as Θ(1) for any finite k. We first characterize the critical transmission range for connectivity in mobile k-hop clustered networks where all nodes move under either the random walk mobility model with non-trivial velocity or the i.i.d. mobility model. By the term non-trivial velocity, we mean that the velocity of nodes v is Θ(1). We then compare with the critical transmission range for stationary k-hop clustered networks. We also study the transmission power versus delay trade-off and the average energy consumption per flow among different types of networks. We show that random walk mobility with non-trivial velocity increases connectivity in k-hop clustered networks, and thus significantly decreases the energy consumption and improves the power-delay trade-off. The decrease of energy consumption per flow is shown to be Θ(logn/nd}) in clustered networks. These results provide insights on network design and fundamental guidelines on building a large-scale wireless network.

[1]  M. Penrose.  The longest edge of the random minimal spanning tree , 1997 .

[2]  R. Ash,et al.  Probability and measure theory , 1999 .

[3]  Piyush Gupta,et al.  Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .

[4]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[5]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[6]  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).

[7]  Li Li,et al.  Distributed topology control for power efficient operation in multihop wireless ad hoc networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[8]  Piyush Gupta,et al.  An Experimental Scaling Law for Ad Hoc Networks , 2001 .

[9]  Paramvir Bahl,et al.  Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks , 2001, PODC '01.

[10]  David Tse,et al.  Mobility increases the capacity of ad-hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[11]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[12]  Tracy Camp,et al.  A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..

[13]  Mohamed F. Younis,et al.  Energy-aware routing in cluster-based sensor networks , 2002, Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems.

[14]  Dahlia Malkhi,et al.  K-clustering in wireless ad hoc networks , 2002, POMC '02.

[15]  Edward J. Coyle,et al.  An energy efficient hierarchical clustering algorithm for wireless sensor networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[16]  Vikas Kawadia,et al.  Power control and clustering in ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[17]  Srdjan Capkun,et al.  Mobility helps security in ad hoc networks , 2003, MobiHoc '03.

[18]  Leandros Tassiulas,et al.  Throughput capacity of random ad hoc networks with infrastructure support , 2003, MobiCom '03.

[19]  Hans-Joachim Hof,et al.  A cluster-based security architecture for ad hoc networks , 2004, IEEE INFOCOM 2004.

[20]  Peng-Jun Wan,et al.  Asymptotic critical transmission radius and critical neighbor number for k-connectivity in wireless ad hoc networks , 2004, MobiHoc '04.

[21]  Sajal K. Das,et al.  WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks , 2002, Cluster Computing.

[22]  Stavros Toumpis,et al.  Capacity bounds for three classes of wireless networks: asymmetric, cluster, and hybrid , 2004, MobiHoc '04.

[23]  Panganamala Ramana Kumar,et al.  The Number of Neighbors Needed for Connectivity of Wireless Networks , 2004, Wirel. Networks.

[24]  D. Manivannan,et al.  Routing protocols for sensor networks , 2004, First IEEE Consumer Communications and Networking Conference, 2004. CCNC 2004..

[25]  F. Xue,et al.  On the θ-coverage and connectivity of large random networks ∗ † , 2005 .

[26]  S.A. Khan,et al.  Analyzing & Enhancing energy Efficient Communication Protocol for Wireless Micro-sensor Networks , 2005, 2005 International Conference on Information and Communication Technologies.

[27]  Panganamala Ramana Kumar,et al.  On the /spl theta/-coverage and connectivity of large random networks , 2006, IEEE Transactions on Information Theory.

[28]  Shu Du,et al.  RMAC: A Routing-Enhanced Duty-Cycle MAC Protocol for Wireless Sensor Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[29]  Shu Du,et al.  DW-MAC: a low latency, energy efficient demand-wakeup MAC protocol for wireless sensor networks , 2008, MobiHoc '08.