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 ...
Security is a critical issue in a mobile ad hoc network (MANET). In most of the previous protocols security is an added layer above the routing protocol. We propose a TrustAware R...
Loay Abusalah, Ashfaq A. Khokhar, G. BenBrahim, W....
Wireless multihop ad hoc networks face a multitude of challenging problems including highly dynamic multihop topologies, lossy and noisy communications channels, and sporadic conne...
Alvin C. Valera, Hwee-Pink Tan, Winston Khoon Guan...
Abstract. We propose a distributed and adaptive topology management algorithm, called PATM (Priority-based Adaptive Topology Management), that constructs and maintains a connected ...
In this paper we show how game theory and Gibbs sampling techniques can be used to design a self-optimizing algorithm for minimizing end-to-end delays for all flows in a multi-clas...