정보처리학회논문지:컴퓨터 및 통신 시스템 (KIPS Transactions on Computer and Communication Systems)

  • 제2권5호
  • /
  • Pages.191-198
  • /
  • 2013
  • /
  • 2287-5891(pISSN)
  • /
  • 2734-049X(eISSN)
한국정보처리학회 (Korea Information Processing Society)
권호 표지
DOI QR코드

DOI QR Code

센서 네트워크에서 실시간 침입탐지 라우팅을 위한 다목적 개미 군집 최적화 알고리즘

A Multi-objective Ant Colony Optimization Algorithm for Real Time Intrusion Detection Routing in Sensor Network

  • 강승호 (국가수리과학연구소 수리생물학연구팀)
  • 투고 : 2013.03.11
  • 심사 : 2013.04.08
  • 발행 : 2013.05.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

이동하는 베이스 노드를 가진 무선 센서 네트워크(WSN)에서 실시간 침입탐지를 위해서는 침입을 탐지한 센서로부터 베이스 노드까지의 정보 전달이 짧은 라우팅 경로를 통해 이루어져야 한다. 센서 네트워크에서 최소 Wiener수 신장트리(MWST)기반 라우팅 방법은 최소 신장트리(MST)기반 라우팅 방법에 비해 작은 홉 수를 보장하고 있어서 실시간 침입탐지에 적합함이 알려져 있다. 하지만 주어진 네트워크로부터 최소 Wiener 수 신장트리를 찾는 문제는 NP-hard이고 특정 노드에 대한 의존성이 커서 최소 신장 트리 기반 라우팅 방법에 비해 짧은 네트워크 수명을 갖는 단점이 있다. 본 논문은 실시간 침입탐지를 위해 최소 Wiener수 신장트리를 개선해 작은 홉 수와 긴 네트워크의 수명을 동시에 보장하는 라우팅 트리를 찾는 다목적 개미 군집 최적화 알고리즘을 제안한다. 그리고 제안한 라우팅 트리의 성능을 패킷의 평균 전송 홉 수 및 네트워크 전력 소모, 네트워크의 수명 측면에서 최소 신장트리기반 라우팅 방법 및 최소 Wiener수 신장트리기반 라우팅 방법과 비교한다.

It is required to transmit data through shorter path between sensor and base node for real time intrusion detection in wireless sensor networks (WSN) with a mobile base node. Because minimum Wiener index spanning tree (MWST) based routing approach guarantees lower average hop count than that of minimum spanning tree (MST) based routing method in WSN, it is known that MWST based routing is appropriate for real time intrusion detection. However, the minimum Wiener index spanning tree problem which aims to find a spanning tree which has the minimum Wiener index from a given weighted graph was proved to be a NP-hard. And owing to its high dependency on certain nodes, minimum Wiener index tree based routing method has a shorter network lifetime than that of minimum spanning tree based routing method. In this paper, we propose a multi-objective ant colony optimization algorithm to tackle these problems, so that it can be used to detect intrusion in real time in wireless sensor networks with a mobile base node. And we compare the results of our proposed method with MST based routing and MWST based routing in respect to average hop count, network energy consumption and network lifetime by simulation.

키워드

