
...we consider the problem of selecting the kth smallest element of a set distributed among the sites of a communication network when the size of messages is bounded; that is, each message is a packet which contains...

...a protocol, heed (hybrid energy  efficient distributed clustering), that periodically selects cluster heads according to a...o(1) iterations, incurs low message overhead, and achieves fairly uniform cluster head distribution across the network we prove that, with appropriate bounds on node density and intra...

...size may produce a backbone with large cost. then an efficient distributed method to construct a weighted backbone with low cost is proposed. we...costs of adjacent nodes is bounded) or the network maximum node degree is bounded. we also show that with a small modification the constructed...

...the delay and delay variationbounded multicast tree (dvbmt) problem is...this paper, we propose an efficient distributed dynamic multicast routing algorithm
to produce routing trees with delay and delay variation constraints...

...arises in a number of distributed network applications, where it is...

...factor of the optimum. the distributed construction of the frt embedding is based on the computation of least elements (le) lists, a distributed data struc ture that can...both timeoptimal and almost messageoptimal with high proba bility....

...paper, we focus on designing efficient query of top k data produced by sensor nodes in a wireless sensor network (wsn). although efficient top k query has been...we propose both de lay efficient and message efficient methods for conducting topk...

...approach to design e cient distributed approximation algorithms for various network...factor of the optimum. the distributed construction of the frt embedding is based on the computation of least elements (le) lists, a distributed data structure that might be...

...we present new distributed deterministic solutions to two communication...there are k rumors initially distributed arbitrarily among the nodes, and...

...this paper presents an efficient distributed multiple selection algorithm designed to select multiple keys simultaneously from dif ferent data sets which are distributed to many computers in a...measuring the performance of a distributed algorithm. the objective of this algorithm is to reduce the number of communication messages. the algorithm makes use of...