Sciweavers

1447 search results - page 233 / 290
» Graphs and Path Equilibria
Sort
View
IJBIDM
2010
80views more  IJBIDM 2010»
15 years 2 months ago
Practical algorithms for subgroup detection in covert networks
: In this paper, we present algorithms for subgroup detection and demonstrated them with a real-time case study of USS Cole bombing terrorist network. The algorithms are demonstrat...
Nasrullah Memon, Uffe Kock Wiil, Abdul Rasool Qure...
INFOCOM
2010
IEEE
15 years 2 months ago
Random Walks on Digraphs: A Theoretical Framework for Estimating Transmission Costs in Wireless Routing
—In this paper we develop a unified theoretical framework for estimating various transmission costs of packet forwarding in wireless networks. Our framework can be applied to th...
Yanhua Li, Zhi-Li Zhang
INFOCOM
2010
IEEE
15 years 2 months ago
VBS: Maximum Lifetime Sleep Scheduling for Wireless Sensor Networks Using Virtual Backbones
—Wireless sensor network (WSN) applications require redundant sensors to guarantee fault tolerance. However, the same degree of redundancy is not necessary for multi-hop communic...
Yaxiong Zhao, Jie Wu, Feng Li, Sanglu Lu
WINET
2010
128views more  WINET 2010»
15 years 2 months ago
Distributed algorithms for lifetime maximization in sensor networks via Min-Max spanning subgraphs
We consider the problem of static transmission-power assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a data-gathering scenario...
Harri Haanpää, André Schumacher, ...
JCSS
2011
95views more  JCSS 2011»
14 years 11 months ago
Hardness results for approximating the bandwidth
The bandwidth of an n-vertex graph G is the minimum value b such that the vertices of G can be mapped to distinct integer points on a line without any edge being stretched to a di...
Chandan K. Dubey, Uriel Feige, Walter Unger