Paper Info
Title
An incremental power greedy heuristic for strong minimum energy topology in wireless sensor networks
Abstract
Given a set of sensors in the plane, the strong minimum energy topology (SMET) problem is to assign transmit power to each sensor such that the resulting topology containing only bidirectional links is strongly connected. This problemis known to be NP-hard. As this problem is verymuch significant from application point of view, several heuristic algorithms have been proposed. In this paper, we propose a new incremental power greedy heuristic for SMET problem, called Kruskal-incremental power greedy heuristic. We compare Kruskal-incremental power greedy heuristic with Prim-incremental power greedy heuristic, one of the most popular heuristics available in the literature, through extensive simulation. The simulation results suggest that Kruskal-incremental power greedy heuristic outperforms on an average the Prim-incremental power greedy heuristic.
Year
DOI
Venue
2011
10.1007/978-3-642-19056-8_13
ICDCIT
Keywords
Field
DocType
kruskal-incremental power,new incremental power,wireless sensor network,resulting topology,smet problem,simulation result,extensive simulation,greedy heuristic,heuristic algorithm,strong minimum energy topology,prim-incremental power,minimum spanning tree,sensor network,sensor networks
Topology,Mathematical optimization,Heuristic,Incremental heuristic search,Topology control,Computer science,Greedy algorithm,Greedy randomized adaptive search procedure,Null-move heuristic,Consistent heuristic,Minimum spanning tree
Conference
Volume
ISSN
Citations 
6536
0302-9743
7
PageRank 
References 
Authors
0.54
7
2
Name
Order
Citations
PageRank
B. S. Panda19921.18
D. Pushparaj Shetty2163.75