A Mobile Agent Based Secure Aggregation in Sensor Network
Autor(a) principal: | |
---|---|
Data de Publicação: | 2010 |
Outros Autores: | |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | INFOCOMP: Jornal de Ciência da Computação |
Texto Completo: | https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/292 |
Resumo: | Compared with traditional wired and wireless networks, low-power wireless sensor networks (WSN) can be rapidly deployed in a large geographical area in a self-configured manner. In such types of networks data aggregation is a key issue. Hop-by-hop data aggregation in this regard is a very important technique for reducing the communication overhead and energy expenditure of sensor nodes during the process of data collection in a sensor network. However, because individual sensor readings are lost in the per-hop aggregation process, compromised nodes in the network may forge false values as the aggregation results of other nodes, resulting the base station into accepting wrong aggregation results. Here a fundamental challenge is how the base station can obtain a good approximation of the aggregated data when a group of sensor nodes are compromised. In this paper, we have designed and implemented a prototype for secure data aggregation using mobile agent (MA) technology. The key advantage of using MA is their capability to move in heterogeneous networks without consuming many resources. The designed scheme uses a novel probabilistic grouping technique to dynamically partition the nodes in a tree topology into multiple logical levels of similar sizes. A commitment-based hop-by-hop aggregation is performed by MA in each group to generate a group aggregate. Extensive analysis and simulations show that designed scheme can achieve the level of efficiency close to an ordinary hop-by-hop aggregation protocol while providing high assuranceon the trustworthiness of the aggregation result. The prototype implementation on top of TinyOS shows that designed scheme is practical on current sensor nodes such as Mica2 motes |
id |
UFLA-5_b65e5ed76e13a52fc25a8552b4ddd531 |
---|---|
oai_identifier_str |
oai:infocomp.dcc.ufla.br:article/292 |
network_acronym_str |
UFLA-5 |
network_name_str |
INFOCOMP: Jornal de Ciência da Computação |
repository_id_str |
|
spelling |
A Mobile Agent Based Secure Aggregation in Sensor NetworkAggregationSecurityMobile AgentSensor NodesCluster head .Compared with traditional wired and wireless networks, low-power wireless sensor networks (WSN) can be rapidly deployed in a large geographical area in a self-configured manner. In such types of networks data aggregation is a key issue. Hop-by-hop data aggregation in this regard is a very important technique for reducing the communication overhead and energy expenditure of sensor nodes during the process of data collection in a sensor network. However, because individual sensor readings are lost in the per-hop aggregation process, compromised nodes in the network may forge false values as the aggregation results of other nodes, resulting the base station into accepting wrong aggregation results. Here a fundamental challenge is how the base station can obtain a good approximation of the aggregated data when a group of sensor nodes are compromised. In this paper, we have designed and implemented a prototype for secure data aggregation using mobile agent (MA) technology. The key advantage of using MA is their capability to move in heterogeneous networks without consuming many resources. The designed scheme uses a novel probabilistic grouping technique to dynamically partition the nodes in a tree topology into multiple logical levels of similar sizes. A commitment-based hop-by-hop aggregation is performed by MA in each group to generate a group aggregate. Extensive analysis and simulations show that designed scheme can achieve the level of efficiency close to an ordinary hop-by-hop aggregation protocol while providing high assuranceon the trustworthiness of the aggregation result. The prototype implementation on top of TinyOS shows that designed scheme is practical on current sensor nodes such as Mica2 motesEditora da UFLA2010-03-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfhttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/292INFOCOMP Journal of Computer Science; Vol. 9 No. 1 (2010): March, 2010; 70-791982-33631807-4545reponame:INFOCOMP: Jornal de Ciência da Computaçãoinstname:Universidade Federal de Lavras (UFLA)instacron:UFLAenghttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/292/277Copyright (c) 2016 INFOCOMP Journal of Computer Scienceinfo:eu-repo/semantics/openAccessKumar, NeerajPatel, R. B.2014-12-09T13:05:17Zoai:infocomp.dcc.ufla.br:article/292Revistahttps://infocomp.dcc.ufla.br/index.php/infocompPUBhttps://infocomp.dcc.ufla.br/index.php/infocomp/oaiinfocomp@dcc.ufla.br||apfreire@dcc.ufla.br1982-33631807-4545opendoar:2024-05-21T19:54:30.158830INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA)true |
dc.title.none.fl_str_mv |
A Mobile Agent Based Secure Aggregation in Sensor Network |
title |
A Mobile Agent Based Secure Aggregation in Sensor Network |
spellingShingle |
A Mobile Agent Based Secure Aggregation in Sensor Network Kumar, Neeraj Aggregation Security Mobile Agent Sensor Nodes Cluster head . |
title_short |
A Mobile Agent Based Secure Aggregation in Sensor Network |
title_full |
A Mobile Agent Based Secure Aggregation in Sensor Network |
title_fullStr |
A Mobile Agent Based Secure Aggregation in Sensor Network |
title_full_unstemmed |
A Mobile Agent Based Secure Aggregation in Sensor Network |
title_sort |
A Mobile Agent Based Secure Aggregation in Sensor Network |
author |
Kumar, Neeraj |
author_facet |
Kumar, Neeraj Patel, R. B. |
author_role |
author |
author2 |
Patel, R. B. |
author2_role |
author |
dc.contributor.author.fl_str_mv |
Kumar, Neeraj Patel, R. B. |
dc.subject.por.fl_str_mv |
Aggregation Security Mobile Agent Sensor Nodes Cluster head . |
topic |
Aggregation Security Mobile Agent Sensor Nodes Cluster head . |
description |
Compared with traditional wired and wireless networks, low-power wireless sensor networks (WSN) can be rapidly deployed in a large geographical area in a self-configured manner. In such types of networks data aggregation is a key issue. Hop-by-hop data aggregation in this regard is a very important technique for reducing the communication overhead and energy expenditure of sensor nodes during the process of data collection in a sensor network. However, because individual sensor readings are lost in the per-hop aggregation process, compromised nodes in the network may forge false values as the aggregation results of other nodes, resulting the base station into accepting wrong aggregation results. Here a fundamental challenge is how the base station can obtain a good approximation of the aggregated data when a group of sensor nodes are compromised. In this paper, we have designed and implemented a prototype for secure data aggregation using mobile agent (MA) technology. The key advantage of using MA is their capability to move in heterogeneous networks without consuming many resources. The designed scheme uses a novel probabilistic grouping technique to dynamically partition the nodes in a tree topology into multiple logical levels of similar sizes. A commitment-based hop-by-hop aggregation is performed by MA in each group to generate a group aggregate. Extensive analysis and simulations show that designed scheme can achieve the level of efficiency close to an ordinary hop-by-hop aggregation protocol while providing high assuranceon the trustworthiness of the aggregation result. The prototype implementation on top of TinyOS shows that designed scheme is practical on current sensor nodes such as Mica2 motes |
publishDate |
2010 |
dc.date.none.fl_str_mv |
2010-03-01 |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/292 |
url |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/292 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/292/277 |
dc.rights.driver.fl_str_mv |
Copyright (c) 2016 INFOCOMP Journal of Computer Science info:eu-repo/semantics/openAccess |
rights_invalid_str_mv |
Copyright (c) 2016 INFOCOMP Journal of Computer Science |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Editora da UFLA |
publisher.none.fl_str_mv |
Editora da UFLA |
dc.source.none.fl_str_mv |
INFOCOMP Journal of Computer Science; Vol. 9 No. 1 (2010): March, 2010; 70-79 1982-3363 1807-4545 reponame:INFOCOMP: Jornal de Ciência da Computação instname:Universidade Federal de Lavras (UFLA) instacron:UFLA |
instname_str |
Universidade Federal de Lavras (UFLA) |
instacron_str |
UFLA |
institution |
UFLA |
reponame_str |
INFOCOMP: Jornal de Ciência da Computação |
collection |
INFOCOMP: Jornal de Ciência da Computação |
repository.name.fl_str_mv |
INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA) |
repository.mail.fl_str_mv |
infocomp@dcc.ufla.br||apfreire@dcc.ufla.br |
_version_ |
1799874740932837376 |