Jongpil Jeong
ABSTRACT
This paper proposes a novel cluster-based lookup service in mobile ad hoc networks. By exploiting a self-adaptive multi-hop clustering, we avoid the empty region problem of grid system and omit the need of GPS device. The uniform distributed hash function is used in information querying to reduce the communication overhead. We also introduce another hashing function which is based on cluster size to shorten the querying delay time. In maintenance phase, we suppress the dependence of hashing function on cluster backbone by limiting the topology modification only at the start of each interval. Finally, simulation results demonstrate that our scheme reduces the communication overhead significantly. By varying different simulation parameters, we show that the proposed scheme is scalable and adaptive to many networks scenarios.
- T. Camp, J. Boleng, and L. Wilcox, "Location Information Services in Mobile Ad hoc Networks," Proceedings of the IEEE International Conference on Communications, 2002, pp. 3318--3324.Google Scholar
Cross Ref
- M. Kasemann et al., "A reactive location service for mobile ad hoc networks," NEC Network Laboratories NL-E Heidelberg, Tech. Rep. TR-02-014, November 2002.Google Scholar
- N. D. Pham and H. Choo, "Energy Efficient Expanding Ring Search for Route Discovery in MANETs," Proceedings of the IEEE International Conference on Communications, 2008, pp. 3002--3006.Google Scholar
- S. Leng, L. Zhang, H. Fu and J. Yang, "A Novel Location-Service Protocol Based on k-Hop Clustering for Mobile Ad Hoc Networks," IEEE Transactions on Vehicular Technology, Volume 56, Issue 2, March 2007, pp. 810--817.Google ScholarCross Ref
- J. Erikson, M. Faloutsos and S. V. Krishnamurthy, "DART: Dynamic Address Routing for Scalable Ad Hoc and Mesh Networks," IEEE/ACM Transactions on Networking, Volume 15, Issue 1, February 2007, pp. 119--132. Google ScholarDigital Library
- S. C. Woo, and S. Singh, "Scalable routing protocol for ad hoc networks," Wireless Networks, Volume 7, September 2001, pp. 513--529. Google ScholarDigital Library
- H. Cheng, J. Cao, and H. H. Chen, "GRLS: Group-based Location Service in Mobile Ad hoc Networks," Proceedings of the IEEE International Conference on Communications, 2007, pp. 4734--4740.Google Scholar
- J. Y. Yu, and P. H. J. Chong, "A survey of Clustering schemes for Mobile Ad hoc Networks," IEEE Communication Surveys and Tutorials, Volume 7, Issue 1, 2005, pp. 32--48. Google ScholarDigital Library
- J. Y. Yu, and P. H. J. Chong, "3hBAC(3-hop between adjacent cluster-heads): A novel Non-overlapping Clustering Algorithm for Mobile Ad hoc networks," IEEE Pacific Rim Conference on Communication, Computers and Signal Processing, August 2003, pp. 318--321.Google Scholar
Index Terms
- Cluster-based lookup service with global hashing in mobile ad hoc networks
Recommendations
Connectivity-based clustering with stretching technique in MANETs
ICUIMC '09: Proceedings of the 3rd International Conference on Ubiquitous Information Management and CommunicationIn this paper, we propose a multi-hop stretching clustering scheme for MANETs. As the solution of k-hop minimum dominating set, our proposed scheme aims to reduce the number of cluster-heads which are responsible for maintaining the cluster backbone. By ...
Topology and mobility considerations in mobile ad hoc networks
A highly dynamic topology is a distinguishing feature and challenge of a mobile ad hoc network. Links between nodes are created and broken, as the nodes move within the network. This node mobility affects not only the source and/or destination, as in a ...
Toward stable clustering in mobile ad hoc networks
ICOIN'09: Proceedings of the 23rd international conference on Information NetworkingThis paper proposes a novel clustering scheme that aims to address the following concerns: effectiveness and low maintenance. By constructing a multi-hop clustering backbone with small number of cluster-heads, we successfully reduce the overhead of ...
Comments