Dichotomy-Based Routing Protocol For Mobile Ad Hoc Networks

Abstract

Broadcasting routing control packets network-wide is the most direct and common method for finding the required destination node in ad hoc wireless networks when on-demand routing strategies are used. Even though most of the mobile nodes in the network are not related with those control packets, they have to retransmit them. Our routing protocol partitions the network into a definite number of square districts with equal sides by the aid of GPS. There are two sorts of districts namely gray districts and white districts that interlace one another. Mobile nodes in gray districts are responsible for re-transmitting the received control packets; however, mobile nodes in white districts will not re-transmit it except “listening” the transmitted packets. A mobile node in white district will respond to the transmitted packets only if it itself is the required destination node. Generally speaking, using our routing protocol will save a half amount of control packets as compared to pure flooding routing protocols. Our routing protocol does not require any location information of the required destination nodes, position database, nor hierarchically organized the networks. Furthermore, the protocol does not need to experience a “learning” stage. Our goal is to prevent the control packets from broadcasting network-wide and to save precious bandwidth.