—We consider dynamic routing and power allocation for a wireless network with time-varying channels. The network consists of power constrained nodes that transmit over wireless l...
—It has been shown that the well-known cutset bounds can be achieved for deterministic wireless networks by performing random coding at each intermediate node. The complexity and...
Mohammad A. (Amir) Khojastepour, Alireza Keshavarz...
We introduce Integrity (I) regions, a novel security primitive that enables message authentication in wireless networks without the use of pre-established or pre-certified keys. ...
In this paper, we consider the effects on network capacity when the nodes of an ad hoc network are allowed to cooperate. These results are then compared to the theoretical upper b...
Capacity improvement is one of the principal challenges in wireless networking. We present a link-layer protocol called Slotted Seeded Channel Hopping, or SSCH, that increases the...