We conjecture that any planar 3-connected graph can be embedded in the plane in such a way that for any nodes s and t, there is a path from s to t such that the Euclidean distance ...
Connectivity in wireless ad hoc and sensor networks is typically analyzed using a graph-theoretic approach. In this paper, we investigate an alternative communication-theoretic app...
Sooksan Panichpapiboon, Gian Luigi Ferrari, Ozan K...
— A novel framework is presented for the study of scalability in ad hoc networks. Using this framework, the first asymptotic analysis is provided with respect to network size, m...
Cesar A. Santivanez, A. Bruce McDonald, Ioannis St...
This paper considers the problem of providing a geocast service in mobile ad hoc networks and presents a novel geocasting algorithm combining unicasting and flooding. Geocast is ...
Broadcasting in ad hoc networks is required for many routing and other network-layer protocols to request information like routes or locations about destination nodes. Most of the...