Cooperation-Based Routing Protocol for Mobile Ad-Hoc Network

Cooperation-Based Routing Protocol for Mobile Ad-Hoc Network

Abdelhalim Baaziz (École Polytechnique de Montréal, Canada) and Samuel Pierre (École Polytechnique de Montréal, Canada)
Copyright: © 2011 |Pages: 16
DOI: 10.4018/978-1-60566-250-3.ch001
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

This chapter describes a hybrid routing protocol for mobile ad hoc network based on the packet relaying cooperation and zone-based network architecture. In each zone, a specific node called Principal manages the routing processing. The Principal receives, periodically from its zone‘s nodes, two values that express their rate of success and their rate of cooperation, and then calculates the average rate of success, and the average rate of cooperation of the zone. After what, it retransmits these averages to all nodes. The nodes use the two averages values to define the action to be undertaken, cooperate or not. The Principal, knowing the topology of its zone, receives route requests and calculates the path between the source and the destination according to the best way based on cooperation. The Principal‘s features are so that it is simple to realize. It does not impose constraints and it allows the information gathering that is necessary for the model solution. Such the routing protocol and the nodes (to undertake the actions that make them possible to cooperate) use this information. Simulations show the efficiency of the protocol opposite to the pro-active and reactive protocols in the context of cooperation in mobile ad hoc networks.
Chapter Preview
Top

By definition, in mobile ad hoc networks, every node is supposed to relay packets for the benefit of other nodes. This may be the most fundamental characteristic of this type of network compared to conventional networks. Indeed, in military or emergency networks where the network is under the control of a single responsible, cooperation problems do not exist as the collective interest of the mission surpasses the individual interest of the nodes. However, if the nodes are their own chiefs, every node tries to obtain the most possible benefits from the network, while saving its own resources. Thus, nodes with selfish behaviors appear, resulting in non-involvement behaviors when common interest operations (routing, packet transmission, mobility management, etc) must be executed (Fèlegyhàzi, Buttyàn & Hubaux, 2003).

To maintain an efficient mobile ad hoc network and to guarantee a certain threshold of operationality, we must insist that all nodes be involved with the basic functions of the network.

Several solutions have been proposed:

Complete Chapter List

Search this Book:
Reset