Anuradha Banerjee1
and Paramartha Dutta2
1Department of Computer Applications, Kalyani Govt. Engg. College, Nadia, West
Bengal, India 2Visva-Bharati University, Santiniketan, West Bengal, India
ABSTRACT
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.
KEYWORDS
Ad hoc network, binary search, grid cell, routing, scalability.
More Details....
No comments:
Post a Comment