{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T05:02:22Z","timestamp":1766466142524,"version":"3.41.0"},"reference-count":11,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2004,7,1]],"date-time":"2004-07-01T00:00:00Z","timestamp":1088640000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGCOMM Comput. Commun. Rev."],"published-print":{"date-parts":[[2004,7]]},"abstract":"We study the capacity of static wireless networks, both ad hoc and hybrid, under the Protocol and Physical Models of communication, proposed in [1]. For ad hoc networks with <i>n<\/i> nodes, we show that under the Physical Model, where signal power is assumed to attenuate as 1\/r<sup>\u03b1<\/sup>, \u03b1 > 2, the transport capacity scales as \u0398(\u221a<i>n<\/i>) bit-meters\/sec. The same bound holds even when the nodes are allowed to approach arbitrarily close to each other and even under a more generalized notion of the Physical Model wherein the data rate is Shannon's logarithmic function of the SINR at the receiver. This result is sharp since it closes the gap that existed between the previous best known upper bound of O(<i>n<\/i><sup>\u03b1-1\/\u03b1<\/sup>) and lower bound of \u03a9(\u221an).<\/jats:p>\n We also show that any spatio-temporal scheduling of transmissions and their ranges that is feasible under the Protocol Model can also be realized under the Physical Model by an appropriate choice of power levels for appropriate thresholds. This allows the generalization of various lower bound constructions from the Protocol Model to the Physical Model. In particular, this provides a better lower bound on the best case transport capacity than in [1].<\/jats:p>\n For hybrid networks, we consider an overlay of \u03bc<i>n<\/i> randomly placed wired base stations. It has previously been shown in [6] that if all nodes adopt a common power level, then each node can be provided a throughput of at most \u0398(1\/log <i>n<\/i>) to randomly chosen destinations. Here we show that by allowing nodes to perform power control and properly choosing \u03bd(1\/log <i>n<\/i>), it is further possible to provide a throughput of \u0398(1) to any fraction <i>f<\/i>, 0 < <i>f<\/i> < 1, of nodes. This result holds under both the Protocol and Physical models of communication. On the one hand, it shows that that the aggregate throughput capacity, measured as the sum of individual throughputs, can scale linearly in the number of nodes. On the other hand, the result underscores the importance of choosing minimum power levels for communication and suggests that simply communicating with the closest node or base station could yield good capacity even for multihop hybrid wireless networks.<\/jats:p>","DOI":"10.1145\/1031134.1031143","type":"journal-article","created":{"date-parts":[[2005,1,26]],"date-time":"2005-01-26T16:49:14Z","timestamp":1106758154000},"page":"71-81","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":159,"title":["Capacity bounds for ad hoc and hybrid wireless networks"],"prefix":"10.1145","volume":"34","author":[{"given":"Ashish","family":"Agarwal","sequence":"first","affiliation":[{"name":"University of Illinois, Urbana, IL"}]},{"given":"P. R.","family":"Kumar","sequence":"additional","affiliation":[{"name":"University of Illinois, Urbana, IL"}]}],"member":"320","published-online":{"date-parts":[[2004,7]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"T-46","article-title":"The capacity of wireless networks","author":"Gupta P.","year":"2000","unstructured":"P. Gupta and P. R. Kumar , \" The capacity of wireless networks ,\" IEEE Transactions on Information Theory , vol. I T-46 , March 2000 . P. Gupta and P. R. Kumar, \"The capacity of wireless networks,\" IEEE Transactions on Information Theory, vol. IT-46, March 2000.","journal-title":"IEEE Transactions on Information Theory"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1002\/wcm.v4:3"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.826631"},{"key":"e_1_2_1_4_1","unstructured":"M. Franceschetti O. Dousse D. Tse P. Thiran \"Closing the gap in the capacity of random wireless networks \" preprint. M. Franceschetti O. Dousse D. Tse P. Thiran \"Closing the gap in the capacity of random wireless networks \" preprint."},{"key":"e_1_2_1_5_1","volume-title":"On the capacity of hybrid wireless networks,\" in Proceedings of IEEE Infocom","author":"Liu B.","year":"2003","unstructured":"B. Liu , Z. Liu , and D. Towsley , \" On the capacity of hybrid wireless networks,\" in Proceedings of IEEE Infocom , 2003 . B. Liu, Z. Liu, and D. Towsley, \"On the capacity of hybrid wireless networks,\" in Proceedings of IEEE Infocom, 2003."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/938985.938992"},{"key":"e_1_2_1_7_1","volume-title":"dissertation","author":"Gupta P.","year":"2000","unstructured":"P. Gupta , \" Design and performance analysis of wireless networks,\" Ph. D. dissertation , University of Illinois at Urbana-Champaign , 2000 . P. Gupta, \"Design and performance analysis of wireless networks,\" Ph.D. dissertation, University of Illinois at Urbana-Champaign, 2000."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/129837"},{"key":"e_1_2_1_9_1","volume-title":"Spatial Tessellations Concepts and Applications of Voronoi Diagrams","author":"Okabe A.","year":"1992","unstructured":"A. Okabe , B. Boots , and K. Sugihara , Spatial Tessellations Concepts and Applications of Voronoi Diagrams . John Wiley , 1992 . A. Okabe, B. Boots, and K. Sugihara, Spatial Tessellations Concepts and Applications of Voronoi Diagrams. John Wiley, 1992."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.4310\/CIS.2001.v1.n1.a3"},{"key":"e_1_2_1_11_1","first-page":"547","volume-title":"Critical power for asymptotic connectivity in wireless networks","author":"Gupta Piyush","year":"1998","unstructured":"Piyush Gupta and P. R. Kumar , \" Critical power for asymptotic connectivity in wireless networks \", pp. 547 -- 566 , in Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W. H. Fleming. Edited by W. M. McEneany, G. Yin, and Q. Zhang. Birkhauser , Boston, 1998 . ISBN 0-8176-4078-9. Piyush Gupta and P. R. Kumar, \"Critical power for asymptotic connectivity in wireless networks\", pp. 547--566, in Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W. H. Fleming. Edited by W. M. McEneany, G. Yin, and Q. Zhang. Birkhauser, Boston, 1998. ISBN 0-8176-4078-9."}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1031134.1031143","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1031134.1031143","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:30:56Z","timestamp":1750264256000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1031134.1031143"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,7]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2004,7]]}},"alternative-id":["10.1145\/1031134.1031143"],"URL":"https:\/\/doi.org\/10.1145\/1031134.1031143","relation":{},"ISSN":["0146-4833"],"issn-type":[{"type":"print","value":"0146-4833"}],"subject":[],"published":{"date-parts":[[2004,7]]},"assertion":[{"value":"2004-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}