Sciweavers

266 search results - page 3 / 54
» Distributed Routing in Tree Networks with Few Landmarks
Sort
View
ICCCN
2007
IEEE
13 years 12 months ago
Maintaining Routing Tree in IEEE 802.16 Centralized Scheduling Mesh Networks
Abstract— The IEEE 802.16 mesh mode supports two scheduling mechanisms, namely centralized scheduling and distributed scheduling. Centralized scheduling is based on a routing tre...
Yanbin Lu, Guoqing Zhang
EUROPAR
2004
Springer
13 years 11 months ago
Near-Optimal Hot-Potato Routing on Trees
In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit, so that some conflicting packets must be deflected away from their destination...
Costas Busch, Malik Magdon-Ismail, Marios Mavronic...
ICDCS
1996
IEEE
13 years 9 months ago
Group Routing without Group Routing Tables
We present a group routing protocol for a network of processes. The task of the protocol is to route data messages to each member of a process group. To this end, a tree of proces...
Jorge Arturo Cobb, Mohamed G. Gouda
JCST
2008
203views more  JCST 2008»
13 years 5 months ago
Scoped Bellman-Ford Geographic Routing for Large Dynamic Wireless Sensor Networks
Routing is a fundamental problem in wireless sensor networks. Most previous routing protocols are challenged when used in large dynamic networks as they suffer from either poor sca...
Xue Zhang, Jue Hong, Sanglu Lu, Li Xie, Jiannong C...
CCR
2006
110views more  CCR 2006»
13 years 5 months ago
Estimating network proximity and latency
Network proximity and latency estimation is an important component in discovering and locating services and applications. With the growing number of services and service providers...
Puneet Sharma, Zhichen Xu, Sujata Banerjee, Sung-J...