{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:22:47Z","timestamp":1750306967469,"version":"3.41.0"},"reference-count":40,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2013,7,1]],"date-time":"2013-07-01T00:00:00Z","timestamp":1372636800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000148","name":"Division of Electrical, Communications and Cyber Systems","doi-asserted-by":"publisher","award":["CCF-0728970 and ECCS-0636569"],"award-info":[{"award-number":["CCF-0728970 and ECCS-0636569"]}],"id":[{"id":"10.13039\/100000148","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-0728970 and ECCS-0636569"],"award-info":[{"award-number":["CCF-0728970 and ECCS-0636569"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Sen. Netw."],"published-print":{"date-parts":[[2013,7]]},"abstract":"<jats:p>\n            Many analytic results for the connectivity, coverage, and capacity of wireless networks have been reported for the case where the number of nodes,\n            <jats:italic>n<\/jats:italic>\n            , tends to infinity (large-scale networks). The majority of these results have not been extended for small or moderate values of\n            <jats:italic>n<\/jats:italic>\n            ; whereas in many practical networks,\n            <jats:italic>n<\/jats:italic>\n            is not very large. In this article, we consider finite (small-scale) wireless sensor networks. We first show that previous asymptotic results provide poor approximations for such networks. We provide a set of differences between small-scale and large-scale analysis and propose a methodology for analysis of finite sensor networks. Furthermore, we consider two models for such networks: unreliable sensor grids and sensor networks with random node deployment. We provide easily computable expressions for bounds on the coverage and connectivity of these networks. With validation from simulations, we show that the derived analytic expressions give very good estimates of such quantities for finite sensor networks. Our investigation confirms the fact that small-scale networks possess unique characteristics different from their large-scale counterparts, necessitating the development of a new framework for their analysis and design.\n          <\/jats:p>","DOI":"10.1145\/2489253.2489268","type":"journal-article","created":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T19:12:41Z","timestamp":1374779561000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Results on finite wireless sensor networks"],"prefix":"10.1145","volume":"9","author":[{"given":"Ali","family":"Eslami","sequence":"first","affiliation":[{"name":"University of Massachusetts, Amherst"}]},{"given":"Mohammad","family":"Nekoui","sequence":"additional","affiliation":[{"name":"University of Massachusetts, Amherst"}]},{"given":"Hossein","family":"Pishro-Nik","sequence":"additional","affiliation":[{"name":"University of Massachusetts, Amherst"}]},{"given":"Faramarz","family":"Fekri","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology"}]}],"member":"320","published-online":{"date-parts":[[2013,7,23]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1024422"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132905.1132921"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2004.830909"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1287853.1287863"},{"volume-title":"Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies. 2896--2900","author":"Balister P.","key":"e_1_2_1_5_1"},{"volume-title":"Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom). 136--144","author":"Balister P.","key":"e_1_2_1_6_1"},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s B. 2001. Random Graphs 2nd Ed. Cambridge University Press Cambridge U.K.  Bollob\u00e1s B. 2001. Random Graphs 2nd Ed. Cambridge University Press Cambridge U.K.","DOI":"10.1017\/CBO9780511814068"},{"key":"e_1_2_1_8_1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1214\/aoap\/1050689601","article-title":"Covering algorithms, continuum percolation and the geometry of wireless networks","volume":"13","author":"Booth L.","year":"2003","journal-title":"Ann. Appl. Probab."},{"key":"e_1_2_1_9_1","first-page":"3","article-title":"Continuum percolation with unreliable and spread out connections","volume":"118","author":"Booth L.","year":"2005","journal-title":"J. Stat. Physics"},{"key":"e_1_2_1_10_1","first-page":"437","article-title":"On the connectivity in finite ad hoc networks. IEEE Communi","volume":"6","author":"Desai M.","year":"2002","journal-title":"Lett."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874537"},{"volume-title":"Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom).","author":"Dousse O.","key":"e_1_2_1_12_1"},{"volume-title":"Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom).","author":"Dousse O.","key":"e_1_2_1_13_1"},{"key":"e_1_2_1_14_1","unstructured":"Dubhashi D. H\u00e4ggstr\u00f6m O. and Panconesi A. 2003. Connectivity properties of bluetooth wireless networks. http:\/\/www.math.chalmers.se\/&sim;olleh\/papers.html.  Dubhashi D. H\u00e4ggstr\u00f6m O. and Panconesi A. 2003. Connectivity properties of bluetooth wireless networks. http:\/\/www.math.chalmers.se\/&sim;olleh\/papers.html."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1110\/TCOMM.2010.08.090119"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01651330"},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Franceschetti M. and Meester R. 2008. Random Networks for Communication: From Statistical Physics to Information Systems. Cambridge University Press Cambridge U.K.  Franceschetti M. and Meester R. 2008. Random Networks for Communication: From Statistical Physics to Information Systems. Cambridge University Press Cambridge U.K.","DOI":"10.1017\/CBO9780511619632"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874545"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2006.1613737"},{"key":"e_1_2_1_20_1","first-page":"88","article-title":"Comments on the connectivity in finite ad hoc networks. IEEE Communi","volume":"10","author":"Gore A.","year":"2006","journal-title":"Lett."},{"volume-title":"Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom).","author":"Grossglauser M.","key":"e_1_2_1_21_1"},{"key":"e_1_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Gupta P. and Kumar P. 1998. Critical power for asymptotic connectivity in wireless networks. Stochastic Analysis Control Optimization and Applications: A Volume in Honor of W.H. Fleming W. M. McEneaney G. Yin and Q. Zhang Eds. Birkh\u00e4user Berlin.  Gupta P. and Kumar P. 1998. Critical power for asymptotic connectivity in wireless networks. Stochastic Analysis Control Optimization and Applications: A Volume in Honor of W.H. Fleming W. M. McEneaney G. Yin and Q. Zhang Eds. Birkh\u00e4user Berlin.","DOI":"10.1007\/978-1-4612-1784-8_33"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.825799"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.814480"},{"key":"e_1_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Janson S. 1986. Random coverings in several dimensions. Acta Mathematica 156.  Janson S. 1986. Random coverings in several dimensions. Acta Mathematica 156.","DOI":"10.1007\/BF02399201"},{"volume-title":"Proceedings of the 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WIOPT'06)","author":"Karmachandani N.","key":"e_1_2_1_26_1"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1023720.1023735"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-006-9958-8"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/381677.381684"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/778415.778431"},{"volume-title":"Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom).","author":"Liu B.","key":"e_1_2_1_31_1"},{"key":"e_1_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Meester R. and Roy R. 1996. Continuum Percolation. Cambridge University Press Cambridge U.K.  Meester R. and Roy R. 1996. Continuum Percolation. Cambridge University Press Cambridge U.K.","DOI":"10.1017\/CBO9780511895357"},{"key":"e_1_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Penrose M. 2003. Random Geometric Graphs. Oxford University Press Oxford U.K.  Penrose M. 2003. Random Geometric Graphs. Oxford University Press Oxford U.K.","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1034625335"},{"volume-title":"Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom).","author":"Perevalov E.","key":"e_1_2_1_35_1"},{"volume-title":"Proceedings of the 1st Annual IEEE International Conference on Sensor and Ad Hoc Communications and Networks. 467--472","author":"Pishro-Nik H.","key":"e_1_2_1_36_1"},{"volume-title":"Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom'03)","author":"Shakkottai S.","key":"e_1_2_1_37_1"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/989459.989461"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:WINE.0000013081.09837.c0"},{"volume-title":"Proceedings of the 1st International Conference on Mobile Ad-Hoc and Sensor Systems (MASS'04)","author":"Yen L.-H.","key":"e_1_2_1_40_1"}],"container-title":["ACM Transactions on Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2489253.2489268","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2489253.2489268","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:21Z","timestamp":1750235961000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2489253.2489268"}},"subtitle":["Connectivity and coverage"],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":40,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["10.1145\/2489253.2489268"],"URL":"https:\/\/doi.org\/10.1145\/2489253.2489268","relation":{},"ISSN":["1550-4859","1550-4867"],"issn-type":[{"type":"print","value":"1550-4859"},{"type":"electronic","value":"1550-4867"}],"subject":[],"published":{"date-parts":[[2013,7]]},"assertion":[{"value":"2011-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}