40 research outputs found
Manifestation and mitigation of node misbehaviour in adhoc networks
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
Administrator and Fidelity Based Secure Routing (AFSR) Protocol in MANET
The proliferation of mobile computing and communication devices are driving a revolutionary change in our information society. Among all the applications and services run by mobile devices, network connections and corresponding data services are without doubt the most demanded services by mobile users. A MANET is a continuously self-configuring, infrastructure-less network of mobile devices connected without wires, which makes it ideal for the present scenario. But, due to lack of any centralized infrastructure and access to trusted authorities, the security in MANET poses a huge threat. The prominent routing protocols we know are generally designed for environments where the nodes within a network are non-malicious. Due to the vulnerable nature of the mobile ad hoc network, there are numerous security threats that disturb its development. We propose a protocol for MANETs named “Administrator and Fidelity Based Secure Routing Protocol” (AFSR), which
ensures secure routing through the network: by electing an Administrator node on the basis of Willingness and Fidelity, after which a node only communicates to that secure Admin node. This selection of secured admin nodes results in mitigation of various threats. We have evaluated our proposed protocol by simulating and comparing in GloMoSim
Bayesian signaling game based efficient security model for MANETs
Game Theory acts as a suitable tool offering promising solutions to security-related concerns in Mobile Ad Hoc Networks (i.e., MANETs). In MANETs, security forms a prominent concern as it includes nodes which are usually portable and require significant coordination between them. Further, the absence of physical organisation makes such networks susceptible to security breaches, hindering secure routing and execution among nodes. Game Theory approach has been manipulated in the current study to achieve an analytical view while addressing the security concerns in MANETs. This paper offers a Bayesian-Signaling game model capable of analysing the behaviour associated with regular as well as malicious nodes. In the proposed model, the utility of normal nodes has been increased while reducing the utility linked to malicious nodes. Moreover, the system employs a reputation system capable of stimulating best cooperation between the nodes. The regular nodes record incessantly to examine their corresponding nodes’ behaviours by using the belief system of Bayes-rules. On its comparison with existing schemes, it was revealed that the presented algorithm provides better identification of malicious nodes and attacks while delivering improved throughput and reduced false positive rate
Performance evaluation of cooperation strategies for m-health services and applications
Health telematics are becoming a major improvement for patients’ lives, especially for
disabled, elderly, and chronically ill people. Information and communication technologies have
rapidly grown along with the mobile Internet concept of anywhere and anytime connection.
In this context, Mobile Health (m-Health) proposes healthcare services delivering, overcoming
geographical, temporal and even organizational barriers. Pervasive and m-Health services aim
to respond several emerging problems in health services, including the increasing number of
chronic diseases related to lifestyle, high costs in existing national health services, the need
to empower patients and families to self-care and manage their own healthcare, and the need
to provide direct access to health services, regardless the time and place. Mobile Health (m-
Health) systems include the use of mobile devices and applications that interact with patients
and caretakers. However, mobile devices have several constraints (such as, processor, energy,
and storage resource limitations), affecting the quality of service and user experience. Architectures
based on mobile devices and wireless communications presents several challenged issues
and constraints, such as, battery and storage capacity, broadcast constraints, interferences, disconnections,
noises, limited bandwidths, and network delays. In this sense, cooperation-based
approaches are presented as a solution to solve such limitations, focusing on increasing network
connectivity, communication rates, and reliability. Cooperation is an important research topic
that has been growing in recent years. With the advent of wireless networks, several recent
studies present cooperation mechanisms and algorithms as a solution to improve wireless networks
performance. In the absence of a stable network infrastructure, mobile nodes cooperate
with each other performing all networking functionalities. For example, it can support intermediate
nodes forwarding packets between two distant nodes.
This Thesis proposes a novel cooperation strategy for m-Health services and applications.
This reputation-based scheme uses a Web-service to handle all the nodes reputation and networking
permissions. Its main goal is to provide Internet services to mobile devices without
network connectivity through cooperation with neighbor devices. Therefore resolving the above
mentioned network problems and resulting in a major improvement for m-Health network architectures
performances. A performance evaluation of this proposal through a real network
scenario demonstrating and validating this cooperative scheme using a real m-Health application
is presented. A cryptography solution for m-Health applications under cooperative environments,
called DE4MHA, is also proposed and evaluated using the same real network scenario and
the same m-Health application. Finally, this work proposes, a generalized cooperative application
framework, called MobiCoop, that extends the incentive-based cooperative scheme for
m-Health applications for all mobile applications. Its performance evaluation is also presented
through a real network scenario demonstrating and validating MobiCoop using different mobile
applications
Security protocols for mobile ad hoc networks
Mobile ad hoc networks (MANETs) are generating much interest both in academia and the telecommunication industries. The principal attractions of MANETs are related to the ease with which they can be deployed due to their infrastructure-less and decentralized nature. For example, unlike other wireless networks, MANETs do not require centralized infrastructures such as base stations, and they are arguably more robust due to their avoidance of single point of failures. Interestingly, the attributes that make MANETs attractive as a network paradigm are the same phenomena that compound the challenge of designing adequate security schemes for these innovative networks.One of the challenging security problems is the issue of certificate revocation in MANETs where there are no on-line access to trusted authorities. In wired network environments, when certificates are to be revoked, certificate authorities (CAs) add the information regarding the certificates in question to certificate revocation lists (CRLs) and post the CRLs on accessible repositories or distribute them to relevant entities. In purely ad hoc networks, there are typically no access to centralized repositories or trusted authorities; therefore the conventional method of certificate revocation is not applicable.Another challenging MANET security problem is the issue of secure routing in the presence of selfish or adversarial entities which selectively drop packets they agreed to forward; and in so doing these selfish or adversarial entities can disrupt the network traffic and cause various communication problems.In this thesis, we present two security protocols we developed for addressing the above-mentioned MANET security needs. The first protocol is a decentralized certificate revocation scheme which allows the nodes within a MANET to have full control over the process of certificate revocation. The scheme is fully contained and it does not rely on any input from centralized or external entities such as trusted CAs. The second protocol is a secure MANET routing scheme we named Robust Source Routing (RSR). In addition to providing data origin authentication services and integrity checks, RSR is able to mitigate against intelligent, colluding malicious agents which selectively drop or modify packets they are required to forward
ECM-GT: design of efficient computational modelling based on game theoretical approach towards enhancing the security solutions in MANET
Game Theory is a useful tool for exploring the issues
concerning Mobile Ad-Hoc Network (or MANET) security. In
MANETs, coordination among the portable nodes is more
significant, which encompasses their vulnerability challenges to
several security assaults and the inability to run securely, when
storing its resources and manage secure routing between the
nodes. Hence, it is imperative to design an efficient routing
protocol to secure all nodes from unknown behaviors. In the
current research study, the game-theory approach is utilized for
analytical purpose and addresses the security problems in
MANETs. The game-theoretic approach is mainly adopted to find
the malicious activities in the networks. In the proposed work, a
Bayesian-Signaling game model is proposed which analyses the
behavior of both regular/normal and malicious nodes. The game
model proposed also provides the finest actions of autonomous
tactics for every node. A Bayesian-Equilibrium (BE) offers the
best solution for games to resolve the incomplete information by
joining strategies and players payoff which form an equilibrium.
By exploiting the BE mechanism, the system can detect the
behavior of regular as well as malicious nodes. Therefore,
Efficient ComputationalModelling based on Game Theory or
ECM-GT methodology will reduce the utility of malicious nodes
and increase the utility of regular nodes. Also, it stimulates the
best co-operation among the nodes by exploiting the reputation
system. On comparing our results with the existing systems, it was
found that the proposed algorithm performed better in the
detection of malicious nodes, throughput, false positive rate and
detection of attacks
Hybrid FPMS: A New Fairness Protocol Management Scheme for Community Wireless Mesh Networks
Node cooperation during packet forwarding operations is critically important
for fair resource utilization in Community Wireless Mesh Networks (CoWMNs). In
a CoWMN, node cooperation is achieved by using fairness protocols specifically
designed to detect and isolate malicious nodes, discourage unfair behavior, and
encourage node participation in forwarding packets. In general, these protocols
can be split into two groups: Incentive-based ones, which are managed
centrally, and use credit allocation schemes. In contrast, reputation-based
protocols that are decentralized, and rely on information exchange among
neighboring nodes. Centrally managed protocols inevitably suffer from
scalability problems. The decentralized, reputation-based protocols lacks in
detection capability, suffer from false detections and error propagation
compared to the centralized, incentive-based protocols. In this study, we
present a new fairness protocol management scheme, called Hybrid FPMS that
captures the superior detection capability of incentive-based fairness
protocols without the scalability problems inherently expected from a
centralized management scheme as a network's size and density grows. Simulation
results show that Hybrid FPMS is more efficient than the current centralized
approach and significantly reduces the network delays and overhead.Comment: KSII Transactions on Internet and Information Systems, 201