A survey of routing techniques for mobile communications networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
On k-connectivity for a geometric random graph
Random Structures & 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
IEEE Transactions on Parallel and Distributed Systems
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
On the minimum node degree and connectivity of a wireless multihop network
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Topology control and routing in ad hoc networks: a survey
ACM SIGACT News
Distributed Spanner with Bounded Degree for Wireless Ad Hoc Networks
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
On the Symmetric Range Assignment Problem in Wireless Ad Hoc Networks
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
An Evaluation of Connectivity in Mobile Wireless Ad Hoc Networks
DSN '02 Proceedings of the 2002 International Conference on Dependable Systems and Networks
Sparse Power Efficient Topology for Wireless Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Throughput and energy efficiency in topology-controlled multi-hop wireless sensor networks
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
On k-coverage in a mostly sleeping sensor network
Proceedings of the 10th annual international conference on Mobile computing and networking
FLSS: a fault-tolerant topology control algorithm for wireless networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Applications of k-Local MST for Topology Control and Broadcasting in Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
On Constructing k-Connected k-Dominating Set in Wireless Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Localized Fault-Tolerant Topology Control in Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Mobility-Sensitive Topology Control in Mobile Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
On constructing k-connected k-dominating set in wireless ad hoc and sensor networks
Journal of Parallel and Distributed Computing - 19th International parallel and distributed processing symposium
A Theory of Network Localization
IEEE Transactions on Mobile Computing
Communicating via fireflies: geographic routing on duty-cycled sensors
Proceedings of the 6th international conference on Information processing in sensor networks
Distributed Mobility Management for Target Tracking in Mobile Sensor Networks
IEEE Transactions on Mobile Computing
Results on coverage for finite wireless networks
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
Reliable density estimates for coverage and connectivity in thin strips of finite length
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Sensor localization in concave environments
ACM Transactions on Sensor Networks (TOSN)
On pairwise connectivity of wireless multihop networks
International Journal of Security and Networks
Energy-efficient topology control for three-dimensional sensor networks
International Journal of Sensor Networks
International Journal of Distributed Sensor Networks
On k-coverage in a mostly sleeping sensor network
Wireless Networks
Mobility-aware topology control in mobile ad hoc networks
Computer Communications
On the critical phase transition time of wireless multi-hop networks with random failures
Proceedings of the 14th ACM international conference on Mobile computing and networking
Variable radii connected sensor cover in sensor networks
ACM Transactions on Sensor Networks (TOSN)
NPART - node placement algorithm for realistic topologies in wireless multihop network simulation
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
On connectivity limits in ad hoc networks with beamforming antennas
EURASIP Journal on Wireless Communications and Networking - Special issue on optimization techniques in wireless communications
Graphical properties of easily localizable sensor networks
Wireless Networks
Connectivity properties of large-scale sensor networks
Wireless Networks
On the resilient overlay topology formation in multi-hop wireless networks
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
K-connected target coverage problem in wireless sensor networks
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Multiobjective K-connected deployment and power assignment in WSNs using constraint handling
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Deploying sensor networks with guaranteed fault tolerance
IEEE/ACM Transactions on Networking (TON)
Fault and intrusion tolerance of wireless sensor networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Efficient algorithms for supergraph query processing on graph databases
Journal of Combinatorial Optimization
Minimum perimeter coverage of query regions in a heterogeneous wireless sensor network
Information Sciences: an International Journal
Self organization and self maintenance of mobile ad hoc networks through dynamic topology control
Architecting dependable systems VII
The effective radius model for multi-hop wireless networks
WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
Fault-tolerant self-organization in sensor networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
International Journal of Sensor Networks
On the monitoring period for fault-tolerant sensor networks
LADC'05 Proceedings of the Second Latin-American conference on Dependable Computing
Results on finite wireless sensor networks: Connectivity and coverage
ACM Transactions on Sensor Networks (TOSN)
Isomerism multiple-path routing algorithm of intelligent terminals
ICIC'13 Proceedings of the 9th international conference on Intelligent Computing Theories and Technology
Construction of low weighted and fault-tolerant topology for wireless ad hoc and sensor network
International Journal of Sensor Networks
Hi-index | 0.00 |
This paper investigate fault tolerance for wireless ad hoc networks. We consider a large-scale of wireless networks whose nodes are distributed randomly in a unit-area square region. 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 their Euclidean distance is no more than rn.We first consider how the transmission range is related with the number of nodes in a fixed area such that the resulted network can sustain k fault nodes with high probability. We show that, for a unit-area square region, the probability that the network G(V,rn) is (k+1)-connected is at least e-e-α when the transmission radius rn satisfies n π rn2 ≥ ln n + (2k-1) ln ln n -2ln k! + 2α for k0 and n sufficiently large. This result also applies to mobile networks when the moving of wireless nodes always generates randomly distributed positions. Our simulations show that n should be larger than 500 if k=2 or 3 and α = log n and n should be larger than 2500 if k=2 or 3 and α = log log n.We then present a localized method to control the network topology given a (k+1)-faults tolerant deployment G(V,rn) of wireless nodes such that the resulting topology is still (k+1)-faults tolerant but with O(kn) communication links maintained. We show that the constructed topology is also a length spanner. Here a subgraph H is spanner of 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.