Randomized algorithms
Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
K-clustering in wireless ad hoc networks
Proceedings of the second ACM international workshop on Principles of mobile computing
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
Cluster Computing
Mobility helps security in ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Energy-Aware Routing in Cluster-Based Sensor Networks
MASCOTS '02 Proceedings of the 10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Throughput capacity of random ad hoc networks with infrastructure support
Proceedings of the 9th annual international conference on Mobile computing and networking
The number of neighbors needed for connectivity of wireless networks
Wireless Networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Capacity bounds for three classes of wireless networks: asymmetric, cluster, and hybrid
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Dynamic power allocation and routing for satellite and wireless networks with time varying channels
Dynamic power allocation and routing for satellite and wireless networks with time varying channels
Capacity of a wireless ad hoc network with infrastructure
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
DW-MAC: a low latency, energy efficient demand-wakeup MAC protocol for wireless sensor networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Multicast capacity for hybrid wireless networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
The age of impatience: optimal replication schemes for opportunistic networks
Proceedings of the 5th international conference on Emerging networking experiments and technologies
Distributed caching over heterogeneous mobile networks
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Passive diagnosis for wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
The capacity of wireless networks
IEEE Transactions on Information Theory
On the &thetas;-coverage and connectivity of large random networks
IEEE Transactions on Information Theory
Dynamic power allocation and routing for time-varying wireless networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
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 nonclustered 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 nontrivial velocity or the i.i.d. mobility model. By the term nontrivial velocity, we mean that the velocity of a node v is ω (r(n)), where r(n) is the transmission range of the node. We then compare with the critical transmission range for stationary k-hop clustered networks. In addition, the critical number of neighbors is studied in a parallel manner for both stationary and mobile networks. We also study the transmission power versus delay tradeoff and the average energy consumption per flow among different types of networks. We show that random walk mobility with nontrivial velocities increases connectivity in k-hop clustered networks, and thus significantly decreases the energy consumption and improves the power-delay tradeoff. The decrease of energy consumption per flow is shown to be Θ(log n/nd) in clustered networks. These results provide insights on network design and fundamental guidelines on building a large-scale wireless network.