Data aggregation in static adhoc networks

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

2 Scopus citations

Abstract

This research is concerned with the Data Aggregation (DA) algorithms in wireless static networks, where host mobility is low or not provided and the number of nodes is fixed. The DA problem is investigated in the presence of omission faults, which can be a common type of failure in wireless communication. It is shown that, in the worst case, the number of rounds of message-exchange needed to reduce the diameter of values held by the hosts in the network is half the maximum network diameter. The research also obtains the upper bound on the number of rounds of message-exchange to reach the stationary-convergence, i.e. the difference between the agreed upon values among the hosts is within a predefined tolerance.

Original languageEnglish (US)
Title of host publicationIEEE Region 10 Colloquium and 3rd International Conference on Industrial and Information Systems, ICIIS 2008
DOIs
StatePublished - 2008
EventIEEE Region 10 Colloquium and 3rd International Conference on Industrial and Information Systems, ICIIS 2008 - Kharagpur, India
Duration: Dec 8 2008Dec 10 2008

Publication series

NameIEEE Region 10 Colloquium and 3rd International Conference on Industrial and Information Systems, ICIIS 2008

Other

OtherIEEE Region 10 Colloquium and 3rd International Conference on Industrial and Information Systems, ICIIS 2008
Country/TerritoryIndia
CityKharagpur
Period12/8/0812/10/08

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Control and Systems Engineering
  • Industrial and Manufacturing Engineering

Fingerprint

Dive into the research topics of 'Data aggregation in static adhoc networks'. Together they form a unique fingerprint.

Cite this