Results 1 
4 of
4
Gossipbased aggregation in large dynamic networks
 ACM TRANS. COMPUT. SYST
, 2005
"... As computer networks increase in size, become more heterogeneous and span greater geographic distances, applications must be designed to cope with the very large scale, poor reliability, and often, with the extreme dynamism of the underlying network. Aggregation is a key functional building block fo ..."
Abstract

Cited by 271 (43 self)
 Add to MetaCart
(Show Context)
As computer networks increase in size, become more heterogeneous and span greater geographic distances, applications must be designed to cope with the very large scale, poor reliability, and often, with the extreme dynamism of the underlying network. Aggregation is a key functional building block for such applications: it refers to a set of functions that provide components of a distributed system access to global information including network size, average load, average uptime, location and description of hotspots, and so on. Local access to global information is often very useful, if not indispensable for building applications that are robust and adaptive. For example, in an industrial control application, some aggregate value reaching a threshold may trigger the execution of certain actions; a distributed storage system will want to know the total available free space; loadbalancing protocols may benefit from knowing the target average load so as to minimize the load they transfer. We propose a gossipbased protocol for computing aggregate values over network components in a fully decentralized fashion. The class of aggregate functions we can compute is very broad and includes many useful special cases such as counting, averages, sums, products, and extremal values. The protocol is suitable for extremely large and highly dynamic systems due to its proactive structure—all nodes receive the aggregate value continuously, thus being able to track
Merging and MergeSort in a Single Hop Radio Network
 In 32nd conference on current trends in theory and practice of computer science (SOFSEM
, 2006
"... Abstract. We present two merging algorithms on a singlechannel singlehop radio network without collision detection. The simpler of these algorithms merges two sorted sequences of length n in time 4n with energetic cost for each station lg n. The energetic cost of broadcasting is constant. This yi ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
(Show Context)
Abstract. We present two merging algorithms on a singlechannel singlehop radio network without collision detection. The simpler of these algorithms merges two sorted sequences of length n in time 4n with energetic cost for each station lg n. The energetic cost of broadcasting is constant. This yields the mergesort for n elements in time 2n lg n, where the energetic cost for each station is
Estimating the number of nodes in wireless sensor networks
, 2006
"... Abstract We propose an efficient algorithm to estimate the number of live computer nodes in a network. This algorithm is fully distributed, and has a timecomplexity which is independent of the number of computer nodes. The algorithm is designed to take advantage of a medium access control (MAC) pr ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract We propose an efficient algorithm to estimate the number of live computer nodes in a network. This algorithm is fully distributed, and has a timecomplexity which is independent of the number of computer nodes. The algorithm is designed to take advantage of a medium access control (MAC) protocol which is prioritized; that is, if two or more messages on different nodes contend for the medium, then the node contending with the highest priority will win, and all nodes will know the priority of the winner. Estimating the Number of Nodes in Wireless Sensor Networks Abstract. We propose an efficient algorithm to estimate the number of live computer nodes in a network. This algorithm is fully distributed, and has a timecomplexity which is independent of the number of computer nodes. The algorithm is designed to take advantage of a medium access control (MAC) protocol which is prioritized; that is, if two or more messages on different nodes contend for the medium, then the node contending with the highest priority will win, and all nodes will know the priority of the winner.
European Commission under the Information Society Technologies Programme of the 5th Framework
, 2004
"... Project funded by the ..."
(Show Context)