Distributed aggregation service for mobile wireless ad hoc sensor networks
by Shun-Chih Hsu, Hsung-Pin Chang
International Journal of Mobile Communications (IJMC), Vol. 5, No. 6, 2007

Abstract: This paper presents Cluster On-Demand Distance Vector Routing (CODV) algorithm for distributed aggregation service in mobile ad hoc sensor networks to achieve important networking requirements, including network scalability, load balancing, loss tolerance, and prolonged lifetime. CODV allows users to express simple queries and have them executed at the cluster heads within the networks of mobile wireless sensors. The distributed aggregation collected and processed by a cluster head transmits to the original observers who wish to request the integrated aggregation service. We also include a performance study demonstrating the advantages of our approach over traditional aggregation methods in ad hoc sensor networks.

Online publication date: Sun, 24-Jun-2007

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mobile Communications (IJMC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com