Energy Efficient IDS Node Distribution Algorithm using Minimum Spanning Tree in MANETs
1
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
In mobile ad hoc networks(MANETs), all the nodes in a network have limited resources. Therefore,communication topology which has long lifetime is suitable for nodes in MANETs. And MANETs areexposed to various threats because of a new node which can join the network at any time. There arevarious researches on security problems in MANETs and many researches have tried to make efficientschemes for reducing network power consumption. Power consumption is necessary to secure networks,however too much power consumption can be critical to network lifetime. This paper focuses on energyefficient monitoring node distribution for enhancing network lifetime in MANETs. Since MANETs cannotuse centralized infrastructure such as security systems of wired networks, we propose an efficient IDSnode distribution scheme using minimum spanning tree (MST) method to cover all the nodes in a networkand enhance the network lifetime. Simulation results show that the proposed algorithm has betterperformance in comparison with the existing algorithms.
Abstract
In mobile ad hoc networks(MANETs), all the nodes in a network have limited resources. Therefore,communication topology which has long lifetime is suitable for nodes in MANETs. And MANETs areexposed to various threats because of a new node which can join the network at any time. There arevarious researches on security problems in MANETs and many researches have tried to make efficientschemes for reducing network power consumption. Power consumption is necessary to secure networks,however too much power consumption can be critical to network lifetime. This paper focuses on energyefficient monitoring node distribution for enhancing network lifetime in MANETs. Since MANETs cannotuse centralized infrastructure such as security systems of wired networks, we propose an efficient IDSnode distribution scheme using minimum spanning tree (MST) method to cover all the nodes in a networkand enhance the network lifetime. Simulation results show that the proposed algorithm has betterperformance in comparison with the existing algorithms.
참고문헌 (11)
- P. Bergamo, "Distributed power control for energy efficient routing in ad hoc networks", Proc. ACM, 2004, pp.10(1), ~
- M. Cardei, "Topology control in ad hoc wireless networks using cooperative communication", IEEE Transaction on Mobile Computing, 5(6) (2006)
- S. Zarifzadeh, "Energy-efficient topology control in wireless ad hoc networks with selfish nodes", Computer Networks, 56(2), pp.902~914 (2012)
- R. E. N. Moraes, "Power optimization in ad hoc wireless network topology control with biconnectivity requirements", Computers & Operations Research, 40, pp.3188~3196 (2013)
- 이윤기, "SDN을 위한 샘플링 기반 네트워크 플러딩 공격 탐지", 방어 시스템, 2015, pp.4(4), 24~32[DOI]
- O. Kachirski, "Effective intrusion detection using multiple sensors in wireless ad hoc networks", Proc. of the International Conference on System Sciences, pp.57~64 (2003)
- H. Kim, "Lifetime-enhancing selection of monitoring nodes for intrusion detection in mobile ad hoc networks", International Journal of Electronics and Communications, 60, pp.248~250 (2006)
- J. H. Chang, "Maximum lifetime routing in wireless sensor networks", IEEE, 2004, pp.12(4), ~
- X. H. Lin, "A new power control approach for IEEE 802. 11 ad hoc networks", IEEE PIMRC (2003)
- R. G. Gallager, "A distributed algorithm for minimum-weight spanning trees", ACM Transactions on Programming Languages and Systems, 5(1), pp.66~77 (1983)
- Epidemic routing for partially connected ad hoc networks, "A. Vahdat", Department of Computer Science, Duke University, ~, pp.Technical Report CS-200006 (2000)