본문 바로가기
  • Home

Heuristic Backtrack Search Algorithm for Energy-efficient Clustering in Wireless Sensor Networks

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2008, 13(5), pp.219-228
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

손석원 1

1호서대학교

Accredited

ABSTRACT

As found in research on constraint satisfaction problems, the choice of variable ordering heuristics is crucial for effective solving of constraint optimization problems. For the special problems such as energy-efficient clustering in heterogeneous wireless sensor networks, in which cluster heads have an inclination to be near a base station, we propose a new approach based on the static preferences variable orderings and provide a pnode heuristic algorithm for a specific application. The pnode algorithm selects the next variable with the highest preference. In our problem, the preference becomes higher when the cluster heads are closer to the optimal region, which can be obtained a priori due to the characteristic of the problem. Since cluster heads are the most dominant sources of power consumption in the cluster-based sensor networks, we seek to minimize energy consumption by minimizing the maximum energy dissipation at each cluster heads as well as sensor nodes. Simulation results indicate that the proposed approach is more efficient than other methods for solving constraint optimization problems with static preferences.

Citation status

* References for papers published after 2022 are currently being built.