Sciweavers

909 search results - page 57 / 182
» On the approximability of some network design problems
Sort
View
CJ
2010
128views more  CJ 2010»
15 years 1 months ago
A Self-Stabilizing O(k)-Time k-Clustering Algorithm
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...
Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Ve...
SIGMETRICS
2008
ACM
128views Hardware» more  SIGMETRICS 2008»
15 years 1 months ago
Loss-aware network coding for unicast wireless sessions: design, implementation, and performance evaluation
Local network coding is growing in prominence as a technique to facilitate greater capacity utilization in multi-hop wireless networks. A specific objective of such local network ...
Shravan K. Rayanchu, Sayandeep Sen, Jianming Wu, S...
INFOCOM
2009
IEEE
15 years 8 months ago
Computing the Capacity Region of a Wireless Network
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...
Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, R...
HICSS
2010
IEEE
487views Biometrics» more  HICSS 2010»
15 years 8 months ago
A Survey of Game Theory as Applied to Network Security
Network security is a complex and challenging problem. The area of network defense mechanism design is receiving immense attention from the research community for more than two de...
Sankardas Roy, Charles Ellis, Sajjan Shiva, Dipank...
INFOCOM
2006
IEEE
15 years 7 months ago
Relay Placement for Higher Order Connectivity in Wireless Sensor Networks
Abstract— Sensors typically use wireless transmitters to communicate with each other. However, sensors may be located in a way that they cannot even form a connected network (e.g...
Abhishek Kashyap, Samir Khuller, Mark A. Shayman