Connectivity of ad hoc wireless networks: An alternative to graph-theoretic approaches

dc.contributor.authorPanichpapiboon, Sooksan
dc.contributor.authorFerrari, Gianluigi
dc.contributor.authorTonguz, Ozan K.
dc.date.accessioned2026-08-06T10:00:02Z
dc.date.available2026-08-06T10:00:02Z
dc.date.issued2010-04-01
dc.description.abstractConnectivity in wireless ad hoc and sensor networks is typically analyzed using a graph-theoretic approach. In this paper, we investigate an alternative communication-theoretic approach for determining the minimum transmit power required for achieving connectivity. Our results show that, if there is significant multipath fading and/or multiple access interference in the network, then graph-theoretic approaches can substantially underestimate the minimum transmit power required for connectivity. This is due to the fact that graph-theoretic approaches do not take the route quality into consideration. Therefore, while in scenarios with line-of-sight (LOS) communications a graph-theoretic approach could be adequate for determining the minimum transmit power required for connectivity, in scenarios with strong multipath fading and/or multiple access interference a communication-theoretic approach could yield much more accurate results and, therefore, be preferable. © Springer Science+Business Media, LLC 2009.
dc.identifier.citationWireless Networks, 16(3), 793-811, 2010
dc.identifier.doi10.1007/s11276-009-0169-y
dc.identifier.issn10220038
dc.identifier.other2-s2.0-77953364385
dc.identifier.urihttps://dspace.kmitl.ac.th/handle/123456789/2996
dc.sourceWireless Networks
dc.subjectAd hoc wireless networks
dc.subjectConnectivity
dc.subjectPower control
dc.subjectSensor networks
dc.subjectTransmission range assignment
dc.titleConnectivity of ad hoc wireless networks: An alternative to graph-theoretic approaches
dc.typeArticle

Files

Collections