| Home | Organizers | Proceedings Editors | Proceedings Contributors | Search | | ||
|
|
|||
|
||||
|
|
||||
| Title: | SECURE CLUSTER HEAD ELECTION ALGORITHM FOR WIRELESS SENSOR NETWORKS | |
| DOI No: | 10.1142/9781860948534_0046 | |
| Source: | INNOVATIVE APPLICATIONS OF INFORMATION TECHNOLOGY FOR THE DEVELOPING WORLD (pp 287-291) | |
| Author(s): | V. CHENNAKESAVULU
Indian Institute of Technology Guwahati, India B. DEY Indian Institute of Technology Guwahati, India S. NANDI Indian Institute of Technology Guwahati, India |
|
| Abstract: | Security is the one of the main issue presently got attention by most of sensor network researchers. Many sensor network routing protocols have been proposed without giving proper attention to security aspects. The presence of a single compromised node can invert the purpose of the protocol. We have proposed a 'trust based cluster head election' scheme that allows only trusted nodes to acquire greater responsibilities in the network like aggregation and cryptography information maintenance. Present scheme introduces the concept of 'Super Nodes' which are having high voting power in these elections. We present statistical results for the number of nodes the adversary has to compromise to get these responsibilities. Present scheme also considers energy resources of nodes during the cluster head election process. A secure routing protocol can be built on this approach. | |
| Full Text: | View full text in PDF format (265KB) | |
| TOC: | Back to Table of Contents | |
|
||