Cell Hash Routingwith Multiple Paths In Wireless Sensor Networks

Cell Hash Routingwith  Multiple Paths In Wireless Sensor Networks
Authors : Macwan Kiran
Publication Date: 02-05-2013


Author(s):  Macwan Kiran

Published in:   International Journal of Engineering Research & Technology

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

Website: www.ijert.org

Volume/Issue:   Vol.2 - Issue 5 (May - 2013)

e-ISSN:   2278-0181


Abstract?This paper focuses on the problem of implementing a distributed hash table (DHT) in wireless ad hoc networks.Scarceness of resources and node mobility turn routing into a challenging problem and therefore, we claim thatbuilding a DHT as an overlay network (like in wired environments) is not the best option. Hence, we present aproof-of-concept DHT, called Cell Hash Routing (CHR), designed from scratch to cope with problems like limitedavailable energy, communication range or node mobility. CHR overcomes these problems, by using position information to organize a DHT of clusters instead of individual nodes. By using position-based routing on top ofthese clusters, CHR is very efficient. Furthermore, its localized routing and its load sharing schemes, make CHRvery scalable in respect to network size and density. For these reasons, we believe that CHR is a simple and yetpowerful adaptation of the DHT concept for wireless ad hoc environments.


Number of Citations for this article:  Data not Available


Key Word(s):    


Number of Downloads:     1042

Call for Papers - May - 2017



                 Call for Thesis - 2017 

     Publish your Ph.D/Master's Thesis Online

              Publish Ph.D Master Thesis Online as Book