Pub Date : 2018-05-31DOI: 10.1109/WCNCW.2018.8368994
L. Fawcett, M. Broadbent, N. Race
The burden put on network infrastructures is changing. The increasing number of connected devices, along with growing demand, are creating an unsustainable future for the Internet. The recently introduced concept of Fog computing predicts a future Internet where general compute power is ubiquitous, extending the Cloud right the way to the network edge. In turn, this acts as a catalyst for Network Functions Virtualisation (NFV), increasing the potential infrastructure locations for deploying new services, specifically ones that can cater to the demands of the changing Internet. However, current realisations of NFV typically host network functions in homogeneous, centralised servers in Cloud infrastructures. This is in contrast to the Fog where environments are both distributed and heterogeneous, thus current management and orchestration platforms suffer from suboptimal service deployment. With the use of a multiple use cases, and a novel auctioning orchestration method, this paper presents Siren, which is an orchestrator for network functions in the Cloud to Fog continuum.
{"title":"Siren: A platform for deploying virtual network services in the cloud to Fog continuum","authors":"L. Fawcett, M. Broadbent, N. Race","doi":"10.1109/WCNCW.2018.8368994","DOIUrl":"https://doi.org/10.1109/WCNCW.2018.8368994","url":null,"abstract":"The burden put on network infrastructures is changing. The increasing number of connected devices, along with growing demand, are creating an unsustainable future for the Internet. The recently introduced concept of Fog computing predicts a future Internet where general compute power is ubiquitous, extending the Cloud right the way to the network edge. In turn, this acts as a catalyst for Network Functions Virtualisation (NFV), increasing the potential infrastructure locations for deploying new services, specifically ones that can cater to the demands of the changing Internet. However, current realisations of NFV typically host network functions in homogeneous, centralised servers in Cloud infrastructures. This is in contrast to the Fog where environments are both distributed and heterogeneous, thus current management and orchestration platforms suffer from suboptimal service deployment. With the use of a multiple use cases, and a novel auctioning orchestration method, this paper presents Siren, which is an orchestrator for network functions in the Cloud to Fog continuum.","PeriodicalId":122391,"journal":{"name":"2018 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116107659","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 : 2018-04-26DOI: 10.1109/WCNCW.2018.8368979
A. M. Kuzminskiy, P. Xiao, R. Tafazolli
Spectrum sharing and employing highly directional antennas in the mm-wave bands are considered among the key enablers for 5G networks. Conventional interference avoidance techniques like listen-before-talk (LBT) may not be efficient for such coexisting networks. In this paper, we address a coexistence mechanism by means of distributed beam scheduling with minimum cooperation between spectrum sharing subsystems without any direct data exchange between them. We extend a “Good Neighbor” (GN) principle initially developed for decentralized spectrum allocation to the distributed beam scheduling problem. To do that, we introduce relative performance targets, develop a GN beam scheduling algorithm, and demonstrate its efficiency in terms of performance/complexity trade off compared to that of the conventional selfish (SLF) and recently proposed distributed learning scheduling (DLS) solutions by means of simulations in highly directional antenna mm-wave scenarios.
{"title":"Good neighbor distributed beam scheduling in coexisting multi-RAT networks","authors":"A. M. Kuzminskiy, P. Xiao, R. Tafazolli","doi":"10.1109/WCNCW.2018.8368979","DOIUrl":"https://doi.org/10.1109/WCNCW.2018.8368979","url":null,"abstract":"Spectrum sharing and employing highly directional antennas in the mm-wave bands are considered among the key enablers for 5G networks. Conventional interference avoidance techniques like listen-before-talk (LBT) may not be efficient for such coexisting networks. In this paper, we address a coexistence mechanism by means of distributed beam scheduling with minimum cooperation between spectrum sharing subsystems without any direct data exchange between them. We extend a “Good Neighbor” (GN) principle initially developed for decentralized spectrum allocation to the distributed beam scheduling problem. To do that, we introduce relative performance targets, develop a GN beam scheduling algorithm, and demonstrate its efficiency in terms of performance/complexity trade off compared to that of the conventional selfish (SLF) and recently proposed distributed learning scheduling (DLS) solutions by means of simulations in highly directional antenna mm-wave scenarios.","PeriodicalId":122391,"journal":{"name":"2018 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"174 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116132427","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 : 2018-04-15DOI: 10.1109/WCNCW.2018.8369019
Albert Mestres, E. Alarcón, A. Cabellos-Aparicio
Recent trends in networking are proposing the use of Machine Learning (ML) techniques for the control and operation of the network. The application of ML to networking brings several use-cases as well as challenges. The objective of this paper is to explore the feasibility of applying different models and ML techniques to model complex networks elements, such as Virtual Network Functions (VNFs). In particular, we focus on the characterization of the CPU consumption of the VNF as a function of the characteristics of the input traffic. The traffic is represented by a set of features describing characteristics from the transport layer to the application layer in small time batches. The CPU consumption is observed from the hypervisor and corresponds to the average CPU consumption when the traffic batch is processed. We experimentally demonstrate that we can learn the behavior of different VNF in order to model its CPU consumption. We conclude that the behavior of different VNF can be modeled using ML techniques.
{"title":"A machine learning-based approach for virtual network function modeling","authors":"Albert Mestres, E. Alarcón, A. Cabellos-Aparicio","doi":"10.1109/WCNCW.2018.8369019","DOIUrl":"https://doi.org/10.1109/WCNCW.2018.8369019","url":null,"abstract":"Recent trends in networking are proposing the use of Machine Learning (ML) techniques for the control and operation of the network. The application of ML to networking brings several use-cases as well as challenges. The objective of this paper is to explore the feasibility of applying different models and ML techniques to model complex networks elements, such as Virtual Network Functions (VNFs). In particular, we focus on the characterization of the CPU consumption of the VNF as a function of the characteristics of the input traffic. The traffic is represented by a set of features describing characteristics from the transport layer to the application layer in small time batches. The CPU consumption is observed from the hypervisor and corresponds to the average CPU consumption when the traffic batch is processed. We experimentally demonstrate that we can learn the behavior of different VNF in order to model its CPU consumption. We conclude that the behavior of different VNF can be modeled using ML techniques.","PeriodicalId":122391,"journal":{"name":"2018 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"740 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116088124","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 : 2018-04-15DOI: 10.1109/WCNCW.2018.8368980
Genming Ding, Jun Tian, Jinsong Wu, Qian Zhao, Lili Xie
Computational and power efficiency is one of the crucial enabling factors to wearable device based human activity recognition (HAR) system. However, limited research efforts in literature have been available toward reducing theses costs without loss of accuracy. In this paper, we propose an improved random forest (RF) based HAR system for elderly-care. The system extracts three kinds of pairwise correlation features in hybrid sliding windows, and uses location information to enhance the recognition performance. A mutual information based feature selection is adopted to optimize the recognition of confused local set of activities. A new random feature selection strategy for each node in RF enables the proposed system to reduce the number of trees while maintaining the recognition accuracy. Numerical experiments show that the proposed method can predict 10 types of activities with 93.01% accuracy and 74.9% reduction of energy consumption. Furthermore, the fall detection accuracy in this proposed system can reach up to 99%.
{"title":"Energy efficient human activity recognition using wearable sensors","authors":"Genming Ding, Jun Tian, Jinsong Wu, Qian Zhao, Lili Xie","doi":"10.1109/WCNCW.2018.8368980","DOIUrl":"https://doi.org/10.1109/WCNCW.2018.8368980","url":null,"abstract":"Computational and power efficiency is one of the crucial enabling factors to wearable device based human activity recognition (HAR) system. However, limited research efforts in literature have been available toward reducing theses costs without loss of accuracy. In this paper, we propose an improved random forest (RF) based HAR system for elderly-care. The system extracts three kinds of pairwise correlation features in hybrid sliding windows, and uses location information to enhance the recognition performance. A mutual information based feature selection is adopted to optimize the recognition of confused local set of activities. A new random feature selection strategy for each node in RF enables the proposed system to reduce the number of trees while maintaining the recognition accuracy. Numerical experiments show that the proposed method can predict 10 types of activities with 93.01% accuracy and 74.9% reduction of energy consumption. Furthermore, the fall detection accuracy in this proposed system can reach up to 99%.","PeriodicalId":122391,"journal":{"name":"2018 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"186 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116599514","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 : 2018-04-15DOI: 10.1109/WCNCW.2018.8368974
S. Hahn, M. Schweins, T. Kürner
Self-Organising Network (SON) functions cover a plethora of use cases, each addressing a different (self-optimisation) task reducing the manual work of the Mobile Network Operator (MNO). A combined SON operation, with numerous SON functions running in parallel, might lead to an undesired network performance due to unforeseen coherencies of parameter changes. In order to gain a greater understanding of the interworking of SON functions, well-known SON use cases are tested with different combinations in a realistic multi-layer, multi-RAT scenario. Results show that a substantial impact on the network performance can be observed for different SON function combinations. Furthermore, the effects also differ if multiple context classes of cells (i.e. different sizes, locations, mobility types) are considered.
{"title":"Impact of SON function combinations on the KPI behaviour in realistic mobile network scenarios","authors":"S. Hahn, M. Schweins, T. Kürner","doi":"10.1109/WCNCW.2018.8368974","DOIUrl":"https://doi.org/10.1109/WCNCW.2018.8368974","url":null,"abstract":"Self-Organising Network (SON) functions cover a plethora of use cases, each addressing a different (self-optimisation) task reducing the manual work of the Mobile Network Operator (MNO). A combined SON operation, with numerous SON functions running in parallel, might lead to an undesired network performance due to unforeseen coherencies of parameter changes. In order to gain a greater understanding of the interworking of SON functions, well-known SON use cases are tested with different combinations in a realistic multi-layer, multi-RAT scenario. Results show that a substantial impact on the network performance can be observed for different SON function combinations. Furthermore, the effects also differ if multiple context classes of cells (i.e. different sizes, locations, mobility types) are considered.","PeriodicalId":122391,"journal":{"name":"2018 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130520359","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 : 2018-04-15DOI: 10.1109/WCNCW.2018.8368978
Maximilian Stark, Syed Aizaz Ali Shah, G. Bauch
The provably capacity-achieving error-correction capability of polar codes prospered huge interest in academia and industry. The explicit structure of polar codes leads to a different notion of code construction which refers to the assignment of information bits to certain positions in that structure instead of the design of the structure itself. State-of-the-art construction methods either rely on approximations or are computationally demanding to achieve an optimum assignment of the information bits. In this paper, we propose a novel construction technique which leverages the information bottleneck method to combine information-optimum construction and less complex, tractable processing of the required joint distributions. Furthermore, we consider the effect of a low-resolution channel quantizer explicitly in the code design which ensures applicability of the constructed code also in practically relevant settings.
{"title":"Polar code construction using the information bottleneck method","authors":"Maximilian Stark, Syed Aizaz Ali Shah, G. Bauch","doi":"10.1109/WCNCW.2018.8368978","DOIUrl":"https://doi.org/10.1109/WCNCW.2018.8368978","url":null,"abstract":"The provably capacity-achieving error-correction capability of polar codes prospered huge interest in academia and industry. The explicit structure of polar codes leads to a different notion of code construction which refers to the assignment of information bits to certain positions in that structure instead of the design of the structure itself. State-of-the-art construction methods either rely on approximations or are computationally demanding to achieve an optimum assignment of the information bits. In this paper, we propose a novel construction technique which leverages the information bottleneck method to combine information-optimum construction and less complex, tractable processing of the required joint distributions. Furthermore, we consider the effect of a low-resolution channel quantizer explicitly in the code design which ensures applicability of the constructed code also in practically relevant settings.","PeriodicalId":122391,"journal":{"name":"2018 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124525822","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 : 2018-04-15DOI: 10.1109/WCNCW.2018.8369020
Danilo F. S. Santos, Mateus A. M. Lima, J. L. Nascimento, A. Perkusich, H. Almeida
The increasing cost of healthcare, the desire of keeping a high-quality life in face of chronic conditions, and the increasing availability of personal health devices (PHDs) are the ingredients of “IoT health” vision. In parallel, a growing number of consumer electronic (CE) devices like TVs, refrigerators or media players are becoming capable of taking the role of “health hub”, that is, a data collector for the sensor PHDs. Many PHDs (and the respective collectors) follow a standard protocol stack for health devices: IEEE 11073-20601. This paper presents Antidote: a portable, open-source implementation of the IEEE 11073-20601 stack, which further promotes this standard and increases its availability to the developer community. One of the main contributions of Antidote is how it exports health data using a DataList XML or JSON format, which helps its integration by developers in different platforms. Finally, it is presented our experience using Antidote on different scenarios, such as on mobile platforms and IoT networks.
{"title":"Enabling the first step for IoT health systems using Antidote and IEEE 11073","authors":"Danilo F. S. Santos, Mateus A. M. Lima, J. L. Nascimento, A. Perkusich, H. Almeida","doi":"10.1109/WCNCW.2018.8369020","DOIUrl":"https://doi.org/10.1109/WCNCW.2018.8369020","url":null,"abstract":"The increasing cost of healthcare, the desire of keeping a high-quality life in face of chronic conditions, and the increasing availability of personal health devices (PHDs) are the ingredients of “IoT health” vision. In parallel, a growing number of consumer electronic (CE) devices like TVs, refrigerators or media players are becoming capable of taking the role of “health hub”, that is, a data collector for the sensor PHDs. Many PHDs (and the respective collectors) follow a standard protocol stack for health devices: IEEE 11073-20601. This paper presents Antidote: a portable, open-source implementation of the IEEE 11073-20601 stack, which further promotes this standard and increases its availability to the developer community. One of the main contributions of Antidote is how it exports health data using a DataList XML or JSON format, which helps its integration by developers in different platforms. Finally, it is presented our experience using Antidote on different scenarios, such as on mobile platforms and IoT networks.","PeriodicalId":122391,"journal":{"name":"2018 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"2014 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125696734","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 : 2018-04-15DOI: 10.1109/WCNCW.2018.8369027
David Manuel Gutiérrez Estévez, M. Gramaglia, A. Domenico, N. Pietro, Sina Khatibi, Kunjan Shah, D. Tsolkas, P. Arnold, P. Serrano
Vertical markets and industries are addressing a large diversity of heterogeneous services, use cases, and applications in 5G. It is currently common understanding that for networks to be able to satisfy those needs, a flexible, adaptable, and programmable architecture based on network slicing is required. Moreover, a softwarization and cloudification of the communications networks is already happening, where network functions (NFs) are transformed from monolithic pieces of equipment to programs running over a shared pool of computational and communication resources. However, this novel architecture paradigm requires new solutions to exploit its inherent flexibility. In this paper, we introduce the concept of resource elasticity as a key means to make an efficient use of the computational resources in 5G systems. Besides establishing a definition as well as a set of requirements and key performance indicators (KPIs), we propose mechanisms for the exploitation of elasticity in three different dimensions, namely computational elasticity in the design and scaling of NFs, orchestration-driven elasticity by flexible placement of NFs, and slice-aware elasticity via cross-slice resource provisioning mechanisms. Finally, we provide a succinct analysis of the architectural components that need to be enhanced to incorporate elasticity principles.
{"title":"The path towards resource elasticity for 5G network architecture","authors":"David Manuel Gutiérrez Estévez, M. Gramaglia, A. Domenico, N. Pietro, Sina Khatibi, Kunjan Shah, D. Tsolkas, P. Arnold, P. Serrano","doi":"10.1109/WCNCW.2018.8369027","DOIUrl":"https://doi.org/10.1109/WCNCW.2018.8369027","url":null,"abstract":"Vertical markets and industries are addressing a large diversity of heterogeneous services, use cases, and applications in 5G. It is currently common understanding that for networks to be able to satisfy those needs, a flexible, adaptable, and programmable architecture based on network slicing is required. Moreover, a softwarization and cloudification of the communications networks is already happening, where network functions (NFs) are transformed from monolithic pieces of equipment to programs running over a shared pool of computational and communication resources. However, this novel architecture paradigm requires new solutions to exploit its inherent flexibility. In this paper, we introduce the concept of resource elasticity as a key means to make an efficient use of the computational resources in 5G systems. Besides establishing a definition as well as a set of requirements and key performance indicators (KPIs), we propose mechanisms for the exploitation of elasticity in three different dimensions, namely computational elasticity in the design and scaling of NFs, orchestration-driven elasticity by flexible placement of NFs, and slice-aware elasticity via cross-slice resource provisioning mechanisms. Finally, we provide a succinct analysis of the architectural components that need to be enhanced to incorporate elasticity principles.","PeriodicalId":122391,"journal":{"name":"2018 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"365 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134288791","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 : 2018-04-15DOI: 10.1109/WCNCW.2018.8368992
S. Gupta, J. Khan, D. T. Ngo
With the expected introduction of autonomous vehicles in the next decade, it will be imperative for road traffic authorities to develop strategies to manage the co-existence of autonomous and legacy vehicles. In this scenario, the exchange of safety messages among vehicles in a timely manner will be critical for future advanced road traffic management systems. Most of the work in the area of vehicular ad hoc network (VANET) has concentrated on the IEEE 802.11p and the DSRC standards. With the emergence of the advanced LTE-based cellular network standard, researchers are now concentrating on the LTE-based VANET architecture. However, due to the use of the centralized architecture, an LTE-based system may require significant network resources to support vehicle-to-vehicle (V2V) communications. In this paper, we propose a new vehicle discovery technique and a LTE cluster-based device-to-device (D2D) architecture to achieve high packet delivery ratio for the safety services in a vehicular network. The performance of the proposed network architecture is analyzed by an OMNET++ based simulation model. Simulations results shows that the proposed algorithm reduces the end-to-end delay and signalling overhead as well as improve the data packet delivery ratio (DPDR) compared to the existing 3GPP ProSe technique for vehicular safety applications.
{"title":"Cluster-based D2D architecture for safety services in vehicular ad hoc networks","authors":"S. Gupta, J. Khan, D. T. Ngo","doi":"10.1109/WCNCW.2018.8368992","DOIUrl":"https://doi.org/10.1109/WCNCW.2018.8368992","url":null,"abstract":"With the expected introduction of autonomous vehicles in the next decade, it will be imperative for road traffic authorities to develop strategies to manage the co-existence of autonomous and legacy vehicles. In this scenario, the exchange of safety messages among vehicles in a timely manner will be critical for future advanced road traffic management systems. Most of the work in the area of vehicular ad hoc network (VANET) has concentrated on the IEEE 802.11p and the DSRC standards. With the emergence of the advanced LTE-based cellular network standard, researchers are now concentrating on the LTE-based VANET architecture. However, due to the use of the centralized architecture, an LTE-based system may require significant network resources to support vehicle-to-vehicle (V2V) communications. In this paper, we propose a new vehicle discovery technique and a LTE cluster-based device-to-device (D2D) architecture to achieve high packet delivery ratio for the safety services in a vehicular network. The performance of the proposed network architecture is analyzed by an OMNET++ based simulation model. Simulations results shows that the proposed algorithm reduces the end-to-end delay and signalling overhead as well as improve the data packet delivery ratio (DPDR) compared to the existing 3GPP ProSe technique for vehicular safety applications.","PeriodicalId":122391,"journal":{"name":"2018 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124223488","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 : 2018-04-15DOI: 10.1109/WCNCW.2018.8369021
Haijun Wang, Haitao Zhao, Li Zhou, Dongtang Ma, Jibo Wei
Unmanned aerial vehicles (UAVs) are playing an important role in serving ground users as base stations (BSs) during temporary events, or after terrestrial BSs fail. UAV deployment is a fundamental and vital problem which directly affects the coverage capacity and user experience. Especially, while deploying a UAV backbone network, the cost and the quality of service (QoS) of the ground users as well as the connectivity among UAVs need to be considered jointly. In this paper, the deployment problem is modeled as minimizing the amount of deployed UAVs while guaranteeing the coverage capacity and connectivity among UAVs. Further, a novel UAV deployment scheme is proposed where a heuristic algorithm is adopted to delete locations from the initially defined candidate UAV locations iteratively, and UAVs are deployed at the remaining locations finally. The simulation results show that our UAV deployment scheme can achieve minimum deployed UAVs while ensuring QoS requirements and a robust network among UAVs.
{"title":"Deployment algorithm for minimum unmanned aerial vehicles towards optimal coverage and interconnections","authors":"Haijun Wang, Haitao Zhao, Li Zhou, Dongtang Ma, Jibo Wei","doi":"10.1109/WCNCW.2018.8369021","DOIUrl":"https://doi.org/10.1109/WCNCW.2018.8369021","url":null,"abstract":"Unmanned aerial vehicles (UAVs) are playing an important role in serving ground users as base stations (BSs) during temporary events, or after terrestrial BSs fail. UAV deployment is a fundamental and vital problem which directly affects the coverage capacity and user experience. Especially, while deploying a UAV backbone network, the cost and the quality of service (QoS) of the ground users as well as the connectivity among UAVs need to be considered jointly. In this paper, the deployment problem is modeled as minimizing the amount of deployed UAVs while guaranteeing the coverage capacity and connectivity among UAVs. Further, a novel UAV deployment scheme is proposed where a heuristic algorithm is adopted to delete locations from the initially defined candidate UAV locations iteratively, and UAVs are deployed at the remaining locations finally. The simulation results show that our UAV deployment scheme can achieve minimum deployed UAVs while ensuring QoS requirements and a robust network among UAVs.","PeriodicalId":122391,"journal":{"name":"2018 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124511909","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
扫码关注我们
求助内容：
应助结果提醒方式：