—In this paper we propose a model to compute an upper bound for the maximum network size in mobile ad-hoc networks. Our model is based on the foundation that for a unicast route ...
Michael Pascoe, Javier Gomez, Victor Rangel, Migue...
In intermittently connected ad hoc networks standard routing protocols like AODV, DSR and GPSR fail since they generally cannot find a contemporaneous path from source to destinat...
Routing in ad-hoc networks is a complicated task because of many reasons. The nodes are low-memory, lowpowered, and they cannot maintain routing tables large enough for well-known ...
Murat Yuksel, Ritesh Pradhan, Shivkumar Kalyanaram...
An ad hoc network is a collection of computers (nodes) that cooperate to forward packets for each other over a multihop wireless network. Users of such networks may wish to use de...
In this paper, we propose an adaptive self- stabilizing algorithm for producing a d-hop connected d-hop dominating set. In the algorithm, the set is cumulatively built with commun...