2009•Unpublished venueRequires access

Hierarchical service-oriented routing of queries in wireless sensor networks

Seifu Tatek Yazhy, Seung-Kyu Park

Open publisher page 0 citations

Abstract

Routing queries from a base station to a particular WSN node is preferable when it is done in a content oriented manner. Previously proposed query routing schemes are either not content based or lack to take advantage of a hierarchical organization of the network when they are content based. In this paper, we propose a hierarchical, service oriented routing scheme to achieve data centric routing of queries in wireless sensor networks. The routing scheme works by first forming clusters of the nodes based on various parameters that will eventually be used to form a query. We use an extended version of LEACH to organize the network into hierarchical clusters. The queries are then routed through the cluster heads to eventually reach the specific nodes that can provide the requested service. Our approach saves energy, extends network lifetime, does away with the need to duplicate a routing table on each node and improves the latency in routing queries.

About this research paper

What this paper is about

Routing queries from a base station to a particular WSN node is preferable when it is done in a content oriented manner. Previously proposed query routing schemes are either not content based or lack to take advantage of a hierarchical organization of the network when they are content based. In this paper, we propose a hierarchical, service oriented routing scheme to achieve data centric routing of queries in wireless sensor networks. The routing scheme works by first forming clusters of the nodes based on various parameters that will eventually be used to form a query. We use an extended version of LEACH to organize the network into hierarchical clusters. The queries are then routed through the cluster heads to eventually reach the specific nodes that can provide the requested service. Our approach saves energy, extends network lifetime, does away with the need to duplicate a routing table on each node and improves the latency in routing queries.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Routing queries from a base station to a particular WSN node is preferable when it is done in a content oriented manner. Previously proposed query routing schemes are either not content based or lack to take advantage of a hierarchical organization of the network when they are content based. In this paper, we propose a hierarchical, service oriented routing scheme to achieve data centric routing of queries in wireless sensor networks. The routing scheme works by first forming clusters of the nodes based on various parameters that will eventually be used to form a query. We use an extended version of LEACH to organize the network into hierarchical clusters. The queries are then routed through the cluster heads to eventually reach the specific nodes that can provide the requested service. Our approach saves energy, extends network lifetime, does away with the need to duplicate a routing table on each node and improves the latency in routing queries.

Key concepts: Computer science, Computer network, Hierarchical routing, Policy-based routing, Static routing, Routing table, Geographic routing, Dynamic Source Routing

Related papers

Back to paper searchBrowse research topicsOriginal source
Hierarchical service-oriented routing of queries in wireless sensor networks — Research Paper | ScholarLens