Use this URL to cite or link to this record in EThOS:
Title: Dealing with free-riding nodes in an open MANET
Author: Bakar, Khairul Azmi Abu
ISNI:       0000 0004 2740 2085
Awarding Body: University of Strathclyde
Current Institution: University of Strathclyde
Date of Award: 2012
Availability of Full Text:
Access from EThOS:
Access from Institution:
A mobile ad hoc network (MANET) is a self-organised wireless network where mobile nodes can communicate with each other without the need of any existing network infrastructure or centralised administration. There are no dedicated routing devices and each node has to rely on others to cooperatively provide forwarding services to ensure global connectivity. In an open MANET, different nodes may have different authorities and different goals. To conserve their own resources, some nodes may choose not to cooperate while still using the network to forward their packets. Uncooperative or misbehaving nodes can significantly degrade the performance of a MANET. Most previous works to mitigate the effects of misbehaving nodes focus on data forwarding. However, dropping control packets is a better strategy for the selfish nodes to avoid themselves from being requested to forward data packets. In this thesis, a new scheme is proposed to detect free-riding nodes which exhibit such a strategy. In the detection scheme, each node operates in promiscuous mode and monitors the activities of its neighbouring node. All nodes in the network are expected to contribute to the network on the continual basis within each predefined time frame. Those which fail will undergo a suspicious checking procedure to test for the suspicious behaviour. Detection alone is not enough to deal with free-riding nodes. To encourage the nodes to be cooperative, three variations of punishment schemes are proposed. The schemes punish free-riding nodes by isolating them and refusing them services.
Supervisor: Not available Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available