Mixed and Continuous Strategy Monitor-Forward Game Based Selective Forwarding Solution in WSN

Liao, Hongmei; Ding, Shifei

doi:10.1155/2015/359780

Cited by 7 publications

(8 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…where G x = φ Q x , G ϕ = φ Φ with symmetric matrix Φ satisfying Q x ( τ I − Q x ) − 1 Q x − Φ ≺ true¯ 0 (refer the proof in Appendix 1). We clarify that Liao and Ding 4 is a convex problem and can be solved using off-the-shelf convex optimization solvers, such as CVX 29 (note that Lin et al 16 adopted the bisection method to solve equation (3) in an iterative way. Since their subproblem is also SDP and similar to equation (5), the whole computational complexity is n times of our algorithm, with n denoting the number of iterations which has also been validated by Figure 5 in section “Simulations and discussions”).…”

Section: Df Beamforming With Preferred Power Supplymentioning

confidence: 99%

“…3 As such, some two-tiered relay network architectures have been investigated to extend the lifetime of WSNs. 4,5…”

Section: Introductionmentioning

confidence: 99%

“…3 As such, some two-tiered relay network architectures have been investigated to extend the lifetime of WSNs. 4,5 Due to the possible failure of some sensor nodes, the WSNs may be divided into several isolated blocks. To this end, an alternative solution is to settle relay sensor nodes to reconnect such blocks.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Joint beamforming and cooperative jamming for secure transmission in multi-antenna decode-and-forward relaying sensor networks: A greedy switching strategy

Lin

Li²,

Gao

et al. 2017

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

In wireless sensor networks, sensor nodes are deployed to collect data and deliver the sensed information to a base station in a wireless manner. Due to the broadcast nature of wireless sensor communications, relay-sensor-based secure transmission remains a challenging issue. This article proposes a joint cooperative beamforming and jamming scheme in the relay wireless sensor networks, where the switching strategy from cooperative beamforming to cooperative jamming is applied to weaken the signal-to-interference-plus-noise ratio of the eavesdropper when the decoding threshold is not triggered. In particular, based on Charnes-Cooper transformation and S-procedure, semi-definite programming is constructed to solve the robust cooperative beamforming and jamming with a low implementation complexity, respectively. Additionally, we adopt the global power constraints in semi-definite programming to take full exploitation of the power at relay sensor. Finally, simulation results demonstrate the superiority of the proposed scheme in comparison with the traditional decode-and-forward robust scheme and the non-robust scheme.

show abstract

Section: Df Beamforming With Preferred Power Supplymentioning

confidence: 99%

“…3 As such, some two-tiered relay network architectures have been investigated to extend the lifetime of WSNs. 4,5…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Joint beamforming and cooperative jamming for secure transmission in multi-antenna decode-and-forward relaying sensor networks: A greedy switching strategy

Lin

Li²,

Gao

et al. 2017

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…Liao and Ding [ 8 ] suggested a trust mechanism for identifying and removing malicious nodes established between the sending node and its one-hop neighbor nodes, a hybrid continuous strategy monitor-forward game, and it can effectively reduce the error rate of packet loss detection in unreliable radio channels. Hu [ 9 ] designs a security mechanism based on monitoring nodes, which are energy-heterogeneous nodes with the function of only monitoring but not forwarding, to suppress the malicious nodes’ insider attacks.…”

Section: Related Workmentioning

confidence: 99%

A Security Mechanism for Cluster-Based WSN against Selective Forwarding

Zhou

Feng

et al. 2016

Sensors

View full text Add to dashboard Cite

A wireless sensor network (WSN) faces a number of outsider and insider attacks, and it is difficult to detect and defend against insider attacks. In particular, an insider selective-forwarding attack, in which the attackers select some of the received packets to drop, most threatens a WSN. Compared to a distributed WSN, a cluster-based WSN will suffer more losses, even the whole network’s destruction, if the cluster head is attacked. In this paper, a scheme solving the above issues is proposed with three types of nodes, the Cluster Head (CH), the Inspector Node (IN) and Member Nodes (MNs). The IN monitors the CH’s transmission to protect the cluster against a selective-forwarding attack; the CH forwards packets from MNs and other CHs, and randomly checks the IN to ascertain if it works properly; and the MNs send the gathered data packets to the CH and evaluate the behaviors of the CH and IN based on their own reputation mechanism. The novelty of our scheme is that in order to take both the safety and the lifespan of a network into consideration, the composite reputation value (CRV) including forwarding rate, detecting malicious nodes, and surplus energy of the node is utilized to select CH and IN under the new suggested network arrangement, and the use of a node’s surplus energy can balance the energy consumption of a node, thereby prolonging the network lifespan. Theoretical analysis and simulation results indicate that the proposed scheme can detect the malicious node accurately and efficiently, so the false alarm rate is lowered by 25.7% compared with Watchdog and the network lifespan is prolonged by 54.84% compared with LEACH (Low Energy Adaptive Clustering Hierarchy).

show abstract

“…A repeated continued non cooperative game for detecting selective discard attacks was introduced in (Liao and Ding, 2015). In this algorithm, nodes monitor their neighbors in order to find more reliable neighbors.…”

Section: Introductionmentioning

confidence: 99%

A Solution for Prevention of Selective Dropping and Selfish Attacks in Opportunistic Networks

Rashidibajgan

2017

Proceedings of the 2nd International Conference on Internet of Things, Big Data and Security

View full text Add to dashboard Cite

Opportunistic Networks (OppNet) are based on routing messages from a node to another node, from a source to the destination. There is not a connection to the Internet in these networks and nodes play routers role, So it is important that all of the nodes participate in the routing protocol. These networks have high potential to vulnerable against "Dropping and Selective Dropping Attacks" and "Selfish attacks". Some nodes may prefer to discard some messages in order to save their Battery life, memory space and so on, while they use the network services. It causes an interruption in the network and makes a high delay for messages. In this paper, we propose a new method based on Game Theory to prevent these attacks against OppNet, and we will prove that our strategy is a Nash equilibrium. Also we will discuss that our algorithm is resistance against various attacks.

show abstract

Mixed and Continuous Strategy Monitor-Forward Game Based Selective Forwarding Solution in WSN

Cited by 7 publications

References 35 publications

Joint beamforming and cooperative jamming for secure transmission in multi-antenna decode-and-forward relaying sensor networks: A greedy switching strategy

Joint beamforming and cooperative jamming for secure transmission in multi-antenna decode-and-forward relaying sensor networks: A greedy switching strategy

A Security Mechanism for Cluster-Based WSN against Selective Forwarding

A Solution for Prevention of Selective Dropping and Selfish Attacks in Opportunistic Networks

Contact Info

Product

Resources

About