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
A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
The Critical Transmitting Range for Connectivity in Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Deploying wireless sensors to achieve both coverage and connectivity
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Connectivity in wireless ad-hoc networks with a log-normal radio model
Mobile Networks and Applications
Enhancing WLAN Capacity by Strategic Placement of Tetherless Relay Points
IEEE Transactions on Mobile Computing
Optimal relay station placement in IEEE 802.16j networks
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
On the hop count statistics for randomly deployed wireless sensor networks
International Journal of Sensor Networks
Modelling gateway placement in wireless networks: geometric k-centres of unit disc graphs
Proceedings of the fifth international workshop on Foundations of mobile computing
Maximizing Networking Lifetime in Wireless Sensor Networks with Regular Topologies
PDCAT '08 Proceedings of the 2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies
Optimal Placement of Multiple Interconnected Gateways in Heterogeneous Wireless Sensor Networks
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
IEEE Transactions on Wireless Communications
Relay-based deployment concepts for wireless and mobile broadband radio
IEEE Communications Magazine
Hi-index | 0.24 |
This paper analyzes the benefits that can be obtained by using opportunistic multi-hop extensions in terms of coverage extension of traditional network deployments. We assume that there are some devices acting as relaying entities, so as to allow others reaching an Access Element, in those situations in which a direct connection is not possible. Two different network deployments are used for this analysis: in the first one, an a priori planning is not assumed and, therefore, the Access Elements are randomly deployed, thus leading to a rather poor connectivity; on the other hand, in the second case, the Access Elements are placed according to an array deployment, thus maximizing the covered area. The paper finds analytical expressions for the probability of a user to be disconnected, i.e. she is not able to reach an Access Element, or the outage probability, for both scenarios, when either one or two hop paths can be used. These results are assessed, first, and complemented later, by means of an extensive simulation-based analysis, which brings about the possibility of extending the results when more than two hops are considered. The results provide helpful insights for aiding network dimensioning processes, since they allow establishing sensible bounds on the maximum number of hops which should be used to connect to the network; in the two complementary deployments which are used throughout the paper, there was not much additional benefit for paths longer than three/four hops, regardless of the probability for a user terminal to behave as a forwarding node.