Abstract
Choosing the appropriate network size to guarantee connectivity in a WSN deployment is a challenging and important question. Classic techniques to answer this question are not up to the challenge because they rarely consider realistic radio models. This work proposes a methodology to evaluate the performance of network size estimation techniques in terms of connectivity efficiency under realistic radio scenarios. This study is carried out using Atarraya, a simulation tool for wireless sensor networks, considering three classical estimation techniques and a radio model based on the specifications of the ZigBee radio from off-the-shelf WaspMote nodes from Libelium. The results show that the hexagon-based optimal grid technique provides the most efficient estimate, offering a high connectivity level with the lowest estimated number of nodes for a given proximity radius parameter, followed by the circle packing and the triangle-based grid distribution. In addition, the results show that packet error rates of 10% could still produce highly connected topologies.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Penrose, M.: The Longest Edge of a Random Minimal Spanning Tree. The Annals of Applied Probability 7(2), 340–361 (1997)
Santi, P.: Topology Control in Wireless Ad Hoc and Sensor Networks. John Wiley and Sons, England (2005)
Labrador, M., Wightman, P.: Topology Control in Wireless Sensor Networks. Springer. Science + Business Media B.V., New York (2009)
Santi, P., Blough, D.: The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks. IEEE Transactions on Mobile Computing 2(1), 25–39 (2003)
Karl, H., Willing, A.: Protocols and Architectures for Wireless Sensor Networks. John Wiley and Sons, England (2005)
Xue, F., Kumar, P.R.: The Number of Neighbors Needed for Connectivity of Wireless Networks. Wireless Networks 10(2), 169–181 (2004)
Cai, H., Jia, X., Sha, M.: Critical Sensor Density for Partial Connectivity in Large Area Wireless Sensor Networks. In: IEEE Infocom, pp. 1–5. IEEE Press, New York (2010)
Graham, R.L., Lubachevsky, B.D.: Repeated Patterns of Dense Packing of Equal Disks in a Square. Electronic Journal of Combinatorics 3(1), 1–16 (1996)
Bai, X., Kumar, S., Xuan, D., Yun, Z., Lai, T.: Deploying Wireless Sensors to Achieve both Coverage and Connectivity. In: ACM Symposium on Mobile Ad Hoc Networking and Computing, pp. 131–142. ACM Press, New York (2006)
Bai, X., Xuan, D., Yun, Z., Lai, T., Jia, W.: Complete Optimal Deployment Patterns for Full-Coverage and K-Connectivity (K<6) Wireless Sensor Networks. In: 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 401–410. ACM Press, New York (2008)
Wightman, P., Labrador, M.: Atarraya: A Simulation Tool to Teach and Research Topology Control Algorithms for Wireless Sensor Networks. In: 2nd International ICST Conference on Simulation Tools and Techniques, pp. 1–10. ICST, Brussels (2009)
Sedgewick, R., Wayne, K.: Introduction to Programming in Java: An Interdisciplinary Approach. Addison Wesley, USA (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wightman, P. et al. (2011). Empirical Approach to Network Sizing for Connectivity in Wireless Sensor Networks with Realistic Radio Propagation Models. In: Frey, H., Li, X., Ruehrup, S. (eds) Ad-hoc, Mobile, and Wireless Networks. ADHOC-NOW 2011. Lecture Notes in Computer Science, vol 6811. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22450-8_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-22450-8_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22449-2
Online ISBN: 978-3-642-22450-8
eBook Packages: Computer ScienceComputer Science (R0)