The Journal of the Korea institute of electronic communication sciences (한국전자통신학회논문지)

Korea Institute of Electronic Communication Science (한국전자통신학회)
권호 표지
DOI QR코드

DOI QR Code

Energy Efficient Routing Protocol in Wireless Sensor Networks with Hole

홀이 있는 WSN 환경에서 에너지 효율적인 라우팅 프로토콜

  • 김응범 (국방대학교 관리대학원) ;
  • 권태욱 (국방대학교 컴퓨터공학과)
  • Received : 2023.07.14
  • Accepted : 2023.10.17
  • Published : 2023.10.31
Download PDF
⟨ Previous Next ⟩

Abstract

Energy-efficient routing protocol is an important task in a wireless sensor network that is used for monitoring and control by wirelessly collecting information obtained from sensor nodes deployed in various environments. Various routing techniques have been studied for this, but it is also necessary to consider WSN environments with specific situations and conditions. In particular, due to topographical characteristics or specific obstacles, a hole where sensor nodes are not deployed may exist in most WSN environments, which may result in inefficient routing or routing failures. In this case, the geographical routing-based hall bypass routing method using GPS functions will form the most efficient path, but sensors with GPS functions have the disadvantage of being expensive and consuming energy. Therefore, we would like to find the boundary node of the hole in a WSN environment with holes through minimal sensor function and propose hole bypass routing through boundary line formation.

다양한 환경에 배치된 센서 노드(Sensor Node)로부터 획득한 정보들을 무선으로 수집하여 감시 및 제어 등의 용도로 활용되고 있는 무선 센서 네트워크에서 에너지 효율적인 라우팅 프로토콜은 중요한 과제이다. 이에 대한 다양한 라우팅 기법이 연구가 되었으나, 특정 상황과 조건이 있는 WSN 환경에 대한 고려 또한 필요하다. 특히, 지형적 특성이나 특정 장애물로 인해 센서 노드가 배치되어 있지 않은 장소(Hole)는 대다수의 WSN 환경에서 존재할 수 있고 이는 비효율적인 라우팅 또는 라우팅 실패가 있을 수 있다. 이 경우 GPS 기능을 활용한 지리적 라우팅 기반의 홀 우회 라우팅 방식이 가장 효율적인 경로를 형성하겠지만 GPS 기능을 가지고 있는 센서는 비용이 많이 들고 에너지 소모가 크다는 단점이 있다. 따라서 최소한의 센서 기능을 통해 홀이 있는 WSN 환경에서 홀의 경계 노드를 찾아 경계선 형성을 통한 홀 우회 라우팅을 제안하고자 한다.

Keywords

References

  1. Q. Fang, J. Gao, and L. Guibas, "Locating and bypassing routing holes in sensor networks," Proc. of the IEEE INFOCOM'04, Hong Kong, China, 2004, pp. 2458-2468. 
  2. D. Seong and J. Yoo, "Shortest Path Network-hole Detour Routing using Minimum Boundary Convex Polygons in Wireless Ad-hoc Sensor Networks," The Journal of Korean Institute of Information Scientists and Engineers, vol. 38, no. 5, 2011, pp. 346-354. 
  3. S. Kim, H. Park, J. Lee, S. Oh, and S. Kim, "A Robust Disjoint Multipath Scheme based on Geographic Routing in Irregular Wireless Sensor Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 37, no. 1, 2012, pp. 21-30.  https://doi.org/10.7840/KICS.2012.37B.1.21
  4. K. Jung, H. Yeom, H. Park, J. Lee, and S. Kim, "Flexible Disjoint Multipath Routing Protocol Using Local Decision in Wireless Sensor Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 38, no. 11, 2013, pp. 911-923.  https://doi.org/10.7840/kics.2013.38B.11.911
  5. Y. Ko, C. Park, I. Son, and M. Kim, "Direction-based Geographic Routing for Wireless Sensor Networks," Journal of the Information Science Society, vol. 33, no. 6, 2006, pp. 438-450. 
  6. B. Karp and H. T. Kung, "GPSR: Greedy perimeter stateless routing for wireless networks," in Proc. Annu. Int. Conf. Mob. Comput. and Netw., Boston, Massachusetts, USA, Aug. 2000, pp. 243-254. 
  7. F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger, "Geometric ad-hoc routing : of theory and pratice," In Proc. 22nd ACM Int. Symp. PODC, Boston, Massachusetts, USA, July 2003, pp. 63-72. 
  8. F. Kuhn, R. Wattenhofer, and A. Zollinger, "Asymptotically optimal geometric mobile ad-hoc routing," In Proc. Dial-M'02, Atlanta, Georgia, USA, Sept. 2002. 
  9. F. Kuhn, R. Wattenhofer, and A. Zollinger, "Worst-case optimal and average-case efficient geometric ad-hoc routing," Proc. of the 4th ACM International Sysmposium on Mobile Ad Hoc Networking and Computing (ACM MobiHoc'03), Annapolis, Maryland, USA, June 2003, pp. 267-278. 
  10. W. Li and W. Zhang, "Coverage hole and boundary nodes detection in wireless sensor networks," Journal of Network and Computer Applications, vol. 48, Feb. 2015, pp. 35-43.  https://doi.org/10.1016/j.jnca.2014.10.011
  11. A. M. Khedr, W. Osamy, and A. Salim, "Distributed coverage hole detection and recovery scheme for heterogeneous wireless sensor networks," Computer Communications, vol. 124, June 2018, pp. 61-75.  https://doi.org/10.1016/j.comcom.2018.04.002
  12. H. Ma, P. K. Sahoo, and Y. Chen, "Computational Geometry based distributed coverage hole detection protocol for the wireless sensor networks," Journal of Network and Computer Applications, vol. 34, issue 5, Sept. 2011, pp. 1743-1756.  https://doi.org/10.1016/j.jnca.2011.06.007
  13. M. Wu, "Adjacent Matrix-based Hole Coverage Discovery Technique for Senssor Networks," Journal of The Korea Society of Computer and Information, vol 24, no. 4, Apr. 2019, pp. 169-176.  https://doi.org/10.9708/JKSCI.2019.24.04.169
  14. A. Dabba and R. Beghdad, "BCP: a border coverage protocol for wireless sensor networks," In Proc. of IEEE Science and Information Conference SAI'2014, London, UK, Oct. 2014, pp. 632-640. 
  15. S. Funke, "Topological hole detection in wireless sensor networks and its applications," In Proc. of the Joint Workshop on Foundations of Mobile Computing, Sept. 2005, pp. 44-53. 
  16. I. M. Khan, M. Z. Kha, H. Mokhtar, and M. Merabti, "Enhancements of the self-detection scheme for boundary recognition in wireless sensor networks," Developments in E-systems Engineering(DeSE), IEEE(2011), Dubai, United Arab Emirates, Dec. 2011, pp. 448-453. 
  17. R. Beghdad and A. Lamraoui, "Boundary and holes recognition in wireless sensor networks," Journal Of Innovation Digital Ecosystem 3, vol. 3, issue 1, 2016, pp. 1-14.  https://doi.org/10.1016/j.jides.2016.04.001
  18. H. Cho and T. Kwon, "GPS Accuracy Revision Using RSSI and AoA in Wireless Sensor Network," J. of the Korea Institute of Electronic Communication Sciences, vol. 17, no. 5, Oct. 2022, pp. 889-896.