A REVIEW ON UNIQUE KEY ASSIGNMENT AND RELIABLE ROUTING SCHEMES OVER WSNs

WSN

https://scholar.google.co.in/citations?view_op=view_citation&hl=en&imq=IJARIIE+INTERNATIONAL+JOURNAL&citation_for_view=tpiTtoAAAAAJ:dQJM2trw0wsC&gmla=AJsN-F63nbAS56Hzbhd90pmnMwFtEM53EGpLBi9P1J6ojn_4ayQXrCJv8UuJFmOdyDDpJMkXMVd3uAItZnMzBvx5MG-nUOpQbSLW5baGcpNoaDhVO7cTd1I In the current decade, wireless sensor networks are emerging as a peculiar multi-disciplinary research area. In WSNs, lower sensing ranges result in dense networks, which bring the necessity to achieve an efficient key management and reliable routing protocols subject to power constraints. WSNs may contain one or more base stations to collect sensed data and possibly relay it to a central processing and storage system. Unique Key allocation is usually not applicable in a sensor network due to the massive production of cheap sensor nodes, the limited bandwidth, and the size of the payload. Several solutions have been proposed for locally unique ID assignment in WSN in order to reduce the communication overhead, which is not desirable due to the limited power supply in a sensor node. In this paper, we study the possible key assignment schemes for WSNs to assign the local unique Key’s to the wireless sensor nodes. The main emphasis in this paper is to preserve more power by means of delaying key assignment conflict and routing resolution until necessary in WSNs and present the possible schemes and techniques by which we can increase robustness of WSNs.

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.