Wireless Sensor Networks: Security,Routing and Energy Efficiency

Subhabrata Barman

ISBN 10: 3659773921 / ISBN 13: 9783659773921

Published by LAP LAMBERT Academic Publishing Okt 2019, 2019

About this Item

Neuware -To get low cost solution of real-world problems, wireless sensor network is widely used. As sensors are low cost tiny device with limited storage, computational capability and power, energy efficient protocol is needed in the applications of wireless sensor network. On the other hand security is one of the main concerned when sensors will communicate to each other securely. Id-Based scheme provides that security, clustering approach provides an energy efficient topology control and cluster head and route selection provides an energy efficient data routing mechanism. In this paper we will propose a framework of three phases: in first phase we will propose an algorithm for finding minimum connected dominating set using maximal independent set for unit disk graph. In second phase we will propose an algorithm for cluster head and path selection and in last phase we will proposed an Id-Based scheme to provide secure communication within the network.Books on Demand GmbH, Überseering 33, 22297 Hamburg 104 pp. Englisch. Seller Inventory # 9783659773921

Bibliographic Details

Title: Wireless Sensor Networks: Security,Routing ...

Publisher: LAP LAMBERT Academic Publishing Okt 2019

Publication Date: 2019

Binding: Taschenbuch

Condition: Neu

About this title

Synopsis:

To get low cost solution of real-world problems, wireless sensor network is widely used. As sensors are low cost tiny device with limited storage, computational capability and power, energy efficient protocol is needed in the applications of wireless sensor network. On the other hand security is one of the main concerned when sensors will communicate to each other securely. Id-Based scheme provides that security, clustering approach provides an energy efficient topology control and cluster head and route selection provides an energy efficient data routing mechanism. In this paper we will propose a framework of three phases: in first phase we will propose an algorithm for finding minimum connected dominating set using maximal independent set for unit disk graph. In second phase we will propose an algorithm for cluster head and path selection and in last phase we will proposed an Id-Based scheme to provide secure communication within the network.