81 research outputs found
A secure mechanism design-based and game theoretical model for MANETs
International audienceTo avoid the single point of failure for the certificate authority (CA) in MANET, a decentralized solution is proposed where nodes are grouped into different clusters. Each cluster should contain at least two confident nodes. One is known as CA and the another as register authority RA. The Dynamic Demilitarized Zone (DDMZ) is proposed as a solution for protecting the CA node against potential attacks. It is formed from one or more RA node. The problems of such a model are: (1) Clusters with one confident node, CA, cannot be created and thus clusters' sizes are increased which negatively affect clusters' services and stability. (2) Clusters with high density of RA can cause channel collision at the CA. (3) Clusters' lifetime are reduced since RA monitors are always launched (i.e., resource consumption). In this paper, we propose a model based on mechanism design that will allow clusters with single trusted node (CA) to be created. Our mechanism will motivate nodes that do not belong to the confident community to participate by giving them incentives in the form of trust, which can be used for cluster's services. To achieve this goal, a RA selection algorithm is proposed that selects nodes based on a predefined selection criteria function and location (i.e., using directional antenna). Such a model is known as moderate. Based on the security risk, more RA nodes must be added to formalize a robust DDMZ. Here, we consider the tradeoff between security and resource consumption by formulating the problem as a nonzero-sum noncooperative game between the CA and attacker. Finally, empirical results are provided to support our solutions
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
A Simulation-Based Study of Server Location Selection Rules in Manets Utilising Threshold Cryptography
Truly Ad Hoc wireless networks where a spontaneous formation of a network occurs and there is no prior knowledge of nodes to each other present significant security challenges, especially as entirely online configuration of nodes with encryption keys must be performed. Utilising threshold cryptography in this type of MANET can greatly increase the security by requiring servers to collaborate to form a single Certificate Authority (CA). In this type of CA responsibility for certificate services is shared between a threshold of servers, greatly increasing security and making attack against the CA considerably more difficult. Choosing which nodes to take on the role of a CA server can have a significant impact on the efficiency of the network, and the success of certificate requests. This research uses simulation to test different rules for choosing nodes to become servers based on their location within the network. Results show that choosing the best server location rules for particular configurations is essential in ensuring both robust security and efficient running of the network
Dual Auction Mechanism for Transaction Forwarding and Validation in Complex Wireless Blockchain Network
In traditional blockchain networks, transaction fees are only allocated to
full nodes (i.e., miners) regardless of the contribution of forwarding
behaviors of light nodes. However, the lack of forwarding incentive reduces the
willingness of light nodes to relay transactions, especially in the
energy-constrained Mobile Ad Hoc Network (MANET). This paper proposes a novel
dual auction mechanism to allocate transaction fees for forwarding and
validation behaviors in the wireless blockchain network. The dual auction
mechanism consists of two auction models: the forwarding auction and the
validation auction. In the forwarding auction, forwarding nodes use Generalized
First Price (GFP) auction to choose transactions to forward. Besides,
forwarding nodes adjust the forwarding probability through a no-regret
algorithm to improve efficiency. In the validation auction, full nodes select
transactions using Vickrey-Clarke-Grove (VCG) mechanism to construct the block.
We prove that the designed dual auction mechanism is Incentive Compatibility
(IC), Individual Rationality (IR), and Computational Efficiency (CE).
Especially, we derive the upper bound of the social welfare difference between
the social optimal auction and our proposed one. Extensive simulation results
demonstrate that the proposed dual auction mechanism decreases energy and
spectrum resource consumption and effectively improves social welfare without
sacrificing the throughput and the security of the wireless blockchain network
Truthful resource management in wireless ad hoc networks
In wireless mobile ad hoc networks (MANETs), cooperation cannot be an im-
plicit assumption anymore. Each profit-oriented network node has the intention to
be selfish due to limited resource possession. In this dissertation, we investigate the
truthful resource management that induces network nodes to reveal true information
and stimulate cooperation.
We propose the Transmission Power Recursive Auction Mechanism routing pro-
tocol (TEAM) and the Truthful Topology Control mechanism (TRUECON) to cope
with the selfish intention and achieve resource effciency in a non-cooperative envi-
ronment. We prove both are strategy-proof and have some theoretic bounds on the
performance. Compared with the existing routing protocols and topology control al-
gorithms, TEAM and TRUECON are more effcient when dealing with the selfishness
in MANETs.
We conduct a study on anonymity enhancement in MANETs by reducing trans-
mission power of network nodes. A routing protocol - Whisper is presented. Simu-
lation results show that it has desirable properties in terms of anonymity and power
effciency
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
- …