文章基本信息

标题：Binary Location-Search Based Scalable Routing Protocol For Ad Hoc Networks
本地全文：下载
作者：Anuradha Banerjee ; Paramartha Dutta
期刊名称：International Journal of Computer Networks & Communications
印刷版ISSN：0975-2293
电子版ISSN：0974-9322
出版年度：2010
卷号：2
期号：5
出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：In this article, we present a binary location search based scalable routing protocol (BinLS) for ad hoc networks. It is completely distributed and based on a location management strategy that keeps the overhead of routing packets significantly small. The network is divided into some equal sized rectangular grid cells. Each node is assigned a home grid cell from where it starts its activity (transmission, reception and forwarding of messages). Nodes residing near the periphery of respective grid cells store information about all nodes present in the cell. Simulation results and detailed mathematical analysis of BinLS emphasize its merit compared to other schemes addressing the issue of scalability in ad hoc networks.
关键词：Ad hoc network; binary search; grid cell; routing; scalability.