Sciweavers

177 search results - page 11 / 36
» Link Distance and Shortest Path Problems in the Plane
Sort
View
INFOCOM
2008
IEEE
14 years 3 months ago
Circular Sailing Routing for Wireless Networks
Abstract—Routing in wireless networks has been heavily studied in the last decade and numerous routing protocols were proposed in literature. The packets usually follow the short...
Fan Li, Yu Wang 0003
ICCSA
2004
Springer
14 years 1 months ago
New Parameter for Balancing Two Independent Measures in Routing Path
The end-to-end characteristic is an important factor for QoS support. Since network users and their required bandwidths for applications increase, the efficient usage of networks h...
Moonseong Kim, Young-Cheol Bang, Hyunseung Choo
MOBIHOC
2005
ACM
14 years 8 months ago
Localization and routing in sensor networks by local angle information
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
Jehoshua Bruck, Jie Gao, Anxiao Jiang
ISCAPDCS
2003
13 years 10 months ago
Design and Analysis of Improved Shortest Path Tree Update for Network Routing
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...
Bin Xiao, Qingfeng Zhuge, Zili Shao, Edwin Hsing-M...
EOR
2006
110views more  EOR 2006»
13 years 8 months ago
A constructive algorithm for realizing a distance matrix
The natural metric of a weighted graph is the length of the shortest paths between all pairs of vertices. The investigated problem consists in a representation of a given metric b...
Sacha C. Varone