Content uploaded by Burhan Ul Islam Khan
Author content
All content in this area was uploaded by Burhan Ul Islam Khan on Aug 07, 2018
Content may be subject to copyright.
A preview of the PDF is not available
Trust and Resource Oriented Communication Scheme in Mobile Ad hoc Networks
File (1)
Content uploaded by Burhan Ul Islam Khan
Author content
ResearchGate has not been able to resolve any citations for this publication.
Mobile adhoc network is one of the major discussed topic in the field of wireless
network and communication system from past few decades. Various extensive
research work conducted in the past shows that mobile adhoc network is shroud
ed
with various type of issues e.g. dynamic topologies, inefficient routing policies,
unwanted energy depletion, and security. Although various solutions has been
explored for addressing other issues in MANET, but solutions previously introduced
for mitig
ating security threats in MANET are yet to be standardized or found robust
enough. One of the root causes for the same is that there is a tremendous amount of
unpredictability in the behavior of the mobile nodes in MANET, be it regular node
or erroneous no
de or malicious node. Hence, this paper discusses only the
significant research work that has been introduced in the past for the purpose of
mitigating security threats in MANET
.
Mobile adhoc network is signified as a boon for advance and future wireless communication system. Owing to its self-establishing network features and decentralization, the system can actually establish a wireless communication with vast range of connectivity with the other nodes. However, the system of MANET is also beheld with various technical impediments owing to its inherent dynamic topologies. Although there are abundant volume of research work, but very few have been able to effectively address the node misbehavior problems in MANET. The paper initially tries to draw a line between different types of nodes in MANETs based on their behavior characteristics, then reviews some of the significant contribution of the prior researches for addressing node misbehavior issues. A major emphasis is laid on is the researches which use game theory as a tool to study and address the misbehavior problems. The manuscript is developed considering some of the latest and standard evidences of past 5 years and finally discusses the open issues related to the problems.
Inspite of wide range of exploration towards the mitigation techniques for malicious nodes in past few years, the effective solutions for addressing the behavioral pattern of malicious nodes are still largely unfound. One of the most challenging dynamics related to this issue is an effective visualization of malicious nodes in the considered simulation techniques. As the malicious nodes will never adopt any strategies which has fairer chances of getting detected, hence, they will perform much confusive behavior based on which it is almost difficult to identify whether it is regular node or malicious node. The current paper accentuates the potentials of game theory considering multi-attacker collusion as the new enhancement that can effectively represent the various unpredictable actions of node cooperation, node declination, node attacks, as well as node reporting that can model the tactical profiling of various mobile nodes.
The high pace increase in wireless mobile communication based applications have made Mobile Adhoc
Network (MANET) an essential communication paradigm to ensure Quality of Service (QoS) provisioning.
MANET characterizes itself with its decentralized network establishment nature and architectural dynamicity.
The predominant QoS parameters in MANETs are end-to-end delay, network throughput, overheads, network
life time and others. The mobility and the lack of optimum resource sharing mechanism cause the QoS
degradation in MANETs. The lifespan of any node deployed in Adhoc network is in proportion with the
associated level of components and functions. Data drop and successive data regeneration also cause the
exhaustion of energy in MANETs, resulting into reduced network lifetime. To achieve optimum resource
sharing and energy conservation, in this paper a hybrid cross layered MAC optimization scheme has been
developed for MANET’s real time applications. Specifically an optimization approach based on Elephant
swarm behaviour named ElePSO has been projected to optimize the node life time and throughput. As,
CSMA/CA protocol is not effective for multihop data transmissions, thus the ElePSO scheme has been
incorporated with TDMA-MAC to ensure energy aware communication. Simulation results show that the
ElePSO outperforms other bio-inspired optimization techniques like (Particle Swarm Optimization) PSO and
(Ant Colony Optimization) ACO. Results confirm that ElePSO exhibits higher active nodes while bearing
lower communication overhead as compared to PSO and ACO.
The Mobile Adhoc Network (MANET) is not only limited to the temporary rescue operations rather it has been conceptualized to be adopted into many civil society comfort and safety applications. The selfconfigurability of MANET’s node is the root cause of vulnerability and security threats, thus there is a need of light weight protocols which can ensure optimal Quality of Service (QoS) in secure way of routing. This paper projects a model of such secure routing in MANET called DTASR i.e. Dual Threshold-based Authentication for Secure Routing accentuating upon a resource-based threshold scheme as well as trust-based authentication scheme to ensure higher degree of resiliency against adversaries. The proposed illustrates an enhanced ability of communication performance when compared to conventional secure routing schemes.
MANET (Mobile Ad hoc Network) has distinctive characteristics like node mobility, broadcast nature of wireless communication, and peer to peer data transfer. Due to these characteristics uncertainty is an integral part of MANET behavior. Uncertainty quantification is important for performance evaluation and better decision making in MANET. Packet dropping is a serious issue in MANET which degrades the performance of the network to a great extent. The packet dropping attack increases uncertainty in the network communication and eventually of the MANET. Trust based routing mechanisms are useful for neutralizing packet dropping attack. There are many existing trust based routing protocols which uses uncertainty for precise trust calculations. Thus, trust and uncertainty are closely related to each other. The paper proposes Uncertainty Analysis Framework (UAF) for MANET, it calculates the network Belief, Disbelief, and Uncertainty (BDU) values. The UAF framework integrated into different trust variants of AODV protocol which use direct trust, indirect trust, and global trust. The research work discovers impact of different trust models on MANET BDU using various mobility models. Experimental analysis shows that, trust based routing protocols show average 3 % gain in packet delivery ratio and at least 5 % increase in the network belief.
You can access online version here => http://rdcu.be/mGAQ
The advancement into smart mobile devices has accelerated the adoption of various pervasive computing based ubiquitous applications, where Mobile Adhoc Network (MANET) has extended its usability from hard core military applications to civil society applications. The success for routing requires a robust computational mechanism of routing based on the collaborative framework of energy (i.e. battery power), signal strength and zonal routings. The paper presents a framework of novel routing technique in order to jointly address the problem pertaining to routing overhead and energy drainage among the mobile nodes. Different from conventional simulation mechanism, the paper presents a communication district with inclusion of auxiliary nodes for minimizing the overhead during the routing process. The outcome of the proposed study shows significant reduction in routing overhead along with energy efficiency as compared to existing AODV and DSDV protocols.
Encouraging cooperation and deterring selfish behaviors are important for proper operations of mobile ad hoc networks (MANETs). For this purpose, most previous efforts rely on either reputation systems or price systems. However, these systems are neither sufficiently effective in providing cooperation incentives nor sufficiently efficient in resource consumption. Nodes in both systems can be uncooperative while still being considered trustworthy. Also, information exchange between mobile nodes in reputation systems and credit circulation in price systems consumes significant resources. This paper presents a hierarchical Account-aided Reputation Management system (ARM) to efficiently and effectively provide cooperation incentives. ARM builds a hierarchical locality-aware distributed hash table (DHT) infrastructure for efficient and integrated operation of both reputation and price systems. The infrastructure helps to globally collect all node reputation information in the system, which can be used to calculate more accurate reputation and detect abnormal reputation information. Also, ARM integrates reputation and price systems by enabling higher-reputed nodes to pay less for their received services. Theoretical analysis demonstrates the properties of ARM. Simulation results show that ARM outperforms the individual reputation system and price system in terms of effectiveness and efficiency of providing cooperation incentives and deterring selfish behaviors.
In military and rescue applications of mobile ad hoc networks, all the nodes belong to the same authority; therefore, they are motivated to cooperate in order to support the basic functions of the network. In this paper, we consider the case when each node is its own authority and tries to maximize the benefits it gets from the network. More precisely, we assume that the nodes are not willing to forward packets for the benefit of other nodes. This problem may arise in civilian applications of mobile ad hoc networks. In order to stimulate the nodes for packet forwarding, we propose a simple mechanism based on a counter in each node. We study the behavior of the proposed mechanism analytically and by means of simulations, and detail the way in which it could be protected against misuse.