Sciweavers

422 search results - page 73 / 85
» On the Wake-Up Problem in Radio Networks
Sort
View
MOBICOM
2010
ACM
13 years 7 months ago
Retransmission != repeat: simple retransmission permutation can resolve overlapping channel collisions
Collisions in overlapping channels are becoming an increasingly important problem in the deployment of high-speed wireless networks. In this paper, we present Remap, a simple, nov...
Erran L. Li, Kun Tan, Harish Viswanathan, Ying Xu,...
INFOCOM
2006
IEEE
14 years 23 days ago
Broadcasting in Sensor Networks: The Role of Local Information
Abstract— Flooding based strategies are conventionally employed to perform querying and broadcasting in sensor networks. These schemes have low hop-delays of Θ( 1 M(n) ) to reac...
Sundar Subramanian, Sanjay Shakkottai, Ari Arapost...
DIALM
2005
ACM
130views Algorithms» more  DIALM 2005»
13 years 8 months ago
On lower bounds for MAC layer contention in CSMA/CA-based wireless networks
Wireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for exam...
Frank A. Zdarsky, Ivan Martinovic, Jens B. Schmitt
ECUMN
2004
Springer
13 years 10 months ago
Fast Handoff Algorithm Using Access Points with Dual RF Modules
With the spread of portable computers, mobile users rapidly increase and have growing interests in wireless LAN (WLAN). However, when a mobile node (MN) moves, handoff can frequent...
Chun-Su Park, Hye-Soo Kim, Sang-Hee Park, Kyunghun...
DC
2010
13 years 6 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