149 search results - page 14 / 30 » On Finding Minimum Deadly Sets for Directed Networks |
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...
MOBIHOC
2005
ACM
14 years 7 months ago
2005
ACM
: In this paper, we analyze the node scheduling approach of topology control in the context of reliable packet delivery. In node scheduling, only a minimum set of nodes needed for ...
CISS
2008
IEEE
14 years 2 months ago
2008
IEEE
—We consider a three node network in which a pair of nodes with stochastic arrivals communicate with each other with the help of an intermediate relay. The bi-directional nature ...
IPCCC
2005
IEEE
14 years 1 months ago
2005
IEEE
The third generation of mobile networks aims to offer services diversified to users, while guaranteeing acceptable QoS. This results in the setting up of strategies of increasingl...
DMSN
2007
ACM
13 years 11 months ago
2007
ACM
This paper assumes a set of n mobile sensors that move in the Euclidean plane as a swarm1 . Our objectives are to explore a given geographic region by detecting and aggregating sp...