Incentive-compatible opportunistic routing for wireless networks

Wu, Fan; Chen, Tingting; Li, Li Erran; Yang, Yang Richard

doi:10.1145/1409944.1409979

Cited by 67 publications

(35 citation statements)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To defend against other cheating and malicious behavior in measuring link loss probabilities, i.e. submitting untruthful reports, both cryptographic and incentive-mechanism approaches can be used [22]. …”

Section: Algorithm 1 Etx-determining Algorithm (Eda)mentioning

confidence: 99%

Wormhole Attack Detection Algorithms in Wireless Network Coding Systems

Chen

Zhong

2015

IEEE Trans. on Mobile Comput.

Self Cite

View full text Add to dashboard Cite

Abstract:Network coding has been shown to be an effective approach to improve the wireless system performance. However, many security issues impede its wide deployment in practice. Besides the well-studied pollution attacks, there is another severe threat, that of wormhole attacks, which undermines the performance gain of network coding. Since the underlying characteristics of network coding systems are distinctly different from traditional wireless networks, the impact of wormhole attacks and countermeasures are generally unknown. In this thesis, we quantify wormholes' devastating harmful impact on network coding system performance through experiments. Firstly, we propose a centralized algorithm to detect wormholes and show its correctness rigorously. For the distributed wireless network, we propose DAWN, a Distributed detection Algorithm against Wormhole in wireless Network coding systems, by exploring the change of the flow directions of the innovative packets caused by wormholes. We rigorously prove that DAWN guarantees a good lower bound of successful detection rate. We perform analysis on the resistance of DAWN against collusion attacks. We find that the robustness depends on the node density in the network, and prove a necessary condition to achieve collusion-resistance. DAWN does not rely on any location information, global synchronization assumptions or special hardware/middleware. It is only based on the local information that can be obtained from regular network coding protocols, and thus the overhead of our algorithms is tolerable. Extensive experimental results have verified the effectiveness and the efficiency of DAWN.iii

show abstract

Section: Algorithm 1 Etx-determining Algorithm (Eda)mentioning

confidence: 99%

Wormhole Attack Detection Algorithms in Wireless Network Coding Systems

Chen

Zhong

2015

IEEE Trans. on Mobile Comput.

Self Cite

View full text Add to dashboard Cite

show abstract

“…The power-efficient gathering in sensor information systems [12] is a voracious chain-based power efficient algorithm. In addition, PEGASIS is based on LEACH.…”

Section: Pegasismentioning

confidence: 99%

Energy Proficient and Security Protocol for WSN: AODV

Kumar¹,

Sharma²

2014

IJCA

View full text Add to dashboard Cite

Wireless sensor network is extensively used technology now a day in real time application. It consists of a number of autonomous sensor nodes which are organized in various areas of interest to accumulate data and jointly convey that data back to a base station. But the sensor node has limited battery energy and it is also found that the WSN more vulnerable to severe kinds of security threats such as denial of service (DOS), Sybil, hello flood attack etc. In this, we proposed group communication using election algorithm to make the network most energy efficient and also make the network secure. The simulation of the proposed methodology is done between different network parameter such as PDR, end-to-end delay, throughput and energy consumption using the network simulator NS-2.34.

show abstract

“…Incentive compatible routing in the context of network coding has been studied by Wu et al [28]. They propose a method that stimulates wireless nodes' cooperation in the procedure of computing how many transmissions each node should make to forward each packet.…”

Section: Overheads In Stable Statementioning

confidence: 99%

“…These are two closely related, but completely different procedures. The incentive compatible routing problem in wireless networks using MORE has been studied by Wu et al [28]. They propose a protocol that gives nodes incentives to honestly measure and report link loss probabilities in the routing procedure, and prove that following the protocol in the routing procedure is to the best interest of user nodes.…”

Section: Introductionmentioning

confidence: 99%

INPAC: An Enforceable Incentive Scheme for Wireless Networks using Network Coding

Chen

2010

2010 Proceedings IEEE INFOCOM

Self Cite

View full text Add to dashboard Cite

Abstract-Wireless mesh networks have been widely deployed to provide broadband network access, and their performance can be significantly improved by using a new technology called network coding. In a wireless mesh network using network coding, selfish nodes may deviate from the protocol when they are supposed to forward packets. This fundamental problem of packet forwarding incentives is closely related to the incentive compatible routing problem in wireless mesh networks using network coding, and to the incentive compatible packet forwarding problem in conventional wireless networks, but different from both of them. In this paper, we propose INPAC, the first incentive scheme for this fundamental problem, which uses a combination of game theoretic and cryptographic techniques to solve it. We formally prove that, if INPAC is used, then following the protocol faithfully is a subgame perfect equilibrium. To make INPAC more practical, we also provide an extension that achieves two improvements: (a) an online authority is no longer needed; (b) the computation and communication overheads are reduced. We have implemented and evaluated INPAC on the Orbit Lab testbed. Our evaluation results verify the incentive compatibility of INPAC and demonstrate that it is efficient.

show abstract

Incentive-compatible opportunistic routing for wireless networks

Cited by 67 publications

References 43 publications

Wormhole Attack Detection Algorithms in Wireless Network Coding Systems

Wormhole Attack Detection Algorithms in Wireless Network Coding Systems

Energy Proficient and Security Protocol for WSN: AODV

INPAC: An Enforceable Incentive Scheme for Wireless Networks using Network Coding

Contact Info

Product

Resources

About