DOI QR코드

DOI QR Code

CACH에 의한 상황인식 기반의 분산 클러스터링 기법

CACH Distributed Clustering Protocol Based on Context-aware

  • 문창민 (한국기술교육대학교컴퓨터공학과) ;
  • 이강환 (한국기술교육대학교컴퓨터공학과)
  • 발행 : 2009.06.30

초록

본 논문에서는 이동 애드혹 네트워크(MANET)에서의 상황인식 기반 계층적 클러스터링 기법인 CACH (Context-aware Adaptive Clustering Hierarchy)를 제안한다. CACH는 적응적 라우팅 기법과 비적응적 라우팅 기법을 융합한 하이브리드 라우팅 방식의 분산 클러스터링 기법을 기반으로 하고 있으며, 제안된 CACH는 동적인 토폴로지에서 노드의 이동성을 고려한 에너지 효율적인 라우팅 프로토콜의 성능을 제공하게 된다. 또한 제안된 토폴로지 변경에 대해 상황인식을 기반으로 하여 적응적으로 토폴로지의 계층구조를 결정하는 새로운 기법의 모델을 제시하였고, 이로부터 네트워크에서 전송 에너지를 고려한 노드의 밀도에 따라 계층적 깊이를 결정하는 최적 다중 흡수를 결정하는 결과를 보여주었다.

In this paper, we proposed a new method, the CACH(Context-aware Clustering Hierarchy) algorithm in Mobile Ad-hoc Network(MANET) systems. The proposed CACH algorithm based on hybrid and clustering protocol that provide the reliable monitoring and control of a variety of environments for remote place. To improve the routing protocol in MANET, energy efficient routing protocol would be required as well as considering the mobility would be needed. The proposed analysis could help in defining the optimum depth of hierarchy architecture CACH utilize. Also, the proposed CACH could be used localized condition to enable adaptation and robustness for dynamic network topology protocol and this provide that our hierarchy to be resilient. As a result, our simulation results would show that a new method for CACH could find energy efficient depth of hierarchy of a cluster.

키워드

참고문헌

  1. Zhihao Guo, Behnam Malakooti, 'Energy Aware Proactive MANET Routing with Prediction on Energy Consumption'
  2. Sirisha Medidi, Jiong Wang, 'A Fault Resilient Routing Protocol for Mobile Ad-hoc Networks', Third IEEE International Conference onWireless and Mobile Computing, Networking and Communications (WiMob 2007)
  3. Z.J. Hass, R. Pearlman, 'Zone routing protocol for ad-hoc networks', Internet Draft, draft-ietf-manet- zrp-02.txt, work in progress, 1999
  4. M. Joa-Ng, I.-T. Lu, 'A peer-to-peer zone-based two- level link state routing for mobile ad hoc networks', IEEE Journal on Selected Areas in Communications 17(8) 1415–.1425, (1999) https://doi.org/10.1109/49.779923
  5. D. Johnson, D. Maltz, J. Jetcheva, 'The dynamic source routing protocol for mobile ad hoc networks', Internet Draft, draft-ietf-manet -dsr-07.txt, work in progress, 2002
  6. S. Das, C. Perkins, E. Royer, 'Ad hoc on demand distance vector (AODV) routing', Internet Draft, draft-ietf-manetaodv-11.txt, work in progress, 2002
  7. S.-C. Woo, S. Singh, 'Scalable routing protocol for ad hoc networks', Wireless Networks 7(5) 513–.529, (2001) https://doi.org/10.1023/A:1016726711167
  8. S. Radhakrishnan, N.S.V Rao, G. Racherla, C.N. Sekharan, S.G. Batsell, 'DST–.–.A routing protocol for ad hoc networks using distributed spanning trees', in: IEEE Wireless Communications and Networking Conference, New Orleans, 1999
  9. N. Nikaein, H. Laboid, C. Bonnet, 'Distributed dynamic routing algorithm (ddr) for mobile ad hoc networks', in: Proceedings of the MobiHOC 2000: First Annual Workshop on Mobile Ad Hoc Networking and Computing, 2000
  10. W. Heinzelman; A. Chandrakasan ; H.Balakrishnan 'Energy-Efficient Communication Protocol for Wireless Microsensor Networks' in Proc. of the 33rd Annual Hawaii International Conference on System Sciences, January 4-7, Page(s) : 3005-3014, 2000
  11. Nidhi Bansa*, T. P. Sharma, Manoj Misra and R. C. Joshi ,'FTEP: A Fault Tolerant Election Protocol for Multi-level Clustering in Homogeneous Wireless Sensor Networks', ICON 2008
  12. M. Bhardwaj, T. Garnett, A. P. Chandrakasan, 'Upper Bounds on the Lifetime of Sensor Networks', In Proceedings of ICC 2001,vol. 3 pp. 785-790, June 2001