참고문헌

  1. I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "Wireless sensor networks: a survey," Computer Networks, Vol.38, pp.393-422, 2002. https://doi.org/10.1016/S1389-1286(01)00302-4
  2. I. F. Akyildiz and I. H. Kasimoglu, "Wireless sensor and actor networks: research challenges," AdHoc Networks, Vol.2, pp.351-367, 2004.
  3. I. F. Akyildiz, T. Melodia, and K. R. Chowdhury, "A survey on wireless multimedia sensor networks," Computer Networks, Vol.51, pp.921-960, 2007. https://doi.org/10.1016/j.comnet.2006.10.002
  4. D. Ganesan, A. Cerpa, W. Ye, Y. Yu, J. Zhao, and D. Estrin, "Networking Issues in Wireless Sensor Networks," Journal of Parallel and Distributed Computing, Vol.64, pp.799-814, July, 2004. https://doi.org/10.1016/j.jpdc.2004.03.016
  5. B. Bhuyan, H. K. D. Sarma, N. Sarma, A. Kar, and R. Mall, "Quality of Serivce (QoS) Provisions in Wireless Sensor Networks and Related Challenges," Wireless Sensor Networks, Vol.2, No.11, pp.861-868, 2010. https://doi.org/10.4236/wsn.2010.211104
  6. R. S. Dubey, R. Choubey, and A. Dubey, "Challenges for Quality of Service (QoS) in Wireless Sensor Networks," International Journal of Engineering Science and Technology, Vol.2, No.12, pp.7395-7400, 2010.
  7. L. Zhang, J. Yu, and Xiaoheng Deng, "Modelling the guaranteed QoS for wireless sensor networks: a network calculus approach," EURASIP Journal on Wireless Communication and Networking, Vol.82, pp.1-14, 2011.
  8. S. Upadhyayula, S. K. S. Gupta, "Spanning tree based algorithms for low latency and energy efficient data aggregation enhanced convergecast(DAC) in wireless sensor networks," Ad Hoc Networks, Vol.5, pp.626-648, 2007. https://doi.org/10.1016/j.adhoc.2006.04.004
  9. S. W. Han, I. S. Jeong, and S. H. Kang, "Low latency and energy efficient routing tree for wireless sensor networks with multiple mobile sinks," Journal of Network and Computer Applications, Vol.36, pp.156-166, 2013. https://doi.org/10.1016/j.jnca.2012.10.003
  10. S. H. Kang, K. Y. Kim, W. Y. Lee, M. A Jung, and S. R. Lee, "A Branch and Bound Algorithm to Find a Routing Tree Having Minimum Wiener Index in Sensor Networks with High Mobile Base Node," KICS Journal, Vol.35, No.5, pp.466-463, 2010.
  11. W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, "Energy-Efficient Communication Protocol for Wireless Microsensor Networks," in Proceedings of the 33rd Hawaii International Conference on System Sciences, pp.1-10, 2000.
  12. S. H. Kang, M. S. Choi, M. A Jung, and S. R. Lee, "A Pareto Ant Colony Optimization Algorithm for Application-Specific Routing in Wirelss Sensor & Actor Networks," KICS Journal, Vol.36, No.4, pp.346-353, 2011. https://doi.org/10.7840/KICS.2011.36B.4.346
  13. S. Hussain and O. Islam, "An Energy Efficient Spanning Tree Based Multi-hop Routing in Wireless Sensor Networks," in Proceedings of Wireless Communications and Networking Conference, pp.4383-4388, 2007.
  14. M. Tchuente, P. M. Yonta, J. M. Nlong II, and Y. Denneulin, "On the Minimum Average Distance Spanning Tree of the Hypercube," Acta Applicandae Mathematicae, Vol.102, pp.219-236, 2008. https://doi.org/10.1007/s10440-008-9215-5
  15. S. K. Chaharsooghi, A. H. M. Kermani, "An effective ant colony optimization algorithm (ACO) for multi-objective resource allocation problem (MORAP)," Applied Mathematics and Computation, Vol.200, No.1, pp.167-177, 2008. https://doi.org/10.1016/j.amc.2007.09.070
  16. M. Dorigo and L. M. Gambardella, "Ant colony system: a cooperative learning approach to the traveling salesman problem," IEEE Transactions on Evolutionary Computation, Vol.1, pp.53-66, 1997. https://doi.org/10.1109/4235.585892
  17. M. Dorigo, V. Maniezzo, and A. Colorni, "The ant system: optimization by a colony of cooperating agents," IEEE Transactions on Systems, Man, and Cybernetics - Part B, Vol.26, pp.29-41, 1996. https://doi.org/10.1109/3477.484436
  18. S. Okdem and D. Karaboga, "Routing in Wireless Sensor Networks Using an Ant Colony Optimization Router Chip," Sensors, Vol.9, pp.909-921, Feb., 2009. https://doi.org/10.3390/s90200909
  19. R. C. Prim, "Shortest connection networks and some generalization," Bell System Technical Journal, Vol.36, pp.1389-1401, 1957. https://doi.org/10.1002/j.1538-7305.1957.tb01515.x
  20. J. C. Kuo and W. Liao, "Hop Count Distribution of Multihop Paths in Wireless Networks With Arbitrary Node Density: Modeling and Its Applications," IEEE Transactions on Vehicular Technology, Vol.56, pp.2321-2331, 2007. https://doi.org/10.1109/TVT.2007.897663