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 ...
Wireless multihop ad hoc networks face a multitude of challenging problems including highly dynamic multihop topologies, lossy and noisy communications channels, and sporadic conne...
Alvin C. Valera, Hwee-Pink Tan, Winston Khoon Guan...
This paper describes the Multicast Shared Tree Protocol MSTP that has been designed to support the delivery of multicast packets in a mobile ad hoc network. MSTP uses a shared tre...
— In a typical mobile ad hoc network, mobile computing devices wander autonomously and communicate via temporary links in a self-organized computing system without any central ad...
A major challenge faced in mobile ad hoc networks (MANETs) is locating devices for communication, especially in the case of high node mobility and sparse node density. Present solu...