Data Aggregation in Static Adhoc Networks
Satish Srinivasan, Azad Azadmanesh · 2008
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.