Sciweavers

833 search results - page 8 / 167
» Simpler and better approximation algorithms for network desi...
Sort
View
TON
2008
125views more  TON 2008»
13 years 7 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
TON
2010
157views more  TON 2010»
13 years 2 months ago
Random Access Game and Medium Access Control Design
We study the contention/interaction among wireless nodes and med -ium access control design in game theory framework. We define a general class of games, called random access game...
Lijun Chen, Steven H. Low, John C. Doyle
CORR
2010
Springer
342views Education» more  CORR 2010»
13 years 7 months ago
A Wireless Sensor Network Air Pollution Monitoring System
Sensor networks are currently an active research area mainly due to the potential of their applications. In this paper we investigate the use of Wireless Sensor Networks (WSN) for...
Kavi Kumar Khedo, Rajiv Perseedoss, Avinash Mungur
APPROX
2009
Springer
145views Algorithms» more  APPROX 2009»
14 years 2 months ago
Approximating Some Network Design Problems with Node Costs
We study several multi-criteria undirected network design problems with node costs and lengths. All these problems are related to the Multicommodity Buy at Bulk (MBB) problem in w...
Guy Kortsarz, Zeev Nutov
INFOCOM
2007
IEEE
14 years 2 months ago
Algorithmic Aspects of Access Networks Design in B3G/4G Cellular Networks
— The forthcoming 4G cellular systems will provide broadband wireless access to a variety of advanced data and voice services. In order to do that, these networks will have a sig...
David Amzallag, Joseph Naor, Danny Raz