Now showing items 1-5 of 5
Tracking fast moving targets in wireless sensor networks
(Institution of Electronics and Telecommunication Engineers, 2010-01)
We propose a dynamic distributed algorithm for tracking objects that move fast in a sensor network. In the earlier efforts in tracking moving targets, the current leader node at time t predicts the location only for time ...
Resource discovery in grid systems: A survey
(Inderscience Enterprises, 2010-07)
Resource Discovery (RD) is one of the key issues in successful Grid systems. Yet, new methodologies for RD are constantly researched owing to the dynamicity, heterogeneity and large-scale characteristics of Grids. Recently, ...
A distributed wakening based target tracking protocol for wireless sensor networks
We propose a two layer protocol for tracking fast targets in sensor networks. At the lower layer, the Distributed Spanning Tree Algorithm (DSTA)  partitions the network into clusters with controllable diameter and ...
A maximum degree self-stabilizing spanning tree algorithm
Spanning trees are fundamental topological structures in distributed environments which ease many applications that require frequent communication between nodes. In this paper, we examine and compare two spanning tree ...
Graph matching-based distributed clustering and backbone formation algorithms for sensor networks
(Oxford University Press, 2010-12)
Clustering is a widely used technique to manage the essential operations such as routing and data aggregation in wireless sensor networks (WSNs). We propose two new graph-theoretic distributed clustering algorithms for ...