A route maintaining algorithm using neighbor table for mobile sinks

Chun Su Park, Kwang Wook Lee, You Sun Kim, Sung Jea Ko

Research output: Contribution to journalArticlepeer-review

13 Citations (Scopus)


In the wireless microsensor networks, both source and sink nodes can be changed or mobile. The movement of source and sink may lead to the breakage of existing routes. In most routing protocols, query packets are broadcasted to correct a broken route between source and sink, which causes significant communication overhead in terms of both energy and delay. In order to support the sink mobility of conventional routing protocols, we propose a simple route maintaining algorithm which does not use the flooding method. Since the proposed algorithm does not require the information on the geometric location of sensor nodes, it can be easily adopted in most existing routing protocols including Ad Hoc On Demand Distance Vector (AODV) and Direct Diffusion (DD). Experimental results show that the proposed algorithm drastically improves the conventional routing protocols in terms of both energy and delay in case of mobile sinks.

Original languageEnglish
Pages (from-to)541-551
Number of pages11
JournalWireless Networks
Issue number4
Publication statusPublished - 2009 May


  • Mobile sinks
  • Neighbor table
  • Sensor networks

ASJC Scopus subject areas

  • Information Systems
  • Computer Networks and Communications
  • Electrical and Electronic Engineering


Dive into the research topics of 'A route maintaining algorithm using neighbor table for mobile sinks'. Together they form a unique fingerprint.

Cite this