Results 1 
6 of
6
TimeOptimal Information Exchange on Multiple Channels
"... This paper presents an efficient algorithm for detecting and disseminating information in a singlehop multichannel network: k arbitrary nodes have information they want to share with the entire network. Neither the nodes that have information nor the number k of these nodes are known initially. Th ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
(Show Context)
This paper presents an efficient algorithm for detecting and disseminating information in a singlehop multichannel network: k arbitrary nodes have information they want to share with the entire network. Neither the nodes that have information nor the number k of these nodes are known initially. This communication primitive lies between the two other fundamental primitives regarding information dissemination, broadcasting (onetoall communication) and gossiping (total information exchange). The time complexity of the information exchange algorithm we present in this paper is linear in the number of information items and thus asymptotically optimal with respect to time. The algorithm does not require collision detection and thanks to using several channels the lower bound of Ω(k + log n) established for singlechannel communication can be broken.
Monitoring Churn in Wireless Networks
"... Abstract. Wireless networks often experience a significant amount of churn, the arrival and departure of nodes. In this paper we propose a distributed algorithm for singlehop networks that detects churn and is resilient to a worstcase adversary. The nodes of the network are notified about changes ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract. Wireless networks often experience a significant amount of churn, the arrival and departure of nodes. In this paper we propose a distributed algorithm for singlehop networks that detects churn and is resilient to a worstcase adversary. The nodes of the network are notified about changes quickly, in asymptotically optimal time up to an additive logarithmic overhead. We establish a tradeoff between saving energy and minimizing the delay until notification for single and multichannel networks. 1
Countingsort and Routing in a Single Hop Radio Network
"... Abstract. We consider two problems. First, sorting of n integer keys from the [0, 2 m − 1] range, stored in p stations of a singlehop and single channel radio network. Second problem is routing of the packets between the stations of the network. We introduce countingsort algorithm which has 3mri ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. We consider two problems. First, sorting of n integer keys from the [0, 2 m − 1] range, stored in p stations of a singlehop and single channel radio network. Second problem is routing of the packets between the stations of the network. We introduce countingsort algorithm which has 3mri + si + di + 3 energetic cost and nm + n + p time cost, where station ai stores si keys (ri distinct keys) and receives di keys. On the basis of this sorting, we construct routing protocols with energetic costs (3⌈log 2 p⌉ + 2)ri + si + di + 5 and (3⌈log 2 p⌉ + 4)ri + si + di + 6, and time costs n⌈log 2 p⌉ + n + 3p and r⌈log 2 p⌉ + n + r + 3p, respectively, where r is sum of all ri. Our routing is attractive alternative for previous solutions, since it is efficient, deterministic and simple.
Duration: 48 months
, 2004
"... This report comprises the complete D4.3.1 deliverable as specified for workpackage ..."
Abstract
 Add to MetaCart
(Show Context)
This report comprises the complete D4.3.1 deliverable as specified for workpackage