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...
Some of the routing algorithms in mobile ad hoc networks use multiple paths simultaneously. These algorithms can attempt to find nodedisjoint paths to achieve higher fault toleranc...
— Gupta and Kumar showed that throughput in a static random wireless network increases with the amount of hopping. In a subsequent paper (2004), it was shown that although throug...
An ad hoc network is formed by a group of mobile hosts communicating over wireless channels. Such a network operates without any fixed network interaction and centralized administ...
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...