“…BCH is an error correcting code technique that is suitable for WSNs due to its properties of enhancing the efficiency of the energy by 23% [20]. BCH was selected by [21] to be scrambled to reduce the between the eavesdropper and the legitimate receiver. In this section, BCH has been evaluated without using the scrambling techniques and compared against Reed Solomon without scrambling.…”
“…The BCH codes acchives high compared with LDPC codes. Thus, BCH is introduced with additional techniques such as scrambling [21]. Scrambling the data bits is employed as an additional strategy to improve the security by decreasing the gap between the eavesdropper node and legitimate receiver.…”
Despite the rapid growth in the market demanding for wireless sensor networks (WSNs), they are far from being secured or efficient. WSNs are vulnerable to malicious attacks and utilize too much power. At the same time, there is a significant increment of the security threats due to the growth of the several applications that employ wireless sensor networks. Therefore, introducing physical layer security is considered to be a promising solution to mitigate the threats. This paper evaluates popular coding techniques like Reed solomon (RS) techniques and scrambled error correcting codes specifically in terms of security gap. The difference between the signal to nose ratio (SNR) of the eavesdropper and the legitimate receiver nodes is defined as the security gap. We investigate the security gap, energy efficiency, and bit error rate between RS and scrambled t-error correcting codes for wireless sensor networks. Lastly, energy efficiency in RS and Bose-Chaudhuri-Hocquenghem (BCH) is also studied. The results of the simulation emphasize that RS technique achieves similar security gap as scrambled error correcting codes. However, the analysis concludes that the computational complexities of the RS is less compared to the scrambled error correcting codes. We also found that BCH code is more energy-efficient than RS.
“…BCH is an error correcting code technique that is suitable for WSNs due to its properties of enhancing the efficiency of the energy by 23% [20]. BCH was selected by [21] to be scrambled to reduce the between the eavesdropper and the legitimate receiver. In this section, BCH has been evaluated without using the scrambling techniques and compared against Reed Solomon without scrambling.…”
“…The BCH codes acchives high compared with LDPC codes. Thus, BCH is introduced with additional techniques such as scrambling [21]. Scrambling the data bits is employed as an additional strategy to improve the security by decreasing the gap between the eavesdropper node and legitimate receiver.…”
Despite the rapid growth in the market demanding for wireless sensor networks (WSNs), they are far from being secured or efficient. WSNs are vulnerable to malicious attacks and utilize too much power. At the same time, there is a significant increment of the security threats due to the growth of the several applications that employ wireless sensor networks. Therefore, introducing physical layer security is considered to be a promising solution to mitigate the threats. This paper evaluates popular coding techniques like Reed solomon (RS) techniques and scrambled error correcting codes specifically in terms of security gap. The difference between the signal to nose ratio (SNR) of the eavesdropper and the legitimate receiver nodes is defined as the security gap. We investigate the security gap, energy efficiency, and bit error rate between RS and scrambled t-error correcting codes for wireless sensor networks. Lastly, energy efficiency in RS and Bose-Chaudhuri-Hocquenghem (BCH) is also studied. The results of the simulation emphasize that RS technique achieves similar security gap as scrambled error correcting codes. However, the analysis concludes that the computational complexities of the RS is less compared to the scrambled error correcting codes. We also found that BCH code is more energy-efficient than RS.
“…Consequently, the effective sum capacity achievable by both users will be improved. Although the sum capacity improvement is achieved by using the SIC operation, the total required computational complexity will further increase as the number of cellular network users is on the rising trend [18][19][20]. Therefore, the need for a user grouping and bandwidth allocation mechanism with a relatively lower computational complexity is higher.…”
The increasing demand for wireless network connections requires efficient network resource allocation. The non-orthogonal multiple access (NOMA) technology offers users sharing the same radio bandwidth to increase the bandwidth efficiency. However, the increase in the number of users demanding for the radio bandwidth and network connections will increase the required computational load for grouping the users to share the radio resources. This paper studies a heuristic method for grouping the users based on the discrete particle swarm optimization. The throughput, the average square error and the fitness function values obtained by the proposed method and the existing schemes are measured and observed. It has been demonstrated that the proposed scheme based on discrete particle swarm optimization has produced the throughput close to the upper limit. The convergence of the proposed method is mainly less than 10 iterations at different numbers of resource blocks.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.