Sciweavers

52 search results - page 1 / 11
» Minimum-Cost Multiple Paths Subject to Minimum Link and Node...
Sort
View
TON
2010
221views more  TON 2010»
13 years 7 days 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
INFOCOM
2007
IEEE
13 years 12 months ago
Finding Minimum-Cost Paths with Minimum Sharability
Abstract— In communication networks, multiple communication paths sharing minimum number of links or/and nodes may be desirable for improved performance, resource utilization and...
Si-Qing Zheng, Bing Yang, Mei Yang, Jianping Wang
ISPAN
2005
IEEE
13 years 11 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
ETFA
2006
IEEE
13 years 9 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
JCO
2006
106views more  JCO 2006»
13 years 5 months ago
Reliable Ad Hoc Routing Based on Mobility Prediction
Reliability is a very important issue in Mobile Ad hoc NETworks (MANETs). Shortest paths are usually used to route packets in MANETs. However, a shortest path may fail quickly, bec...
Jian Tang, Guoliang Xue, Weiyi Zhang