— The minimum disc cover set can be used to construct the dominating set on the fly for energy-efficient communications in mobile ad hoc networks. The approach used to compute ...
Reliable storage of data with concurrent read/write accesses (or query/update) is an ever recurring issue in distributed settings. In mobile ad hoc networks, the problem becomes e...
Abstract— In this paper we use an information-theoretic formulation for characterizing the minimum routing overhead of link state routing in a mobile ad hoc network. We formulate...
—In this paper we study the propagation of malicious software in wireless ad hoc networks under a probabilistic framework. We design topology control algorithms for the developme...
Vasileios Karyotis, Symeon Papavassiliou, Mary Gra...
– In this paper, we propose an auction mechanism for routing in mobile ad hoc networks with selfish nodes. Our approach is to promote bidding for end-to-end routes, as opposed to...