Trust-based Scheme for Cheating and Collusion Detection in Wireless Multihop Networks

Samian, Normalia; Seah, Winston K.G.

doi:10.1145/3144457.3144486

Cited by 5 publications

(11 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the next section, we show how to exploit [11,12] to characterize the long-term utility region and construct a practical transmission strategy. In Section 2.4, we will show how to integrate the strategic stability 3 property into this strategy, this property being important to ensure that selfish nodes effectively implement the efficient strategies.…”

Section: Repeated Game Formulation Of the Problemmentioning

confidence: 99%

“…The proposed incentive mechanism combines the ideas of credit and reputation. To our knowledge, the closest existing incentive mechanism to the one proposed in the present paper is given by ICARUS in [3,6], and [8]. Here, we go further by dealing with the problem of imperfect observation and that of credit outage or excess.…”

Section: Introductionmentioning

confidence: 96%

“…Therefore, nodes are in the situation where they have to relay packets, but have at the same time to manage the energy they spend for helping other nodes, and therefore exhibiting selfish behavior. To stimulate cooperation, incentive mechanisms have to be implemented [1][2][3][4][5][6][7]. The vast majority of incentive mechanisms either rely on the idea of reputation [4,5,8] or the use of a credit system [9,10].…”

Section: Introductionmentioning

confidence: 99%

“…While providing an efficient solution, all the corresponding models still have some limitations, especially regarding the link quality fluctuations and partial knowledge at the nodes; indeed, they do not take into account the quality of the link between the transmitting and the receiving nodes, which may be an important issue since the link quality may strongly fluctuate if it is wireless. The solution in [3,6], and [8] referred to as ICARUS (hybrId inCentive mechAnism for coopeRation stimUlation in ad hoc net-workS) combines the two ideas, namely, reputation and credit system, but it is not suited to scenarios where the actions of the other nodes are not perfectly observed, which results, e.g., in inappropriate punishment (a node is declared selfish while it is cooperative) and therefore in a loss of efficiency. Additionally, in these works, when a node is out of credit, the transmission is blocked and the node cannot send any packet anymore; this might be not practical in some wireless networks where a certain quality of service has to be provided.…”

Section: Introductionmentioning

confidence: 99%

“…As a sample result, the network-consumed power is shown to be divided by more than two w.r.t. state-of-the art strategies [1,3,5,8].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Efficient packet transmission in wireless ad hoc networks with partially informed nodes

Berri

Lasaulce

Radjef

2019

J Wireless Com Network

View full text Add to dashboard Cite

One formal way of studying cooperation and incentive mechanisms in wireless ad hoc networks is to use game theory. In this respect, simple interaction models such as the forwarder's dilemma have been proposed and used successfully. However, this type of models is not suited to account for possible fluctuations of the wireless links of the network. Additionally, it does not allow one to study the way a node transmits its own packets. At last, the repeated game models used in the related literature do not allow the important scenario of nodes with partial information (about the link state and nodes actions) to be studied. One of the contributions of the present work is precisely to provide a general approach to integrate all of these aspects. Second, the best performance the nodes can achieve under partial information is fully characterized for a general form of utilities. Third, we derive an equilibrium transmission strategy which allows a node to adapt its transmit power levels and packet forwarding rate to link fluctuations and other node actions. The derived results are illustrated through a detailed numerical analysis for a network model built from a generalized version of the forwarder's dilemma. The analysis shows in particular that the proposed strategy is able to operate in the presence of channel fluctuations and to perform significantly better than the existing transmission mechanisms (e.g., in terms of consumed network energy).

show abstract

Section: Repeated Game Formulation Of the Problemmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 96%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…As a sample result, the network-consumed power is shown to be divided by more than two w.r.t. state-of-the art strategies [1,3,5,8].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Efficient packet transmission in wireless ad hoc networks with partially informed nodes

Berri

Lasaulce

Radjef

2019

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

A Bio inspired optimization with Reliable QoS Routing through Efficient Packet Transmission in Mobile ad-hoc Network

Subbaiah

Govinda

2022

Renewable Energy Focus

View full text Add to dashboard Cite

Antilizer

Tomić

Chen

Breza

et al. 2018

Proceedings of the 15th EAI International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services

View full text Add to dashboard Cite

Wireless Sensor Network (WSN) applications range from domestic Internet of Things systems like temperature monitoring of homes to the monitoring and control of large-scale critical infrastructures. The greatest risk with the use of WSNs in critical infrastructure is their vulnerability to malicious network level attacks. Their radio communication network can be disrupted, causing them to lose or delay data which will compromise system functionality. This paper presents Antilizer, a lightweight, fully-distributed solution to enable WSNs to detect and recover from common network level attack scenarios. In Antilizer each sensor node builds a self-referenced trust model of its neighbourhood using network overhearing. The node uses the trust model to autonomously adapt its communication decisions. In the case of a network attack, a node can make neighbour collaboration routing decisions to avoid affected regions of the network. Mobile agents further bound the damage caused by attacks. These agents enable a simple notification scheme which propagates collaborative decisions from the nodes to the base station. A filtering mechanism at the base station further validates the authenticity of the information shared by mobile agents. We evaluate Antilizer in simulation against several routing attacks. Our results show that Antilizer reduces data loss down to 1% (4% on average), with operational overheads of less than 1% and provides fast network-wide convergence.

show abstract

Trust-based Scheme for Cheating and Collusion Detection in Wireless Multihop Networks

Cited by 5 publications

References 18 publications

Efficient packet transmission in wireless ad hoc networks with partially informed nodes

Efficient packet transmission in wireless ad hoc networks with partially informed nodes

A Bio inspired optimization with Reliable QoS Routing through Efficient Packet Transmission in Mobile ad-hoc Network

Antilizer

Contact Info

Product

Resources

About