Please use this identifier to cite or link to this item:
Title: Non-manipulable aggregator node election protocols for wireless sensor networks
Authors: Westhoff, Dirk
Armknecht, Frederik
Sirivianos, Michael ItemCrisRefDisplayStrategy.rp.deleted.icon
Keywords: Wireless sensor networks;Computer network protocols;Computer science;Energy consumption;Ad hoc networks (Computer networks)
Issue Date: 2007
Publisher: IEEE Xplore
Source: 5th international symposium on modeling and optimization in mobile, ad hoc and wireless networks and workshops, WiOpt 2007, Pages 1-10
Abstract: Aggregator nodes commonly have the ability to read, corrupt or disrupt the flow of information produced by a wireless sensor network (WSN). Despite this fact, existing aggregator node election schemes do not address an adversary that strives to influence the election process towards candidate nodes that it controls. We discuss the requirements that need to be fulfilled by a non-manipulable aggregator node election protocol. We conclude that these requirements can be satisfied by a distributed random number generator function in which no node is able to determine the output of the function. We provide and compare three protocols that instantiate such function
ISBN: 978-1-4244-0960-0 (print)
978-1-4244-0961-7 (online)
DOI: 10.1109/WIOPT.2007.4480031
Rights: © 2007 IEEE
Type: Book Chapter
Appears in Collections:Κεφάλαια βιβλίων/Book chapters

Show full item record

Citations 50

checked on May 1, 2018

Page view(s)

Last Week
Last month
checked on Feb 22, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.