Pub Date : 2021-04-21DOI: 10.4108/EAI.21-4-2021.169417
Ong Mau Dung, T. Lam, Thanh-Hieu Nguyen
This article explores the intricacies of the ZigBee wireless protocol that works on the underlying IEEE 802.15.4 standard in order to fine-tune it in a way that will meet the unique requirements of a Wireless Body Sensor Network. This particular standard is relatively new and is specifically designed to offer low cost and power consumption, reliability, and inter-operability for sensor and control applications with low to moderate data rates. By simulating ZigBee wireless networks with the possible star, tree, or mesh topologies under different scenarios, the performance of each topology can be evaluated and assessed. The results from the simulations demonstrate that ZigBee wireless networks using the mesh topology have the highest overall performance regardless of the number of nodes. Moreover, the ratio of routers to end-devices in a Personal Area Network can either improve or deteriorate its performance. Received on 23 March 2021; accepted on 19 April 2021; published on 21 April 2021
{"title":"Performance Evaluation of MAC Layer Protocol over Wireless Body Area Sensor Networks","authors":"Ong Mau Dung, T. Lam, Thanh-Hieu Nguyen","doi":"10.4108/EAI.21-4-2021.169417","DOIUrl":"https://doi.org/10.4108/EAI.21-4-2021.169417","url":null,"abstract":"This article explores the intricacies of the ZigBee wireless protocol that works on the underlying IEEE 802.15.4 standard in order to fine-tune it in a way that will meet the unique requirements of a Wireless Body Sensor Network. This particular standard is relatively new and is specifically designed to offer low cost and power consumption, reliability, and inter-operability for sensor and control applications with low to moderate data rates. By simulating ZigBee wireless networks with the possible star, tree, or mesh topologies under different scenarios, the performance of each topology can be evaluated and assessed. The results from the simulations demonstrate that ZigBee wireless networks using the mesh topology have the highest overall performance regardless of the number of nodes. Moreover, the ratio of routers to end-devices in a Personal Area Network can either improve or deteriorate its performance. Received on 23 March 2021; accepted on 19 April 2021; published on 21 April 2021","PeriodicalId":33474,"journal":{"name":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76748218","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 : 2021-01-26DOI: 10.4108/EAI.26-1-2021.168229
Tran Trung Duy, Le Chu Khan, N. Binh, Nguyen Luong Nhat
This paper evaluates intercept probability (IP) of a cooperative cognitive radio network. Using Fountain codes, a secondary source continuously generates encoded packets, and sends them to secondary destination and relay nodes that attempt to receive a sufficient number of the encoded packets for recovering the source data. If the relay can sufficiently collect the packets before the destination, it replaces the source to transmit the encoded packets to the destination. Also in the secondary network, a passive eavesdropper attempts to illegally receive the packets sent by the source and relay nodes, and if it can accumulate enough encoded packets, the source data is intercepted. To enhance secrecy performance, in terms of IP, a cooperative jammer is used to transmit noises on the eavesdropper. We also propose a simple transmit power allocation method for the secondary transmitters such as source, relay and jammer so that outage performance of a primary network is not harmful. We derive an exact closed-form expression of IP over Rayleigh fading channel, and verify it by performing Monte-Carlo simulations. Received on 23 December 2020; accepted on 22 January 2021; published on 26 January 2021
{"title":"Intercept Probability Analysis of Cooperative Cognitive Networks Using Fountain Codes and Cooperative Jamming","authors":"Tran Trung Duy, Le Chu Khan, N. Binh, Nguyen Luong Nhat","doi":"10.4108/EAI.26-1-2021.168229","DOIUrl":"https://doi.org/10.4108/EAI.26-1-2021.168229","url":null,"abstract":"This paper evaluates intercept probability (IP) of a cooperative cognitive radio network. Using Fountain codes, a secondary source continuously generates encoded packets, and sends them to secondary destination and relay nodes that attempt to receive a sufficient number of the encoded packets for recovering the source data. If the relay can sufficiently collect the packets before the destination, it replaces the source to transmit the encoded packets to the destination. Also in the secondary network, a passive eavesdropper attempts to illegally receive the packets sent by the source and relay nodes, and if it can accumulate enough encoded packets, the source data is intercepted. To enhance secrecy performance, in terms of IP, a cooperative jammer is used to transmit noises on the eavesdropper. We also propose a simple transmit power allocation method for the secondary transmitters such as source, relay and jammer so that outage performance of a primary network is not harmful. We derive an exact closed-form expression of IP over Rayleigh fading channel, and verify it by performing Monte-Carlo simulations. Received on 23 December 2020; accepted on 22 January 2021; published on 26 January 2021","PeriodicalId":33474,"journal":{"name":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87245711","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 : 2021-01-26DOI: 10.4108/EAI.26-1-2021.168228
V. Dinh, Thanh B. Chu, Minh-Tuan Le, Vu-Duc Ngo
In this paper, a low-complexity precoding algorithm is proposed to reduce the computational complexity and improve the performance for MU-MIMO systems under exponential spatial correlation channel conditions. The proposed precoders are designed consisting of two components: The first one minimizes the interference among neighboring user groups, while the second one improves the system performance. Numerical and simulation results show that the proposed precoders have remarkably lower computational complexities than their existing LC-RBD-LR-ZF and BD counterparts. Besides, BER performances of the proposed precoders are asymptotic to that of LC-RBD-LR-ZF precoder at the low SNR region and better than that of LC-RBD-LR-ZF precoder at the high SNR region. Simulation results also show that the performance of the proposed algorithms is significantly improved compared to the BD algorithm in an exponential spatial correlation channel.
{"title":"Design of Group Precoding for MU-MIMO Systems with Exponential Spatial Correlation Channel","authors":"V. Dinh, Thanh B. Chu, Minh-Tuan Le, Vu-Duc Ngo","doi":"10.4108/EAI.26-1-2021.168228","DOIUrl":"https://doi.org/10.4108/EAI.26-1-2021.168228","url":null,"abstract":"In this paper, a low-complexity precoding algorithm is proposed to reduce the computational complexity and improve the performance for MU-MIMO systems under exponential spatial correlation channel conditions. The proposed precoders are designed consisting of two components: The first one minimizes the interference among neighboring user groups, while the second one improves the system performance. Numerical and simulation results show that the proposed precoders have remarkably lower computational complexities than their existing LC-RBD-LR-ZF and BD counterparts. Besides, BER performances of the proposed precoders are asymptotic to that of LC-RBD-LR-ZF precoder at the low SNR region and better than that of LC-RBD-LR-ZF precoder at the high SNR region. Simulation results also show that the performance of the proposed algorithms is significantly improved compared to the BD algorithm in an exponential spatial correlation channel.","PeriodicalId":33474,"journal":{"name":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91036374","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 : 2021-01-26DOI: 10.4108/EAI.26-1-2021.168227
Tuan T. Nguyen, Quoc-Tuan Vien, H. Sellahewa
To this day, agriculture still remains very important and plays considerable role to support our daily life and economy in most countries. It is the source of not only food supply, but also providing raw materials for other industries, e.g. plastic, fuel. Currently, farmers are facing the challenge to produce sufficient crops for expanding human population and growing in economy, while maintaining the quality of agriculture products. Pest invasions, however, are a big threat to the growth crops which cause the crop loss and economic consequences. If they are left untreated even in a small area, they can quickly spread out other healthy area or nearby countries. A pest control is therefore crucial to reduce the crop loss. In this paper, we introduce an efficient method basing on deep learning approach to classify pests from images captured from the crops. The proposed method is implemented on various EfficientNet and shown to achieve a considerably high accuracy in a complex dataset, but only a few iterations are required in the training process.
{"title":"An Efficient Pest Classification In Smart Agriculture Using Transfer Learning","authors":"Tuan T. Nguyen, Quoc-Tuan Vien, H. Sellahewa","doi":"10.4108/EAI.26-1-2021.168227","DOIUrl":"https://doi.org/10.4108/EAI.26-1-2021.168227","url":null,"abstract":"To this day, agriculture still remains very important and plays considerable role to support our daily life and economy in most countries. It is the source of not only food supply, but also providing raw materials for other industries, e.g. plastic, fuel. Currently, farmers are facing the challenge to produce sufficient crops for expanding human population and growing in economy, while maintaining the quality of agriculture products. Pest invasions, however, are a big threat to the growth crops which cause the crop loss and economic consequences. If they are left untreated even in a small area, they can quickly spread out other healthy area or nearby countries. A pest control is therefore crucial to reduce the crop loss. In this paper, we introduce an efficient method basing on deep learning approach to classify pests from images captured from the crops. The proposed method is implemented on various EfficientNet and shown to achieve a considerably high accuracy in a complex dataset, but only a few iterations are required in the training process.","PeriodicalId":33474,"journal":{"name":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83121510","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 : 2021-01-07DOI: 10.4108/eai.7-1-2021.167840
A. Samad, Muhammad Azam, Mamoona Qadir
Link prediction in social network gaining high attention of researchers nowadays due to the rush of users towards social network. Link prediction is known as the prediction of missing or unobserved link, i.e., new interaction is going to be occurring in a near future. State-of-the-art link prediction techniques(e.g., Jaccard Index, Resource Allocation, SAM Similarity, Sorensen Index, Salton Cosine, Hub Depressed Index and Parameter-Dependent) considers only similarity of the pair of node in order to find the link. However, we argued that nodes having same status of centralization along with high similarity can connect to each other in a future. In this paper, we have proposed structural importance-based state-of-the-art link prediction techniques and compared. We have compared structural importance-based link prediction techniques with state-of-the-art techniques. The experiments are performed on four di ff erent datasets (i.e., Astro, CondMat, HepPh and HepTh). Our results show that structural importance-based link prediction techniques outperformed than state-of-the-art link prediction techniques by getting 95% at threshold 0.1 and 68% at threshold 0.7.
{"title":"Structural Importance-based Link Prediction Techniques in Social Network","authors":"A. Samad, Muhammad Azam, Mamoona Qadir","doi":"10.4108/eai.7-1-2021.167840","DOIUrl":"https://doi.org/10.4108/eai.7-1-2021.167840","url":null,"abstract":"Link prediction in social network gaining high attention of researchers nowadays due to the rush of users towards social network. Link prediction is known as the prediction of missing or unobserved link, i.e., new interaction is going to be occurring in a near future. State-of-the-art link prediction techniques(e.g., Jaccard Index, Resource Allocation, SAM Similarity, Sorensen Index, Salton Cosine, Hub Depressed Index and Parameter-Dependent) considers only similarity of the pair of node in order to find the link. However, we argued that nodes having same status of centralization along with high similarity can connect to each other in a future. In this paper, we have proposed structural importance-based state-of-the-art link prediction techniques and compared. We have compared structural importance-based link prediction techniques with state-of-the-art techniques. The experiments are performed on four di ff erent datasets (i.e., Astro, CondMat, HepPh and HepTh). Our results show that structural importance-based link prediction techniques outperformed than state-of-the-art link prediction techniques by getting 95% at threshold 0.1 and 68% at threshold 0.7.","PeriodicalId":33474,"journal":{"name":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79525780","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 5G networks, device-to-device (D2D) communications have played an important role in enlarging the coverage, relaxing the workload of backhaul links of both macro base stations (MBSs) and small-cell base stations (SBSs), and serving the mobile users (MUs) local applications and services at high capacity. However, beyond 5G (B5G or 6G) networks will require disruptive solutions that can assist D2D communications to meet numerous advanced applications and services requested by dense MUs. One of the most e ffi cient solutions for D2D communications is multi-hop multi-path (MHMP). In this paper, we present a detailed survey of the so called D2D MHMP communications in terms of models, techniques, and applications for B5G networks. We discuss and propose the future research directions of D2D MHMP communications. All the models, techniques, and applications as well as future research directions of D2D MHMP communications provide the useful insights into B5G networks design and optimisation. of the Creative Commons Attribution license ( ), which permits unlimited use, distribution and reproduction in any medium so long as the original work is properly cited.
{"title":"D2D Multi-hop Multi-path Communications in B5G Networks: A Survey on Models, Techniques, and Applications","authors":"Quang-Nhat Tran, Nguyen-Son Vo, Q. Nguyen, Minh-Phung Bui, Thanh-Minh Phan, Van-Viet Lam, Antonino Masaracchia","doi":"10.4108/eai.7-1-2021.167839","DOIUrl":"https://doi.org/10.4108/eai.7-1-2021.167839","url":null,"abstract":"In 5G networks, device-to-device (D2D) communications have played an important role in enlarging the coverage, relaxing the workload of backhaul links of both macro base stations (MBSs) and small-cell base stations (SBSs), and serving the mobile users (MUs) local applications and services at high capacity. However, beyond 5G (B5G or 6G) networks will require disruptive solutions that can assist D2D communications to meet numerous advanced applications and services requested by dense MUs. One of the most e ffi cient solutions for D2D communications is multi-hop multi-path (MHMP). In this paper, we present a detailed survey of the so called D2D MHMP communications in terms of models, techniques, and applications for B5G networks. We discuss and propose the future research directions of D2D MHMP communications. All the models, techniques, and applications as well as future research directions of D2D MHMP communications provide the useful insights into B5G networks design and optimisation. of the Creative Commons Attribution license ( ), which permits unlimited use, distribution and reproduction in any medium so long as the original work is properly cited.","PeriodicalId":33474,"journal":{"name":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77631023","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 : 2021-01-01DOI: 10.4108/eai.23-6-2021.170241
Van-Hau Nguyen, V. Nam, Linh Dao Manh, V. K. Quy
The mobile ad-hoc network (MANET) is a special mobile network that has self-configuration and self-establish abilities to communicate conveniently. MANET is forming mobile devices such as mobile phones, personal digital assistants (PDAs), laptops, etc. As a result of the rapid, flexibility, and facilitate in communication, nowadays, MANET has revolutionized many real-life applications, ranging from smart agriculture and smart cities to forest fire detection systems, and expected to have vital contributions into the future of the Internet. However, due to the mobile nature of network nodes combined with the network architecture that without relying on central devices pre-installed such as base stations, the high-performance routing problem is one of the most significant challenges in the MANET environment. In this study, we propose a highperformance routing protocol, namely agent-based ad-hoc on-demand distance vector (A-AODV), to select the optimal route with high throughput and low latency. Through the developed routing algorithm, we explain how the suitable route with the lowest cost based on agents. To demonstrate the effectiveness of the proposed protocol, we compared A-AODV’s performance with two well-known traditional protocols on NS2. Simulation results show that A-AODV improves superior performance over the traditional protocols.
{"title":"An Improved Agent-Based AODV Routing Protocol for MANET","authors":"Van-Hau Nguyen, V. Nam, Linh Dao Manh, V. K. Quy","doi":"10.4108/eai.23-6-2021.170241","DOIUrl":"https://doi.org/10.4108/eai.23-6-2021.170241","url":null,"abstract":"The mobile ad-hoc network (MANET) is a special mobile network that has self-configuration and self-establish abilities to communicate conveniently. MANET is forming mobile devices such as mobile phones, personal digital assistants (PDAs), laptops, etc. As a result of the rapid, flexibility, and facilitate in communication, nowadays, MANET has revolutionized many real-life applications, ranging from smart agriculture and smart cities to forest fire detection systems, and expected to have vital contributions into the future of the Internet. However, due to the mobile nature of network nodes combined with the network architecture that without relying on central devices pre-installed such as base stations, the high-performance routing problem is one of the most significant challenges in the MANET environment. In this study, we propose a highperformance routing protocol, namely agent-based ad-hoc on-demand distance vector (A-AODV), to select the optimal route with high throughput and low latency. Through the developed routing algorithm, we explain how the suitable route with the lowest cost based on agents. To demonstrate the effectiveness of the proposed protocol, we compared A-AODV’s performance with two well-known traditional protocols on NS2. Simulation results show that A-AODV improves superior performance over the traditional protocols.","PeriodicalId":33474,"journal":{"name":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78956061","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 : 2021-01-01DOI: 10.4108/eai.7-1-2021.167841
Antonino Masaracchia, M. Nguyen, A. Kortun
This article proposes a performance analysis of a non-orthogonal multiple access (NOMA) transmission system in the presence of user mobility. The main objective is to illustrate how the users’ mobility can affect the system performance in terms of downlink aggregated throughput, downlink network fairness, and percentage of quality-of-service requirement guaranteed. The idea behind is to highlight the importance to take into account user mobility in designing power allocation policies for NOMA systems. It is shown how the communication technologies are mainly dependent from channel state information (CSI) which in turns depends on users’ mobility. In addition a reinforcement learning (RL) to tackle with user mobility is proposed. Performance investigations regarding the proposed framework have shown how the network performances in presence of users’ mobility can be improved, especially when a feed-forward neural network is used as CSI estimator. Received on 10 December 2020; accepted on 19 December 2020; published on 07 January 2021
{"title":"User mobility into NOMA assisted communication: Analysis and a Reinforcement Learning with Neural Network based approach","authors":"Antonino Masaracchia, M. Nguyen, A. Kortun","doi":"10.4108/eai.7-1-2021.167841","DOIUrl":"https://doi.org/10.4108/eai.7-1-2021.167841","url":null,"abstract":"This article proposes a performance analysis of a non-orthogonal multiple access (NOMA) transmission system in the presence of user mobility. The main objective is to illustrate how the users’ mobility can affect the system performance in terms of downlink aggregated throughput, downlink network fairness, and percentage of quality-of-service requirement guaranteed. The idea behind is to highlight the importance to take into account user mobility in designing power allocation policies for NOMA systems. It is shown how the communication technologies are mainly dependent from channel state information (CSI) which in turns depends on users’ mobility. In addition a reinforcement learning (RL) to tackle with user mobility is proposed. Performance investigations regarding the proposed framework have shown how the network performances in presence of users’ mobility can be improved, especially when a feed-forward neural network is used as CSI estimator. Received on 10 December 2020; accepted on 19 December 2020; published on 07 January 2021","PeriodicalId":33474,"journal":{"name":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81964713","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 : 2021-01-01DOI: 10.4108/eai.13-4-2021.169186
Yusuf Özçevik, Elif Bozkaya, Mertkan Akkoç, Muhammed Rasit Erol, B. Canberk
Aerial networks have enormous potential to assist terrestrial communications under heavy tra ffi c requests for a predictable duration. However, such potential for improving both the performance and the coverage through the use of drones can face a major challenge in terms of power limitation. Hence, we consider the energy consumption characteristic of the components in such networks to provide energy aware flight path planning. For this purpose, a flight path planning scheme is proposed on an underlying topology graph that models the energy consumption of path traversals in the aerial network. In the proposed model, we o ff er to seek for the minimum energy consumption on a global problem domain during the entire operational time. Thus, we provide a concrete problem formulation and implement a flight path planning with Genetic Algorithms (GA) approach. Moreover, a novel end-system initiated handover procedure is illustrated to preserve connectivity of terrestrial users in the network architecture. In the end, the evaluation of the proposed model is conducted under three di ff erent scales of social event scenarios. A comparison with a dummy path planning scheme without energy awareness concerns is presented according to a set of parameters. The evaluation outcomes show that the proposed model is able to save 20% energy consumption, provides 15% less number of terrestrial replenishment, and 18% more average endurance for the topology. Besides, another energy aware path planning scheme in the literature o ff ering a deployment with Bellman Ford algorithm is also included in the evaluation to evaluate the feasibility of the proposed framework for the enhanced problem domain.
{"title":"GA-based Energy Aware Path Planning Framework for Aerial Network Assistance","authors":"Yusuf Özçevik, Elif Bozkaya, Mertkan Akkoç, Muhammed Rasit Erol, B. Canberk","doi":"10.4108/eai.13-4-2021.169186","DOIUrl":"https://doi.org/10.4108/eai.13-4-2021.169186","url":null,"abstract":"Aerial networks have enormous potential to assist terrestrial communications under heavy tra ffi c requests for a predictable duration. However, such potential for improving both the performance and the coverage through the use of drones can face a major challenge in terms of power limitation. Hence, we consider the energy consumption characteristic of the components in such networks to provide energy aware flight path planning. For this purpose, a flight path planning scheme is proposed on an underlying topology graph that models the energy consumption of path traversals in the aerial network. In the proposed model, we o ff er to seek for the minimum energy consumption on a global problem domain during the entire operational time. Thus, we provide a concrete problem formulation and implement a flight path planning with Genetic Algorithms (GA) approach. Moreover, a novel end-system initiated handover procedure is illustrated to preserve connectivity of terrestrial users in the network architecture. In the end, the evaluation of the proposed model is conducted under three di ff erent scales of social event scenarios. A comparison with a dummy path planning scheme without energy awareness concerns is presented according to a set of parameters. The evaluation outcomes show that the proposed model is able to save 20% energy consumption, provides 15% less number of terrestrial replenishment, and 18% more average endurance for the topology. Besides, another energy aware path planning scheme in the literature o ff ering a deployment with Bellman Ford algorithm is also included in the evaluation to evaluate the feasibility of the proposed framework for the enhanced problem domain.","PeriodicalId":33474,"journal":{"name":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79139551","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
扫码关注我们
求助内容：
应助结果提醒方式：