On k-connectivity for a geometric random graph
Random Structures & Algorithms
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
An Evaluation of Connectivity in Mobile Wireless Ad Hoc Networks
DSN '02 Proceedings of the 2002 International Conference on Dependable Systems and Networks
The number of neighbors needed for connectivity of wireless networks
Wireless Networks
On the fundamental limits of topology control
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Quantile models for the threshold range for k-connectivity
MSWiM '04 Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Topology control in wireless ad hoc and sensor networks
ACM Computing Surveys (CSUR)
Spatial Node Distribution of the Random Waypoint Mobility Model with Applications
IEEE Transactions on Mobile Computing
On the θ-coverage and connectivity of large random networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Coverage by randomly deployed wireless sensor networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Virtual Backbone Construction in MANETs Using Adjustable Transmission Ranges
IEEE Transactions on Mobile Computing
The k-Neighbors Approach to Interference Bounded and Symmetric Topology Control in Ad Hoc 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
The study and simulation of connectivity based routing protocols in ad hoc networks
Proceedings of the 1st international conference on MOBILe Wireless MiddleWARE, Operating Systems, and Applications
Asymptotic critical total power for k-connectivity of wireless networks
IEEE/ACM Transactions on Networking (TON)
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
Journal of Network and Computer Applications
On the asymptotic minimum transporting energy and its implication on the wireless network capacity
IEEE/ACM Transactions on Networking (TON)
Maximum scan statistics and channel assignment problems in homogeneous wireless networks
Theoretical Computer Science
Prediction Based Mobile Data Aggregation in Wireless Sensor Network
GPC '09 Proceedings of the 4th International Conference on Advances in Grid and Pervasive Computing
Joint range assignment and routing to conserve energy in wireless ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the capacity of k-MPR wireless networks using multi-channel multi-interface
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Multiple Round Random Ball Placement: Power of Second Chance
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Mobility increases the connectivity of K-hop clustered wireless networks
Proceedings of the 15th annual international conference on Mobile computing and networking
On the capacity of k-MPR wireless networks
IEEE Transactions on Wireless Communications
Nodes Placement for Optimizing Coverage of Visual Sensor Networks
PCM '09 Proceedings of the 10th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
Connectivity properties of large-scale sensor networks
Wireless Networks
On the capacity of multi-packet reception enabled multi-channel multi-interface wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Critical sensor density for partial connectivity in large area wireless sensor networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Critical sensor density for partial connectivity in large area wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Undirected connectivity of sparse Yao graphs
FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
MobiCom '11 Proceedings of the 17th annual international conference on Mobile computing and networking
Coverage extension by means of non-conventional multi-hop communications
Computer Communications
An efficient relay sensors placing algorithm for connectivity in wireless sensor networks
EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing
Fault recovery in wireless networks: the geometric recolouring approach
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Network topology models for multihop wireless networks
ISRN Communications and Networking
Results on finite wireless sensor networks: Connectivity and coverage
ACM Transactions on Sensor Networks (TOSN)
Mobility increases the connectivity of wireless networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
A range assignment to the nodes in a wireless ad hoc network induces a topology in which there is an edge between two nodes if and only if both of them are within each other's transmission range. The critical transmission radius for k-connectivity is the smallest r such that if all nodes have the transmission radius r,the induce topology is k-connected. The critical neighbor number for k-connectivity is the smallest integer l such that if every node sets its transmission radius equal to the distance between itself an its l-th nearest neighbor, the induce topology is k-connecte. In this paper, we study the asymptotic critical transmission radius for k-connectivity an asymptotic critical neighbor number for k-connectivity in a wireless ad hoc network whose nodes are uniformly an independently distribute in a unit-area square or disk. We provide a precise asymptotic distribution of the critical transmission radius for k-connectivity and an improve asymptotic almost sure upper bound on the critical neighbor number for k-connectivity.