Energy Efficient Secure Data Transmission in Wireless Sensor Network

Conference proceedings article


Authors / Editors


Research Areas

No matching items found.


Publication Details

Author list: Kuthadi VM, Selvaraj R, Marwala T

Place: BERLIN

Publication year: 2018

Journal: SMART COMPUTING AND INFORMATICS (2190-3018)

Journal acronym: SMART INNOV SYST TEC

Volume number: 77

Start page: 275

End page: 287

Number of pages: 13

ISBN: 978-981-10-5543-0

eISBN: 978-981-10-5544-7

ISSN: 2190-3018

Languages: English-Great Britain (EN-GB)


View in Web of Science | View on publisher site | View citing articles in Web of Science


Abstract

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.


Keywords

base station, Dijkstra algorithm, Power efficient adaptive clustering hierarchy, Time differential of arrival, wireless sensor networks


Documents

No matching items found.


Last updated on 2021-07-05 at 03:59