Abstract--Existing anycast routing protocols solely route packets to the closest group member. In this paper, we introduce density-based anycast routing, a new anycast routing para...
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...
—In this paper we study the propagation of malicious software in wireless ad hoc networks under a probabilistic framework. We design topology control algorithms for the developme...
Vasileios Karyotis, Symeon Papavassiliou, Mary Gra...
– In this paper, we propose an auction mechanism for routing in mobile ad hoc networks with selfish nodes. Our approach is to promote bidding for end-to-end routes, as opposed to...
A routing protocol is designed considering a particular environment all the time which is not possible in the case of practical ad hoc networks. Because of the uncertainty in topol...