Sciweavers

52 search results - page 7 / 11
» Network design arc set with variable upper bounds
Sort
View
INFOCOM
2007
IEEE
14 years 2 months ago
Randomized k-Coverage Algorithms For Dense Sensor Networks
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
Mohamed Hefeeda, M. Bagheri
TON
2008
74views more  TON 2008»
13 years 8 months ago
Race conditions in coexisting overlay networks
By allowing end hosts to make independent routing decisions at the application level, different overlay networks may unintentionally interfere with each other. This paper describes...
Ram Keralapura, Chen-Nee Chuah, Nina Taft, Gianluc...
MOR
2010
118views more  MOR 2010»
13 years 6 months ago
Strategyproof Approximation of the Minimax on Networks
We consider the problem of locating a facility on a network, represented by a graph. A set of strategic agents have different ideal locations for the facility; the cost of an age...
Noga Alon, Michal Feldman, Ariel D. Procaccia, Mos...
INFOCOM
2008
IEEE
14 years 2 months ago
A Distributed Optimization Algorithm for Multi-Hop Cognitive Radio Networks
Cognitive radio (CR) is a revolution in radio technology and is viewed as an enabling technology for dynamic spectrum access. This paper investigates how to design distributed alg...
Yi Shi, Y. Thomas Hou
MOBIHOC
2009
ACM
14 years 9 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