This paper models an ad-hoc network as a continuum of nodes, ignoring edge effects, to find how the traffic scales with N, the number of nodes. We obtain expressions for the traffi...
—In greedy routing, each relay node forwards the message to a neighbor (also called successor) that is closer to the destination. However, the successor candidate set (SCS) is di...
Position and orientation information of individual nodes in ad hoc networks is useful for both service and application implementation. Services that can be enabled by availability...
Flooding in wireless ad hoc networks is a fundamental and critical operation in supporting various applications and protocols. However, the traditional flooding scheme generates ex...
Opportunistic networking is emerging as a technique to exploit chance encounters among mobile nodes, and is distinct from previously studied behaviors found in sensor and ad hoc n...