Sciweavers

2076 search results - page 306 / 416
» Universal Routing in Distributed Networks
Sort
View
112
Voted
MOBIHOC
2004
ACM
16 years 2 months ago
Rate allocation in wireless sensor networks with network lifetime requirement
An important performance consideration for wireless sensor networks is the amount of information collected by all the nodes in the network over the course of network lifetime. Sin...
Yiwei Thomas Hou, Yi Shi, Hanif D. Sherali
MOBIHOC
2002
ACM
16 years 2 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman
180
Voted
ISCC
2009
IEEE
262views Communications» more  ISCC 2009»
15 years 9 months ago
Babelchord: a social tower of DHT-based overlay networks
Chord is a protocol to distribute and retrieve information at large scale. It builds a large but rigid overlay network without taking into account the social nature and the underl...
Luigi Liquori, Cédric Tedeschi, Francesco B...
LCN
2002
IEEE
15 years 7 months ago
Multimedia QoS in Low-Cost Home Networks
This paper describes a new mechanism to garantee quality of service for multimedia streams in low-cost home networks. Quality of service is based on a token, of which the route in...
Hans Scholten, Pierre G. Jansen, Ferdy Hanssen, Pi...
114
Voted
IWAN
1999
Springer
15 years 7 months ago
Policy Specification for Programmable Networks
There is a need to be able to program network components to adapt to application requirements for quality of service, specialised application dependent routing, to increase effici...
Morris Sloman, Emil Lupu