Authors: Jongpil Jeong; Chulhee Cho; Jeong-Jin Kang
Addresses: College of Information and Communications, Sungkyunkwan University, Suwon, Kyunggi-do, 440-745, Republic of Korea ' College of Information and Communications, Sungkyunkwan University, Suwon, Kyunggi-do, 440-745, Republic of Korea ' Department of Information and Communication, Dong Seoul University, Seongnam, Gyeonggi-Province 461-714, Republic of Korea
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.
Keywords: mobile ad hoc networks; MANETs; multi-hop clustering; stretching clustering; lookup service; distributed hashing; mobile networks; leaving rate; communication overhead; query delay time.
International Journal of Sensor Networks, 2014 Vol.15 No.3, pp.183 - 197
Available online: 24 Jul 2014 *Full-text access for editors Access for subscribers Purchase this article Comment on this article