Sciweavers

3467 search results - page 78 / 694
» A New Localized Network Based Routing Model in Computer and ...
Sort
View
CNSR
2004
IEEE
14 years 21 days ago
Trusted Route Discovery with TORA Protocol
An ad-hoc network is formed when a group of wireless nodes pledge to help each other in passing packets based upon a pre-agreed protocol. Temporally Ordered Routing Algorithm (TOR...
Asad Amir Pirzada, Chris McDonald
NETWORK
2010
122views more  NETWORK 2010»
13 years 3 months ago
Betweenness centrality and resistance distance in communication networks
In this article we report on applications and extensions of weighted graph theory in the design and control of communication networks. We model the communication network as a weig...
Ali Tizghadam, Alberto Leon-Garcia
TPDS
2010
109views more  TPDS 2010»
13 years 7 months ago
Minimal Sets of Turns for Breaking Cycles in Graphs Modeling Networks
Abstract—We propose an algorithm that provides for deadlockfree and livelock-free routing, in particular in wormhole routed networks. The proposed algorithm requires nearly minim...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa
WCNC
2008
IEEE
14 years 3 months ago
Performance Evaluation of Vehicular DTN Routing under Realistic Mobility Models
—In performance studies of vehicular ad hoc networks (VANETs), the underlying mobility model plays an important role. Since conventional mobile ad hoc network (MANET) routing pro...
Pei'en Luo, Hongyu Huang, Wei Shu, Minglu Li, Min-...
MOBIHOC
2005
ACM
14 years 8 months ago
Link-layer salvaging for making routing progress in mobile ad hoc networks
IEEE 802.11 MAC, called the Distributed Coordination Function (DCF), employs carrier sensing to effectively avoid collisions, but this makes it difficult to maximally reuse the sp...
Chansu Yu, Kang G. Shin, Lubo Song