Dynamic Router Selection and Encryption for Secure Data Transmission in Wireless Sensor Networks
Autor: | Vyshak C, Aruna M G |
---|---|
Rok vydání: | 2014 |
Předmět: |
business.industry
Computer science Network packet Distributed computing Node (networking) ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS Encryption Key distribution in wireless sensor networks Core router One-armed router Routing (electronic design automation) business Wireless sensor network Computer network |
Zdroj: | IOSR Journal of Computer Engineering. 16:20-25 |
ISSN: | 2278-0661 2278-8727 |
DOI: | 10.9790/0661-16212025 |
Popis: | Among the various possible threats in the WSN‟s, like node failure, data security, etc., we are presenting this paper in order to circumvent or overcome the „black holes‟ that are formed due to compromised -node (CN) and denial-of-service (Denial of service) by using some routing mechanisms. Basic idea of developing this paper is nothing but combat the vulnerability of existing system in handling such attacks due to their deterministic nature i.e., once an obstructionist can gather or acquire the routing algorithm can figure out the same routes known to the source, and hence intimidate all information sent over these routes. We have developed a structure that generates randomized routes. Under this design the routes taken by the “shares” of different packets change over time to time increasing the probability of randomness of paths to be selected for transferring the information. Therefore, even though adversary or offender comes to know about the routing algorithm still he cannot pinpoint the routes in where each packet is traversed randomly. Apart from randomness, the routes that are generated by our mechanisms are energy efficient as well as dispersive which ultimately make them capable of circumventing the black holes at less energy cost. Extensive frameworks are conducted to verify the validity of our mechanisms. |
Databáze: | OpenAIRE |
Externí odkaz: |