Sciweavers

476 search results - page 9 / 96
» Computing the Capacity Region of a Wireless Network
Sort
View
INFOCOM
2003
IEEE
14 years 28 days ago
Dynamic Power Allocation and Routing for Time Varying Wireless Networks
—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...
Michael J. Neely, Eytan Modiano, Charles E. Rohrs
WIOPT
2010
IEEE
13 years 6 months ago
On capacity achieving property of rotational coding for acyclic deterministic wireless networks
—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...
WS
2006
ACM
14 years 1 months ago
Integrity regions: authentication through presence in wireless networks
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. ...
Srdjan Capkun, Mario Cagalj
ADHOCNOW
2008
Springer
13 years 8 months ago
A Lower Bound on the Capacity of Wireless Ad Hoc Networks with Cooperating Nodes
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...
Anthony S. Acampora, Louisa Pui Sum Ip
MOBICOM
2004
ACM
14 years 1 months ago
SSCH: slotted seeded channel hopping for capacity improvement in IEEE 802.11 ad-hoc wireless networks
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...
Paramvir Bahl, Ranveer Chandra, John Dunagan