ScholarLens Back to search
2009•한국정보과학회 학술발표논문집Requires access

A Novel Publish/Subscribe Tree Construction Algorithm for Wireless Ad-hoc Networks

Hieu Nguyen, Sangyoon Oh

Open publisher page 0 citations

Abstract

In wireless ad-hoc networks, a publish/subscribe system comes up with an event routing if it is distributed. As a point in the discussion, event routing should be efficient enough to drive events from sources to interested users. The existing algorithm SHOPPARENT has exposed how to construct an optimal publish/subscribe tree for routing events. However, there are many cases for improving SHOPPARENT algorithm. In this paper, we propose a novel algorithm, CALSIM, which remedies the tree construction in the context that a similarity between subscriptions is the main routing metric.

About this research paper

What this paper is about

In wireless ad-hoc networks, a publish/subscribe system comes up with an event routing if it is distributed. As a point in the discussion, event routing should be efficient enough to drive events from sources to interested users. The existing algorithm SHOPPARENT has exposed how to construct an optimal publish/subscribe tree for routing events. However, there are many cases for improving SHOPPARENT algorithm. In this paper, we propose a novel algorithm, CALSIM, which remedies the tree construction in the context that a similarity between subscriptions is the main routing metric.

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

In wireless ad-hoc networks, a publish/subscribe system comes up with an event routing if it is distributed. As a point in the discussion, event routing should be efficient enough to drive events from sources to interested users. The existing algorithm SHOPPARENT has exposed how to construct an optimal publish/subscribe tree for routing events. However, there are many cases for improving SHOPPARENT algorithm. In this paper, we propose a novel algorithm, CALSIM, which remedies the tree construction in the context that a similarity between subscriptions is the main routing metric.

Key concepts: Computer science, Computer network, Wireless ad hoc network, Distributed computing, Destination-Sequenced Distance Vector routing, Dynamic Source Routing, Publication, Wireless Routing Protocol

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Novel Publish/Subscribe Tree Construction Algorithm for Wireless Ad-hoc Networks — Research Paper | ScholarLens