Sciweavers

3319 search results - page 252 / 664
» The topology of dark networks
Sort
View
130
Voted
TPDS
2010
109views more  TPDS 2010»
15 years 9 days 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
EMS
2009
IEEE
15 years 8 months ago
Modelling Periodic Data Dissemination in Wireless Sensor Networks
—Epidemic-based communications, or “gossiping”, provides a robust and scalable method for maintaining a knowledge base in a sensor network faced with an unpredictable network...
Graham Williamson, Davide Cellai, Simon A. Dobson,...
ICC
2009
IEEE
129views Communications» more  ICC 2009»
15 years 8 months ago
Do Next Generation Networks Need Path Diversity?
—We have currently reached a phase where big shifts in the network traffic might impose to rethink the design of current architectures, and where new technologies, being pushed ...
Luca Muscariello, Diego Perino, Dario Rossi
ICC
2009
IEEE
103views Communications» more  ICC 2009»
15 years 8 months ago
On the Minimum k-Connectivity Repair in Wireless Sensor Networks
—Repairing connectivity and achieving a certain level of fault tolerance are two important research challenges in wireless sensor networks that have, in many papers in the litera...
Hisham M. Almasaeid, Ahmed E. Kamal
ICC
2007
IEEE
205views Communications» more  ICC 2007»
15 years 8 months ago
RLAR: Robust Link Availability Routing Protocol for Mobile Ad Hoc Networks
— Many previously proposed routing metrics and algorithms for ad hoc networks work well in static networks, however, when nodes are moving and wireless links may fail from time t...
Xueyuan Su, Sammy Chan, King Sun Chan