Non-Manipulable Aggregator Node Election Protocols for Wireless Sensor Networks
- 1 April 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 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.Keywords
This publication has 19 references indexed in Scilit:
- TinySeRSync2006
- An Energy-Efficient Voting-Based Clustering Algorithm for Sensor Networks2005
- SIA2003
- Distributed clustering for ad hoc networks2003
- An application-specific protocol architecture for wireless microsensor networksIEEE Transactions on Wireless Communications, 2002
- SPINS2001
- A design concept for reliable mobile radio networks with frequency hopping signalingProceedings of the IEEE, 1987
- The Byzantine Generals ProblemACM Transactions on Programming Languages and Systems, 1982
- The Architectural Organization of a Mobile Radio Network via a Distributed AlgorithmIEEE Transactions on Communications, 1981
- Secure communications over insecure channelsCommunications of the ACM, 1978