Sciweavers

166 search results - page 21 / 34
» Monotonicity in Bargaining Networks
Sort
View
JSAC
2011
107views more  JSAC 2011»
14 years 6 months ago
Joint Network Capacity Region for Cognitive Networks Heterogeneous Environments and RF-Environment Awareness
In this paper, we characterize the joint network capacity region for a licensed broadcast (primary) and ad hoc cognitive (secondary) network in a heterogeneous environment, includ...
Yuchul Kim, Gustavo de Veciana
ACSAC
2003
IEEE
15 years 5 months ago
Efficient Minimum-Cost Network Hardening Via Exploit Dependency Graphs
In-depth analysis of network security vulnerability must consider attacker exploits not just in isolation, but also in combination. The general approach to this problem is to comp...
Steven Noel, Sushil Jajodia, Brian O'Berry, Michae...
91
Voted
IPCO
2010
148views Optimization» more  IPCO 2010»
15 years 1 months ago
Prize-Collecting Steiner Network Problems
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
JCO
2006
126views more  JCO 2006»
14 years 11 months ago
Minimum power assignment in wireless ad hoc networks with spanner property
Power assignment for wireless ad hoc networks is to assign a power for each wireless node such that the induced communication graph has some required properties. Recently research ...
Yu Wang 0003, Xiang-Yang Li
TC
2008
14 years 11 months ago
Iterative Local Solutions for Connected Dominating Set in Ad Hoc Wireless Networks
We propose a general framework of the iterative local solution (ILS) for computing a connected dominating set (CDS) in ad hoc wireless networks, which include wireless sensor netwo...
Jie Wu, Fei Dai, Shuhui Yang