Sciweavers

866 search results - page 108 / 174
» On Dynamic Shortest Paths Problems
Sort
View
INFOVIS
2003
IEEE
15 years 3 months ago
Visualizing Evolving Networks: Minimum Spanning Trees versus Pathfinder Networks
Network evolution is a ubiquitous phenomenon in a wide variety of complex systems. There is an increasing interest in statistically modeling the evolution of complex networks such...
Chaomei Chen, Steven Morris
BCS
2008
14 years 11 months ago
Adaptive Random Re-Routing for Differentiated QoS in Sensor Networks
Much of the traffic carried by Sensor Networks will originate from routine measurements or observations by sensors which monitor a particular situation, such as the temperature an...
Erol Gelenbe, Edith C. H. Ngai
JNW
2008
115views more  JNW 2008»
14 years 9 months ago
On the Interaction Between Multiple Paths and Wireless Mesh Networks Scheduler Approaches
Multi-path routing allows building and use of multiple paths for routing between a source-destination pair. This paper investigates the problem of selecting multiple routing paths ...
Valeria Loscrì
IMC
2006
ACM
15 years 3 months ago
Quantifying path exploration in the internet
A number of previous measurement studies [10, 12, 17] have shown the existence of path exploration and slow convergence in the global Internet routing system, and a number of prot...
Ricardo V. Oliveira, Beichuan Zhang, Dan Pei, Rafi...
INFOCOM
2009
IEEE
15 years 4 months ago
Tracking with Unreliable Node Sequences
—Tracking mobile targets using sensor networks is a challenging task because of the impacts of in-the-filed factors such as environment noise, sensing irregularity and etc. This...
Ziguo Zhong, Ting Zhu, Dan Wang, Tian He