This paper investigates connectivity in one-dimensional ad hoc networks by means of the distribution of the minimum hop count between source and destination nodes. We derive the ex...
— A well-known approach to increase the resilience of mobile ad hoc networks (MANETs) and unstructured sensor networks is to ensure a network topology where there are at least k ...
Tae-Hoon Kim, David Tipper, Prashant Krishnamurthy
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 ...
We propose a general framework of the iterative local solution (ILS) for computing a connected dominating set (CDS) in ad hoc wireless networks, which include wireless sensor netwo...
The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconfiguration and self-management. Efficient clus...