Efficient and robust query processing for mobile wireless sensor networks

Huilong Huang, John H Hartman, Terril N. Hurst

Research output: Contribution to journalArticle

14 Citations (Scopus)

Abstract

We present CNFS, an algorithm for efficient and robust query processing for mobile wireless sensor networks. CNFS is a walk-based algorithm that is biased to visit nodes close to the source first. This bias is accomplished by collecting topology information about the network as the search progresses. This information is also used to compute the shortest return path for the query result and to tolerate changes in the network topology caused by node mobility that could otherwise cause the query to fail. As a result, CNFS requires fewer messages to process a query than flooding-based algorithms, while tolerating node mobility better than random walk-based algorithms. Our experiments show that in medium-density networks (average node degree 8.3) CNFS requires about 38% fewer messages than the other algorithms studied, while experiencing significantly fewer query failures than random walk-based algorithms in both sparse and dense networks. CNFS's success rate is comparable to flooding-based algorithms in dense networks and slightly worse in sparse networks.

Original languageEnglish (US)
Pages (from-to)99-107
Number of pages9
JournalInternational Journal of Sensor Networks
Volume2
Issue number1-2
DOIs
StatePublished - 2007

Fingerprint

Query processing
Wireless sensor networks
Topology

Keywords

  • Biased walk
  • Mobile wireless sensor network
  • Query processing
  • Topology collection

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications
  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

Efficient and robust query processing for mobile wireless sensor networks. / Huang, Huilong; Hartman, John H; Hurst, Terril N.

In: International Journal of Sensor Networks, Vol. 2, No. 1-2, 2007, p. 99-107.

Research output: Contribution to journalArticle

@article{fb6754b5c0b14d08af060dc7e67e7729,
title = "Efficient and robust query processing for mobile wireless sensor networks",
abstract = "We present CNFS, an algorithm for efficient and robust query processing for mobile wireless sensor networks. CNFS is a walk-based algorithm that is biased to visit nodes close to the source first. This bias is accomplished by collecting topology information about the network as the search progresses. This information is also used to compute the shortest return path for the query result and to tolerate changes in the network topology caused by node mobility that could otherwise cause the query to fail. As a result, CNFS requires fewer messages to process a query than flooding-based algorithms, while tolerating node mobility better than random walk-based algorithms. Our experiments show that in medium-density networks (average node degree 8.3) CNFS requires about 38{\%} fewer messages than the other algorithms studied, while experiencing significantly fewer query failures than random walk-based algorithms in both sparse and dense networks. CNFS's success rate is comparable to flooding-based algorithms in dense networks and slightly worse in sparse networks.",
keywords = "Biased walk, Mobile wireless sensor network, Query processing, Topology collection",
author = "Huilong Huang and Hartman, {John H} and Hurst, {Terril N.}",
year = "2007",
doi = "10.1504/IJSNET.2007.012988",
language = "English (US)",
volume = "2",
pages = "99--107",
journal = "International Journal of Sensor Networks",
issn = "1748-1279",
publisher = "Inderscience Enterprises Ltd",
number = "1-2",

}

TY - JOUR

T1 - Efficient and robust query processing for mobile wireless sensor networks

AU - Huang, Huilong

AU - Hartman, John H

AU - Hurst, Terril N.

PY - 2007

Y1 - 2007

N2 - We present CNFS, an algorithm for efficient and robust query processing for mobile wireless sensor networks. CNFS is a walk-based algorithm that is biased to visit nodes close to the source first. This bias is accomplished by collecting topology information about the network as the search progresses. This information is also used to compute the shortest return path for the query result and to tolerate changes in the network topology caused by node mobility that could otherwise cause the query to fail. As a result, CNFS requires fewer messages to process a query than flooding-based algorithms, while tolerating node mobility better than random walk-based algorithms. Our experiments show that in medium-density networks (average node degree 8.3) CNFS requires about 38% fewer messages than the other algorithms studied, while experiencing significantly fewer query failures than random walk-based algorithms in both sparse and dense networks. CNFS's success rate is comparable to flooding-based algorithms in dense networks and slightly worse in sparse networks.

AB - We present CNFS, an algorithm for efficient and robust query processing for mobile wireless sensor networks. CNFS is a walk-based algorithm that is biased to visit nodes close to the source first. This bias is accomplished by collecting topology information about the network as the search progresses. This information is also used to compute the shortest return path for the query result and to tolerate changes in the network topology caused by node mobility that could otherwise cause the query to fail. As a result, CNFS requires fewer messages to process a query than flooding-based algorithms, while tolerating node mobility better than random walk-based algorithms. Our experiments show that in medium-density networks (average node degree 8.3) CNFS requires about 38% fewer messages than the other algorithms studied, while experiencing significantly fewer query failures than random walk-based algorithms in both sparse and dense networks. CNFS's success rate is comparable to flooding-based algorithms in dense networks and slightly worse in sparse networks.

KW - Biased walk

KW - Mobile wireless sensor network

KW - Query processing

KW - Topology collection

UR - http://www.scopus.com/inward/record.url?scp=77949944449&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77949944449&partnerID=8YFLogxK

U2 - 10.1504/IJSNET.2007.012988

DO - 10.1504/IJSNET.2007.012988

M3 - Article

AN - SCOPUS:77949944449

VL - 2

SP - 99

EP - 107

JO - International Journal of Sensor Networks

JF - International Journal of Sensor Networks

SN - 1748-1279

IS - 1-2

ER -