Pub Date : 2022-06-01DOI: 10.1177/15501329221104352
Nan Zhao, Qixuan Wan, Jinlian Chen, Minghu Wu
By utilizing the mobile terminals’ sensing and computing capabilities, mobile crowdsourcing network is considered to be a promising technology to support the various large-scale sensing applications. However, considering the limited resources and security issue, mobile users may be unwilling to participate in crowdsourcing without any incentive. In this work, by combining reputation and contract theory, a dynamic long-term incentive mechanism is proposed to attract the mobile users to participate in mobile crowdsourcing networks. A two-period dynamic contract is first investigated to deal with the asymmetric information problem in the crowdsourcing tasks. Reputation strategy is then introduced to further attract the mobile users to complete the long-term crowdsourcing tasks. The optimal contracts are designed to obtain the maximum expected utility of service provider with reputation strategy and without reputation strategy, respectively. Simulation results demonstrate that the long-term crowdsourcing tasks can be guaranteed by combining the contract’s explicit incentive with the reputation’s implicit incentive. The incentive mechanism can gain a higher expected utility, the more implicit reputation effect factor.
{"title":"Dynamic incentive mechanism in mobile crowdsourcing networks by combining reputation and contract theory","authors":"Nan Zhao, Qixuan Wan, Jinlian Chen, Minghu Wu","doi":"10.1177/15501329221104352","DOIUrl":"https://doi.org/10.1177/15501329221104352","url":null,"abstract":"By utilizing the mobile terminals’ sensing and computing capabilities, mobile crowdsourcing network is considered to be a promising technology to support the various large-scale sensing applications. However, considering the limited resources and security issue, mobile users may be unwilling to participate in crowdsourcing without any incentive. In this work, by combining reputation and contract theory, a dynamic long-term incentive mechanism is proposed to attract the mobile users to participate in mobile crowdsourcing networks. A two-period dynamic contract is first investigated to deal with the asymmetric information problem in the crowdsourcing tasks. Reputation strategy is then introduced to further attract the mobile users to complete the long-term crowdsourcing tasks. The optimal contracts are designed to obtain the maximum expected utility of service provider with reputation strategy and without reputation strategy, respectively. Simulation results demonstrate that the long-term crowdsourcing tasks can be guaranteed by combining the contract’s explicit incentive with the reputation’s implicit incentive. The incentive mechanism can gain a higher expected utility, the more implicit reputation effect factor.","PeriodicalId":50327,"journal":{"name":"International Journal of Distributed Sensor Networks","volume":" ","pages":""},"PeriodicalIF":2.3,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46188061","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this article, we studied the robust security transmission design for multi-user peer-to-peer relay networks, where all users demand secure communication and the eavesdropper is passive. Although the previous researches have designed the physical-layer security schemes under perfect channel state information, this study focuses on investigating the robust transmission design in the presence of a passive eavesdropper. Our goal is to maximize the artificial noise power to confuse the passive eavesdropper and subject to the worst-case signal-to-interference-noise-ratio constraints for all users under a bounded spherical region for the norm of the channel state information error vector from the relays to the destinations and the individual power constraints of all relay nodes. Mathematically, the original robust problem is difficult to solve due to its non-linearity and non-convexity. We propose to adopt S-Procedure and rank relaxation techniques to convert it to a semidefinite programming convex problem. The numerical results show the advantage of the proposed robust method.
{"title":"Robust security transmission design for multi-user peer-to-peer wireless relay networks","authors":"Dongmei Yang, Hongjun Li, Baoquan Ren, Xudong Zhong","doi":"10.1177/15501329221107582","DOIUrl":"https://doi.org/10.1177/15501329221107582","url":null,"abstract":"In this article, we studied the robust security transmission design for multi-user peer-to-peer relay networks, where all users demand secure communication and the eavesdropper is passive. Although the previous researches have designed the physical-layer security schemes under perfect channel state information, this study focuses on investigating the robust transmission design in the presence of a passive eavesdropper. Our goal is to maximize the artificial noise power to confuse the passive eavesdropper and subject to the worst-case signal-to-interference-noise-ratio constraints for all users under a bounded spherical region for the norm of the channel state information error vector from the relays to the destinations and the individual power constraints of all relay nodes. Mathematically, the original robust problem is difficult to solve due to its non-linearity and non-convexity. We propose to adopt S-Procedure and rank relaxation techniques to convert it to a semidefinite programming convex problem. The numerical results show the advantage of the proposed robust method.","PeriodicalId":50327,"journal":{"name":"International Journal of Distributed Sensor Networks","volume":" ","pages":""},"PeriodicalIF":2.3,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48831047","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Accurate assessment of wet aggregate stability is critical in evaluating soil quality. However, a few general models are used to assess it. In this work, we use the support vector machine to evaluate wet aggregate stability and compare it with a benchmark model based on artificial neural networks. One hundred thirty-four soil samples from various land uses, such as crops, grasslands, and bare land are adopted to verify the effectiveness of the proposed method and confirm the valid input parameters. We select 107 samples for calibrating the prediction model and the rest for evaluation. Experiments show that organic carbon is the main control parameter of wet aggregate stability, although the most influential factors for different land use are various. Comparing the determination coefficient and the root mean square error, it proves that the support vector machine method is superior to the artificial neural network method. In addition, the relative importance analysis shows that contents of organic carbon, silt, and clay are the primary input parameters. Finally, the impact of land use and management types is evaluated.
{"title":"Wet aggregate stability modeling based on support vector machine in multiuse soils","authors":"Ruizhi Zhai, Jianping Wang, Deshun Yin, Ziheng Shangguan","doi":"10.1177/15501329221107573","DOIUrl":"https://doi.org/10.1177/15501329221107573","url":null,"abstract":"Accurate assessment of wet aggregate stability is critical in evaluating soil quality. However, a few general models are used to assess it. In this work, we use the support vector machine to evaluate wet aggregate stability and compare it with a benchmark model based on artificial neural networks. One hundred thirty-four soil samples from various land uses, such as crops, grasslands, and bare land are adopted to verify the effectiveness of the proposed method and confirm the valid input parameters. We select 107 samples for calibrating the prediction model and the rest for evaluation. Experiments show that organic carbon is the main control parameter of wet aggregate stability, although the most influential factors for different land use are various. Comparing the determination coefficient and the root mean square error, it proves that the support vector machine method is superior to the artificial neural network method. In addition, the relative importance analysis shows that contents of organic carbon, silt, and clay are the primary input parameters. Finally, the impact of land use and management types is evaluated.","PeriodicalId":50327,"journal":{"name":"International Journal of Distributed Sensor Networks","volume":" ","pages":""},"PeriodicalIF":2.3,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44522315","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-01DOI: 10.1177/15501329221107868
Shabir Ahmad, Salman Khan, Faisal Jamil, Faiza Qayyum, Abid Ali, Do-Hyeun Kim
Many real-life problems have different contradicting goals and no simple solution. Therefore, an analysis is made to select the appropriate solution based on the scenario, which is considered the best compromise toward the achievement of a goal. In literature, it is known as complex problem-solving and is a kind of paradigm that has been around since the last century, but the cognition involved in complex problem-solving has purely relied on experts in the field. However, with the evolution of the current stack of technologies such as artificial intelligence and the Internet of Things, it is quite possible to perform the cognition process with the help of machines based on the previously-trained historical data. Our previous work proposed the complex problem-solving as a service for smart cities. In this article, we extend this work and propose a generic architecture for complex problem-solving using task orchestration and predictive optimization in Internet of Things–enabled generic smart space. The proposed framework makes use of historical data for artificial cognition of the complexity of the given problem. For this, predictive optimization is used, which identifies the problem and intelligently predict the solution based on the given constraints. The task orchestration architecture is used to decompose the complex problem into small tasks for real-world deployment into sensors and actuators. The architecture is evaluated against different load conditions and different categories of problems, and the results suggest that the proposed architecture can be used a commonplace for different smart space solutions.
{"title":"Design of a general complex problem-solving architecture based on task management and predictive optimization","authors":"Shabir Ahmad, Salman Khan, Faisal Jamil, Faiza Qayyum, Abid Ali, Do-Hyeun Kim","doi":"10.1177/15501329221107868","DOIUrl":"https://doi.org/10.1177/15501329221107868","url":null,"abstract":"Many real-life problems have different contradicting goals and no simple solution. Therefore, an analysis is made to select the appropriate solution based on the scenario, which is considered the best compromise toward the achievement of a goal. In literature, it is known as complex problem-solving and is a kind of paradigm that has been around since the last century, but the cognition involved in complex problem-solving has purely relied on experts in the field. However, with the evolution of the current stack of technologies such as artificial intelligence and the Internet of Things, it is quite possible to perform the cognition process with the help of machines based on the previously-trained historical data. Our previous work proposed the complex problem-solving as a service for smart cities. In this article, we extend this work and propose a generic architecture for complex problem-solving using task orchestration and predictive optimization in Internet of Things–enabled generic smart space. The proposed framework makes use of historical data for artificial cognition of the complexity of the given problem. For this, predictive optimization is used, which identifies the problem and intelligently predict the solution based on the given constraints. The task orchestration architecture is used to decompose the complex problem into small tasks for real-world deployment into sensors and actuators. The architecture is evaluated against different load conditions and different categories of problems, and the results suggest that the proposed architecture can be used a commonplace for different smart space solutions.","PeriodicalId":50327,"journal":{"name":"International Journal of Distributed Sensor Networks","volume":" ","pages":""},"PeriodicalIF":2.3,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46559617","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-01DOI: 10.1177/15501329221104330
Miao Zhang, Yao Zhang, Q. Cen, Shixun Wu
Machine learning techniques, especially deep learning algorithms have been widely utilized to deal with different kinds of research problems in wireless communications. In this article, we investigate the secrecy rate maximization problem in a non-orthogonal multiple access network based on deep learning approach. In this non-orthogonal multiple access network, the base station intends to transmit two integrated information: a confidential information to user 1 (the strong user) and a broadcast information to user 1 and user 2. In addition, there exists an eavesdropper that intends to decode the confidential information due to the broadcast nature of radio waves. Hence, we formulate the optimization problem as a secrecy rate maximization problem. We first solve this problem by employing convex optimization technique, then we generate the training, validation, and test dataset. We propose a deep neural network–based approach to learn to optimize the resource allocations. The advantages of the proposed deep neural network are the capabilities to achieve low complexity and latency resource allocations. Simulation results are provided to show that the proposed deep neural network approach is capable of reaching near-optimal secrecy rate performance with significantly reduced computational time, when compared with the benchmark conventional approach.
{"title":"Deep learning–based resource allocation for secure transmission in a non-orthogonal multiple access network","authors":"Miao Zhang, Yao Zhang, Q. Cen, Shixun Wu","doi":"10.1177/15501329221104330","DOIUrl":"https://doi.org/10.1177/15501329221104330","url":null,"abstract":"Machine learning techniques, especially deep learning algorithms have been widely utilized to deal with different kinds of research problems in wireless communications. In this article, we investigate the secrecy rate maximization problem in a non-orthogonal multiple access network based on deep learning approach. In this non-orthogonal multiple access network, the base station intends to transmit two integrated information: a confidential information to user 1 (the strong user) and a broadcast information to user 1 and user 2. In addition, there exists an eavesdropper that intends to decode the confidential information due to the broadcast nature of radio waves. Hence, we formulate the optimization problem as a secrecy rate maximization problem. We first solve this problem by employing convex optimization technique, then we generate the training, validation, and test dataset. We propose a deep neural network–based approach to learn to optimize the resource allocations. The advantages of the proposed deep neural network are the capabilities to achieve low complexity and latency resource allocations. Simulation results are provided to show that the proposed deep neural network approach is capable of reaching near-optimal secrecy rate performance with significantly reduced computational time, when compared with the benchmark conventional approach.","PeriodicalId":50327,"journal":{"name":"International Journal of Distributed Sensor Networks","volume":" ","pages":""},"PeriodicalIF":2.3,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43185229","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-01DOI: 10.1177/15501329221102734
Ling Wu, Yongrong Sun, Xiyu Fu, Qing-hua Zeng
The carrier-based kinematic-to-kinematic relative positioning can obtain the precise baseline between two moving stations, which greatly expands the application field of dynamic relative positioning. However, the relative positioning performance is degraded greatly with low fixation rate of ambiguity with low-cost receivers. Especially, in the complex dynamic environment, ambiguity resolution effect is influenced by the satellite signal blocked, multipath outlier, and abnormal state prediction. Aiming at the problems, a novel inertial navigation system–aided robust adaptive filtering ambiguity resolution model is proposed. In addition, a hierarchical filtering strategy is developed to eliminate ambiguity parameters in BeiDou navigation satellite system/inertial navigation system tightly coupled integrated system. Finally, the precise relative position can be calculated with the “best” ambiguity solution. Both experiments with static data and field vehicle test were carried out to evaluate the algorithm efficiency in different data configurations. The results indicate that IRAFAR-TCRP method can effectively suppress the influence of observation outliers and model prediction abnormalities, which improves the success rate of ambiguity resolution, raises the accuracy as well as the continuity of relative positioning. The success rate of ambiguity resolution with single-frequency BeiDou navigation satellite system can reach 90% in the gross error and abnormal disturbance environments and centimeter-level accuracy can be achieved.
{"title":"A novel ambiguity resolution model of BeiDou navigation satellite system/inertial navigation system tightly coupled for kinematic-to-kinematic precise relative positioning","authors":"Ling Wu, Yongrong Sun, Xiyu Fu, Qing-hua Zeng","doi":"10.1177/15501329221102734","DOIUrl":"https://doi.org/10.1177/15501329221102734","url":null,"abstract":"The carrier-based kinematic-to-kinematic relative positioning can obtain the precise baseline between two moving stations, which greatly expands the application field of dynamic relative positioning. However, the relative positioning performance is degraded greatly with low fixation rate of ambiguity with low-cost receivers. Especially, in the complex dynamic environment, ambiguity resolution effect is influenced by the satellite signal blocked, multipath outlier, and abnormal state prediction. Aiming at the problems, a novel inertial navigation system–aided robust adaptive filtering ambiguity resolution model is proposed. In addition, a hierarchical filtering strategy is developed to eliminate ambiguity parameters in BeiDou navigation satellite system/inertial navigation system tightly coupled integrated system. Finally, the precise relative position can be calculated with the “best” ambiguity solution. Both experiments with static data and field vehicle test were carried out to evaluate the algorithm efficiency in different data configurations. The results indicate that IRAFAR-TCRP method can effectively suppress the influence of observation outliers and model prediction abnormalities, which improves the success rate of ambiguity resolution, raises the accuracy as well as the continuity of relative positioning. The success rate of ambiguity resolution with single-frequency BeiDou navigation satellite system can reach 90% in the gross error and abnormal disturbance environments and centimeter-level accuracy can be achieved.","PeriodicalId":50327,"journal":{"name":"International Journal of Distributed Sensor Networks","volume":" ","pages":""},"PeriodicalIF":2.3,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49122256","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-01DOI: 10.1177/15501329221104332
Z. Li, Qingkai Miao, Shehzad Ashraf Chaudhry, Chien-Ming Chen
The Internet of vehicles technology has developed rapidly in recent years and has become increasingly important. The social Internet of vehicles provides better resources and services for the development of the Internet of vehicles and provides better experience for users. However, there are still many security problems in social vehicle networking environments. Once the vehicle is networked, the biggest problem is data security according to the three levels of data collection, intelligent analysis, and decision control of the Internet of vehicles. Recently, Wu et al. proposed a lightweight vehicle social network security authentication protocol based on fog nodes. They claimed that their security authentication protocol could resist various attacks. However, we found that their authentication protocols are vulnerable to internal attacks, smart card theft attacks, and lack perfect forward security. In this study, we propose a new protocol to overcome these limitations. Finally, security and performance analyses show that our protocol perfectly overcomes these limitations and exhibits excellent performance and efficiency.
{"title":"A provably secure and lightweight mutual authentication protocol in fog-enabled social Internet of vehicles","authors":"Z. Li, Qingkai Miao, Shehzad Ashraf Chaudhry, Chien-Ming Chen","doi":"10.1177/15501329221104332","DOIUrl":"https://doi.org/10.1177/15501329221104332","url":null,"abstract":"The Internet of vehicles technology has developed rapidly in recent years and has become increasingly important. The social Internet of vehicles provides better resources and services for the development of the Internet of vehicles and provides better experience for users. However, there are still many security problems in social vehicle networking environments. Once the vehicle is networked, the biggest problem is data security according to the three levels of data collection, intelligent analysis, and decision control of the Internet of vehicles. Recently, Wu et al. proposed a lightweight vehicle social network security authentication protocol based on fog nodes. They claimed that their security authentication protocol could resist various attacks. However, we found that their authentication protocols are vulnerable to internal attacks, smart card theft attacks, and lack perfect forward security. In this study, we propose a new protocol to overcome these limitations. Finally, security and performance analyses show that our protocol perfectly overcomes these limitations and exhibits excellent performance and efficiency.","PeriodicalId":50327,"journal":{"name":"International Journal of Distributed Sensor Networks","volume":" ","pages":""},"PeriodicalIF":2.3,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47808633","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-01DOI: 10.1177/15501329221107246
Zain ul Abidin Jaffri, Muhammad Asif, W. U. Khan, Zeeshan Ahmad, Z. Akhtar, Kalim Ullah, Md. Sadek Ali
The design and implementation of energy-efficient routing protocols for next-generation wireless sensor networks is always a challenge due to limited power resource capabilities. Hierarchical (clustering) routing protocols appeared to be a remarkable solution for extending the lifetime of wireless sensor networks, particularly in application-aware (threshold-sensitive) and heterogeneity-aware cluster-based routing protocols. In this article, we propose a protocol, namely, Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol. It is a heterogeneity-aware and threshold-based protocol that provides a better solution to existing problems in next-generation wireless sensor networks. During execution, the Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol splits the entire network area into several zones to manage network traffic efficiently. In the first step, Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol is designed for a homogeneous network where the initial energy of all the nodes is the same. Thereafter, we bring in heterogeneity in the Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol execution environment to optimize its energy consumption. By investigating the performance of the various numbers of divisions, it is proved that the Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol with 9 zonal divisions has higher stability and throughput. The performance of the proposed Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol is compared with those of Stable Election Protocol, Low-Energy Adaptive Clustering Hierarchy, Modified Low-Energy Adaptive Clustering Hierarchy, and Gateway-Based Energy-Efficient Routing Protocol through computer simulations. Simulation results verify the improved performance of the proposed Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol in terms of network stability, lifetime, and throughput.
{"title":"TEZEM: A new energy-efficient routing protocol for next-generation wireless sensor networks","authors":"Zain ul Abidin Jaffri, Muhammad Asif, W. U. Khan, Zeeshan Ahmad, Z. Akhtar, Kalim Ullah, Md. Sadek Ali","doi":"10.1177/15501329221107246","DOIUrl":"https://doi.org/10.1177/15501329221107246","url":null,"abstract":"The design and implementation of energy-efficient routing protocols for next-generation wireless sensor networks is always a challenge due to limited power resource capabilities. Hierarchical (clustering) routing protocols appeared to be a remarkable solution for extending the lifetime of wireless sensor networks, particularly in application-aware (threshold-sensitive) and heterogeneity-aware cluster-based routing protocols. In this article, we propose a protocol, namely, Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol. It is a heterogeneity-aware and threshold-based protocol that provides a better solution to existing problems in next-generation wireless sensor networks. During execution, the Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol splits the entire network area into several zones to manage network traffic efficiently. In the first step, Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol is designed for a homogeneous network where the initial energy of all the nodes is the same. Thereafter, we bring in heterogeneity in the Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol execution environment to optimize its energy consumption. By investigating the performance of the various numbers of divisions, it is proved that the Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol with 9 zonal divisions has higher stability and throughput. The performance of the proposed Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol is compared with those of Stable Election Protocol, Low-Energy Adaptive Clustering Hierarchy, Modified Low-Energy Adaptive Clustering Hierarchy, and Gateway-Based Energy-Efficient Routing Protocol through computer simulations. Simulation results verify the improved performance of the proposed Threshold-based Energy-aware Zonal Efficiency Measuring hierarchical routing protocol in terms of network stability, lifetime, and throughput.","PeriodicalId":50327,"journal":{"name":"International Journal of Distributed Sensor Networks","volume":" ","pages":""},"PeriodicalIF":2.3,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42122763","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-05-01DOI: 10.1177/15501477211066304
Dongmei Yang, Cheng Li, Baoquan Ren, Hongjun Li, K. Guo
This article investigates the impacts of relay selection schemes on cooperative underlay cognitive radio non-orthogonal multiple access networks, where the partial relay selection scheme, the max–min relay selection scheme and the two-stage relay selection scheme are applied in the network. Moreover, decode-and-forward protocol is used at the transmission relays. What’s more, in order to show the effect of the schemes on the considered network, the closed-form expressions and asymptotic expressions for the outage probability of the system are derived. Furthermore, the outage performance under the effect of perfect and imperfect successive interference cancellation is analysed. Numerical results are given to illustrate the impacts of the relay selection schemes, the number of relays, the residual interference factor and the power allocation factor on the outage performance. Finally, Monte Carlo simulations are presented to validate the accuracy of the numerical results.
{"title":"Analysis of relay selection schemes in underlay cognitive radio non-orthogonal multiple access networks","authors":"Dongmei Yang, Cheng Li, Baoquan Ren, Hongjun Li, K. Guo","doi":"10.1177/15501477211066304","DOIUrl":"https://doi.org/10.1177/15501477211066304","url":null,"abstract":"This article investigates the impacts of relay selection schemes on cooperative underlay cognitive radio non-orthogonal multiple access networks, where the partial relay selection scheme, the max–min relay selection scheme and the two-stage relay selection scheme are applied in the network. Moreover, decode-and-forward protocol is used at the transmission relays. What’s more, in order to show the effect of the schemes on the considered network, the closed-form expressions and asymptotic expressions for the outage probability of the system are derived. Furthermore, the outage performance under the effect of perfect and imperfect successive interference cancellation is analysed. Numerical results are given to illustrate the impacts of the relay selection schemes, the number of relays, the residual interference factor and the power allocation factor on the outage performance. Finally, Monte Carlo simulations are presented to validate the accuracy of the numerical results.","PeriodicalId":50327,"journal":{"name":"International Journal of Distributed Sensor Networks","volume":" ","pages":""},"PeriodicalIF":2.3,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46790143","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-05-01DOI: 10.1177/15501329221100412
Chao Xiang, Li Zhang, Xiaopo Xie, Longgang Zhao, Xin Ke, Zhendong Niu, Feng Wang
With the rapid development of electric vehicles and artificial intelligence technology, the automatic driving industry has entered a rapid development stage. However, there is a risk of traffic accidents due to the blind spot of vision, whether autonomous vehicles or traditional vehicles. In this article, a multi-sensor fusion perception method is proposed, in which the semantic information from the camera and the range information from the LiDAR are fused at the data layer and the LiDAR point cloud containing semantic information is clustered to obtain the type and location information of the objects. Based on the sensor equipments deployed on the roadside, the sensing information processed by the fusion method is sent to the nearby vehicles in real-time through 5G and V2X technology for blind spot early warning, and its feasibility is verified by experiments and simulations. The blind spot warning scheme based on roadside multi-sensor fusion perception proposed in this article has been experimentally verified in the closed park, which can obviously reduce the traffic accidents caused by the blind spot of vision, and is of great significance to improve traffic safety.
{"title":"Multi-sensor fusion algorithm in cooperative vehicle-infrastructure system for blind spot warning","authors":"Chao Xiang, Li Zhang, Xiaopo Xie, Longgang Zhao, Xin Ke, Zhendong Niu, Feng Wang","doi":"10.1177/15501329221100412","DOIUrl":"https://doi.org/10.1177/15501329221100412","url":null,"abstract":"With the rapid development of electric vehicles and artificial intelligence technology, the automatic driving industry has entered a rapid development stage. However, there is a risk of traffic accidents due to the blind spot of vision, whether autonomous vehicles or traditional vehicles. In this article, a multi-sensor fusion perception method is proposed, in which the semantic information from the camera and the range information from the LiDAR are fused at the data layer and the LiDAR point cloud containing semantic information is clustered to obtain the type and location information of the objects. Based on the sensor equipments deployed on the roadside, the sensing information processed by the fusion method is sent to the nearby vehicles in real-time through 5G and V2X technology for blind spot early warning, and its feasibility is verified by experiments and simulations. The blind spot warning scheme based on roadside multi-sensor fusion perception proposed in this article has been experimentally verified in the closed park, which can obviously reduce the traffic accidents caused by the blind spot of vision, and is of great significance to improve traffic safety.","PeriodicalId":50327,"journal":{"name":"International Journal of Distributed Sensor Networks","volume":" ","pages":""},"PeriodicalIF":2.3,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41474409","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：