DOI QR코드

DOI QR Code

An Optimization Algorithm for Minimum Energy Broadcast Problem in Wireless Sensor Networks

무선 센서 네트워크에서 최소 전력 브로드캐스트 문제를 위한 최적화 알고리즘

  • 장길웅 (한국해양대학교 데이터정보학과 네트워크 연구실)
  • Received : 2012.02.02
  • Accepted : 2012.04.05
  • Published : 2012.04.30

Abstract

The minimum energy broadcast problem is for all deployed nodes to minimize a total transmission energy for performing a broadcast operation in wireless networks. In this paper, we propose a Tabu search algorithm to solve efficiently the minimum energy broadcast problem on the basis of meta-heuristic approach in wireless sensor networks. In order to make a search more efficient, we propose a novel neighborhood generating method and a repair function of the proposed algorithm. We compare the performance of the proposed algorithm with other existing algorithms through some experiments in terms of the total transmission energy of nodes and algorithm computation time. Experimental results show that the proposed algorithm is efficient for the minimum energy broadcast problem in wireless sensor networks.

무선 네트워크에서 최소 에너지 브로드캐스트 문제는 네트워크에 배치된 모든 노드가 브로드캐스팅과정에서 데이터 전송에 사용되는 에너지를 최소화하는 문제이다. 본 논문은 무선 센서 네트워크에서 최소 에너지 브로드캐스트 문제를 효과적으로 해결할 수 있는 메타휴리스틱 기법인 타부서치 알고리즘을 제안한다. 보다 효과적인 해 검색을 위해 제안된 알고리즘은 새로운 이웃해 생성방식과 복구함수를 적용한다. 제안된 알고리즘의 성능평가는 배치된 모든 노드로의 브로드캐스팅 시 전송 에너지와 알고리즘 실행시간 관점에서 기존의 알고리즘과 비교를 하였으며, 실험 결과에서 제안된 알고리즘이 최소 에너지 브로드캐스트 문제에 효과적으로 적용됨을 보여준다.

Keywords

References

  1. Akyildiz I F, Su W, Sankarasubramanian Y, Cayiraci E, "Wireless sensor networks: a survey," Computer Networks, vol. 38, pp. 393-422, 2002. https://doi.org/10.1016/S1389-1286(01)00302-4
  2. Akkaya K, Younis M, "A survey on routing protocols for wireless sensor networks," Ad hoc networks, vol. 3, pp. 325-349, 2005. https://doi.org/10.1016/j.adhoc.2003.09.010
  3. Wieselthier J E, Nguyen G D, Ephremides A, "On the construction of energy-efficient broadcast and multicast trees in wireless networks," In Proc. IEEE Infocom, pp. 585-594, 2000.
  4. Das A K, Marks R J, El-Sharkawi, Arabshahi M P, Gray A, "Minimum power broadcast trees for wireless networks: integer programming formulations," In Proc. IEEE Int. Symp. Circuits and Systems, pp. 245-248, 2003.
  5. Das A K, Marks R J, El-Sharkawi M, "Minimum power broadcast trees for wireless networks: optimizing using the viability lemmma," In Proc. IEEE Int. Symp. Circuits and Systems, 2002.
  6. Stojmenovic I, Seddigh M, Zunic J, "Internal nodes based broadcasting in wireless networks," In Proc. 34th Hawaii Int. Conf. System Sciences, 2001.
  7. Dell'Amico A, Trubian A, "Applying Tabu search to the jobshop scheduling problem," Journal of Annals of Operation Research, vol. 41, pp. 231-252, 1993. https://doi.org/10.1007/BF02023076
  8. Laguna M, Barnes J W, Glover F, "Tabu search methodology for a single machine scheduling problem," Journal of International Manufacturing, vol. 2, pp. 63-74, 1992.
  9. Papadimitriou I, Georgiadis L, "Minimum-energy broadcasting in wireless networks using a single broadcast tree," In Proc. 2nd Int. Workshop on Modeling and Optimization in Mobile, Ad Hoc and Wireless and Computing, 2001.
  10. Ye F, Luo H, Cheng, Lu S, Zhang L, "A two-tier data dissemination model for large-scale wireless sensor networks," In Proc. 8th ACM Annual Int. Conference on Mobile Computing and Networking, pp. 148-159, 2002.
  11. Karl H, Willig A, Protocols and architectures for wireless sensor networks, Wiley Press, 2005.
  12. Montemanni R, Gambardella L M, Das A K, "The minimum power broadcast problem in wireless networks: a simulated annealing approach," In Proc. Wireless Communications and Networking Conference, pp. 2057-2062, 2005.
  13. Wu X, Wang X, Liu R, "Solving minimum power broadcast problem in wireless ad hoc networks using genetic algorithm," In Proc. the Communication Networks and Services Research Conference, pp. 203-207, 2008.
  14. S. Kultuel-Konak, Norman A E, Coit D W, "Efficiently solving the redundancy allocation problem using Tabu search," IIE Transactions, vol. 35, pp. 515-526, 2003. https://doi.org/10.1080/07408170304422