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...
Abstract. In ad hoc networks, node mobility causes the network topology to change dynamically over time, which complicates important tasks such as routing and flow control. We pro...
We present a technique for compression of shortest paths routing tables for wireless ad hoc networks. The main characteristic of such networks is that geographic location of nodes...
This paper describes a study of the evolution of distributed behavior, specifically the control of agents in a mobile ad hoc network, using neuroevolution. In neuroevolution, a p...
David B. Knoester, Heather Goldsby, Philip K. McKi...
Using two-hop neighborhood information, we present the hybrid activation multiple access (HAMA) protocol for time-division channel access scheduling in ad hoc networks with omni-di...