Sciweavers

138 search results - page 1 / 28
» Monitoring minimum cost paths on road networks
Sort
View
GIS
2009
ACM
13 years 9 months ago
Monitoring minimum cost paths on road networks
Yuan Tian, Ken C. K. Lee, Wang-Chien Lee
SIGMOD
2009
ACM
198views Database» more  SIGMOD 2009»
14 years 5 months ago
Monitoring path nearest neighbor in road networks
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
Zaiben Chen, Heng Tao Shen, Xiaofang Zhou, Jeffrey...
ETFA
2006
IEEE
13 years 8 months ago
Verification of The Minimum Cost Forwarding Protocol for Wireless Sensor Networks
Wireless sensor networks (WSN) consist of small self-contained devices with computational, sensing and wireless communication capabilities. They allow flexible, powerful, tetherles...
William D. Henderson, Steven Tron
ISPAN
2005
IEEE
13 years 10 months ago
Minimum Cost Paths Subject to Minimum Vulnerability for Reliable Communications
Abstract—In real networks, disjoint paths are needed for providing protection against single link/node failure. When disjoint paths cannot be found, an alternative solution is to...
Bing Yang, Mei Yang, Jianping Wang, S. Q. Zheng
TON
2010
221views more  TON 2010»
12 years 11 months ago
Minimum-Cost Multiple Paths Subject to Minimum Link and Node Sharing in a Network
Abstract--In communication networks, multiple disjoint communication paths are desirable for many applications. Such paths, however, may not exist in a network. In such a situation...
S. Q. Zheng, Jianping Wang, Bing Yang, Mei Yang