In this paper, we propose a new distributed algorithm that constructs a sparse spanner subgraph of the unit disk graph efficiently for wireless ad hoc networks. It maintains a li...
—In this paper the problem of evaluating the statistics of the connected nodes position in a multi-hop wireless random ad hoc network is addressed. In particular, an analytical m...
Abstract-In this paper, we investigate the problem of providing QoS to end-to-end flows in multihop ad hoc networks with channel errors through packet scheduling. Each flow is asso...
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 propose a distributed clustering algorithm for a multi-hop packet radio network. These types of networks, also known as ad hoc networks, are dynamic in nature due...