Sciweavers

867 search results - page 12 / 174
» Network Robustness and Graph Topology
Sort
View
CN
2010
121views more  CN 2010»
13 years 4 months ago
Probabilistic flooding for efficient information dissemination in random graph topologies
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
Konstantinos Oikonomou, Dimitrios Kogias, Ioannis ...
LCN
2007
IEEE
14 years 1 months ago
Detecting Black Hole Attacks in Tactical MANETs using Topology Graphs
Abstract— Black Hole Attacks are a serious threat to communication in tactical MANETs. In this work we present TOGBAD a new centralised approach, using topology graphs to identif...
Elmar Gerhards-Padilla, Nils Aschenbruck, Peter Ma...
ISCAS
2006
IEEE
118views Hardware» more  ISCAS 2006»
14 years 1 months ago
Complex network topologies and synchronization
Synchronization in networks with different topolo- is shown that for typical systems only three main scenarios gies is studied. We show that for a large class of oscillators there ...
Paolo Checco, Mario Biey, Gábor Vattay, Lju...
HPCC
2011
Springer
12 years 7 months ago
Heuristic-Based Techniques for Mapping Irregular Communication Graphs to Mesh Topologies
— Mapping of parallel applications on the network topology is becoming increasingly important on large supercomputers. Topology aware mapping can reduce the hops traveled by mess...
Abhinav Bhatele, Laxmikant V. Kalé
INFOCOM
2011
IEEE
12 years 11 months ago
Fine-grained location-free planarization in wireless sensor networks
—Extracting planar graph from network topologies is of great importance for efficient protocol design in wireless ad hoc and sensor networks. Previous techniques of planar topol...
Dezun Dong, Yunhao Liu, Xiangke Liao, Xiang-Yang L...