Distributed geographic service discovery for mobile sensor networks

Choonha Hwang, Elmurod Talipov, Hojung Cha

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

Many of the recent sensor network applications assume node mobility. The service provisioning protocol should therefore be designed to be stateless and scalable for continuously changing link states of typical mobile sensor nodes. In this paper, we propose DSDP, Distributed Service Discovery Protocol, for mobile sensor networks. DSDP organizes the network area into hierarchical regions to reduce service update cost. Regions at the lowest hierarchy cover a two-hop range area, and nodes freely move within the larger area without updating the service coordinators. Due to the low hierarchy architecture, the increased size of the minimal regions helps to reduce the runtime overhead. Node mobility is specifically considered in DSDP. Depending on the nodes' mobility, nodes in DSDP work as service coordinators for requested services, and the discovery protocol runs in a distributed manner to lessen the overhead. Both the simulation and experimental results show that the proposed mechanism achieves a high service query success rate and low service update overhead in mobile sensor networks.

Original languageEnglish
Pages (from-to)1069-1082
Number of pages14
JournalComputer Networks
Volume55
Issue number5
DOIs
Publication statusPublished - 2011 Apr 1

Fingerprint

Sensor networks
Wireless networks
Network protocols
Sensor nodes
Costs

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Cite this

Hwang, Choonha ; Talipov, Elmurod ; Cha, Hojung. / Distributed geographic service discovery for mobile sensor networks. In: Computer Networks. 2011 ; Vol. 55, No. 5. pp. 1069-1082.
@article{140df82d8d2f40e3b877f534901f7591,
title = "Distributed geographic service discovery for mobile sensor networks",
abstract = "Many of the recent sensor network applications assume node mobility. The service provisioning protocol should therefore be designed to be stateless and scalable for continuously changing link states of typical mobile sensor nodes. In this paper, we propose DSDP, Distributed Service Discovery Protocol, for mobile sensor networks. DSDP organizes the network area into hierarchical regions to reduce service update cost. Regions at the lowest hierarchy cover a two-hop range area, and nodes freely move within the larger area without updating the service coordinators. Due to the low hierarchy architecture, the increased size of the minimal regions helps to reduce the runtime overhead. Node mobility is specifically considered in DSDP. Depending on the nodes' mobility, nodes in DSDP work as service coordinators for requested services, and the discovery protocol runs in a distributed manner to lessen the overhead. Both the simulation and experimental results show that the proposed mechanism achieves a high service query success rate and low service update overhead in mobile sensor networks.",
author = "Choonha Hwang and Elmurod Talipov and Hojung Cha",
year = "2011",
month = "4",
day = "1",
doi = "10.1016/j.comnet.2010.09.015",
language = "English",
volume = "55",
pages = "1069--1082",
journal = "Computer Networks",
issn = "1389-1286",
publisher = "Elsevier",
number = "5",

}

Distributed geographic service discovery for mobile sensor networks. / Hwang, Choonha; Talipov, Elmurod; Cha, Hojung.

In: Computer Networks, Vol. 55, No. 5, 01.04.2011, p. 1069-1082.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Distributed geographic service discovery for mobile sensor networks

AU - Hwang, Choonha

AU - Talipov, Elmurod

AU - Cha, Hojung

PY - 2011/4/1

Y1 - 2011/4/1

N2 - Many of the recent sensor network applications assume node mobility. The service provisioning protocol should therefore be designed to be stateless and scalable for continuously changing link states of typical mobile sensor nodes. In this paper, we propose DSDP, Distributed Service Discovery Protocol, for mobile sensor networks. DSDP organizes the network area into hierarchical regions to reduce service update cost. Regions at the lowest hierarchy cover a two-hop range area, and nodes freely move within the larger area without updating the service coordinators. Due to the low hierarchy architecture, the increased size of the minimal regions helps to reduce the runtime overhead. Node mobility is specifically considered in DSDP. Depending on the nodes' mobility, nodes in DSDP work as service coordinators for requested services, and the discovery protocol runs in a distributed manner to lessen the overhead. Both the simulation and experimental results show that the proposed mechanism achieves a high service query success rate and low service update overhead in mobile sensor networks.

AB - Many of the recent sensor network applications assume node mobility. The service provisioning protocol should therefore be designed to be stateless and scalable for continuously changing link states of typical mobile sensor nodes. In this paper, we propose DSDP, Distributed Service Discovery Protocol, for mobile sensor networks. DSDP organizes the network area into hierarchical regions to reduce service update cost. Regions at the lowest hierarchy cover a two-hop range area, and nodes freely move within the larger area without updating the service coordinators. Due to the low hierarchy architecture, the increased size of the minimal regions helps to reduce the runtime overhead. Node mobility is specifically considered in DSDP. Depending on the nodes' mobility, nodes in DSDP work as service coordinators for requested services, and the discovery protocol runs in a distributed manner to lessen the overhead. Both the simulation and experimental results show that the proposed mechanism achieves a high service query success rate and low service update overhead in mobile sensor networks.

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

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

U2 - 10.1016/j.comnet.2010.09.015

DO - 10.1016/j.comnet.2010.09.015

M3 - Article

VL - 55

SP - 1069

EP - 1082

JO - Computer Networks

JF - Computer Networks

SN - 1389-1286

IS - 5

ER -