A Trust-Based Cooperation Bit-Map Routing Protocol for Ad Hoc Networks

In this paper, we assume that an ad hoc network may be self-organized by some varying quality nodes which consist of some good nodes, some selfish nodes or malicious nodes. The selfish nodes or malicious nodes may have lots of misbehaving and hurting the connectivity for an ad hoc network. It will be reported as malicious node in all reported trust based routing protocols. 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 Trust-Based Cooperation Bit-Map Routing Protocol for Ad Hoc Networks. In this protocol, every node will deal with a trust-value assessment work and dynamically updating cooperative bit-map table. The trust-value assessment as well as the table will be dynamically updated on when any intended receiver node fails to receive the packet during the packet delivery phase. In this work, we show that our routing protocol can against packet dropping attack, and it will be more powerful to work in an abnormal environment.