Nodes in a mobile ad hoc network need to thwart various attacks and malicious activities. This is especially true for the ad hoc environment where there is a total lack of central...
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 autonomous mobile ad-hoc networks, one major challenge is to stimulate cooperation among selfish nodes, especially when some nodes may be malicious. In this paper, we address co...
We propose a process calculus to study the behavioural theory of Mobile Ad Hoc Networks. The operational semantics of our calculus is given both in terms of a Reduction Semantics ...
Recently, many routing protocols and applications for mobile ad hoc networks have been proposed. However, most of them are tested through the simulation experiments, but are not d...