Sciweavers

1184 search results - page 189 / 237
» Nearness relations and topology
Sort
View
TON
2008
125views more  TON 2008»
13 years 8 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
2008
159views more  TON 2008»
13 years 8 months ago
Optimizing lifetime for continuous data aggregation with precision guarantees in wireless sensor networks
This paper exploits the tradeoff between data quality and energy consumption to extend the lifetime of wireless sensor networks. To obtain an aggregate form of sensor data with pre...
Xueyan Tang, Jianliang Xu
TON
2008
131views more  TON 2008»
13 years 8 months ago
Capacity management and equilibrium for proportional QoS
Differentiated services architectures are scalable solutions for providing class-based Quality of Service (QoS) over packet switched networks. While qualitative attributes of the o...
Ishai Menache, Nahum Shimkin
JSAC
2007
124views more  JSAC 2007»
13 years 8 months ago
Optimal search performance in unstructured peer-to-peer networks with clustered demands
—This paper derives the optimal search time and the optimal search cost that can be achieved in unstructured peer-topeer networks when the demand pattern exhibits clustering (i.e...
Saurabh Tewari, Leonard Kleinrock
TWC
2008
176views more  TWC 2008»
13 years 8 months ago
Asynchronous distributed power and rate control in ad hoc networks: a game-theoretic approach
This paper analyzes distributed asynchronous power and rate control for wireless ad hoc networks. Importantly, all network transmitters are considered to be independent of any mana...
Stepán Kucera, Sonia Aïssa, Koji Yamam...