{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T18:05:29Z","timestamp":1754157929081,"version":"3.41.2"},"reference-count":17,"publisher":"Emerald","issue":"4","license":[{"start":{"date-parts":[[2009,11,20]],"date-time":"2009-11-20T00:00:00Z","timestamp":1258675200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,11,20]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-heading\">Purpose<\/jats:title><jats:p>In multihop wireless networks, the number of neighbors has an important role in the network performance since links are dynamically formed between a node and its neighbors. This paper aims to investigate this issue.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Design\/methodology\/approach<\/jats:title><jats:p>The paper quantitatively studies the effects of the average number of neighbors in multihop wireless networks on the network connectivity, the number of hops needed to traverse a certain distance, which can be used to determine the hop diameter of a network, and the total energy consumed by packet transmission, which can be used to choose an optimum average number of neighbors that minimizes the energy consumption. This paper also presents an analysis of the energy consumption that can be applied to a wide range of access protocols and show the effect of a variety of factors.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Findings<\/jats:title><jats:p>Results show that the minimum average number of neighbors to guarantee the overall network connectivity depends on the size of a network coverage. There is a sharp knee in the network connectivity with decrease of the average number of neighbors, <jats:italic>N<\/jats:italic>. If the distance between a source and destination, <jats:italic>d<\/jats:italic>, is known, the number of hops needed to reach the destination is usually between <jats:italic>d<\/jats:italic>\/<jats:italic>R<\/jats:italic>\u223c2<jats:italic>d<\/jats:italic>\/<jats:italic>R<\/jats:italic>, where <jats:italic>R<\/jats:italic> is the transmission range. A larger average number of neighbors <jats:italic>N<\/jats:italic> leads to a smaller number of hops to traverse a certain distance, which in turn results in a smaller traffic load caused by relaying packets. However, a bigger <jats:italic>N<\/jats:italic> also causes more collisions when a contention medium access scheme is used, which leads to more energy consumed by packet transmission. The results show that the optimum <jats:italic>N<\/jats:italic> which minimizes the energy is obtained by balancing several factors affecting the energy.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Originality\/value<\/jats:title><jats:p>The paper provides a useful study on the effects of the number of neighbors in multihop wireless networks.<\/jats:p><\/jats:sec>","DOI":"10.1108\/17427370911008875","type":"journal-article","created":{"date-parts":[[2009,12,5]],"date-time":"2009-12-05T07:17:22Z","timestamp":1259997442000},"page":"517-542","source":"Crossref","is-referenced-by-count":1,"title":["The effects of the number of neighbors in multihop wireless networks"],"prefix":"10.1108","volume":"5","author":[{"given":"Xiaowei","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.F.","family":"Maxemchuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","reference":[{"key":"key2021010620212603100_b9","unstructured":"Chang, J.\u2010H. and Tassiulas, L. (2000), \u201cEnergy conserving routing in wireless ad hoc networks\u201d, IEEE Infocom 00, pp. 22\u201031."},{"key":"key2021010620212603100_b10","unstructured":"Chen, B., Jamieson, K. and Balakrishnan, H. (2001), \u201cAn energy efficient coordination algorithm for topology maintenance in ad hoc wireless networks\u201d, paper presented at the International Conference on Mobile Computing and Networking, July."},{"key":"key2021010620212603100_b12","doi-asserted-by":"crossref","unstructured":"Flinn, J. and Satyanarayanan, M. (1999), \u201cEnergy aware adaptation for mobile applications\u201d, paper presented at the ACM Symposium on Operating System Principles (SOSP 99).","DOI":"10.1145\/319151.319155"},{"key":"key2021010620212603100_b4","unstructured":"Gupta, P. and Kumar, P.R. (1998), \u201cCritical power for asymptotic connectivity in wireless networks\u201d, Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W.H. Fleming, Boston, MA, pp. 547\u201066."},{"key":"key2021010620212603100_b17","unstructured":"Heinzelman, W.R., Chandrakasan, A. and Balakrishnan, H. (2000), \u201cEnergy efficient communication protocol for wireless microsensor networks\u201d, paper presented at the Haw. Int. Conf. for Syst. Sci., January 4\u20107, 2000."},{"key":"key2021010620212603100_b2","unstructured":"Hou, T.\u2010C. and Li, V. (1986), \u201cTransmission range control in multihop packet radio networks\u201d, IEEE Transactions on Communications, Vol. COM34, No. 1, January, pp. 38\u201044."},{"key":"key2021010620212603100_b1","unstructured":"Kleinrock, L. and Silvester, J. (1978), \u201cOptimum transmission radii for packet radio networks or why six is a magic number\u201d, Proceedings of the IEEE National Telecommunications. Conference, December, pp. 4.3.1\u20104.3.5."},{"key":"key2021010620212603100_b13","doi-asserted-by":"crossref","unstructured":"Li, Q., Aslam, J. and Rus, D. (2001), \u201cOnline power\u2010aware routing in wireless ad hoc networks\u201d, Proceedings of the 7th ACM\/IEEE Conference on Mobile Computing and Networking (MobiCom 2001), Rome, Italy, July 16\u201021.","DOI":"10.1145\/381677.381687"},{"key":"key2021010620212603100_b6","unstructured":"Merlin, P. and Schweitzer, P. (1980), \u201cDeadlock avoidance instore\u2010and\u2010forward networks\u2010I: store\u2010and\u2010forward deadlock\u201d, IEEE Transaction on Communications, Vol. COM\u201028."},{"key":"key2021010620212603100_b8","unstructured":"Rudolphu, V. and Meng, T.H. (1999), \u201cMinimum energy mobile wireless networks\u201d, IEEE JSAC, Vol. 17 No. 8, pp. 1333\u201044."},{"key":"key2021010620212603100_b3","unstructured":"Sanchez, M., Manzoni, P. and Haas, Z. (1999), \u201cDetermination of critical transmission range in ad\u2010hoc networks\u201d, Proceedings of Multiaccess Mobility and Teletraffic for Wireless Communications Workshop, 1999 (MMT'99), October 6\u20108, Venice, Italy."},{"key":"key2021010620212603100_b18","doi-asserted-by":"crossref","unstructured":"Savvides, A., Han, C.C. and Srivastava, M.B. (2001), \u201cDynamic fine\u2010grained localization in ad\u2010hoc wireless sensor networks\u201d, in the Proceedings of the International Conference on Mobile Computing and Networking (MobiCom) 2001, Rome, Italy, July.","DOI":"10.1145\/381677.381693"},{"key":"key2021010620212603100_b19","doi-asserted-by":"crossref","unstructured":"Savvides, A., Park, H. and Srivastava, M.B. (2002), \u201cThe bits and flops of then\u2010hop multilateration primitive for node localization problems\u201d, paper presented at the 1st ACM International Workshop on Sensor Networks and Applications held in conjunction with Mobicom September 28, 2002.","DOI":"10.1145\/570738.570755"},{"key":"key2021010620212603100_b11","doi-asserted-by":"crossref","unstructured":"Singh, S., Woo, M. and Raghavendra, C.S. (1998), \u201cPower\u2010aware routing in mobile ad hoc networks\u201d, paper presented at Mobicom 98, October.","DOI":"10.1145\/288235.288286"},{"key":"key2021010620212603100_b15","unstructured":"Van Trees, H.L. (1969), Detection, Estimation, and Modulation Theory (Part I), John Wiley & Sons, New York, NY."},{"key":"key2021010620212603100_b7","doi-asserted-by":"crossref","unstructured":"Xu, Y., Heidemann, J. and Estrin, D. (2001), \u201cGeography\u2010informed energy conservation for ad\u2010hoc routing\u201d, paper presented at IEEE\/ACM MobiCom, Rome, Italy, July 16\u201021.","DOI":"10.1145\/381677.381685"},{"key":"key2021010620212603100_b5","unstructured":"Xue, F. and Kumar, P.R. (2002), \u201cThe number of neighbors needed for connectivity of wireless networks\u201d, Wireless Networks, submitted April 1."}],"container-title":["International Journal of Pervasive Computing and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/17427370911008875","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/17427370911008875\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/17427370911008875\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T00:24:15Z","timestamp":1753403055000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/ijpcc\/article\/5\/4\/517-542\/374793"}},"subtitle":[],"editor":[{"given":"D.A.","family":"Agarwal","sequence":"first","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2009,11,20]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,11,20]]}},"alternative-id":["10.1108\/17427370911008875"],"URL":"https:\/\/doi.org\/10.1108\/17427370911008875","relation":{},"ISSN":["1742-7371"],"issn-type":[{"type":"print","value":"1742-7371"}],"subject":[],"published":{"date-parts":[[2009,11,20]]}}}