—We consider dynamic routing and power allocation for a wireless network with time-varying channels. The network consists of power constrained nodes that transmit over wireless l...
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
—In the past few years there has been increasing research interest in service discovery protocols for Mobile Ad Hoc Networks (MANET). The most promising approaches so far address...
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc rout...
Fabian Kuhn, Roger Wattenhofer, Yan Zhang, Aaron Z...
Routing protocols for wireless ad hoc networks have traditionally focused on finding paths with minimum hop count. However, such paths can include slow or lossy links, leading to...