Pub Date : 2022-05-01DOI: 10.1177/15501329221097815
H. Zhang, Hongshuo Zhang, Zhao Wang, Zhenyu Zhou, Qiang Wang, Guangyuan Xu, Junzhong Yang, Zhong Gan
Message queuing telemetry transport has emerged as a promising communication protocol for resource-constrained electric Internet of things due to high bandwidth utilization, simple implementation, and various quality of service levels. Enabled by message queuing telemetry transport, electric Internet of things gateways adopt dynamic protocol adaptation, conversion, and quality of service level selection to realize bidirectional communication with massive devices and platforms based on heterogeneous communication protocols. However, protocol adaptation and quality of service guarantee in message queuing telemetry transport-empowered electric Internet of things still faces several challenges, such as unified communication architecture, differentiated quality of service requirements, lack of quality of service metric models, and incomplete information. In this paper, we first establish a unified communication architecture for message queuing telemetry transport-empowered electric Internet of things for adaptation and conversion of heterogeneous protocols. Second, we formulate the quality of service level selection optimization problem to minimize the weighted sum of packet-loss ratio and delay. Then, a delay-reliability-aware message queuing telemetry transport quality of service level selection algorithm based on upper confidence bound is proposed to learn the optimal quality of service level through dynamically interacting with the environment. Compared with single and fixed quality of service level selection strategies, delay-reliability-aware message queuing telemetry transport quality of service level selection can effectively reduce the weighted sum of delay and packet-loss ratio and satisfy the differentiated quality of service requirements of electric Internet of things.
{"title":"Delay-reliability-aware protocol adaption and quality of service guarantee for message queuing telemetry transport-empowered electric Internet of things","authors":"H. Zhang, Hongshuo Zhang, Zhao Wang, Zhenyu Zhou, Qiang Wang, Guangyuan Xu, Junzhong Yang, Zhong Gan","doi":"10.1177/15501329221097815","DOIUrl":"https://doi.org/10.1177/15501329221097815","url":null,"abstract":"Message queuing telemetry transport has emerged as a promising communication protocol for resource-constrained electric Internet of things due to high bandwidth utilization, simple implementation, and various quality of service levels. Enabled by message queuing telemetry transport, electric Internet of things gateways adopt dynamic protocol adaptation, conversion, and quality of service level selection to realize bidirectional communication with massive devices and platforms based on heterogeneous communication protocols. However, protocol adaptation and quality of service guarantee in message queuing telemetry transport-empowered electric Internet of things still faces several challenges, such as unified communication architecture, differentiated quality of service requirements, lack of quality of service metric models, and incomplete information. In this paper, we first establish a unified communication architecture for message queuing telemetry transport-empowered electric Internet of things for adaptation and conversion of heterogeneous protocols. Second, we formulate the quality of service level selection optimization problem to minimize the weighted sum of packet-loss ratio and delay. Then, a delay-reliability-aware message queuing telemetry transport quality of service level selection algorithm based on upper confidence bound is proposed to learn the optimal quality of service level through dynamically interacting with the environment. Compared with single and fixed quality of service level selection strategies, delay-reliability-aware message queuing telemetry transport quality of service level selection can effectively reduce the weighted sum of delay and packet-loss ratio and satisfy the differentiated quality of service requirements of electric Internet of things.","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":"48363010","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}
Aiming at the issue of parameter matching in conventional two-step location, a reduced dimension multiple signal classification direct position determination algorithm based on multi-array is proposed. Based on the idea of dimension reduction, the algorithm avoids multi-dimensional search in spatial domain and attenuation coefficient domain and reduces the search complexity. Simulation results show that the performance of the algorithm is better than the traditional angle of arrival two-step localization algorithm and subspace data fusion direct localization algorithm.
{"title":"A reduced dimension multiple signal classification–based direct location algorithm with dense arrays","authors":"Jianfeng Li, Gaofeng Zhao, Baobao Li, Xianpeng Wang, Mengxing Huang","doi":"10.1177/15501329221097583","DOIUrl":"https://doi.org/10.1177/15501329221097583","url":null,"abstract":"Aiming at the issue of parameter matching in conventional two-step location, a reduced dimension multiple signal classification direct position determination algorithm based on multi-array is proposed. Based on the idea of dimension reduction, the algorithm avoids multi-dimensional search in spatial domain and attenuation coefficient domain and reduces the search complexity. Simulation results show that the performance of the algorithm is better than the traditional angle of arrival two-step localization algorithm and subspace data fusion direct localization algorithm.","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":"47360799","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/15501329221097817
Yao Ma, Yuting Wu, Dan Yu, Lv Ding, Yongle Chen
Device vulnerabilities emerge one after another in the Internet of thing environment, the attackers attack vulnerabilities on several low-level devices simultaneously by multi-step attack method to trigger the vulnerabilities on other high-level devices to damage or control the information system. Considering the correlation between device vulnerabilities, we proposed a method based on attack graph to evaluate vulnerability risk in order to ensure Internet of thing network security. First, according to the type, version, and other relevant information of device vulnerabilities in the Internet of thing environment, hidden Markov model can be used to model the association between device states. Second, analyze the possible attacks on the vulnerabilities on the device, and generate the attack graph according to the correlation between the device states and the relevant information of the vulnerabilities in the device. Finally, the vulnerabilities are objectively and accurately evaluated according to the attack graph. The experiments results show that the proposed method can map the relationship between devices more accurately and objectively and improve the efficiency and accuracy of the vulnerability evaluation.
{"title":"Vulnerability association evaluation of Internet of thing devices based on attack graph","authors":"Yao Ma, Yuting Wu, Dan Yu, Lv Ding, Yongle Chen","doi":"10.1177/15501329221097817","DOIUrl":"https://doi.org/10.1177/15501329221097817","url":null,"abstract":"Device vulnerabilities emerge one after another in the Internet of thing environment, the attackers attack vulnerabilities on several low-level devices simultaneously by multi-step attack method to trigger the vulnerabilities on other high-level devices to damage or control the information system. Considering the correlation between device vulnerabilities, we proposed a method based on attack graph to evaluate vulnerability risk in order to ensure Internet of thing network security. First, according to the type, version, and other relevant information of device vulnerabilities in the Internet of thing environment, hidden Markov model can be used to model the association between device states. Second, analyze the possible attacks on the vulnerabilities on the device, and generate the attack graph according to the correlation between the device states and the relevant information of the vulnerabilities in the device. Finally, the vulnerabilities are objectively and accurately evaluated according to the attack graph. The experiments results show that the proposed method can map the relationship between devices more accurately and objectively and improve the efficiency and accuracy of the vulnerability evaluation.","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":"41609645","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/15501329221097819
Leonardo Eras, Federico Domínguez, Caril Martinez
Bluetooth low energy is an almost ubiquitous technology currently embedded in billions of power-constrained Internet of Things devices around the world. The Bluetooth mesh profile, released by the Bluetooth Special Interest Group in July 2017, allows Bluetooth low energy devices to form a mesh network, further enabling smart home and building applications where long-range connectivity is required. However, the current release of Bluetooth mesh profile still has power and deployment constraints that limit its applicability. To explore the viability of Bluetooth mesh profile in home/building automation applications, we built the Smart Doorbell: a proof-of-concept Bluetooth mesh profile–based visitor notification system for office spaces. The Smart Doorbell was implemented using a mesh network topology with nodes distributed across office building floors, serving as a real Internet of Things deployment and as a testbed for mesh network protocols. Similar Bluetooth mesh profile evaluations found in literature use mostly development kits and/or synthetic traffic in artificial settings; we contribute by using the Smart Doorbell, a system as close as possible to a minimum viable product, to evaluate power consumption and responsiveness as a proxy for product viability. This article presents the architecture of the Smart Doorbell, the viability evaluation results, and a direct comparison with FruityMesh, a competing Bluetooth low energy mesh network protocol. Overall, the fact that Bluetooth mesh profile devices can directly communicate with a user’s mobile phone (using Bluetooth low energy) considerably eases deployment and provisioning. However, the use of flooding to forward messages across the mesh network increases power consumption, precluding the use of battery-powered nodes on the network’s backbone and severely limiting the applicability of Bluetooth mesh profile in building automation.
{"title":"Viability characterization of a proof-of-concept Bluetooth mesh smart building application","authors":"Leonardo Eras, Federico Domínguez, Caril Martinez","doi":"10.1177/15501329221097819","DOIUrl":"https://doi.org/10.1177/15501329221097819","url":null,"abstract":"Bluetooth low energy is an almost ubiquitous technology currently embedded in billions of power-constrained Internet of Things devices around the world. The Bluetooth mesh profile, released by the Bluetooth Special Interest Group in July 2017, allows Bluetooth low energy devices to form a mesh network, further enabling smart home and building applications where long-range connectivity is required. However, the current release of Bluetooth mesh profile still has power and deployment constraints that limit its applicability. To explore the viability of Bluetooth mesh profile in home/building automation applications, we built the Smart Doorbell: a proof-of-concept Bluetooth mesh profile–based visitor notification system for office spaces. The Smart Doorbell was implemented using a mesh network topology with nodes distributed across office building floors, serving as a real Internet of Things deployment and as a testbed for mesh network protocols. Similar Bluetooth mesh profile evaluations found in literature use mostly development kits and/or synthetic traffic in artificial settings; we contribute by using the Smart Doorbell, a system as close as possible to a minimum viable product, to evaluate power consumption and responsiveness as a proxy for product viability. This article presents the architecture of the Smart Doorbell, the viability evaluation results, and a direct comparison with FruityMesh, a competing Bluetooth low energy mesh network protocol. Overall, the fact that Bluetooth mesh profile devices can directly communicate with a user’s mobile phone (using Bluetooth low energy) considerably eases deployment and provisioning. However, the use of flooding to forward messages across the mesh network increases power consumption, precluding the use of battery-powered nodes on the network’s backbone and severely limiting the applicability of Bluetooth mesh profile in building automation.","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":"44748496","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/15501329221097591
Yu Wang, Fuxiang Chang, Yuanjie Wu, Ziran Hu, Lihui Li, Pengyu Li, Pu Lang, Shouwen Yao
Skeleton tracking based on multiple Kinects data fusion has been proved to have better accuracy and robustness than single Kinect. However, previous works did not consider the inconsistency of tracking accuracy in the tracking field of Kinect and the self-occlusion of human body in assembly operation, which are of vital importance to the fusion performance of the multiple Kinects data in assembly task simulation. In this work, we developed a multi-Kinect fusion algorithm to achieve robust full-body tracking in virtual reality (VR)-aided assembly simulation. Two reliability functions are first applied to evaluate the tracking confidences reflecting the impacts of the position-related error and the self-occlusion error on the tracked skeletons. Then, the tracking skeletons from multiple Kinects are fused based on weighted arithmetic average and generalized covariance intersection. To evaluate the tracking confidence, the ellipsoidal surface fitting was used to model the tracking accuracy distribution of Kinect, and the relations between the user-Kinect crossing angles and the influences of the self-occlusion on the tracking of different parts of body were studied. On the basis, the two reliability functions were developed. We implemented a prototype system leveraging six Kinects and applied the distributed computing in the system to improve the computing efficiency. Experiment results showed that the proposed algorithm has superior fusion performance compared to the peer works.
{"title":"Multi-Kinects fusion for full-body tracking in virtual reality-aided assembly simulation","authors":"Yu Wang, Fuxiang Chang, Yuanjie Wu, Ziran Hu, Lihui Li, Pengyu Li, Pu Lang, Shouwen Yao","doi":"10.1177/15501329221097591","DOIUrl":"https://doi.org/10.1177/15501329221097591","url":null,"abstract":"Skeleton tracking based on multiple Kinects data fusion has been proved to have better accuracy and robustness than single Kinect. However, previous works did not consider the inconsistency of tracking accuracy in the tracking field of Kinect and the self-occlusion of human body in assembly operation, which are of vital importance to the fusion performance of the multiple Kinects data in assembly task simulation. In this work, we developed a multi-Kinect fusion algorithm to achieve robust full-body tracking in virtual reality (VR)-aided assembly simulation. Two reliability functions are first applied to evaluate the tracking confidences reflecting the impacts of the position-related error and the self-occlusion error on the tracked skeletons. Then, the tracking skeletons from multiple Kinects are fused based on weighted arithmetic average and generalized covariance intersection. To evaluate the tracking confidence, the ellipsoidal surface fitting was used to model the tracking accuracy distribution of Kinect, and the relations between the user-Kinect crossing angles and the influences of the self-occlusion on the tracking of different parts of body were studied. On the basis, the two reliability functions were developed. We implemented a prototype system leveraging six Kinects and applied the distributed computing in the system to improve the computing efficiency. Experiment results showed that the proposed algorithm has superior fusion performance compared to the peer works.","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":"44241930","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/15501329221080658
E. F. Cahyadi, Tzu-Wei Su, Chou-Chen Yang, M. Hwang
In the vehicular ad hoc network, moving vehicles can keep communicating with each other by entering or leaving the network at any time to establish a new connection. However, since many users transmit a substantial number of messages, it may cause reception delays and affect the entire system. A certificateless aggregate signature scheme can provide a signature compression that keeps the verification cost low. Therefore, it is beneficial for environments constrained by time, bandwidth, and storage, such as vehicular ad hoc network. In recent years, several certificateless aggregate signature schemes have been proposed. Unfortunately, some of them still have some security and privacy issues under specific existing attacks. This article offers an authentication scheme that can improve security, privacy, and efficiency. First, we apply the certificateless aggregate signature method to prevent the onboard unit devices from leaking sensitive information when sending messages. The scheme is proven to be secure against the Type-1 ( A 1 ) and Type-2 ( A 2 ) adversaries in the random oracle model under the computational Diffie–Hellman problem assumption. Then, the performance evaluation demonstrates that our proposed scheme is more suitable for deployment in vehicular ad hoc network environments.
{"title":"A certificateless aggregate signature scheme for security and privacy protection in VANET","authors":"E. F. Cahyadi, Tzu-Wei Su, Chou-Chen Yang, M. Hwang","doi":"10.1177/15501329221080658","DOIUrl":"https://doi.org/10.1177/15501329221080658","url":null,"abstract":"In the vehicular ad hoc network, moving vehicles can keep communicating with each other by entering or leaving the network at any time to establish a new connection. However, since many users transmit a substantial number of messages, it may cause reception delays and affect the entire system. A certificateless aggregate signature scheme can provide a signature compression that keeps the verification cost low. Therefore, it is beneficial for environments constrained by time, bandwidth, and storage, such as vehicular ad hoc network. In recent years, several certificateless aggregate signature schemes have been proposed. Unfortunately, some of them still have some security and privacy issues under specific existing attacks. This article offers an authentication scheme that can improve security, privacy, and efficiency. First, we apply the certificateless aggregate signature method to prevent the onboard unit devices from leaking sensitive information when sending messages. The scheme is proven to be secure against the Type-1 ( A 1 ) and Type-2 ( A 2 ) adversaries in the random oracle model under the computational Diffie–Hellman problem assumption. Then, the performance evaluation demonstrates that our proposed scheme is more suitable for deployment in vehicular ad hoc network environments.","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":"46437897","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/15501477211049917
M. Ri, Yefei Han, Jinsuk Pak
Sensed data can be forwarded only in one direction to the base station in one-dimensional queue wireless sensor networks different from mesh structure, so the network lifetime will be shortened if some continuous neighboring nodes have run out of their energy. So designing routing protocols for balancing energy consumption is a challenging problem. However, traditional and existing opportunistic routing protocols for one-dimensional queue wireless sensor network proposed so far have not yet addressed this problem to prolong the network lifetime by introducing sleep mode. In this article, we propose a distributed energy-efficient opportunistic routing algorithm accompanied by timeslot allocation by using specific network topology of one-dimensional queue wireless sensor network. In our new algorithm, clustering and routing tree construction is performed while introducing the optimal relay transmission distance achieved by using opportunistic routing principle, and at the same time, interference-free wake up time is scheduled, which may optimize energy consumption and decrease the number of various control messages as possible to prolong the network lifetime. Furthermore, this improves energy efficiency by introducing the operation mode giving up cluster head role. Simulation results show that the proposed protocol can significantly improve the network performance such as energy consumption and network connectivity, when compared with other existing protocols.
{"title":"A distributed energy-efficient opportunistic routing accompanied by timeslot allocation in wireless sensor networks","authors":"M. Ri, Yefei Han, Jinsuk Pak","doi":"10.1177/15501477211049917","DOIUrl":"https://doi.org/10.1177/15501477211049917","url":null,"abstract":"Sensed data can be forwarded only in one direction to the base station in one-dimensional queue wireless sensor networks different from mesh structure, so the network lifetime will be shortened if some continuous neighboring nodes have run out of their energy. So designing routing protocols for balancing energy consumption is a challenging problem. However, traditional and existing opportunistic routing protocols for one-dimensional queue wireless sensor network proposed so far have not yet addressed this problem to prolong the network lifetime by introducing sleep mode. In this article, we propose a distributed energy-efficient opportunistic routing algorithm accompanied by timeslot allocation by using specific network topology of one-dimensional queue wireless sensor network. In our new algorithm, clustering and routing tree construction is performed while introducing the optimal relay transmission distance achieved by using opportunistic routing principle, and at the same time, interference-free wake up time is scheduled, which may optimize energy consumption and decrease the number of various control messages as possible to prolong the network lifetime. Furthermore, this improves energy efficiency by introducing the operation mode giving up cluster head role. Simulation results show that the proposed protocol can significantly improve the network performance such as energy consumption and network connectivity, when compared with other existing protocols.","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":"48290474","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 the past few years, introducing ontology to describe the concepts and relationships between different entities in semantic sensor network enhances the interoperability between entities. Existing works mostly based on SPARQL retrieval ignore the user’s specific requirements of sensor attributes. Therefore, the recommendation results cannot satisfy the user’s needs. In this article, we propose a graph-based sensor recommendation model. The model mainly includes two parts: (1) Filtering nodes in data graph. In addition to using the traditional graph matching algorithm, we propose a threshold pruning algorithm to narrow the matching scope and improve the matching efficiency. (2) Recommending top-k sensors. We use the improved fast non-dominated sorting algorithm to obtain the local optimal solutions of sensor data set, and we apply the simple additive weight algorithm to characterize and sort local optional solutions. Finally, we recommend the top-k sensors to the user. By comparison, the graph-based sensor recommendation algorithm meets user’s needs more than other algorithms, and experiments show that our model outperforms several baselines in terms of both response time and precision.
{"title":"A graph-based sensor recommendation model in semantic sensor network","authors":"Yuanyi Chen, Yih-Yeong Lin, Pengfei Yu, Yanyun Tao, Zengwei Zheng","doi":"10.1177/15501477211049307","DOIUrl":"https://doi.org/10.1177/15501477211049307","url":null,"abstract":"In the past few years, introducing ontology to describe the concepts and relationships between different entities in semantic sensor network enhances the interoperability between entities. Existing works mostly based on SPARQL retrieval ignore the user’s specific requirements of sensor attributes. Therefore, the recommendation results cannot satisfy the user’s needs. In this article, we propose a graph-based sensor recommendation model. The model mainly includes two parts: (1) Filtering nodes in data graph. In addition to using the traditional graph matching algorithm, we propose a threshold pruning algorithm to narrow the matching scope and improve the matching efficiency. (2) Recommending top-k sensors. We use the improved fast non-dominated sorting algorithm to obtain the local optimal solutions of sensor data set, and we apply the simple additive weight algorithm to characterize and sort local optional solutions. Finally, we recommend the top-k sensors to the user. By comparison, the graph-based sensor recommendation algorithm meets user’s needs more than other algorithms, and experiments show that our model outperforms several baselines in terms of both response time and precision.","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":"49525576","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/15501329221097588
Na Fan, Shuai Shen, C. Wu, J. Yao
Vehicular social networks are emerging hybrid networks that combine traditional vehicular networks and social networks, with two key types of nodes, that is, vehicles and drivers. Since vehicle behaviors are controlled or influenced by drivers, the trustworthiness of a vehicle node is essentially determined by its own communication behaviors and its driver’s social characteristics. Therefore, human factors should be considered in securing the communication in vehicular social networks. In this article, we propose a hybrid trust model that considers both communication trust and social trust. Within the proposed scheme, we first construct a communication trust model to quantify the trust value based on the interactions between vehicle nodes, and then develop a social trust model to measure the social trust based on the social characteristics of vehicle drivers. Based on these two trust models, we compute the combined trust assessment of a vehicle node in vehicular social networks. Extensive simulations show that the proposed hybrid trust model improves the accuracy in evaluating the trustworthiness of vehicle nodes and the efficiency of communication in vehicular social networks.
{"title":"A hybrid trust model based on communication and social trust for vehicular social networks","authors":"Na Fan, Shuai Shen, C. Wu, J. Yao","doi":"10.1177/15501329221097588","DOIUrl":"https://doi.org/10.1177/15501329221097588","url":null,"abstract":"Vehicular social networks are emerging hybrid networks that combine traditional vehicular networks and social networks, with two key types of nodes, that is, vehicles and drivers. Since vehicle behaviors are controlled or influenced by drivers, the trustworthiness of a vehicle node is essentially determined by its own communication behaviors and its driver’s social characteristics. Therefore, human factors should be considered in securing the communication in vehicular social networks. In this article, we propose a hybrid trust model that considers both communication trust and social trust. Within the proposed scheme, we first construct a communication trust model to quantify the trust value based on the interactions between vehicle nodes, and then develop a social trust model to measure the social trust based on the social characteristics of vehicle drivers. Based on these two trust models, we compute the combined trust assessment of a vehicle node in vehicular social networks. Extensive simulations show that the proposed hybrid trust model improves the accuracy in evaluating the trustworthiness of vehicle nodes and the efficiency of communication in vehicular social networks.","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":"47977585","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/15501329221100326
Manal Alsabhan, A. Soudani, Manan Almusallam
The availability of low-cost embedded devices for multimedia sensing has encouraged their integration with low-power wireless sensors to create systems that enable advanced services and applications referred to as the Internet of Multimedia Things. Image-based sensing applications are challenged by energy efficiency and resource availability. Mainly, image sensing and transmission in Internet of Multimedia Things severely deplete the sensor energy and overflow the network bandwidth with redundant data. Some solutions presented in the literature, such as image compression, do not efficiently solve this problem because of the algorithms’ computational complexities. Thus, detecting the event of interest locally before the communication using shape-based descriptors would avoid useless data transmission and would extend the network lifetime. In this article, we propose a new approach of distributed event-based sensing scheme over a set of nodes forming a processing cluster to balance the processing load. This approach is intended to reduce per-node energy consumption in one sensing cycle. The conducted experiments show that our novel method based on the general Fourier descriptor decreases the energy consumption in the camera node to only 2.4 mJ, which corresponds to 75.32% of energy-saving compared to the centralized approach, promising to prolong the network lifetime significantly. In addition, the scheme achieved more than 95% accuracy in target recognition.
{"title":"A distributed scheme for energy-efficient event-based target recognition using Internet of Multimedia Things","authors":"Manal Alsabhan, A. Soudani, Manan Almusallam","doi":"10.1177/15501329221100326","DOIUrl":"https://doi.org/10.1177/15501329221100326","url":null,"abstract":"The availability of low-cost embedded devices for multimedia sensing has encouraged their integration with low-power wireless sensors to create systems that enable advanced services and applications referred to as the Internet of Multimedia Things. Image-based sensing applications are challenged by energy efficiency and resource availability. Mainly, image sensing and transmission in Internet of Multimedia Things severely deplete the sensor energy and overflow the network bandwidth with redundant data. Some solutions presented in the literature, such as image compression, do not efficiently solve this problem because of the algorithms’ computational complexities. Thus, detecting the event of interest locally before the communication using shape-based descriptors would avoid useless data transmission and would extend the network lifetime. In this article, we propose a new approach of distributed event-based sensing scheme over a set of nodes forming a processing cluster to balance the processing load. This approach is intended to reduce per-node energy consumption in one sensing cycle. The conducted experiments show that our novel method based on the general Fourier descriptor decreases the energy consumption in the camera node to only 2.4 mJ, which corresponds to 75.32% of energy-saving compared to the centralized approach, promising to prolong the network lifetime significantly. In addition, the scheme achieved more than 95% accuracy in target recognition.","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":"46192972","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
扫码关注我们
求助内容：
应助结果提醒方式：