Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
Convex Optimization
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Mobile object tracking in wireless sensor networks
Computer Communications
Decentralized, adaptive resource allocation for sensor networks
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Cross-Layer Collaborative In-Network Processing in Multihop Wireless Sensor Networks
IEEE Transactions on Mobile Computing
A survey on clustering algorithms for wireless sensor networks
Computer Communications
IEEE Transactions on Computers
Improving network lifetime using sensors with adjustable sensing ranges
International Journal of Sensor Networks
Wireless sensor network survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
A reactive role assignment for data routing in event-based wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Trail: a distance sensitive WSN service for distributed object tracking
EWSN'07 Proceedings of the 4th European conference on Wireless sensor networks
Sensor-mission assignment in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Energy-Efficient Task Mapping for Data-Driven Sensor Network Macroprogramming
IEEE Transactions on Computers
Reputation-based role assignment for role-based access control in wireless sensor networks
Computer Communications
Review: Task assignment policies in distributed server systems: A survey
Journal of Network and Computer Applications
Localization systems for wireless sensor networks
IEEE Wireless Communications
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
DCTC: dynamic convoy tree-based collaboration for target tracking in sensor networks
IEEE Transactions on Wireless Communications
A tutorial on decomposition methods for network utility maximization
IEEE Journal on Selected Areas in Communications
International Journal of Ad Hoc and Ubiquitous Computing
| Hi-index | 0.00 |
In this paper, we consider the problem of cluster task assignment to maximize total utilities of nodes for target coverage in heterogeneous Wireless Sensor Networks. We define this problem as assigning the tasks of Cluster Head (CH) and Cluster Members (CM) to nodes for each target and requiring communication connectivity between every CH with its members. The utility of each node for each target is defined as a function of its distance to the target and its remaining energy. We propose an upper bound based on Lagrangian Relaxation (LR) and a lower bound by Linear Programming (LP) relaxation with a combination of Randomized Rounding (RR) and a greedy-based heuristic. Furthermore, we propose a distributed heuristic algorithm based on matching and a general assignment problem. Dynamic movements of targets are taken into account by intra/inter-cluster task reassignments. Simulation results, compared with optimal values, reveal that the LR upper bound performs better than the bound reached by pure LP relaxation. The lower bound obtained by LP relaxation combined with the RR technique provides close results in comparison with the distributed heuristic algorithm. Furthermore, the results of the distributed heuristic algorithm remain between the upper and lower bounds and close to optimal values.