Abstract— We consider two-hop communication of a delaysensitive, memoryless Gaussian source over two independent paths in an ad-hoc network. To capture the behavior an ad-hoc net...
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
We present a new non-interactive key agreement and progression (NIKAP) scheme for mobile ad hoc networks (MANETs), which does not require an on-line centralized authority, can non...
Abstract—Many protocols for ad-hoc wireless networks perform poorly in situations when node cooperation cannot be enforced. This may happen because of the lack of global authorit...
Abstract –The access link contention can severely constrain the endto-end throughput of the path between a source and destination mobile node connected through the backbone of th...
Amir Esmailpour, Muhammad Jaseemuddin, Nidal Nasse...