作者: Fatemeh Borran , Marcin Poturalski , Jean-Pierre Hubaux , Panagiotis Papadimitratos
DOI:
关键词: Node (networking) 、 Distributed computing 、 Wireless sensor network 、 Brooks–Iyengar algorithm 、 Computer network 、 Key distribution in wireless sensor networks 、 Computer science 、 Fraction (mathematics) 、 Base station 、 Mobile wireless sensor network 、 Data consistency
摘要: Ensuring data consistency in a distributed network the presence of malicious nodes is fundamental problem. The resource constraints and security issues make designing mechanisms for information aggregation large scale networks particularly challenging. We consider sensor with self-organized nature which requires no cetralized reliable base station. propose general approach to achieve through secure agreement. In this node collects from entire corrects its measured value based on fact that may be present. Several algorithms are presented solve agreement Our model gives good approximation actual produced by environment even if fraction corrupted. best algorithm communication-ec ient only sublinear communication between nodes.