Sciweavers

1716 search results - page 314 / 344
» Optimal Hopping in Ad Hoc Wireless Networks
Sort
View
SCN
2011
Springer
348views Communications» more  SCN 2011»
13 years 3 months ago
MANET QoS support without reservations
An inelastic flow is a flow with inelastic rate: i.e., the rate is fixed, it cannot be dynamically adjusted to traffic and load condition as in elastic flows like TCP. Real ti...
Soon-Young Oh, Gustavo Marfia, Mario Gerla
ICC
2008
IEEE
126views Communications» more  ICC 2008»
14 years 3 months ago
On The Rate-Distance Adaptability of Slotted Aloha
—In wireless communication systems, the signal strength/quality generally varies with the distances between transmitters and receivers. As a consequence, the throughput in the MA...
Chih-Cheng Tseng, Shao-Yu Lien, Kwang-Cheng Chen, ...
DC
2010
13 years 8 months ago
An optimal maximal independent set algorithm for bounded-independence graphs
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
Johannes Schneider, Roger Wattenhofer
INFOCOM
2011
IEEE
13 years 5 days ago
Optimal multicast capacity and delay tradeoffs in MANETs: A global perspective
—In this paper, we give a global perspective of multicast capacity and delay analysis in Mobile Ad-hoc Networks (MANETs). Specifically, we consider two node mobility models: (1)...
Yun Wang, Xiaoyu Chu, Xinbing Wang, Yu Cheng
MOBIHOC
2004
ACM
14 years 8 months ago
On greedy geographic routing algorithms in sensing-covered networks
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
Guoliang Xing, Chenyang Lu, Robert Pless, Qingfeng...