—Owing to the absence of any static support structure, Ad-hoc networks are prone to link failures. The ‘shortest path seeking’ routing protocols may not lead to stable routes...
Sulabh Agarwal, Ashish Ahuja, Jatinder Pal Singh, ...
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 address the problem of destination anonymity for applications in mobile ad hoc networks where geographic information is ready for use in both ad hoc routing and I...
In the last few years, the advance of multimedia applications has prompted researchers to undertake the task of routing multimedia data through Manet. This task is rather difficul...
—In mobile ad hoc networks, solving the standard problems encountered in fixed networks can be challenging because of the unpredictable motion of mobile nodes. Due to the lack o...