A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
In this paper we present AntHocNet, a new algorithm for routing in mobile ad hoc networks. Due to the ever changing topology and limited bandwidth it is very hard to establish and ...
Gianni Di Caro, Frederick Ducatelle, Luca Maria Ga...
—Using directional antennas to conserve bandwidth and energy consumption in ad hoc wireless networks has attracted much attention of the research community in recent years. Howev...
The network is becoming more and more versatile because of the variety of the computing resources and the communication technologies that have become available. The mobility of the...
Coping with mobility and dynamism is one of the biggest challenges in ad hoc networks. An essential requirement for such networks is a service that can establish communication ses...