We consider the following problem for wireless ad hoc networks: assume n nodes, each capable of communicating with nodes within a radius of r, are distributed in a ddimensional re...
- Mobile ad hoc networks allow mobile nodes to communicate with one another without the aid of infrastructure thus forming temporary networks on the fly. While such networks are ga...
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 ...