TY - GEN
T1 - Energy efficient secure data transmission in wireless sensor network
AU - Kuthadi, Venu Madhav
AU - Selvaraj, Rajalakshmi
AU - Marwala, Tshilidzi
N1 - Publisher Copyright:
© Springer Nature Singapore Pte Ltd. 2018.
PY - 2018
Y1 - 2018
N2 - Wireless sensor network (WSN) turns out to be a vital innovation identified with systems as well as it is by and large broadly connected and received in the present day control and checking functions. In any case, problems with respect to vitality proficiency create huge worries during the time spent in remote sensor system. For problems concerning vitality, power efficient adaptive clustering hierarchy (PEACH) tradition has been suggested essentially for WSNs so as to criticize vitality use of hubs and expanding life range of the system. The hubs in the remote sensor system structure as a gathering. The most noteworthy vitality hub in the gathering has been chosen as a bunch head. The bunch head determination has a few criteria in choosing: (1) based on the vitality levels of sensors in group (i.e., the hub with higher vitality would be chosen as a bunch head). (2) based on hub degree (total number of hubs associated with it) (i.e., the hub with advanced hub degree would be chosen as a bunch head). The time differential of arrival (TDA) has been proposed for vitality consumption of sensor hubs in the system. TDA decreases the vitality utilization of hubs and expanding the system life duration. The node connectivity algorithm (NCA) has been proposed to discover the availability with neighbor’s hub in the remote sensor system. The bunch head confirms the gathering hubs and transfers the confirmation data to server. On the off chance that any noxious hub available in the system, the server would recognize through self-mending key appropriation procedure and the bunch head would shut the hub and toss out the hub from the bunch. The noxious hub assets would be stored into the server. It will make the system more ensured and safe one. To broadcast the parcels from resource to goal, figure the most limited way with the assistance of Dijkstra algorithm. The bundle encodes at source and unscrambled once it gets to the goal by means of Advanced Encryption Standard (AES) encryption calculation.
AB - Wireless sensor network (WSN) turns out to be a vital innovation identified with systems as well as it is by and large broadly connected and received in the present day control and checking functions. In any case, problems with respect to vitality proficiency create huge worries during the time spent in remote sensor system. For problems concerning vitality, power efficient adaptive clustering hierarchy (PEACH) tradition has been suggested essentially for WSNs so as to criticize vitality use of hubs and expanding life range of the system. The hubs in the remote sensor system structure as a gathering. The most noteworthy vitality hub in the gathering has been chosen as a bunch head. The bunch head determination has a few criteria in choosing: (1) based on the vitality levels of sensors in group (i.e., the hub with higher vitality would be chosen as a bunch head). (2) based on hub degree (total number of hubs associated with it) (i.e., the hub with advanced hub degree would be chosen as a bunch head). The time differential of arrival (TDA) has been proposed for vitality consumption of sensor hubs in the system. TDA decreases the vitality utilization of hubs and expanding the system life duration. The node connectivity algorithm (NCA) has been proposed to discover the availability with neighbor’s hub in the remote sensor system. The bunch head confirms the gathering hubs and transfers the confirmation data to server. On the off chance that any noxious hub available in the system, the server would recognize through self-mending key appropriation procedure and the bunch head would shut the hub and toss out the hub from the bunch. The noxious hub assets would be stored into the server. It will make the system more ensured and safe one. To broadcast the parcels from resource to goal, figure the most limited way with the assistance of Dijkstra algorithm. The bundle encodes at source and unscrambled once it gets to the goal by means of Advanced Encryption Standard (AES) encryption calculation.
KW - Base station
KW - Dijkstra algorithm
KW - Power efficient adaptive clustering hierarchy
KW - Time differential of arrival
KW - Wireless sensor networks
UR - http://www.scopus.com/inward/record.url?scp=85039415333&partnerID=8YFLogxK
U2 - 10.1007/978-981-10-5544-7_28
DO - 10.1007/978-981-10-5544-7_28
M3 - Conference contribution
AN - SCOPUS:85039415333
SN - 9789811055430
T3 - Smart Innovation, Systems and Technologies
SP - 275
EP - 287
BT - Smart Computing and Informatics - Proceedings of the 1st International Conference on SCI 2016
A2 - Bhateja, Vikrant
A2 - Das, Swagatam
A2 - Satapathy, Suresh Chandra
PB - Springer Science and Business Media Deutschland GmbH
T2 - 1st International Conference on Smart Computing and Informatics, SCI 2016
Y2 - 3 March 2017 through 4 March 2017
ER -