149 search results - page 14 / 30 » On Finding Minimum Deadly Sets for Directed Networks |
113
click to vote
COCOA
2008
Springer
15 years 3 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...
127
Voted
MOBIHOC
2005
ACM
16 years 1 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 ...
102
Voted
CISS
2008
IEEE
15 years 8 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 ...
98
Voted
IPCCC
2005
IEEE
15 years 7 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...
119
Voted
DMSN
2007
ACM
15 years 5 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...