한국지능시스템학회논문지 (Journal of the Korean Institute of Intelligent Systems)

  • 제15권6호
  • /
  • Pages.736-741
  • /
  • 2005
  • /
  • 1976-9172(pISSN)
  • /
  • 2288-2324(eISSN)
한국지능시스템학회 (Korean Institute of Intelligent Systems)
권호 표지
DOI QR코드

DOI QR Code

Ad-hoc 센서 네트워크를 위한 최적 라우팅 경로 설정 알고리즘

Optimal Routing Path Selection Algorithm in Ad-hoc Wireless Sensor Network

  • 장인훈 (중앙대학교 전자전기공학부) ;
  • 심귀보 (중앙대학교 전자전기공학부)
  • 발행 : 2005.12.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

다단계 호핑(multi-hop) 무선 센서네트워크의 라우팅 경로를 설정하는데 있어서 데이터 전송의 요구가 있는 경우에만 경로를 만드는 Demand-Driven 방식의 대표적인 방법이 DSR(Dynamic Source Routing)인데 라우트 레코드를 패킷에 실어 보내기 때문에 이 또한 센서노드들의 수가 많아질수록 패킷이 무거워질 수밖에 없다. 본 논문에서는 DSR 프로토콜을 기반하면서도 라우팅 테이블을 적절히 이용하여 노드 수 증가에 대해 고정된 패킷크기를 가지도록 하였으며 라우팅 비용함수를 적용하여 각 센서노드들의 전원 소모량, 이동성(Mobility), 네트워크 내에서의 Traffic, 거리(Hop) 등을 복합적으로 고려한 안정적이고 신뢰성 있는 최적의 라우팅 설정알고리즘을 제안한다.

The highly popular algorithm to determine routing path for the multi-hopping wireless sensor network is DSR(Dynamic Source Routing), which is one of the Demand-Driven way to makes the route only when there is a request for sending data. However, because DSR attaches the route's record on the sending packet, the bigger number of sensor node is, the heavier packet in DSR becomes. In this paper, we try to propose the new optimal routing path selecting algorithm which does not make the size of packet bigger by using proper routing table even though the number of sensor node increases, and we try to show our algorithm is more stable and reliable because it is based on the cost function considering some network resources of each sensor node such as power consumption, mobility, traffic in network, distance(hop) between source and destination.

키워드

참고문헌

  1. Ian F. Akyildiz, W. Su, Y. Sankarasubrama -niam, and E. Cayirci, 'A Survey on Sensor Networks.' IEEE Communications Magazine, pp.102-114, Aug. 2002
  2. S. Madden, M. J. Franklin, and J. M. Hellerstein, 'The Design of an Acquisitional Query Processor for Sensor Networks,' Proc. ACM SIGMOD, ACM Press, pp.491-502, 2003
  3. S. Madden, M. J. Franklin, and J. M. Hellerstein, and W. Hong., 'TAG: A Tiny AGgregationService for AD-Hoc Sensor Networks,' Proc. Symp. OSDI, 2002
  4. Johannes Gehrke, Samuel Madden, 'Query Processing in Sensor Networks,' IEEE CS and IEEE ComSoc., pp.46-55, January-March 2004
  5. Murat Demirbas, Hakan Ferhatosmanoglu, 'Peerto- Peer Spatial Queries in Sensor Networks,' 3rd International Conference on Peer-to-Peer Computing (P2P 2003), pp.32-39, 1-3 Sep. 2003
  6. Y. Zou and K. Chakrabarty, 'Coverage -Oriented Sensor Deployment', Distributed Sensor Networks, R. R. Brooks and S. S. Iyengar (eds.), CRC Press, pp453-481, 2005
  7. S. S. Iyengar, A. Tandon, Q. Wu, Eungchun Cho, N. S. V. Rao, V. K. Vaishnavi, 'Deployment of Sensors : An Overview,' R. R. Brooks and S. S. Iyengar (eds.), CRC Press, pp483-504, 2005
  8. C. E. Perkins and P. Bhagwat, 'Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers,' comp. Commun. Rev., pp.234-244, Oct 1994
  9. C. E. Perkins and E. M. Royer. 'Ad hoc On- Demand Distance Vector Routing.' Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, New Orleans, LA, pp. 90-100, Feb. 1999
  10. David B. Johnson. Routing in Ad Hoc Networks of Mobile Hosts. Proceedings of the Workshop on Mobile Computing Systems and Applications, pp. 158-163, IEEE Computer Society, Santa Cruz, CA, Dec. 1994
  11. David B. Johnson, David A. Maltz, 'Dynamic Source Routing in Ad Hoc Wireless Networks,' Mobile Computing, edited by Tomasz Imielinski and Hank Korth, Kluwer Academic Publishers, 1996
  12. Xu Li; Zheng Baoyu, Yang Zhen, 'Power and mobility-aware adaptive dynamic source routing in MANET,' TENCON 2004. 2004 IEEE Region 10 Conference Volume B, 21-24 Nov. 2004 pp. 652 - 655 Vol. 2