772 research outputs found
Stimulating cooperative behavior of autonomous devices - an analysis of requirements and existing approaches
In the context of mobile and wireless devices, an information
system is no longer a centralized component storing all the
relevant data nor is it a decentralized component governed by a
common authority. Rather, the information spread across huge
numbers of autonomous mobile and wireless devices owned by
independent organizations and individuals can be regarded as a
highly dynamic, virtual information system. For this vision to
become reality, the autonomous devices involved need to be
motivated to cooperate. This cooperation needs to occur not only
on the application layer, but, depending on the network
architecture, also on the lower layers from the link layer on
upwards. In this report, we investigate on which protocol layers
cooperation is needed and what constitutes uncooperative behavior.
We then identify necessary properties of incentive schemes that
encourage cooperation and discourage uncooperative behavior. In
this context, we examine remuneration types that are a major
constituent of incentive schemes. Finally, using the example of
ad hoc networks, the most challenging technical basis of a
wireless information system, we compare existing incentive
schemes to these characteristics
Modeling Security and Resource Allocation for Mobile Multi-hop Wireless Neworks Using Game Theory
This dissertation presents novel approaches to modeling and analyzing security and resource allocation in mobile ad hoc networks (MANETs). The research involves the design, implementation and simulation of different models resulting in resource sharing and security’s strengthening of the network among mobile devices. Because of the mobility, the network topology may change quickly and unpredictably over time. Moreover, data-information sent from a source to a designated destination node, which is not nearby, has to route its information with the need of intermediary mobile nodes. However, not all intermediary nodes in the network are willing to participate in data-packet transfer of other nodes. The unwillingness to participate in data forwarding is because a node is built on limited resources such as energy-power and data. Due to their limited resource, nodes may not want to participate in the overall network objectives by forwarding data-packets of others in fear of depleting their energy power.
To enforce cooperation among autonomous nodes, we design, implement and simulate new incentive mechanisms that used game theoretic concepts to analyze and model the strategic interactions among rationale nodes with conflicting interests. Since there is no central authority and the network is decentralized, to address the concerns of mobility of selfish nodes in MANETs, a model of security and trust relationship was designed and implemented to improve the impact of investment into trust mechanisms. A series of simulations was carried out that showed the strengthening of security in a network with selfish and malicious nodes. Our research involves bargaining for resources in a highly dynamic ad-hoc network. The design of a new arbitration mechanism for MANETs utilizes the Dirichlet distribution for fairness in allocating resources. Then, we investigated the problem of collusion nodes in mobile ad-hoc networks with an arbitrator. We model the collusion by having a group of nodes disrupting the bargaining process by not cooperating with the arbitrator. Finally, we investigated the resource allocation for a system between agility and recovery using the concept of Markov decision process. Simulation results showed that the proposed solutions may be helpful to decision-makers when allocating resources between separated teams
Exponential Reliability Coefficient based Reputation Mechanism for isolating selfish nodes in MANETs
AbstractIn mobile ad hoc networks, cooperation among active mobile nodes is considered to play a vital role in reliable transmission of data. But, the selfish mobile nodes present in an ad hoc environment refuse to forward neighbouring nodes’ packet for conserving its own energy. This intentional selfish behaviour drastically reduces the degree of cooperation maintained between the mobile nodes. Hence, a need arises for devising an effective mechanism which incorporates both energy efficiency and reputation into account for mitigating selfish behaviour in MANETs. In this paper, we propose an Exponential Reliability Coefficient based reputation Mechanism (ERCRM) which isolates the selfish nodes from the routing path based on Exponential Reliability Coefficient (ExRC). This reliability coefficient manipulated through exponential failure rate based on moving average method highlights the most recent past behaviour of the mobile nodes for quantifying its genuineness. From the simulation results, it is evident that, the proposed ERCRM approach outperforms the existing Packet Conservation Monitoring Algorithm (PCMA) and Spilt Half Reliability Coefficient based Mathematical Model (SHRCM) in terms of performance evaluation metrics such as packet delivery ratio, throughput, total overhead and control overhead. Further, this ERCRM mechanism has a successful rate of 28% in isolating the selfish nodes from the routing path. Furthermore, it also aids in framing the exponential threshold point of detection as 0.4, where a maximum number of selfish nodes are identified when compared to the existing models available in the literature
Coalition Formation in MANETs
Wireless ad-hoc networks rely on the cooperation of participating nodes for almost all their functions. However, due to resource constraints, nodes are generally selfish and try to maximize their own benefit when participating in the network. Therefore, it is important to study mechanisms which can be used as incentives to form coalitions inside the network. In this paper, we study coalition formation based on game theory, especially cooperative game theory. First, the dynamics of coalition formation proceeds via pairwise bargaining. We show that the size of the maximum coalition is a decreasing function of the cost for establishing a link. After the coalition formation process reaches the steady state, we are interested in the stability of coalitions. We prove that coalitions are stable in terms of both pairwise stability and coalitional stability
Recommended from our members
Fair relay selection in wireless rural networks using game theory
Access to Internet is the key to facilitate the economic growth and development of the rural communities and to bridge the digital-divide between the urban and rural population. The traditional broadband access technologies are not always suitable for the rural areas due to their difficult topography and sparsely populated communities. Specialized relay stations can be deployed to extend the coverage of a wireless rural network but they come with an inherited increase in the infrastructural cost. An alternative is to utilize the in-range users as relays to enhance the coverage range of the wireless rural network.
In this thesis, the in-range ordinary users termed as primary users (PUs) are used to act as relays for the out-of-range users called the secondary users (SUs). Two relay selection solutions, the Fair Battery Power Consumption (FBPC) algorithm and the Credit based Fair Relay Selection (CF-RS) protocol have been proposed with the aim of providing fair chance to every PU to assist the SUs, thus resulting in fair utilization of battery power of all relays along with the coverage extension. The FBPC algorithm uses the concept of proportional fairness as the relay selection criterion. However, if only proportionally fair consumption of battery power is taken as the relay selection parameter, the FBPC algorithm may result in selecting relays with poor channel conditions. The rural network may also consist of selfish PUs which need to be incentivized to use their resources for the SUs. The CF-RS protocol is developed which takes into account both the achievable data rate and consumption of battery power for selection of a relay. The CF-RS protocol is formulated using Stackelberg game which employs a credit-based incentive mechanism to motivate the self-interested PUs to help the SUs by providing instantaneous as well as long term benefit to the PUs.
A basic network model consisting of PUs and SUs has been simulated and the performance of the FBPC algorithm and the CF-RS protocol have been evaluated in terms of data rate and utility achievable at the SUs, dissipation of battery power of the PUs and Jain’s fairness index to determine fairness in utilization of battery power. The results obtained show that the FBPC algorithm achieves approximately 100% fairness for utilization of battery power of relays but compromises the data rate attainable by the SUs. Thus the FBPC algorithm shall be viewed as a trade-off between the fair battery power dissipation of relays and the data rate achievable by the SUs. Whereas, the CF-RS protocol provides 55% better utility and longer service time to the SUs without harming the attainable data rate and achieves 80% fairness. When the CF-RS protocol is used for relay selection, it is advantageous even for the self-interested users to participate in the relaying process to earn some benefit to utilize it when needed to buy assistance from other users
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
Recommended from our members
Trust Computational Models for Mobile Ad Hoc Networks. Recommendation Based Trustworthiness Evaluation using Multidimensional Metrics to Secure Routing Protocol in Mobile Ad Hoc Networks.
Distributed systems like e-commerce and e-market places, peer-to-peer networks, social networks, and mobile ad hoc networks require cooperation among the participating entities to guarantee the formation and sustained existence of network services. The reliability of interactions among anonymous entities is a significant issue in such environments. The distributed entities establish connections to interact with others, which may include selfish and misbehaving entities and result in bad experiences. Therefore, trustworthiness evaluation using trust management techniques has become a significant issue in securing these environments to allow entities decide on the reliability and trustworthiness of other entities, besides it helps coping with defection problems and stimulating entities to cooperate. Recent models on evaluating trustworthiness in distributed systems have heavily focused on assessing trustworthiness of entities and isolate misbehaviours based on single trust metrics. Less effort has been put on the investigation of the subjective nature and differences in the way trustworthiness is perceived to produce a composite multidimensional trust metrics to overcome the limitation of considering single trust metric. In the light of this context, this thesis concerns the evaluation of entities’ trustworthiness by the design and investigation of trust metrics that are computed using multiple properties of trust and considering environment.
Based on the concept of probabilistic theory of trust management technique, this thesis models trust systems and designs cooperation techniques to evaluate trustworthiness in mobile ad hoc networks (MANETs). A recommendation based trust model with multi-parameters filtering algorithm, and multidimensional metric based on social and QoS trust model are proposed to secure MANETs. Effectiveness of each of these models in evaluating trustworthiness and discovering misbehaving nodes prior to interactions, as well as their influence on the network performance has been investigated. The results of investigating both the trustworthiness evaluation and the network performance are promising.Ministry of Higher Education in Libya and the Libyan Cultural Attaché bureau in Londo
- …