265 search results - page 2 / 53 » On the number of leaders needed to ensure network connectivi... |
STACS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. It is well-known that no classical algorithm can solve exactly (i.e., in bounded time without error) the leader election problem in anonymous networks. This paper propose...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Natural networks such as those between humans observed through their interactions or biological networks predicted based on various experimental measurements contain a wealth of i...
DSN
2006
IEEE
13 years 10 months ago
2006
IEEE
This paper considers the eventual leader election problem in asynchronous message-passing systems where an arbitrary number t of processes can crash (t < n, where n is the tota...
AISS
2010
13 years 2 months ago
2010
In this paper we proposed perfectly secure message transmission for reliable and secure communications in order to ensure that an adversary cannot obtain information (in the infor...
TPDS
2008
13 years 4 months ago
2008
One of the key research issues in wireless sensor networks (WSNs) is how to efficiently deploy sensors to cover an area. In this paper, we solve the k-coverage sensor deployment pr...