We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
A non-redundant fault-tolerant broadcasting algorithm in a faulty k-ary n-cube is designed. The algorithm can adapt up to 2n,2 node failures. Compared to the optimal algorithm in a...
Most of currently available content-based publish-subscribe systems that were designed to operate in large scale, wired scenarios, build their routing infrastructure as a set of b...
We propose a two layer protocol for tracking fast targets in sensor networks. At the lower layer, the Distributed Spanning Tree Algorithm (DSTA) [12] partitions the network into c...
Aysegul Alaybeyoglu, Orhan Dagdeviren, Aylin Kanta...
Link reversal algorithms provide a simple mechanism for routing in mobile ad hoc networks. These algorithms maintain routes to any particular destination in the network, even when...