Pub Date : 2019-05-01DOI: 10.1109/WOCC.2019.8770635
Zihui Yan, Ning Wei, Qizhen Jin, Xiaobo Zhou
Software defined networking (SDN) is a key technology in building future generation networks by decoupling the control and data plane. By allowing multiple virtual networks (VN) to coexist in the same underlying SDN, virtual software defined networking (vSDN) can further improve the resource utilization and satisfy the diverse quality of service (QoS) requirements of users. Different from traditional VN embedding, there are more types of resources need to be allocated in vSDN. In addition, the control plane latency impacts on the performance of vSDN, especially when control flow and data flow share the same substrate links. Therefore, a key problem is minimizing the control latency while maintaining load balance. In this paper, we propose a heuristic latency-aware resource-efficient algorithm to solve it, after formulating the vSDN embedding problem as the integer linear programming model. In our method, we first aggregate the candidate physical nodes having similar resources proportion with the virtual node based on K-Means clustering. Then, the optimal physical node is selected out from the cluster according to the control latency derived from network calculus. Finally, the K-shortest path algorithm executes to map virtual links to the substrate paths between the corresponding substrate node. Simulation results demonstrate that the proposed algorithm improves the vSDN acceptance ratio by around 20% than an existing greedy algorithm with the controller-to-switch latency guarantee.
{"title":"Latency-Aware Resource-Efficient Virtual Network Embedding in Software Defined Networking","authors":"Zihui Yan, Ning Wei, Qizhen Jin, Xiaobo Zhou","doi":"10.1109/WOCC.2019.8770635","DOIUrl":"https://doi.org/10.1109/WOCC.2019.8770635","url":null,"abstract":"Software defined networking (SDN) is a key technology in building future generation networks by decoupling the control and data plane. By allowing multiple virtual networks (VN) to coexist in the same underlying SDN, virtual software defined networking (vSDN) can further improve the resource utilization and satisfy the diverse quality of service (QoS) requirements of users. Different from traditional VN embedding, there are more types of resources need to be allocated in vSDN. In addition, the control plane latency impacts on the performance of vSDN, especially when control flow and data flow share the same substrate links. Therefore, a key problem is minimizing the control latency while maintaining load balance. In this paper, we propose a heuristic latency-aware resource-efficient algorithm to solve it, after formulating the vSDN embedding problem as the integer linear programming model. In our method, we first aggregate the candidate physical nodes having similar resources proportion with the virtual node based on K-Means clustering. Then, the optimal physical node is selected out from the cluster according to the control latency derived from network calculus. Finally, the K-shortest path algorithm executes to map virtual links to the substrate paths between the corresponding substrate node. Simulation results demonstrate that the proposed algorithm improves the vSDN acceptance ratio by around 20% than an existing greedy algorithm with the controller-to-switch latency guarantee.","PeriodicalId":285172,"journal":{"name":"2019 28th Wireless and Optical Communications Conference (WOCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125905311","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}
In this paper, we study the problem of downlink power allocation in the multi-UAV enabled wireless networks, where the unmanned aerial vehicles (UAVs) act as the aerial base stations (BSs) to serve a group of users on the ground. To solve the problem, we propose a price-based optimal power allocation scheme, and model the interaction between the UAVs and the ground users as a Stackelberg game. As the leaders of the game, the UAVs choose the optimal power price to maximize their own revenue. Each ground user of the networks selects optimal power strategy to maximize its own utility. In order to solve the equilibrium program with equilibrium constraints (EPEC) problem of the Stackelberg game, we investigate the lower equilibrium of the ground users, and propose a distributed iterative algorithm to obtain the equilibrium of the lower game. Simulation results show that through the price-based optimal power allocation scheme, the capacity of the BSs and the rates of users are improved.
{"title":"Price-based Power Allocation for Multi-UAV Enabled Wireless Networks","authors":"Xiaomin Liu, Lixin Li, Fucheng Yang, Xu Li, Wei Chen, Wenjun Xu","doi":"10.1109/WOCC.2019.8770581","DOIUrl":"https://doi.org/10.1109/WOCC.2019.8770581","url":null,"abstract":"In this paper, we study the problem of downlink power allocation in the multi-UAV enabled wireless networks, where the unmanned aerial vehicles (UAVs) act as the aerial base stations (BSs) to serve a group of users on the ground. To solve the problem, we propose a price-based optimal power allocation scheme, and model the interaction between the UAVs and the ground users as a Stackelberg game. As the leaders of the game, the UAVs choose the optimal power price to maximize their own revenue. Each ground user of the networks selects optimal power strategy to maximize its own utility. In order to solve the equilibrium program with equilibrium constraints (EPEC) problem of the Stackelberg game, we investigate the lower equilibrium of the ground users, and propose a distributed iterative algorithm to obtain the equilibrium of the lower game. Simulation results show that through the price-based optimal power allocation scheme, the capacity of the BSs and the rates of users are improved.","PeriodicalId":285172,"journal":{"name":"2019 28th Wireless and Optical Communications Conference (WOCC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125130624","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 : 2019-05-01DOI: 10.1109/WOCC.2019.8770665
Meijie Yang, Yueyun Chen, Yuan Liu, Liping Du, Zushen Liu
Filtered-orthogonal frequency division multiplexing (F-OFDM) is a potential waveform which uses sub-band filtering to support multi-numerologies in the future 5G systems. It is a future trend to combine F-OFDM with MIMO to further improve the system capacity. However, when employing different numerologies, a long filter length is needed to suppress severe inter-user interference (IUI) caused by various symbol duration in time domain, which causes inter-symbol interference (ISI) and inter-carrier interference (ICI) at the same time. Longer CP is helpful to resist the effect of multipath and filter responds but will waste more time resource. In order to reduce ISI and ICI while improving the spectrum efficiency, we propose a CP optimization model based on theoretical derivation of ISI, ICI and IUI for downlink MIMO F-OFDM system. The simulation results show that the ISI and ICI decrease as CP gets longer, while the spectrum efficiency is improved based on the proposed CP optimization model and outperforms traditional OFDM.
{"title":"CP Optimization for Multi-numerologies F-OFDM in MIMO System","authors":"Meijie Yang, Yueyun Chen, Yuan Liu, Liping Du, Zushen Liu","doi":"10.1109/WOCC.2019.8770665","DOIUrl":"https://doi.org/10.1109/WOCC.2019.8770665","url":null,"abstract":"Filtered-orthogonal frequency division multiplexing (F-OFDM) is a potential waveform which uses sub-band filtering to support multi-numerologies in the future 5G systems. It is a future trend to combine F-OFDM with MIMO to further improve the system capacity. However, when employing different numerologies, a long filter length is needed to suppress severe inter-user interference (IUI) caused by various symbol duration in time domain, which causes inter-symbol interference (ISI) and inter-carrier interference (ICI) at the same time. Longer CP is helpful to resist the effect of multipath and filter responds but will waste more time resource. In order to reduce ISI and ICI while improving the spectrum efficiency, we propose a CP optimization model based on theoretical derivation of ISI, ICI and IUI for downlink MIMO F-OFDM system. The simulation results show that the ISI and ICI decrease as CP gets longer, while the spectrum efficiency is improved based on the proposed CP optimization model and outperforms traditional OFDM.","PeriodicalId":285172,"journal":{"name":"2019 28th Wireless and Optical Communications Conference (WOCC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122860075","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 : 2019-05-01DOI: 10.1109/WOCC.2019.8770547
Bo Wang, Wei Xiang, Kairen Ma, Y. Mu, Zheng Wu
In view of the fact that most of the crutches on the market have a single function, they are not convenient for the elderly and blind people to go out and very expensive. In this design, the gyroscope accelerometer module, ultrasonic module, SIM868 module, voice module and so on are controlled by STM32F103 microcontroller, which realizes the detection of obstacles ahead, crutches quickly drop the ground alarm, crutch voice prompt and other basic functions. The APP of mobile phone with hardware is written to the family of crutches, which can update the user's position, security and other information in real time. Therefore, the design not only realizes many key functions, but also increases the exchange of information between users and their families, making it more secure for users to go out alone and the families more assured.
{"title":"Design and implementation of intelligent walking stick based on OneNET Internet of things development platform","authors":"Bo Wang, Wei Xiang, Kairen Ma, Y. Mu, Zheng Wu","doi":"10.1109/WOCC.2019.8770547","DOIUrl":"https://doi.org/10.1109/WOCC.2019.8770547","url":null,"abstract":"In view of the fact that most of the crutches on the market have a single function, they are not convenient for the elderly and blind people to go out and very expensive. In this design, the gyroscope accelerometer module, ultrasonic module, SIM868 module, voice module and so on are controlled by STM32F103 microcontroller, which realizes the detection of obstacles ahead, crutches quickly drop the ground alarm, crutch voice prompt and other basic functions. The APP of mobile phone with hardware is written to the family of crutches, which can update the user's position, security and other information in real time. Therefore, the design not only realizes many key functions, but also increases the exchange of information between users and their families, making it more secure for users to go out alone and the families more assured.","PeriodicalId":285172,"journal":{"name":"2019 28th Wireless and Optical Communications Conference (WOCC)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121112214","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 : 2019-05-01DOI: 10.1109/WOCC.2019.8770642
Huan Wang, W. Huangfu, Yunhui Qin, Keping Long
The base station location optimization is one of the most important issues in cellular networks. A novel genetic algorithm combined with the virtual force decoration to improve coverage performance of cellular networks is proposed. The virtual force decoration modifies the individuals and provides a better direction guide for the gene mutation. Experiences prove the proposed algorithm not only obtains higher coverage rate but also converges faster than the standard genetic algorithms.
{"title":"Virtual Force-Decorated Genetic Algorithm to Optimize Base Station Locations","authors":"Huan Wang, W. Huangfu, Yunhui Qin, Keping Long","doi":"10.1109/WOCC.2019.8770642","DOIUrl":"https://doi.org/10.1109/WOCC.2019.8770642","url":null,"abstract":"The base station location optimization is one of the most important issues in cellular networks. A novel genetic algorithm combined with the virtual force decoration to improve coverage performance of cellular networks is proposed. The virtual force decoration modifies the individuals and provides a better direction guide for the gene mutation. Experiences prove the proposed algorithm not only obtains higher coverage rate but also converges faster than the standard genetic algorithms.","PeriodicalId":285172,"journal":{"name":"2019 28th Wireless and Optical Communications Conference (WOCC)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114737835","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}
In this paper, we consider the neighbor discovery problem in Flying Ad Hoc Network using directional antennas. Based on realistic scenarios, the height of UAVs can be approximated to follow a Gaussian distribution. A novel 2-way neighbor discovery algorithm that adjusts the selection probability according to transmission space divided by pitch angle parameter is proposed. Then we derive analytical expressions of the probability of a successful discovery between two nodes and the expected value of time slots needed to complete the neighbor discovery. We also adopt a practical way to determine when to terminate the discovery procedure. Lastly, simulation results are presented to show the effectiveness of proposed algorithm.
{"title":"A Neighbor Discovery Algorithm for Flying Ad Hoc Network Using Directional Antennas","authors":"Lingjun Liu, Laixian Peng, Renhui Xu, Wendong Zhao","doi":"10.1109/WOCC.2019.8770698","DOIUrl":"https://doi.org/10.1109/WOCC.2019.8770698","url":null,"abstract":"In this paper, we consider the neighbor discovery problem in Flying Ad Hoc Network using directional antennas. Based on realistic scenarios, the height of UAVs can be approximated to follow a Gaussian distribution. A novel 2-way neighbor discovery algorithm that adjusts the selection probability according to transmission space divided by pitch angle parameter is proposed. Then we derive analytical expressions of the probability of a successful discovery between two nodes and the expected value of time slots needed to complete the neighbor discovery. We also adopt a practical way to determine when to terminate the discovery procedure. Lastly, simulation results are presented to show the effectiveness of proposed algorithm.","PeriodicalId":285172,"journal":{"name":"2019 28th Wireless and Optical Communications Conference (WOCC)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127687043","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 : 2019-05-01DOI: 10.1109/WOCC.2019.8770651
Yawei Song, Yunfeng Peng, Liang Zhang
Face recognition has been widely used in airport security, face payment, access control, and other scenarios. Face recognition contains a sequence of tasks, e.g. face detection, preprocessing, feature extraction and classification recognition. This paper focuses on the dynamic tasks assignment for face recognition in edge computing architecture. Our preliminary experimental results show that different ways of assigning tasks can significantly affect the response time of face recognition services. Motivated by this finding, we propose a new framework for face recognition in edge computing architecture which supports the face recognition tasks assignment to Edge server and Cloud server. We further propose a dynamic tasks allocation algorithm based on decision tree that minimizes the overall response time for face recognition. Simulation results indicate that the average response time of our scheme is 62.5%, 34.7%, and 17.4% lower than that of a simple model, cloud model, and fog computing (FC) model respectively.
{"title":"Dynamic Tasks Assignment for Face Recognition in Edge Computing","authors":"Yawei Song, Yunfeng Peng, Liang Zhang","doi":"10.1109/WOCC.2019.8770651","DOIUrl":"https://doi.org/10.1109/WOCC.2019.8770651","url":null,"abstract":"Face recognition has been widely used in airport security, face payment, access control, and other scenarios. Face recognition contains a sequence of tasks, e.g. face detection, preprocessing, feature extraction and classification recognition. This paper focuses on the dynamic tasks assignment for face recognition in edge computing architecture. Our preliminary experimental results show that different ways of assigning tasks can significantly affect the response time of face recognition services. Motivated by this finding, we propose a new framework for face recognition in edge computing architecture which supports the face recognition tasks assignment to Edge server and Cloud server. We further propose a dynamic tasks allocation algorithm based on decision tree that minimizes the overall response time for face recognition. Simulation results indicate that the average response time of our scheme is 62.5%, 34.7%, and 17.4% lower than that of a simple model, cloud model, and fog computing (FC) model respectively.","PeriodicalId":285172,"journal":{"name":"2019 28th Wireless and Optical Communications Conference (WOCC)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133062492","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 : 2019-05-01DOI: 10.1109/WOCC.2019.8770693
Jianxin Li, Meng Li, Wei Li
This paper focused on satellite communication on compatibility study between non-geostationary system and the geostationary system in the fixed-satellite service. Nowadays, both geostationary and non-geostationary fixed-satellite service satellite systems may operate in the frequency bands 37.5-39.5 GHz (space-to-Earth), 39.5-42.5 GHz (space-to-Earth), 47.2-50.2 GHz (Earth-to-space) and 50.4-51.4 GHz (Earth-to-space). However, there is currently no protection standard shared by the two systems in the Q/V frequency bands. This study uses the representative Low Earth orbit satellite to calculate the interference of two systems. In order to evaluate the level of interference, this paper specially selects the medium-sized satellite constellation with 336 satellites to calculate the aggregate interference level. Study used two tracking communication strategies, the maximum antenna Gain identification and the best elevation angle, to choose related satellite for considering different levels of interference. Paper calculated and analysed the compatible application of geostationary and non-geostationary fixed-satellite service system, and obtained preliminary compatibility and sharing conditions.
{"title":"Satellite communication on the non-geostationary system and the geostationary system in the Fixed-satellite service","authors":"Jianxin Li, Meng Li, Wei Li","doi":"10.1109/WOCC.2019.8770693","DOIUrl":"https://doi.org/10.1109/WOCC.2019.8770693","url":null,"abstract":"This paper focused on satellite communication on compatibility study between non-geostationary system and the geostationary system in the fixed-satellite service. Nowadays, both geostationary and non-geostationary fixed-satellite service satellite systems may operate in the frequency bands 37.5-39.5 GHz (space-to-Earth), 39.5-42.5 GHz (space-to-Earth), 47.2-50.2 GHz (Earth-to-space) and 50.4-51.4 GHz (Earth-to-space). However, there is currently no protection standard shared by the two systems in the Q/V frequency bands. This study uses the representative Low Earth orbit satellite to calculate the interference of two systems. In order to evaluate the level of interference, this paper specially selects the medium-sized satellite constellation with 336 satellites to calculate the aggregate interference level. Study used two tracking communication strategies, the maximum antenna Gain identification and the best elevation angle, to choose related satellite for considering different levels of interference. Paper calculated and analysed the compatible application of geostationary and non-geostationary fixed-satellite service system, and obtained preliminary compatibility and sharing conditions.","PeriodicalId":285172,"journal":{"name":"2019 28th Wireless and Optical Communications Conference (WOCC)","volume":"326 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134194195","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 : 2019-05-01DOI: 10.1109/WOCC.2019.8770659
Jianshuang Xu, J. Klein, Christian Brauers, R. Kays
Visible Light Communication is a promising technology for data transmission, which has become more and more relevant in recent years. Other than the common approach of modulated LED lighting, display-camera communication has become an attractive novel take on the concept. As outlined in earlier papers, the DaViD (Data Transmission Using Video Displays) system provides a modulation concept allowing for a data overlay onto video content which is nearly invisible to the viewer, i.e. causing hardly any perceptible degradation in video quality. This is achieved by differentially modulating the chrominance information of the underlying video frames with low amplitudes. The resulting color differences within the recorded images can be interpreted by the receiver, allowing for reconstruction of the transmitted data. In this paper, we introduce further system details and improvements to the DaViD concept. In addition to traditional transmission systems, on the display-camera link, the receiver has to be not only temporally but also spatially synchronized to the transmitter. We address the spatial synchronization problem by utilizing localization patterns for detecting the modulation area and a separate optimization on columns and rows for data resampling. Using a slight temporal oversampling, clean data frames can be reconstructed on the receiver side. Based on our modulation and coding concept, we achieve a data rate up to 34.56 Mbit/s in our current demonstration setup with hardly any visible degradation in video quality.
{"title":"Transmitter Design and Synchronization Concepts for DaViD Display Camera Communication","authors":"Jianshuang Xu, J. Klein, Christian Brauers, R. Kays","doi":"10.1109/WOCC.2019.8770659","DOIUrl":"https://doi.org/10.1109/WOCC.2019.8770659","url":null,"abstract":"Visible Light Communication is a promising technology for data transmission, which has become more and more relevant in recent years. Other than the common approach of modulated LED lighting, display-camera communication has become an attractive novel take on the concept. As outlined in earlier papers, the DaViD (Data Transmission Using Video Displays) system provides a modulation concept allowing for a data overlay onto video content which is nearly invisible to the viewer, i.e. causing hardly any perceptible degradation in video quality. This is achieved by differentially modulating the chrominance information of the underlying video frames with low amplitudes. The resulting color differences within the recorded images can be interpreted by the receiver, allowing for reconstruction of the transmitted data. In this paper, we introduce further system details and improvements to the DaViD concept. In addition to traditional transmission systems, on the display-camera link, the receiver has to be not only temporally but also spatially synchronized to the transmitter. We address the spatial synchronization problem by utilizing localization patterns for detecting the modulation area and a separate optimization on columns and rows for data resampling. Using a slight temporal oversampling, clean data frames can be reconstructed on the receiver side. Based on our modulation and coding concept, we achieve a data rate up to 34.56 Mbit/s in our current demonstration setup with hardly any visible degradation in video quality.","PeriodicalId":285172,"journal":{"name":"2019 28th Wireless and Optical Communications Conference (WOCC)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129580221","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 : 2019-05-01DOI: 10.1109/WOCC.2019.8770680
F. Aftab, Zhongshan Zhang
The dynamic changes in cluster topology of Mobile Ad-hoc Network (MANET) can cause cluster management issues. Cluster management in the presence of mobility and cluster load balancing are among the most difficult issues to handle in mobility aware MANET. In this paper, we propose a self-organization based hybrid scheme for cluster management. This scheme is inspired from the behavioral study of firefly and dragonfly. Hybrid scheme consists of different phases which ensure cluster formation and its management. The cluster formation takes place by using energy aware approach of firefly algorithm while cluster management takes place using behavioral study of both dragonfly and firefly. A cluster merging technique is proposed for refining number of clusters in MANET to achieve cluster load balancing. The performance of proposed hybrid scheme is evaluated and compared with the existing scheme by considering the benchmarks of energy consumption, cluster head advertisement messages and topology distribution with respect to hop count.
{"title":"Hybrid Self-Organization based Cluster Management Scheme for Group Mobility Aware MANET","authors":"F. Aftab, Zhongshan Zhang","doi":"10.1109/WOCC.2019.8770680","DOIUrl":"https://doi.org/10.1109/WOCC.2019.8770680","url":null,"abstract":"The dynamic changes in cluster topology of Mobile Ad-hoc Network (MANET) can cause cluster management issues. Cluster management in the presence of mobility and cluster load balancing are among the most difficult issues to handle in mobility aware MANET. In this paper, we propose a self-organization based hybrid scheme for cluster management. This scheme is inspired from the behavioral study of firefly and dragonfly. Hybrid scheme consists of different phases which ensure cluster formation and its management. The cluster formation takes place by using energy aware approach of firefly algorithm while cluster management takes place using behavioral study of both dragonfly and firefly. A cluster merging technique is proposed for refining number of clusters in MANET to achieve cluster load balancing. The performance of proposed hybrid scheme is evaluated and compared with the existing scheme by considering the benchmarks of energy consumption, cluster head advertisement messages and topology distribution with respect to hop count.","PeriodicalId":285172,"journal":{"name":"2019 28th Wireless and Optical Communications Conference (WOCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127734485","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
扫码关注我们
求助内容：
应助结果提醒方式：