Sciweavers

317 search results - page 45 / 64
» Bounds on the Gain of Network Coding and Broadcasting in Wir...
Sort
View
ICC
2008
IEEE
127views Communications» more  ICC 2008»
14 years 2 months ago
Power and Bandwidth Allocation in Cooperative Dirty Paper Coding
—The cooperative dirty paper coding (DPC) rate region is investigated in a two-transmitter two-receiver network with full channel state information available at all terminals. Th...
Chris T. K. Ng, Nihar Jindal, Andrea J. Goldsmith,...
MOBIHOC
2008
ACM
14 years 8 months ago
The capacity and energy efficiency of wireless ad hoc networks with multi-packet reception
We address the cost incurred in increasing the transport capacity of wireless ad hoc networks over what can be attained when sources and destinations communicate over multi-hop pa...
Zheng Wang, Hamid R. Sadjadpour, Jose Joaquin Garc...
WDAG
2009
Springer
91views Algorithms» more  WDAG 2009»
14 years 3 months ago
Randomization Can Be a Healer: Consensus with Dynamic Omission Failures
Abstract. Wireless ad-hoc networks are being increasingly used in diverse contexts, ranging from casual meetings to disaster recovery operations. A promising approach is to model t...
Henrique Moniz, Nuno Ferreira Neves, Miguel Correi...
ALGOSENSORS
2009
Springer
14 years 3 months ago
Near-Optimal Radio Use for Wireless Network Synchronization
In this paper we consider the model of communication where wireless devices can either switch their radios off to save energy (and hence, can neither send nor receive messages), o...
Milan Bradonjic, Eddie Kohler, Rafail Ostrovsky
WINET
2010
185views more  WINET 2010»
13 years 6 months ago
TDMA scheduling algorithms for wireless sensor networks
Abstract Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is a...
Sinem Coleri Ergen, Pravin Varaiya