Sciweavers

7133 search results - page 1301 / 1427
» Communication algorithms with advice
Sort
View
ICDCS
2010
IEEE
13 years 10 months ago
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...
Ling Ding, Xiaofeng Gao, Weili Wu, Wonjun Lee, Xu ...
AHSWN
2010
130views more  AHSWN 2010»
13 years 9 months ago
How Good is Opportunistic Routing? - A Reality Check under Rayleigh Fading Channels
Considerations of realistic channel dynamics motivate the design of a new breed of opportunistic schemes, such as opportunistic transmission, scheduling and routing. Compared to t...
Rong Zheng, Chengzhi Li
CONCURRENCY
2010
104views more  CONCURRENCY 2010»
13 years 9 months ago
Performance analysis of an experimental wireless relay sensor network
Communication through relay channels in wireless sensor networks can create diversity and consequently improve robustness of data transmission for ubiquitous computing and network...
Gu-Chun Zhang, Xiao-Hong Peng, Xuan-Ye Gu
COMCOM
2008
143views more  COMCOM 2008»
13 years 9 months ago
Cross-layer rate control, medium access control and routing design in cooperative VANET
In this paper, we address the rate control, the Medium Access Control (MAC) and the routing problem for cooperative Vehicular Ad-Hoc Network (VANET) in the framework of cross-laye...
Liang Zhou, Baoyu Zheng, Benoit Geller, Anne Wei, ...
CORR
2008
Springer
119views Education» more  CORR 2008»
13 years 9 months ago
Capacity of the Discrete-Time AWGN Channel Under Output Quantization
We investigate the limits of communication over the discrete-time Additive White Gaussian Noise (AWGN) channel, when the channel output is quantized using a small number of bits. W...
Jaspreet Singh, Onkar Dabeer, Upamanyu Madhow
« Prev « First page 1301 / 1427 Last » Next »