Hashing-based lookup service in mobile ad-hoc networks with multi-hop stretchable clustering Online publication date: Thu, 24-Jul-2014
by Jongpil Jeong; Chulhee Cho; Jeong-Jin Kang
International Journal of Sensor Networks (IJSNET), Vol. 15, No. 3, 2014
Abstract: We propose a cluster-based hashing lookup service for mobile ad hoc networks (MANETs) which consists of a multi-hop stretching clustering scheme and a size-based hashing lookup service. As a solution to the k-hop minimum dominating set, our connectivity-based stretchable clustering (CSC) scheme aims to minimise the number of clusterheads which are responsible for maintaining the cluster backbone. Based on the cluster topology, we present a cluster-based hashing lookup service (CHLS) which eliminate the issues of the grid system. Our method uses a size-based hash function and allows multiple bindings between one node and lookup servers, in order to reduce query delay time. They are scattered evenly in the networks by the multiple anchor clusters distribution algorithm. The present study concludes with extensive experiments showing that the CSC scheme attains stability with low leaving rate and the CHLS scheme has low communication overhead with a reasonably small query delay time.
Online publication date: Thu, 24-Jul-2014
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Sensor Networks (IJSNET):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com