Results on coverage for finite wireless networks

Authors:
Woei Ling Leow;Hossein Pishro-Nik
Affiliations:
University of Massachusetts Amherst, Amherst, MA;University of Massachusetts Amherst, Amherst, MA
Venue:
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
Year:
2007

Citing 10
Cited 0

Capacity of Ad Hoc wireless networks

Proceedings of the 7th annual international conference on Mobile computing and networking
Fault tolerant deployment and topology control in wireless networks

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
The number of neighbors needed for connectivity of wireless networks

Wireless Networks
Asymptotic critical transmission radius and critical neighbor number for k-connectivity in wireless ad hoc networks

Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
On k-coverage in a mostly sleeping sensor network

Proceedings of the 10th annual international conference on Mobile computing and networking
Barrier coverage with wireless sensors

Proceedings of the 11th annual international conference on Mobile computing and networking
Critical node lifetimes in random networks via the Chen-Stein method

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
The capacity of wireless networks

IEEE Transactions on Information Theory
Towards an information theory of large networks: an achievable rate region

IEEE Transactions on Information Theory
The distance-2 matching problem and its relationship to the MAC-Layer capacity of ad hoc wireless networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Practical or economic considerations may impose a finite limit on the number of nodes deployed in a wireless network. Results derived from asymptotic analysis are reportedly ill-suited for such cases. This motivates the analysis of finite wireless sensor networks. In this paper, we discuss the upper and lower bounds of the coverage probability of a randomly-deployed finite wireless network. Comparisons of the bounds with simulation and asymptotic results are presented. A discussion on the optimal deployment of sensors to achieve maximum coverage probability for a line network is also presented.