Proceedings of the 8th annual international conference on Mobile computing and networking
The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Fault tolerant deployment and topology control in wireless networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Connectivity of wireless multihop networks in a shadow fading environment
MSWIM '03 Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
Topology properties of Ad hoc networks with random waypoint mobility
ACM SIGMOBILE Mobile Computing and Communications Review
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Stochastic properties of the random waypoint mobility model
Wireless Networks
Regional gossip routing for wireless ad hoc networks
Mobile Networks and Applications
Impact of interferences on connectivity in ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Assignment of dynamic transmission range based on estimation of vehicle density
Proceedings of the 2nd ACM international workshop on Vehicular ad hoc networks
Topology control in wireless ad hoc and sensor networks
ACM Computing Surveys (CSUR)
Management of mobile ad hoc networks: information model and probe-based architecture
International Journal of Network Management
Modeling and performance analysis of ad hoc broadcasting schemes
Performance Evaluation
On the connectivity of dynamic random geometric graphs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Analysis of k-Neigh topology control protocol for mobile wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Graph theoretic models and tools for the analysis of dynamic wireless multihop networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Asymptotic critical transmission radius for k-connectivity in wireless ad hoc networks
IEEE Transactions on Information Theory
A framework for connectivity in inter-working multi-hop wireless networks
ruSMART/NEW2AN'10 Proceedings of the Third conference on Smart Spaces and next generation wired, and 10th international conference on Wireless networking
On the communication range in auction-based multi-agent target assignment
IWSOS'11 Proceedings of the 5th international conference on Self-organizing systems
Connectivity model of wireless networks via dependency links random graphs
The Journal of Supercomputing
Asymptotic properties of multi-hop wireless networks
Asymptotic properties of multi-hop wireless networks
Value of incomplete information in mobile target allocation
MATES'11 Proceedings of the 9th German conference on Multiagent system technologies
Connectivity for wireless agents moving on a cycle or grid
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Monitoring end-to-end connectivity in mobile ad-hoc networks
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
On mobile target allocation with incomplete information in defensive environments
KES-AMSTA'12 Proceedings of the 6th KES international conference on Agent and Multi-Agent Systems: technologies and applications
| Hi-index | 0.06 |
We consider the following problem for wireless ad hoc networks: assume n nodes, each capable of communicating with nodes within a radius of r, are distributed in a d-dimensionalregion of side l; how large must the transmitting range r be to ensure that the resulting network is connected?We also consider the mobile version of the problem, in which nodes are allowed to move during a time interval and the value of r ensuring connectedness for a given fraction of the interval must be determined. For the stationary case, we give tight bounds on the relative magnitude of r, n and l yielding a connected graph with high probability in 1-dimensional networks, thus solving an open problem. The mobile version of the problem when d=2 is investigated through extensive simulations, which give insight on how mobility affect connectivity and reveal a useful trade-off between communication capability andenergy consumption.