Paper Info
Title
Secure Coverage Tree Construction Scheme for Wireless Sensor Networks.
Abstract
In wireless sensor networks, nodes usually construct tree structure in any monitored area to enable data aggregation and to transmit aggregated data by multi-hopping through neighbors to a remote sink (BS) which results in significant energy savings. Further- more, a captured sensor node might generate a fictitious data and misguide the Sink (BS). Hence, secure communication between nodes have generally vital importance. Secret shared keys are needed to be established among sensor nodes for secure communication among them. In the present work a new algorithm is introduced to construct such a tree of sensor nodes in wireless sensor networks. This algorithm implements a sleep/wake scheduling technique to keep redundant nodes inactive while maintaining initial sensing coverage with active nodes. Redundant nodes can replace the failure nodes to keep network tasks that enhances the network lifetime by efficient utilization. Hence the objective of this research work is to jointly design the scheme for sensor scheduling, tree construction with active nodes, and secret pair-wise keys establishment with their parent and children such that the network lifetime can be maximized. Thereafter, sensor nodes communicate with each other securely using secret pair-wise keys.
Year
DOI
Venue
2015
10.1007/s11277-014-2246-5
Wireless Personal Communications
Keywords
Field
DocType
data aggregation,security,wireless sensor networks,coverage,fault tolerance
Sensor node,Key distribution in wireless sensor networks,Scheduling (computing),Computer science,Computer network,Fault tolerance,Tree structure,Mobile wireless sensor network,Wireless sensor network,Secure communication,Distributed computing
Journal
Volume
Issue
ISSN
82
1
1572-834X
Citations 
PageRank 
References 
1
0.35
9
Authors
4
Name
Order
Citations
PageRank
Irfana Memon111.03
Pardeep Kumar231.07
Nisar A. Memon310.35
Bhawani Shankar Chowdhry45117.15