Sciweavers

867 search results - page 136 / 174
» Network Robustness and Graph Topology
Sort
View
INFOCOM
2000
IEEE
13 years 11 months ago
Heuristic Algorithms for Joint Configuration of the Optical and Electrical Layer in Multi-Hop Wavelength Routing Networks
An efficient and general graph-theoretic model (the Wavelength-Graph (WG)) has been proposed which enables solving the static Routing and Wavelength Assignment (RWA) problems in Mu...
Tibor Cinkler, Dániel Marx, Claus Popp Lars...
CN
2008
106views more  CN 2008»
13 years 7 months ago
Efficient virtual-backbone routing in mobile ad hoc networks
Since the physical topology of Mobile Ad hoc Networks (MANETs) is generally unstable, an appealing approach is the construction of a stable and robust virtual topology or backbone...
Jamal N. Al-Karaki, Ahmed E. Kamal
INFOCOM
2012
IEEE
11 years 10 months ago
SybilDefender: Defend against sybil attacks in large social networks
—Distributed systems without trusted identities are particularly vulnerable to sybil attacks, where an adversary creates multiple bogus identities to compromise the running of th...
Wei Wei, Fengyuan Xu, Chiu Chiang Tan, Qun Li
ADHOC
2007
122views more  ADHOC 2007»
13 years 7 months ago
Minimum latency joint scheduling and routing in wireless sensor networks
Wireless sensor networks are expected to be used in a wide range of applications from environment monitoring to event detection. The key challenge is to provide energy efficient ...
Gang Lu, Bhaskar Krishnamachari
MOBIHOC
2002
ACM
14 years 7 months ago
Message-optimal connected dominating sets in mobile ad hoc networks
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder