A Hybrid Secure Scheme for Wireless Sensor Networks against Timing Attacks Using Continuous-Time Markov Chain and Queueing Model

Meng, Tobias; Li, Xiaofan; Sha, Zhang; Zhao, Y. B.

doi:10.3390/s16101606

Cited by 9 publications

(7 citation statements)

References 32 publications

(33 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It ranges from the analysis of service chains to arbitrary complex queues of huge network systems. It is usually used to analyze the probability distribution in a continuous-state space [44,45]. Several models of queuing systems are represented by Kendall's notation to classify system types and their queuing events.…”

Section: Queuing Theorymentioning

confidence: 99%

Simulation Model for Blockchain Systems Using Queuing Theory

Memon

Ahmed

2019

Electronics

View full text Add to dashboard Cite

In recent years, blockchains have obtained so much attention from researchers, engineers, and institutions; and the implementation of blockchains has started to revive a large number of applications ranging from e-finance, e-healthcare, smart home, Internet of Things, social security, logistics and so forth. In the literature on blockchains, it is found that most articles focused on their engineering implementation, while little attention has been devoted to the exploration of theoretical aspects of the system; however, the existing work is limited to model the mining process only. In this paper, a queuing theory-based model is proposed for understanding the working and theoretical aspects of the blockchain. We validate our proposed model using the actual statistics of two popular cryptocurrencies, Bitcoin and Ethereum, by running simulations for two months of transactions. The obtained performance measures parameters such as the Number of Transactions per block, Mining Time of Each Block, System Throughput, Memorypool count, Waiting Time in Memorypool, Number of Unconfirmed Transactions in the Whole System, Total Number of Transactions, and Number of Generated Blocks; these values are compared with actual statistics. It was found that the results gained from our proposed model are in good agreement with actual statistics. Although the simulation in this paper presents the modeling of blockchain-based cryptocurrencies only, the proposed model can be used to represent a wide range of blockchain-based systems.

show abstract

Section: Queuing Theorymentioning

confidence: 99%

Simulation Model for Blockchain Systems Using Queuing Theory

Memon

Ahmed

2019

Electronics

View full text Add to dashboard Cite

show abstract

“…This technique is generally used when the various performance metrics of WSNs are calculated. For example, these metrics include the effectiveness of battery recovery [ 39 ], characteristics of Rayleigh fading channels [ 40 ], the average number of successful transmissions completed by WSN nodes [ 41 ], and the effectiveness of protection against timing attacks [ 42 ]. Here, we consider the impact of a DoB attack, as well as the sensor battery capacity, on the system lifetime.…”

Section: Dob Analysismentioning

confidence: 99%

“…It is a commonly used survivability metric [ 42 , 44 ]. MTTF provides the mean time it takes for the sensor to reach the failure state for a given initial state of the sensor.…”

Section: Dob Analysismentioning

confidence: 99%

Depletion-of-Battery Attack: Specificity, Modelling and Analysis

Shakhov

Koo

2018

Sensors

View full text Add to dashboard Cite

The emerging Internet of Things (IoT) has great potential; however, the societal costs of the IoT can outweigh its benefits. To unlock IoT potential, there needs to be improvement in the security of IoT applications. There are several standardization initiatives for sensor networks, which eventually converge with the Internet of Things. As sensor-based applications are deployed, security emerges as an essential requirement. One of the critical issues of wireless sensor technology is limited sensor resources, including sensor batteries. This creates a vulnerability to battery-exhausting attacks. Rapid exhaustion of sensor battery power is not only explained by intrusions, but can also be due to random failure of embedded sensor protocols. Thus, most wireless sensor applications, without tools to defend against rash battery exhausting, would be unable to function during prescribed times. In this paper, we consider a special type of threat, in which the harm is malicious depletion of sensor battery power. In contrast to the traditional denial-of-service attack, quality of service under the considered attack is not necessarily degraded. Moreover, the quality of service can increase up to the moment of the sensor set crashes. We argue that this is a distinguishing type of attack. Hence, the application of a traditional defense mechanism against this threat is not always possible. Therefore, effective methods should be developed to counter the threat. We first discuss the feasibility of rash depletion of battery power. Next, we propose a model for evaluation of energy consumption when under attack. Finally, a technique to counter the attack is discussed.

show abstract

“…Hence, it also needs same computing with cluster members. Then, CHSD of one node will be calculated by Equations (5)- (7). This process actually need no data transmission except for the computing of CHSD.…”

Section: The Process Of Cluster Establishmentmentioning

confidence: 99%

“…In order to assist other nodes in the network to build information links, nodes can be used as router or terminal or both of them [3,4]. Mobile Ad hoc sensor network can be utilized in these scenarios, such as military and habitat monitoring [5,6], target tracking network [7,8]. For example, in the animal tracking system, sensor nodes are loaded on the body of animals in order to observing animal behavior.…”

Section: Introductionmentioning

confidence: 99%

A Robust and Energy-Efficient Weighted Clustering Algorithm on Mobile Ad Hoc Sensor Networks †

Liu

Xiao

et al. 2018

Algorithms

View full text Add to dashboard Cite

In an Ad hoc sensor network, nodes have characteristics of limited battery energy, self-organization and low mobility. Due to the mobility and heterogeneity of the energy consumption in the hierarchical network, the cluster head and topology are changed dynamically. Therefore, topology control and energy consumption are growing to be critical in enhancing the stability and prolonging the lifetime of the network. In order to improve the survivability of Ad hoc network effectively, this paper proposes a new algorithm named the robust, energy-efficient weighted clustering algorithm (RE2WCA). For the homogeneous of the energy consumption; the proposed clustering algorithm takes the residual energy and group mobility into consideration by restricting minimum iteration times. In addition, a distributed fault detection algorithm and cluster head backup mechanism are presented to achieve the periodic and real-time topology maintenance to enhance the robustness of the network. The network is analyzed and the simulations are performed to compare the performance of this new clustering algorithm with the similar algorithms in terms of cluster characteristics, lifetime, throughput and energy consumption of the network. The result shows that the proposed algorithm provides better performance than others.

show abstract

A Hybrid Secure Scheme for Wireless Sensor Networks against Timing Attacks Using Continuous-Time Markov Chain and Queueing Model

Cited by 9 publications

References 32 publications

Simulation Model for Blockchain Systems Using Queuing Theory

Simulation Model for Blockchain Systems Using Queuing Theory

Depletion-of-Battery Attack: Specificity, Modelling and Analysis

A Robust and Energy-Efficient Weighted Clustering Algorithm on Mobile Ad Hoc Sensor Networks †

Contact Info

Product

Resources

About