In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
To better represent human interactions in social networks, the authors take a network-oriented simulation approach to analyze the evolution of acquaintance networks based on local...
Top-k queries are a popular type of query in Wireless Sensor Networks. Typical solutions rely on coordinated root-tonodes and nodes-to-root messages and on maintaining filters at...
Johannes Niedermayer, Mario A. Nascimento, Matthia...
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
—In this work, we study the effects of finite buffers on the throughput and delay of line networks with erasure links. We identify the calculation of performance parameters such...
Badri N. Vellambi, Nima Torabkhani, Faramarz Fekri