Sciweavers

88 search results - page 6 / 18
» An Improved Topology Discovery Algorithm for Networks with W...
Sort
View
ISCAPDCS
2003
13 years 8 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...
TPDS
2002
155views more  TPDS 2002»
13 years 6 months ago
Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links
Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad hoc wireless networks. Routing based on a connected dominating set is...
Jie Wu
CORR
2006
Springer
143views Education» more  CORR 2006»
13 years 7 months ago
Efficient Route Tracing from a Single Source
Traceroute is a networking tool that allows one to discover the path that packets take from a source machine, through the network, to a destination machine. It is widely used as a...
Benoit Donnet, Philippe Raoult, Timur Friedman
TWC
2008
137views more  TWC 2008»
13 years 7 months ago
Reliability and route diversity in wireless networks
Abstract -We study the problem of communication reliability and diversity in multi-hop wireless networks. Our aim is to develop a new network model that better takes into account t...
Amir Ehsan Khandani, Jinane Abounadi, Eytan Modian...
ICDCS
1998
IEEE
13 years 11 months ago
A Feedback Based Scheme for Improving TCP Performance in Ad-Hoc Wireless Networks
Ad-hoc networks consist of a set of mobile hosts that communicate using wireless links, without the use of other communication support facilities (such as base stations). The topo...
Kartik Chandran, Sudarshan Raghunathan, S. Venkate...