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 ...
– As mobile wireless ad hoc networks have different characteristics from wired networks and even from standard wireless networks, there are new challenges related to security iss...
— Group communications are important in Mobile Ad hoc Networks (MANET). Multicast is an efficient method to implement the group communications. However, it is challenging to imp...
Abstract: Overlay Multicast networks in mobile ad-hoc environments have received much attention due to their increasing number of practical applications. Although overlay multicast...
Abhishek P. Patil, Yunhao Liu, Lionel M. Ni, Li Xi...
In this paper, we present Collaborative Opportunistic Recovery Algorithm (CORA) designed for multicast multimedia applications with low loss as well as latency constraints in ad h...
Yunjung Yi, Jiejun Kong, Mario Gerla, Joon-Sang Pa...