LEACH (Low Energy Adaptive Clustering Hierarchy) is one of the pioneer clustering routing algorithm, the idea of clustering proposed by which provides a good reference for the design of routing algorithm for wireless sensor network. In LEACH algorithm, the selection of cluster head ignores the consideration of node energy, which may lead to the death of cluster head and this will case the failure of data transmitted to sink. Besides, cluster head direct communication with the base station limits the expansion of the network scale. In response to these shortcomings, three strategies to improve the performance of LEACH-based algorithm are discussed in this paper, based on which we propose a low energy consumption high reliable multi-hop routing algorithm LEACH-MB. By improving the selection of cluster heads, introducing a mechanism of backup cluster head and adopting the approach of cluster head multi-hop, the performance of this new algorithm has been significantly improved compared to LEACH. Through the simulation analysis of the algorithm, we can find that this algorithm can prolong the network lifetime and improve the reliability of data transmission, and get a result of throughput increase.
LEACH (Low Energy Adaptive Clustering Hierarchy)是最早的聚类路由算法之一，其提出的聚类思想为无线传感器网络路由算法的设计提供了很好的参考。在LEACH算法中，簇头的选择忽略了对节点能量的考虑，这可能导致簇头死亡，从而导致数据传输到sink失败。此外，集群头与基站直接通信限制了网络规模的扩展。针对这些不足，本文讨论了提高基于leach算法性能的三种策略，在此基础上提出了一种低能耗、高可靠的多跳路由算法LEACH-MB。通过改进簇头选择、引入簇头备份机制和采用簇头多跳方法，该算法的性能比LEACH算法有了明显提高。通过对该算法的仿真分析，可以发现该算法可以延长网络寿命，提高数据传输的可靠性，并获得吞吐量增加的结果。
{"title":"Improved Strategies of LEACH-based Low Energy Consumption and High Reliable Multi-hop Routing Algorithm for Wireless Sensor Network","authors":"Lubin Guo, Jiayan Liu, Peng Qin, Xiongwen Zhao, Huiyuan Ma, Zhongjun Chi","doi":"10.1109/ICCC51575.2020.9345136","DOIUrl":"https://doi.org/10.1109/ICCC51575.2020.9345136","url":null,"abstract":"LEACH (Low Energy Adaptive Clustering Hierarchy) is one of the pioneer clustering routing algorithm, the idea of clustering proposed by which provides a good reference for the design of routing algorithm for wireless sensor network. In LEACH algorithm, the selection of cluster head ignores the consideration of node energy, which may lead to the death of cluster head and this will case the failure of data transmitted to sink. Besides, cluster head direct communication with the base station limits the expansion of the network scale. In response to these shortcomings, three strategies to improve the performance of LEACH-based algorithm are discussed in this paper, based on which we propose a low energy consumption high reliable multi-hop routing algorithm LEACH-MB. By improving the selection of cluster heads, introducing a mechanism of backup cluster head and adopting the approach of cluster head multi-hop, the performance of this new algorithm has been significantly improved compared to LEACH. Through the simulation analysis of the algorithm, we can find that this algorithm can prolong the network lifetime and improve the reliability of data transmission, and get a result of throughput increase.","PeriodicalId":386048,"journal":{"name":"2020 IEEE 6th International Conference on Computer and Communications (ICCC)","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132686615","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-12-11DOI: 10.1109/ICCC51575.2020.9345097
Xiang Wu, Hao Wu
Mobile users need to consider the credibility of nodes to ensure their privacy when building a P2P network. Therefore, how to perform node trust management is an urgent problem to be solved. This paper proposes a trust management method that combines incentive mechanisms and punishment measures, introduces time-sensitive functions, integrates hash chains, and builds a mobile user trust evaluation model.
{"title":"Trust Management of Mobile Users P2P Nodes Based on Blockchain","authors":"Xiang Wu, Hao Wu","doi":"10.1109/ICCC51575.2020.9345097","DOIUrl":"https://doi.org/10.1109/ICCC51575.2020.9345097","url":null,"abstract":"Mobile users need to consider the credibility of nodes to ensure their privacy when building a P2P network. Therefore, how to perform node trust management is an urgent problem to be solved. This paper proposes a trust management method that combines incentive mechanisms and punishment measures, introduces time-sensitive functions, integrates hash chains, and builds a mobile user trust evaluation model.","PeriodicalId":386048,"journal":{"name":"2020 IEEE 6th International Conference on Computer and Communications (ICCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132723089","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-12-11DOI: 10.1109/ICCC51575.2020.9344904
Mingsheng Gao, Pengfei Wei, Yuxiang Liu
Path planning is the fundamental aspect of applications for autonomous Unmanned Aerial Vehicles (UAVs) system. It allows UAV to find an optimal path relevant to some specific missions within limited time, especially in large sized scenarios. In this paper, a novel competitive self-organizing neural network algorithm is proposed to improve the search ability and speed up the convergence of traditional algorithms. More specifically, in the initialization phase, a new opposition-based learning is adopted to generate better neurons. Next, a secondary competitive layer is added above the hidden layer, thus enhancing accuracy of the algorithm. Simulations validate the proposed algorithm outperforms some intelligence algorithms in terms of optimization ability.
{"title":"Competitive Self-Organizing Neural Network Based UAV Path Planning","authors":"Mingsheng Gao, Pengfei Wei, Yuxiang Liu","doi":"10.1109/ICCC51575.2020.9344904","DOIUrl":"https://doi.org/10.1109/ICCC51575.2020.9344904","url":null,"abstract":"Path planning is the fundamental aspect of applications for autonomous Unmanned Aerial Vehicles (UAVs) system. It allows UAV to find an optimal path relevant to some specific missions within limited time, especially in large sized scenarios. In this paper, a novel competitive self-organizing neural network algorithm is proposed to improve the search ability and speed up the convergence of traditional algorithms. More specifically, in the initialization phase, a new opposition-based learning is adopted to generate better neurons. Next, a secondary competitive layer is added above the hidden layer, thus enhancing accuracy of the algorithm. Simulations validate the proposed algorithm outperforms some intelligence algorithms in terms of optimization ability.","PeriodicalId":386048,"journal":{"name":"2020 IEEE 6th International Conference on Computer and Communications (ICCC)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133202294","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-12-11DOI: 10.1109/ICCC51575.2020.9345182
Liang Liu, Song Wang, Ting Cai, Weixin Zhao
Spatio-temporal trajectory data cover a wide area, have high real-time performance, which can not only reflect the timing change of road traffic but also reflect the travel rules of residents. However, due to the lack of effective methods, it is difficult for analysts to conduct in-depth analysis and extract valuable information. To help users to understand the situation of urban traffic congestion, explore the social behavior pattern, this paper proposed and implemented a novel interactive visual analysis system, Visual Analyzer for Bus Data (VABD). Visual analysis of spatio-temporal trajectory data is introduced into “intelligent transportation” to provide new ideas and data support for solving urban congestion problems. A case study based on urban bus data of Mianyang proves the effectiveness of the system.
{"title":"VABD: Visual Analysis of Spatio-temporal Trajectory Based on Urban Bus Data","authors":"Liang Liu, Song Wang, Ting Cai, Weixin Zhao","doi":"10.1109/ICCC51575.2020.9345182","DOIUrl":"https://doi.org/10.1109/ICCC51575.2020.9345182","url":null,"abstract":"Spatio-temporal trajectory data cover a wide area, have high real-time performance, which can not only reflect the timing change of road traffic but also reflect the travel rules of residents. However, due to the lack of effective methods, it is difficult for analysts to conduct in-depth analysis and extract valuable information. To help users to understand the situation of urban traffic congestion, explore the social behavior pattern, this paper proposed and implemented a novel interactive visual analysis system, Visual Analyzer for Bus Data (VABD). Visual analysis of spatio-temporal trajectory data is introduced into “intelligent transportation” to provide new ideas and data support for solving urban congestion problems. A case study based on urban bus data of Mianyang proves the effectiveness of the system.","PeriodicalId":386048,"journal":{"name":"2020 IEEE 6th International Conference on Computer and Communications (ICCC)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133559260","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-12-11DOI: 10.1109/ICCC51575.2020.9345212
Jingang Yu, Peipei Zhao, Shu Li, Haiting Wang
The current flow and trading of data has been a trend, but the current enthusiasm for data trading is not high. Due to the particularity of data and the current trading pattern of data, the ability of data trading platform to retain trading data has become a potential threat to both sides of the transaction and an obstacle to data trading. Due to the sensitivity of data, how to protect the privacy security of both sides of the transaction is also an important factor hindering the current data transaction. In response to the existing problems, this paper proposes a feasibility plan for data security transactions based on blockchain and in an untrusted environment, and designs a new decentralized transaction platform that will help transform data through online transactions. At the same time, it is technically guaranteed that the platform does not have the possibility of viewing, copying and detaining data, thereby ensuring the secure transaction of data and the privacy of both parties to the transaction.
{"title":"Distributed Data Trading Model Based on Blockchain","authors":"Jingang Yu, Peipei Zhao, Shu Li, Haiting Wang","doi":"10.1109/ICCC51575.2020.9345212","DOIUrl":"https://doi.org/10.1109/ICCC51575.2020.9345212","url":null,"abstract":"The current flow and trading of data has been a trend, but the current enthusiasm for data trading is not high. Due to the particularity of data and the current trading pattern of data, the ability of data trading platform to retain trading data has become a potential threat to both sides of the transaction and an obstacle to data trading. Due to the sensitivity of data, how to protect the privacy security of both sides of the transaction is also an important factor hindering the current data transaction. In response to the existing problems, this paper proposes a feasibility plan for data security transactions based on blockchain and in an untrusted environment, and designs a new decentralized transaction platform that will help transform data through online transactions. At the same time, it is technically guaranteed that the platform does not have the possibility of viewing, copying and detaining data, thereby ensuring the secure transaction of data and the privacy of both parties to the transaction.","PeriodicalId":386048,"journal":{"name":"2020 IEEE 6th International Conference on Computer and Communications (ICCC)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134164096","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-12-11DOI: 10.1109/ICCC51575.2020.9345113
Wenge Xing, Yuan Yao, Guang-xin Wu, Xinxin Liu, Jun Zhu
Radar communication integration seems promising to meet multiple mission requirements, reduce the number of antennas, and improve the utilization of spectrum resources. However, proper system design is required to obtain these advantages. In this paper, we propose a radar communication framework which allows radar and communication to share aperture, beamforming, spectrum, and resource scheduling. Moreover, a burst communication waveform is proposed to overcome the impact of saturated power amplifiers and improve performance. Moreover, we develop a radar communication test system. Test results validate the feasibility and effect of our proposed radar communication framework. Besides, in the test radar communication integration system, over-the-horizon scattering communications have been realized.
{"title":"System Design and Performance Test for Phased Array Radar Communication","authors":"Wenge Xing, Yuan Yao, Guang-xin Wu, Xinxin Liu, Jun Zhu","doi":"10.1109/ICCC51575.2020.9345113","DOIUrl":"https://doi.org/10.1109/ICCC51575.2020.9345113","url":null,"abstract":"Radar communication integration seems promising to meet multiple mission requirements, reduce the number of antennas, and improve the utilization of spectrum resources. However, proper system design is required to obtain these advantages. In this paper, we propose a radar communication framework which allows radar and communication to share aperture, beamforming, spectrum, and resource scheduling. Moreover, a burst communication waveform is proposed to overcome the impact of saturated power amplifiers and improve performance. Moreover, we develop a radar communication test system. Test results validate the feasibility and effect of our proposed radar communication framework. Besides, in the test radar communication integration system, over-the-horizon scattering communications have been realized.","PeriodicalId":386048,"journal":{"name":"2020 IEEE 6th International Conference on Computer and Communications (ICCC)","volume":"489 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133078289","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-12-11DOI: 10.1109/ICCC51575.2020.9344985
Jincheng Zhou, Sian-Jheng Lin
Visual cryptography (VC) encodes a secret image into multiple transparencies. The secret image can be revealed by stacking a subset of these transparencies. However, the pixel expansion problem is a critical issue for VCs as a pixel in the secret image is encoded into multiple pixels. To solve this problem, many size-invariant VCs have been proposed. But there are some drawbacks in the existing size-invariant VCs. i) The input image is a binary image rather than a grayscale image. ii) Some schemes are not a ($k, n$) - VC. iii) The quality of recovered image is poor. Based on two-dimensional lattices, a block halftone technology for a size-invariant VC is proposed. In particular, the proposed block error diffusion takes a grayscale image as the input. It is adaptable to any pixel expansion. The experiments show that the proposed halftone technique has a better visual quality for the stacking results than prior common schemes, such as probabilistic schemes.
{"title":"Block Halftoning for Size-Invariant Visual Cryptography Based on Two-Dimensional Lattices","authors":"Jincheng Zhou, Sian-Jheng Lin","doi":"10.1109/ICCC51575.2020.9344985","DOIUrl":"https://doi.org/10.1109/ICCC51575.2020.9344985","url":null,"abstract":"Visual cryptography (VC) encodes a secret image into multiple transparencies. The secret image can be revealed by stacking a subset of these transparencies. However, the pixel expansion problem is a critical issue for VCs as a pixel in the secret image is encoded into multiple pixels. To solve this problem, many size-invariant VCs have been proposed. But there are some drawbacks in the existing size-invariant VCs. i) The input image is a binary image rather than a grayscale image. ii) Some schemes are not a ($k, n$) - VC. iii) The quality of recovered image is poor. Based on two-dimensional lattices, a block halftone technology for a size-invariant VC is proposed. In particular, the proposed block error diffusion takes a grayscale image as the input. It is adaptable to any pixel expansion. The experiments show that the proposed halftone technique has a better visual quality for the stacking results than prior common schemes, such as probabilistic schemes.","PeriodicalId":386048,"journal":{"name":"2020 IEEE 6th International Conference on Computer and Communications (ICCC)","volume":"408 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114008045","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-12-11DOI: 10.1109/ICCC51575.2020.9345159
Yong Zhang, Yong Xiao, Yuna Jiang, Xiaohu Ge
Blockchain has been recently extended into Internet-of-Things (IoT) networks to further improve security and reliability of data communication. Modern IoT networks need to support a wide range of services with various requirements in terms of data delivering security, reliability, and timeliness. In this paper, a fog computing-supported hierarchical blockchain network framework is proposed. In the first layer, the Inter-Planetary File System is used to store the message uploaded by IoT devices. In the second layer, a set of subchains that are referred as channels are designed. Fog nodes subscribed to the same channel maintain the corresponding distributed ledger, and each channel support a specific IoT service. The security, latency, and communication cost of the proposed framework are derived. Besides, tradeoffs among the above three performance metrics are analyzed. Finally, a real deployment scenario based on the actual base station locations in Dublin is considered to evaluate the proposed framework. Numerical results show that it is impossible to optimize all the performance metrics at the same time. By carefully selecting the parameters of different “channels”, the proposed framework can support highly diversified services without sacrificing security.
{"title":"A Hierarchical Blockchain Framework for Fog Computing-supported IoT Networks","authors":"Yong Zhang, Yong Xiao, Yuna Jiang, Xiaohu Ge","doi":"10.1109/ICCC51575.2020.9345159","DOIUrl":"https://doi.org/10.1109/ICCC51575.2020.9345159","url":null,"abstract":"Blockchain has been recently extended into Internet-of-Things (IoT) networks to further improve security and reliability of data communication. Modern IoT networks need to support a wide range of services with various requirements in terms of data delivering security, reliability, and timeliness. In this paper, a fog computing-supported hierarchical blockchain network framework is proposed. In the first layer, the Inter-Planetary File System is used to store the message uploaded by IoT devices. In the second layer, a set of subchains that are referred as channels are designed. Fog nodes subscribed to the same channel maintain the corresponding distributed ledger, and each channel support a specific IoT service. The security, latency, and communication cost of the proposed framework are derived. Besides, tradeoffs among the above three performance metrics are analyzed. Finally, a real deployment scenario based on the actual base station locations in Dublin is considered to evaluate the proposed framework. Numerical results show that it is impossible to optimize all the performance metrics at the same time. By carefully selecting the parameters of different “channels”, the proposed framework can support highly diversified services without sacrificing security.","PeriodicalId":386048,"journal":{"name":"2020 IEEE 6th International Conference on Computer and Communications (ICCC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115176243","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-12-11DOI: 10.1109/ICCC51575.2020.9345195
Xiaomeng Wang, Jiyun Li, Chen Qian
Mammography image usually contains two views in different orientations-CC and MLO. In current computer-aided mammography label prediction systems, most models either assess information from only a single view which increases the false-positive rate or comprehensively evaluate information from four views of two breasts without distinguishing between the two breasts. In this paper, we propose a semantic label prediction model of mammography based on co-consideration of CC and MLO views. Firstly, a DCN is used to classify and enhance dense images. Secondly, a MLLN is designed to generate semantic labels of mammography by fusing the features of CC view and MLO view. The experiment shows that our model improves the prediction mAP of 7.3% compared to the single view model and 23.3% compared to the four-view model, respectively.
{"title":"Semantic Label Prediction of Mammography Based on CC and MLO Views","authors":"Xiaomeng Wang, Jiyun Li, Chen Qian","doi":"10.1109/ICCC51575.2020.9345195","DOIUrl":"https://doi.org/10.1109/ICCC51575.2020.9345195","url":null,"abstract":"Mammography image usually contains two views in different orientations-CC and MLO. In current computer-aided mammography label prediction systems, most models either assess information from only a single view which increases the false-positive rate or comprehensively evaluate information from four views of two breasts without distinguishing between the two breasts. In this paper, we propose a semantic label prediction model of mammography based on co-consideration of CC and MLO views. Firstly, a DCN is used to classify and enhance dense images. Secondly, a MLLN is designed to generate semantic labels of mammography by fusing the features of CC view and MLO view. The experiment shows that our model improves the prediction mAP of 7.3% compared to the single view model and 23.3% compared to the four-view model, respectively.","PeriodicalId":386048,"journal":{"name":"2020 IEEE 6th International Conference on Computer and Communications (ICCC)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115615042","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-12-11DOI: 10.1109/ICCC51575.2020.9344952
Yunliang Liao, Laixian Peng, Renhui Xu, Aijing Li, Lin Ge
At present, most neighbor discovery algorithm mainly uses the 1-way handshake mechanism, which may lead to isolated nodes in the network. In order to solve this problem, an algorithm TSBA is proposed in this article, which uses the 2-way handshake mechanism to make the transmitting and receiving nodes cooperate to ensure the normal operation of subsequent communications. However, while solving the isolated nodes, the algorithm TSBA also caused the conflict and interference among nodes. For this reason, a selective feedback mechanism is added on the basis of the algorithm TSBA, and the algorithm TSBA-PI is pro-posed to reduce the probability of conflict and interference among nodes. By using OPNET 14.5 network simulation software, the performance of the algorithms TSBA, TSBA-PI and the 1-way handshake mechanism algorithm SBA-D (Deterministic Scan based Algorithm) is compared. The results show that the time slots consumed by the nodes in the 2-way handshake mechanism are significantly less than the 1-way handshake. In addition, nodes can quickly complete the neighbor discovery process when using the selective feed-back mechanism.
目前，大多数邻居发现算法主要采用单向握手机制，这可能导致网络中节点隔离。为了解决这一问题，本文提出了TSBA算法，该算法采用双向握手机制，使发送节点和接收节点相互协作，保证后续通信的正常进行。然而，TSBA算法在求解孤立节点的同时，也造成了节点间的冲突和干扰。为此，在TSBA算法的基础上增加了选择性反馈机制，提出了TSBA- pi算法，以降低节点间冲突和干扰的概率。利用OPNET 14.5网络仿真软件，比较了TSBA、TSBA- pi算法和单向握手机制算法SBA-D (Deterministic Scan based algorithm)的性能。结果表明，双向握手机制中节点消耗的时隙明显小于单向握手机制。此外，采用选择性反馈机制，节点可以快速完成邻居发现过程。
{"title":"Neighbor Discovery Algorithm with Collision Avoidance in Ad Hoc Network using Directional Antenna","authors":"Yunliang Liao, Laixian Peng, Renhui Xu, Aijing Li, Lin Ge","doi":"10.1109/ICCC51575.2020.9344952","DOIUrl":"https://doi.org/10.1109/ICCC51575.2020.9344952","url":null,"abstract":"At present, most neighbor discovery algorithm mainly uses the 1-way handshake mechanism, which may lead to isolated nodes in the network. In order to solve this problem, an algorithm TSBA is proposed in this article, which uses the 2-way handshake mechanism to make the transmitting and receiving nodes cooperate to ensure the normal operation of subsequent communications. However, while solving the isolated nodes, the algorithm TSBA also caused the conflict and interference among nodes. For this reason, a selective feedback mechanism is added on the basis of the algorithm TSBA, and the algorithm TSBA-PI is pro-posed to reduce the probability of conflict and interference among nodes. By using OPNET 14.5 network simulation software, the performance of the algorithms TSBA, TSBA-PI and the 1-way handshake mechanism algorithm SBA-D (Deterministic Scan based Algorithm) is compared. The results show that the time slots consumed by the nodes in the 2-way handshake mechanism are significantly less than the 1-way handshake. In addition, nodes can quickly complete the neighbor discovery process when using the selective feed-back mechanism.","PeriodicalId":386048,"journal":{"name":"2020 IEEE 6th International Conference on Computer and Communications (ICCC)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115698629","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：