In this paper we present a novel probabilistic protocol for path discovery in Mobile Ad Hoc Networks (MANETs). The protocol implements what we call a polarized gossiping algorithm...
Abstract—In lightweight mobile ad hoc networks, both probabilistic and deterministic key management schemes are fragile to node fabrication attacks. Our simulation results show t...
Jeffrey S. Dwoskin, Dahai Xu, Jianwei Huang, Mung ...
We present a self-healing On-demand Geographic Path Routing Protocol (OGPR) for mobile ad-hoc networks. OGPR is an efficient, stateless, and scalable routing protocol that inherit...
Quality of service is an important issue in Delay Tolerant Mobile Ad-Hoc Networks (DTMs). This work attempts to improve the Quality of service (QoS) in DTMs by relying on spanning...
Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are many real ...