A Cooperative Bit-Map Routing Protocol in Ad Hoc Networks

In the various wireless networks, there are lots of link breakage occurs because of a variety of triggers such as a natural disaster, a burst of traffic, running out of power, etc. This situation would be greatly inhibit the activity data communications, and causes the length of time of data packet delivery activity. Due to such kind of situations, we propose a based on cooperative bit-map routing protocol in Ad Hoc Networks. In this protocol, every node will maintain a cooperative caching and backup bit-map table. The table will be dynamically updated on when any intended receiver node fails to receive the packet during the packet delivery phase. The main contribution of this paper is the first investigation of the n-Bit map routing protocol using cooperative cross-layer technology, which deals with mobility, power consumption and real traffic on the maintained routes. In this work, we intend to compare the packet delivery time and amount of process time between cooperative bit-map routing and non-cooperative traditional routing protocol, and show that our scheme can reduce time consumption and gain more robust routing maintenance ability in an abnormal environment.