Skip to main navigation Skip to search Skip to main content

Grid-based autonomous geographic routing in wireless sensor networks

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper, a grid-base autonomous geographic routing is proposed to decrease end-to-end delay and improve network capability for wireless sensor networks. After numbering grids in sequence, every grid has a unique ID. In this case, any node can utilize local decision to figure out which neighboring grid is closest to the center nodes. Since it is not needed to establish a routing in advance, this algorithm is very suitable for dynamic networks, real-time traffics and burst communications. By Matlab and Ns-2 simulation, the novel routing algorithm exhibits excellent performance in packet delivery fraction, end-to-end delay, protocol overhead, and path length.

Original languageEnglish
Title of host publicationCSAE 2012 - Proceedings, 2012 IEEE International Conference on Computer Science and Automation Engineering
Pages238-242
Number of pages5
DOIs
StatePublished - 2012
Event2012 IEEE International Conference on Computer Science and Automation Engineering, CSAE 2012 - Zhangjiajie, China
Duration: 25 May 201227 May 2012

Publication series

NameCSAE 2012 - Proceedings, 2012 IEEE International Conference on Computer Science and Automation Engineering
Volume2

Conference

Conference2012 IEEE International Conference on Computer Science and Automation Engineering, CSAE 2012
Country/TerritoryChina
CityZhangjiajie
Period25/05/1227/05/12

Keywords

  • geographic routing
  • grid networks
  • wireless sensor networks

Fingerprint

Dive into the research topics of 'Grid-based autonomous geographic routing in wireless sensor networks'. Together they form a unique fingerprint.

Cite this