Information flow based routing algorithms for wireless sensor networks

Yeling Zhang, Mahalingam Ramkumar, Nasir Memon

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper introduces a measure of information as a new criteria for the performance analysis of routing algorithms in wireless sensor networks. We argue that since the objective of a sensor network is to estimate a two dimensional random field, a routing algorithm must maximize information flow about the underlying field over the life time of the sensor network. We develop two novel algorithms, MIR (Maximum Information Routing) and CMIR (Conditional Maximum Information Routing) designed to maximize information flow, and present a comparison of the algorithms to a previously proposed algorithm - MREP (Maximum Residual Energy Path) through simulations. We show that the proposed algorithms give significant improvement in terms of information flow, when compared to MREP.

Original languageEnglish (US)
Title of host publicationGLOBECOM'04 - IEEE Global Telecommunications Conference
Pages742-747
Number of pages6
Volume2
StatePublished - 2004
EventGLOBECOM'04 - IEEE Global Telecommunications Conference - Dallas, TX, United States
Duration: Nov 29 2004Dec 3 2004

Other

OtherGLOBECOM'04 - IEEE Global Telecommunications Conference
CountryUnited States
CityDallas, TX
Period11/29/0412/3/04

Keywords

  • Information flow based routing
  • Wireless sensor networks

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Information flow based routing algorithms for wireless sensor networks'. Together they form a unique fingerprint.

Cite this