This paper focuses on discussing the strategy of moving target defense (MTD) system. We divide the strategies of MTD system into two categories: User-relevant strategy and User-irrelevant strategy. Also we analyze the two strategies, and give the more detailed classifications of two strategies. In addition, we discuss each detailed classifications of strategies, and make a comparison between these strategies. The comparison about time complexity and enhancement of security. At last, we conduct experiments on MTD web service system and get some results. Also, we point some further research work that we can do in future.
{"title":"A Comparison of Moving Target Defense Strategies","authors":"Jingzhe Zhang, Dongxia Wang, Xuewei Feng","doi":"10.1109/MASS.2018.00084","DOIUrl":"https://doi.org/10.1109/MASS.2018.00084","url":null,"abstract":"This paper focuses on discussing the strategy of moving target defense (MTD) system. We divide the strategies of MTD system into two categories: User-relevant strategy and User-irrelevant strategy. Also we analyze the two strategies, and give the more detailed classifications of two strategies. In addition, we discuss each detailed classifications of strategies, and make a comparison between these strategies. The comparison about time complexity and enhancement of security. At last, we conduct experiments on MTD web service system and get some results. Also, we point some further research work that we can do in future.","PeriodicalId":297945,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122688896","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 : 1900-01-01DOI: 10.1109/MASS52906.2021.00027
Ying Gao, Hongbin Dong, S. Ou, Jin-dong Xu, Zhuoran Cai
Momentum term technique is an efficient resolution to accelerate the convergence speed of adaptive blind source separation (BSS) algorithms, however, the BSS algorithm combined with a momentum term also suffers from the tradeoff between the fast convergence speed and small misadjustment error. In order to alleviate such compromise, an optimal variable momentum factor method is used to boost the separating performance of the nonlinear principal component analysis (NPCA) BSS algorithm. At first, by using the projection approximation, the cost function of the NPCA algorithm can be represented as a quadratic function of the momentum factor. Then the optimal momentum factor is obtained on the basis of the gradient decent technique, which makes the cost function descend in the fastest way during each iteration. Simulation experiment results manifest that the modified algorithm can improve the convergence speed and decrease the final misadjustment error more effective compared with the classical NPCA algorithms and the fixed momentum factor NPCA algorithms.
{"title":"Optimal Variable Momentum Factor Algorithm for NPCA in Blind Source Separation","authors":"Ying Gao, Hongbin Dong, S. Ou, Jin-dong Xu, Zhuoran Cai","doi":"10.1109/MASS52906.2021.00027","DOIUrl":"https://doi.org/10.1109/MASS52906.2021.00027","url":null,"abstract":"Momentum term technique is an efficient resolution to accelerate the convergence speed of adaptive blind source separation (BSS) algorithms, however, the BSS algorithm combined with a momentum term also suffers from the tradeoff between the fast convergence speed and small misadjustment error. In order to alleviate such compromise, an optimal variable momentum factor method is used to boost the separating performance of the nonlinear principal component analysis (NPCA) BSS algorithm. At first, by using the projection approximation, the cost function of the NPCA algorithm can be represented as a quadratic function of the momentum factor. Then the optimal momentum factor is obtained on the basis of the gradient decent technique, which makes the cost function descend in the fastest way during each iteration. Simulation experiment results manifest that the modified algorithm can improve the convergence speed and decrease the final misadjustment error more effective compared with the classical NPCA algorithms and the fixed momentum factor NPCA algorithms.","PeriodicalId":297945,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125204840","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 : 1900-01-01DOI: 10.1109/MAHSS.2004.1392168
Ya-feng Wu, Yinlong Xu, Guoliang Chen, Kun Wang
With the proliferation of portable computing devices and ascending popularity of group-oriented computing, wireless ad hoc network multicasting remains a challenging research subject. While the virtual multicast backbone (VMB) structure is commonly used in current multicast protocols, this paper focuses on the construction of the optimal VMB with the fewest forwarding nodes to decrease overhead and cost, due to the scarce resource in ad hoc networks. Instead of the conventional Steiner tree model, the optimal shared VMB in ad hoc networks is modeled as the minimum Steiner dominating set (MSCDS) in unit-disk graphs (UDG), which is NP-hard. A performance evaluation of flooding for MSCDS is given and a one-hop algorithm is proposed with an approximation ratio of at most 10. To adapt various network scenarios, this paper further presents a fully distributed d-hop algorithm also with a constant approximation ratio, which organizes multicast nodes to form a hierarchical VMB. Based on the hierarchical structure, this paper proposes some approaches to maintain and update VMB, and gives a security framework to exclude malicious nodes from multicast groups. Simulation results show that the proposed algorithms perform very well.
{"title":"On the construction of virtual multicast backbone for wireless ad hoc networks","authors":"Ya-feng Wu, Yinlong Xu, Guoliang Chen, Kun Wang","doi":"10.1109/MAHSS.2004.1392168","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392168","url":null,"abstract":"With the proliferation of portable computing devices and ascending popularity of group-oriented computing, wireless ad hoc network multicasting remains a challenging research subject. While the virtual multicast backbone (VMB) structure is commonly used in current multicast protocols, this paper focuses on the construction of the optimal VMB with the fewest forwarding nodes to decrease overhead and cost, due to the scarce resource in ad hoc networks. Instead of the conventional Steiner tree model, the optimal shared VMB in ad hoc networks is modeled as the minimum Steiner dominating set (MSCDS) in unit-disk graphs (UDG), which is NP-hard. A performance evaluation of flooding for MSCDS is given and a one-hop algorithm is proposed with an approximation ratio of at most 10. To adapt various network scenarios, this paper further presents a fully distributed d-hop algorithm also with a constant approximation ratio, which organizes multicast nodes to form a hierarchical VMB. Based on the hierarchical structure, this paper proposes some approaches to maintain and update VMB, and gives a security framework to exclude malicious nodes from multicast groups. Simulation results show that the proposed algorithms perform very well.","PeriodicalId":297945,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121473455","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}
The usage of IoT devices is rapidly growing recently and it raises the challenge of supporting a dynamic network of dense IoT devices with low latency and high throughput. Among the network multiple access protocols, Time Division Multiple Access(TDMA) is most suitable for this scene for its time efficiency and easy implementation. However, TDMA protocols typically perform poorly when confronted with the merging collision problem incurred especially in dynamic networks. Inspired by the coloring mechanism and spatial reuse introduced by 802.11ax, we created a cluster-based TDMA network system that can predict incoming collisions and avoid the collisions by rescheduling or extending the frame length before they actually happen. It can achieve zero-collision TDMA networks with optimal frame length and thus enhances the overall throughput and latency.
{"title":"CTDMA: Color-aware TDMA Network System For Low latency and High Throughput in Dense D2D Wireless Network","authors":"Xiuxian Guan, Yawei Li, Yuexuan Wang, Zekai Sun, Shengliang Deng, Heming Cui","doi":"10.1109/MASS50613.2020.00047","DOIUrl":"https://doi.org/10.1109/MASS50613.2020.00047","url":null,"abstract":"The usage of IoT devices is rapidly growing recently and it raises the challenge of supporting a dynamic network of dense IoT devices with low latency and high throughput. Among the network multiple access protocols, Time Division Multiple Access(TDMA) is most suitable for this scene for its time efficiency and easy implementation. However, TDMA protocols typically perform poorly when confronted with the merging collision problem incurred especially in dynamic networks. Inspired by the coloring mechanism and spatial reuse introduced by 802.11ax, we created a cluster-based TDMA network system that can predict incoming collisions and avoid the collisions by rescheduling or extending the frame length before they actually happen. It can achieve zero-collision TDMA networks with optimal frame length and thus enhances the overall throughput and latency.","PeriodicalId":297945,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127189788","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}
Industrial wireless networks IWNs, different from ad hoc and traditional mesh networks, feature in centralised management architecture and energy-limited devices. In this paper, we propose a technique based on extremal optimisation EO approach to solve the joint routing and link scheduling problem in IWNs. After analysing the feasibility of cross-layer optimisation in IWNs, an integer linear programming ILP problem in accordance with the characteristics of IWNs, is presented to optimise the real-time performance and the network lifetime. Further, EO is investigated to solve the ILP model, where the fitness assignment strategy, mutation rules and operating process are designed. To our knowledge, it's the first time that EO is applied for scheduling problem in wireless networks. Numerical results show that our approach can achieve real-time communication with improved latency and optimal network lifetime with balanced energy consumption among nodes. And the trade-off between energy consumption and path delay is further demonstrated.
{"title":"Extremal Optimization Approach to Joint Routing and Scheduling for Industrial Wireless Networks","authors":"Zhidong He, Wenjun Huang","doi":"10.1109/MASS.2013.42","DOIUrl":"https://doi.org/10.1109/MASS.2013.42","url":null,"abstract":"Industrial wireless networks IWNs, different from ad hoc and traditional mesh networks, feature in centralised management architecture and energy-limited devices. In this paper, we propose a technique based on extremal optimisation EO approach to solve the joint routing and link scheduling problem in IWNs. After analysing the feasibility of cross-layer optimisation in IWNs, an integer linear programming ILP problem in accordance with the characteristics of IWNs, is presented to optimise the real-time performance and the network lifetime. Further, EO is investigated to solve the ILP model, where the fitness assignment strategy, mutation rules and operating process are designed. To our knowledge, it's the first time that EO is applied for scheduling problem in wireless networks. Numerical results show that our approach can achieve real-time communication with improved latency and optimal network lifetime with balanced energy consumption among nodes. And the trade-off between energy consumption and path delay is further demonstrated.","PeriodicalId":297945,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems","volume":"68 9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126379888","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
扫码关注我们
求助内容：
应助结果提醒方式：