Data aggregation in partially connected networks

Satish Mahade Van Srinivasan, Azad H. Azadmanesh

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

With the diverse new capabilities that sensor and ad hoc networks can provide, applicability of data aggregation is growing. Data aggregation is useful in dealing with multi-value domain information, which often requires approximate agreement decisions among nodes. In contrast to fully connected networks, the research on data aggregation for partially connected networks is very limited. This is due to the complexity of formal proofs and the fact that a node may not have a global view of the entire network, which makes it difficult to attain the convergence properties. The complexity of the problem is compounded in the presence of message dropouts, faults, and orchestrated attacks. By exploiting the properties of Discrete Markov Chains, this study investigates the data aggregation problem for partially connected networks to obtain: the number of rounds of message exchanges needed to reach a network-convergence, the average convergence rate in a round of message exchange, and the number of rounds required to reach a stationary-convergence.

Original languageEnglish (US)
Pages (from-to)594-601
Number of pages8
JournalComputer Communications
Volume32
Issue number4
DOIs
StatePublished - Mar 4 2009

Fingerprint

Agglomeration
Ad hoc networks
Markov processes
Sensors

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Cite this

Srinivasan, Satish Mahade Van ; Azadmanesh, Azad H. / Data aggregation in partially connected networks. In: Computer Communications. 2009 ; Vol. 32, No. 4. pp. 594-601.
@article{ece865b8fb26472ea163c2b24ca03cce,
title = "Data aggregation in partially connected networks",
abstract = "With the diverse new capabilities that sensor and ad hoc networks can provide, applicability of data aggregation is growing. Data aggregation is useful in dealing with multi-value domain information, which often requires approximate agreement decisions among nodes. In contrast to fully connected networks, the research on data aggregation for partially connected networks is very limited. This is due to the complexity of formal proofs and the fact that a node may not have a global view of the entire network, which makes it difficult to attain the convergence properties. The complexity of the problem is compounded in the presence of message dropouts, faults, and orchestrated attacks. By exploiting the properties of Discrete Markov Chains, this study investigates the data aggregation problem for partially connected networks to obtain: the number of rounds of message exchanges needed to reach a network-convergence, the average convergence rate in a round of message exchange, and the number of rounds required to reach a stationary-convergence.",
author = "Srinivasan, {Satish Mahade Van} and Azadmanesh, {Azad H.}",
year = "2009",
month = "3",
day = "4",
doi = "10.1016/j.comcom.2008.11.021",
language = "English (US)",
volume = "32",
pages = "594--601",
journal = "Computer Communications",
issn = "0140-3664",
publisher = "Elsevier",
number = "4",

}

Data aggregation in partially connected networks. / Srinivasan, Satish Mahade Van; Azadmanesh, Azad H.

In: Computer Communications, Vol. 32, No. 4, 04.03.2009, p. 594-601.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Data aggregation in partially connected networks

AU - Srinivasan, Satish Mahade Van

AU - Azadmanesh, Azad H.

PY - 2009/3/4

Y1 - 2009/3/4

N2 - With the diverse new capabilities that sensor and ad hoc networks can provide, applicability of data aggregation is growing. Data aggregation is useful in dealing with multi-value domain information, which often requires approximate agreement decisions among nodes. In contrast to fully connected networks, the research on data aggregation for partially connected networks is very limited. This is due to the complexity of formal proofs and the fact that a node may not have a global view of the entire network, which makes it difficult to attain the convergence properties. The complexity of the problem is compounded in the presence of message dropouts, faults, and orchestrated attacks. By exploiting the properties of Discrete Markov Chains, this study investigates the data aggregation problem for partially connected networks to obtain: the number of rounds of message exchanges needed to reach a network-convergence, the average convergence rate in a round of message exchange, and the number of rounds required to reach a stationary-convergence.

AB - With the diverse new capabilities that sensor and ad hoc networks can provide, applicability of data aggregation is growing. Data aggregation is useful in dealing with multi-value domain information, which often requires approximate agreement decisions among nodes. In contrast to fully connected networks, the research on data aggregation for partially connected networks is very limited. This is due to the complexity of formal proofs and the fact that a node may not have a global view of the entire network, which makes it difficult to attain the convergence properties. The complexity of the problem is compounded in the presence of message dropouts, faults, and orchestrated attacks. By exploiting the properties of Discrete Markov Chains, this study investigates the data aggregation problem for partially connected networks to obtain: the number of rounds of message exchanges needed to reach a network-convergence, the average convergence rate in a round of message exchange, and the number of rounds required to reach a stationary-convergence.

UR - http://www.scopus.com/inward/record.url?scp=59649095043&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=59649095043&partnerID=8YFLogxK

U2 - 10.1016/j.comcom.2008.11.021

DO - 10.1016/j.comcom.2008.11.021

M3 - Article

VL - 32

SP - 594

EP - 601

JO - Computer Communications

JF - Computer Communications

SN - 0140-3664

IS - 4

ER -