Research on Avoid Repetition Information Flooding Broadcasting Protocol

Abstract

Abstract-Distributed ad hoc broadcasting is not only the foundation for unicast, multicast as well as deterministic broadcast routing protocols to detect and maintain their routing, but itself can be used as approach to transmit messages for unicast, multicast and broadcast communication. In order to avoid the problems of poor broadcast reliability, large transmission delay and more network resource occupation that caused by broadcast storms, adjacent conflict, hidden collisions in the packet radio network application of traditional broadcasting protocol, the paper presented an Avoid Repetition Information Flooding Broadcasting Protocol (ARIFBP) and mainly researched on its material algorithm and related key problems for practical applications based on Collision Avoid Multiple Access (CAMA) protocol. The proposition of ARIFBP is of great significance for the improvement of routing protocols and researches on ad hoc packet radio network. Index Terms-packet radio network, broadcast, flooding, avoid repetition information I. INTRODUCTIONIn the networking process of multi-hop packet radio network, distributed ad hoc broadcasting is a necessary operation, which is not only the foundation for unicast, multicast as well as deterministic broadcast routing protocols to detect and maintain their routing, but it can be used as means to transmit unicast, multicast and broadcast messages. Flooding is a king of ad hoc technology that has been widely used in the practical network applications. But when applied in multi-hop packet radio network, it will introduce the problems of broadcast storms, adjacent conflict, hidden collisions and etc, which will result in bad broadcast reliability, larger transmission delay and more network resource occupation. Aim at the characteristics of multi-hop packet radio network, the paper brought out the ARIFBP. It utilizes CAMA firstly to solve the problems of adjacent conflict and hidden collisions, which is a kind of non-collision and high efficiency preferential RTS/CTS appointment multiple access mechanism that can not only solve problems of adjacent conflict and hidden collisions, but also effectively support QoS of multimedia traffic and insure prior traffic can be accessed in priority. At the same time, the ARIFBP makes use of local neighbor information and collected repetition broadcasting information to avoid broadcast storms, so that the repeated broadcasting information of flooding can be effectively avoid, and improve the broadcast transmission speed and network throughput, which has good reliability, too. The arrangement of the paper is as following: Section 2 analyzes the related research works of broadcasting protocol and points out their advantages and disadvantages; In section 3, the detail algorithm of the paper proposed ARIFBP; Section 4 researches key problems of forward delay, adjacent information acquisition, one-way link and data structure that relates to practical applications of ARIFBP; Section 5 concludes our work. II. RELATED RESEARCH WORKS OF FLOODING BROADCASTING P...