Sciweavers

2343 search results - page 146 / 469
» The Locomotive Routing Problem
Sort
View
BROADNETS
2007
IEEE
16 years 14 days ago
Scheduling routing table calculations to achieve fast convergence in OSPF protocol
Fast convergence to topology changes is a key requirement in modern routing infrastructure while reducing the protocol CPU overhead continues to be as important as before. In this...
Mukul Goyal, Weigao Xie, Mohd Soperi, Seyed H. Hos...
ICC
2007
IEEE
203views Communications» more  ICC 2007»
16 years 14 days ago
Distributed Cooperative Routing for UWB Ad-Hoc Networks
— Ultra wide band (UWB) ad-hoc networks have attracted much research attention in recent years. This paper proposes and investigates a new distributed cooperative routing strateg...
Shouhong Zhu, Kin K. Leung
ICDCS
2005
IEEE
15 years 11 months ago
Enhancing Source-Location Privacy in Sensor Network Routing
— One of the most notable challenges threatening the successful deployment of sensor systems is privacy. Although many privacy-related issues can be addressed by security mechani...
Pandurang Kamat, Yanyong Zhang, Wade Trappe, Celal...
151
Voted
INFOCOM
2005
IEEE
15 years 11 months ago
Provably competitive adaptive routing
Abstract— An ad hoc wireless network is an autonomous selforganizing system of mobile nodes connected by wireless links where nodes not in direct range communicate via intermedia...
Baruch Awerbuch, David Holmer, Herbert Rubens, Rob...
182
Voted
IWDC
2005
Springer
138views Communications» more  IWDC 2005»
15 years 11 months ago
Hierarchical Routing in Sensor Networks Using k-Dominating Sets
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
Michael Q. Rieck, Subhankar Dhar