Sciweavers

98 search results - page 18 / 20
» Approximating minimum independent dominating sets in wireles...
Sort
View
BROADNETS
2007
IEEE
14 years 10 days ago
TCP dynamics over IEEE 802.11E WLANs: Modeling and throughput enhancement
— Today, IEEE 802.11 Wireless LAN (WLAN) has become a prevailing solution for broadband wireless Internet access while Transport Control Protocol (TCP) is the dominant transport ...
Jeonggyun Yu, Sunghyun Choi, Daji Qiao
ALGOSENSORS
2007
Springer
14 years 5 days ago
Assigning Sensors to Missions with Demands
We introduce Semi-Matching with Demands (SMD), which models a certain problem in sensor networks of assigning individual sensors to sensing tasks. If there are multiple sensing tas...
Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson,...
MOBIHOC
2009
ACM
14 years 6 months ago
Spectrum auction framework for access allocation in cognitive radio networks
Cognitive radio networks are emerging as a promising technology for the efficient use of radio spectrum. In these networks, there are two categories of networks on different chann...
Gaurav S. Kasbekar, Saswati Sarkar
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
14 years 16 days ago
Shifting Strategy for Geometric Graphs without Geometry
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
Imran A. Pirwani
PODC
2005
ACM
13 years 11 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer