A unified energy-efficient topology for unicast and broadcast
Proceedings of the 11th annual international conference on Mobile computing and networking
Computer Networks: The International Journal of Computer and Telecommunications Networking
Pervasive and Mobile Computing
On the lifetime of wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Self-organizing fault-tolerant topology control in large-scale three-dimensional wireless networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Fault tolerant interference-aware topology control for ad hoc wireless networks
ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks
Broadcast analysis in dense duty-cycle sensor networks
Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication
| Hi-index | 0.00 |
We consider a large-scale of wireless ad hoc networks whose nodes are distributed randomly in a two-dimensional region Ω (more specifically, a unit square). Given n wireless nodes V, each with transmission range rn, the wireless networks are often modeled by graph G (V, rn) in which two nodes are connected if and only if their Euclidean distance is no more than rn. We first consider how to relate the transmission range with the number of nodes in a fixed area such that the resulted network can sustain k fault nodes in its neighborhood with high probability when all nodes have the same transmission range. We show that, for a unit-area square region Ω, the probability that the network G (V, rn) is k-connected is at least ${\rm e}^{-{\rm e}^{-\alpha}}$ when the transmission radius rn satisfies $n \pi r_n^2 \ge {\rm ln}\ n \,+ (2k - 3) {\rm ln}\, {\rm ln}\, n - 2 \,{\rm ln}(k - 1)! + 2 \alpha \ {\rm for} \, k \,1$ and n sufficiently large. This result also applies to mobile networks when the moving of wireless nodes always generates randomly distributed positions. We also conduct extensive simulations to study the practical transmission range to achieve certain probability the network being k-connectivity, when the number of nodes n is not large enough. The relation between the minimum node degree and the connectivity of graph G (V, r) is also studied. Setting the transmission range of all nodes to rn guarantees the k-connectivity with high probability, but some nodes may have excessive number of neighbours in the graph G (V, rn). We then present a localized method to construct a subgraph of the network topology G (V, rn) such that the resulting subgraph is still k-connected but with much fewer communication links maintained. We show that the constructed topology has only O (k · n) links and is a length spanner. Here a graph H ⊆ G is spanner for graph G, if for any two nodes, the length of the shortest path connecting them in H is no more than a small constant factor of the length of the shortest path connecting them in G. Finally, we conduct some simulations to study the practical transmission range to achieve certain probability of k-connected when n is not large enough. Copyright © 2004 John Wiley & Sons, Ltd.