Efficient and robust query processing for mobile wireless sensor networks

Huilong Huang, John H Hartman, Terril N. Hurst

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

2 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 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 37% 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)
Title of host publicationGLOBECOM - IEEE Global Telecommunications Conference
DOIs
StatePublished - 2006
EventIEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference - San Francisco, CA, United States
Duration: Nov 27 2006Dec 1 2006

Other

OtherIEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference
CountryUnited States
CitySan Francisco, CA
Period11/27/0612/1/06

Fingerprint

Query processing
Wireless sensor networks
Topology

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Huang, H., Hartman, J. H., & Hurst, T. N. (2006). Efficient and robust query processing for mobile wireless sensor networks. In GLOBECOM - IEEE Global Telecommunications Conference [4151558] https://doi.org/10.1109/GLOCOM.2006.928

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

GLOBECOM - IEEE Global Telecommunications Conference. 2006. 4151558.

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

Huang, H, Hartman, JH & Hurst, TN 2006, Efficient and robust query processing for mobile wireless sensor networks. in GLOBECOM - IEEE Global Telecommunications Conference., 4151558, IEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference, San Francisco, CA, United States, 11/27/06. https://doi.org/10.1109/GLOCOM.2006.928
Huang H, Hartman JH, Hurst TN. Efficient and robust query processing for mobile wireless sensor networks. In GLOBECOM - IEEE Global Telecommunications Conference. 2006. 4151558 https://doi.org/10.1109/GLOCOM.2006.928
Huang, Huilong ; Hartman, John H ; Hurst, Terril N. / Efficient and robust query processing for mobile wireless sensor networks. GLOBECOM - IEEE Global Telecommunications Conference. 2006.
@inproceedings{53c8819e9c1142aca591f4e0f2c66f7a,
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 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 37{\%} 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.",
author = "Huilong Huang and Hartman, {John H} and Hurst, {Terril N.}",
year = "2006",
doi = "10.1109/GLOCOM.2006.928",
language = "English (US)",
isbn = "142440357X",
booktitle = "GLOBECOM - IEEE Global Telecommunications Conference",

}

TY - GEN

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

AU - Huang, Huilong

AU - Hartman, John H

AU - Hurst, Terril N.

PY - 2006

Y1 - 2006

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 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 37% 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 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 37% 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.

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

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

U2 - 10.1109/GLOCOM.2006.928

DO - 10.1109/GLOCOM.2006.928

M3 - Conference contribution

SN - 142440357X

SN - 9781424403578

BT - GLOBECOM - IEEE Global Telecommunications Conference

ER -