Proceedings of the Korean Information Science Society Conference (한국정보과학회:학술대회논문집)

  • 2007.10d
  • /
  • Pages.240-243
  • /
  • 2007
  • /
  • 1598-5164(pISSN)
Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

Energy-efficient Data Dissemination Scheme via Sink Location Service in Wireless Sensor Networks

무선 센서망에서 위치정보 선제공 기법을 이용한 에너지 효율적인 데이타 전달방안

  • Yu, Fu-Cai (Dept. of Computer Engineering, Chungnam National University) ;
  • Choi, Young-Hwan (Dept. of Computer Engineering, Chungnam National University) ;
  • Park, Soo-Chang (Dept. of Computer Engineering, Chungnam National University) ;
  • Lee, Eui-Sin (Dept. of Computer Engineering, Chungnam National University) ;
  • Tian, Ye (Dept. of Computer Engineering, Chungnam National University) ;
  • Park, Ho-Sung (Dept. of Computer Engineering, Chungnam National University) ;
  • Kim, Sang-Ha (Dept. of Computer Engineering, Chungnam National University)
  • 우부재 (충남대학교 컴퓨터공학과) ;
  • 최영환 (충남대학교 컴퓨터공학과) ;
  • 박수창 (충남대학교 컴퓨터공학과) ;
  • 이의신 (충남대학교 컴퓨터공학과) ;
  • 전야 (충남대학교 컴퓨터공학과) ;
  • 박호성 (충남대학교 컴퓨터공학과) ;
  • 김상하 (충남대학교 컴퓨터공학과)
  • Published : 2007.10.26
Download PDF
⟨ Previous Next ⟩

Abstract

Geographic routing has been considered as an efficient simple, and scalable routing protocol for wireless sensor networks since it exploits pure location information instead of global topology information to route data packets. Geographic routing requires the sources nodes to be aware of the location of the sinks. In this paper, we propose a scheme named Sink Location Service for geographic routing in wireless Sensor Networks, in which the source nodes can get and update the location of sinks with low overhead. In this scheme, a source and a sink send data announcement and query messages along two paths respectively by geographic routing. The node located on the crossing point of the two paths informs the source about the location of the sink. Then the source can send data packet to the sink by geographic routing. How to guarantee that these two paths have at least one crossing point in any irregular profile of sensor network is the challenge of this paper.

Keywords