Pub Date : 2017-05-21DOI: 10.1109/ICC.2017.7996834
Saidhiraj Amuru, R. Buehrer, M. Schaar
Can we optimally attack networks (in terms of disrupting the ability of the nodes in the network from communicating) when the network topology is unknown? In this paper, we show that it is not always possible to do so when the network topology is unknown a priori. Specifically, we develop multi armed bandit-based techniques that enable the attacker to learn the best network attack strategies and also discuss the potential limitations that the attacker faces in such blind scenarios.
{"title":"Bandit strategies for blindly attacking networks","authors":"Saidhiraj Amuru, R. Buehrer, M. Schaar","doi":"10.1109/ICC.2017.7996834","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996834","url":null,"abstract":"Can we optimally attack networks (in terms of disrupting the ability of the nodes in the network from communicating) when the network topology is unknown? In this paper, we show that it is not always possible to do so when the network topology is unknown a priori. Specifically, we develop multi armed bandit-based techniques that enable the attacker to learn the best network attack strategies and also discuss the potential limitations that the attacker faces in such blind scenarios.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"37 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80733339","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 : 2017-05-21DOI: 10.1109/ICC.2017.7996469
Alina Tuholukova, G. Neglia, T. Spyropoulos
As cellular network operators are struggling to keep up with the rapidly increasing traffic demand, two key directions are deemed necessary for beyond 4G networks: (i) extensive cell densification to improve spatial reuse, and (ii) storage of content as close to the user as possible to cope with the backhaul constraints and increased interference. However, caching has mostly been studied with an exclusive focus either on the backhaul network (e.g. the “femto-caching” line of work) or on the radio access (e.g. through coded caching or cacheaided CoMP). As a result, an understanding of the impact of edge caching on network-wide and end-to-end performance is lacking. In this paper we investigate the problem of optimal caching in a context where nearby small cells (“femto-helpers”) can coordinate not just in terms of what to cache but also to perform Joint Transmission (a type of CoMP). We show that interesting tradeoffs arise between caching policies that improve radio access and ones that improve backhaul, and propose an algorithm that provably achieves an 1/2-approximation ratio to the optimal one (which is NP-hard), and performs well in simulated scenarios.
{"title":"Optimal cache allocation for femto helpers with joint transmission capabilities","authors":"Alina Tuholukova, G. Neglia, T. Spyropoulos","doi":"10.1109/ICC.2017.7996469","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996469","url":null,"abstract":"As cellular network operators are struggling to keep up with the rapidly increasing traffic demand, two key directions are deemed necessary for beyond 4G networks: (i) extensive cell densification to improve spatial reuse, and (ii) storage of content as close to the user as possible to cope with the backhaul constraints and increased interference. However, caching has mostly been studied with an exclusive focus either on the backhaul network (e.g. the “femto-caching” line of work) or on the radio access (e.g. through coded caching or cacheaided CoMP). As a result, an understanding of the impact of edge caching on network-wide and end-to-end performance is lacking. In this paper we investigate the problem of optimal caching in a context where nearby small cells (“femto-helpers”) can coordinate not just in terms of what to cache but also to perform Joint Transmission (a type of CoMP). We show that interesting tradeoffs arise between caching policies that improve radio access and ones that improve backhaul, and propose an algorithm that provably achieves an 1/2-approximation ratio to the optimal one (which is NP-hard), and performs well in simulated scenarios.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"39 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77976595","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 : 2017-05-21DOI: 10.1109/ICC.2017.7997281
Sarah Cook, B. Mathieu, Patrick Truong, I. Hamchaoui
Many applications nowadays use HTTP. HTTP/2, standardised in February 2015, is an improvment of HTTP/1.1. However it is still running on top of TCP/TLS and can thus suffer from performance issues, such as the number of RTTs for the handshake phase and the Head of Line blocking. Google proposed the QUIC (Quick UDP Internet Connection) protocol, an user level protocol, running on top of UDP, to solve those issues. Google argues that the response time (Page Load Time) is shorter and thus the end-user experience better. First papers evaluated the intrinsic performances of QUIC, but none compared QUIC with the network, the website structure and the involved actors in mind. In this paper, we present the results of our evaluation, performed on a local testbed as well as on Internet, and our analysis to identify in which conditions QUIC is of interest, which actors can benefit from having QUIC deployed in the network and what impacts QUIC can lead to.
现在许多应用程序都使用HTTP。HTTP/2于2015年2月标准化，是对HTTP/1.1的改进。然而，它仍然运行在TCP/TLS之上，因此可能会受到性能问题的影响，例如握手阶段的rtt数量和线头阻塞。b谷歌提出了QUIC (Quick UDP Internet Connection)协议，一种运行在UDP之上的用户级协议，来解决这些问题。谷歌认为响应时间(页面加载时间)更短，因此最终用户体验更好。第一篇论文评价了QUIC的内在性能，但没有将QUIC与网络、网站结构和所涉及的参与者进行比较。在本文中，我们展示了我们在本地测试平台和互联网上进行的评估结果，以及我们的分析，以确定在哪些条件下QUIC是感兴趣的，哪些参与者可以从在网络中部署QUIC中受益，以及QUIC可能导致的影响。
{"title":"QUIC: Better for what and for whom?","authors":"Sarah Cook, B. Mathieu, Patrick Truong, I. Hamchaoui","doi":"10.1109/ICC.2017.7997281","DOIUrl":"https://doi.org/10.1109/ICC.2017.7997281","url":null,"abstract":"Many applications nowadays use HTTP. HTTP/2, standardised in February 2015, is an improvment of HTTP/1.1. However it is still running on top of TCP/TLS and can thus suffer from performance issues, such as the number of RTTs for the handshake phase and the Head of Line blocking. Google proposed the QUIC (Quick UDP Internet Connection) protocol, an user level protocol, running on top of UDP, to solve those issues. Google argues that the response time (Page Load Time) is shorter and thus the end-user experience better. First papers evaluated the intrinsic performances of QUIC, but none compared QUIC with the network, the website structure and the involved actors in mind. In this paper, we present the results of our evaluation, performed on a local testbed as well as on Internet, and our analysis to identify in which conditions QUIC is of interest, which actors can benefit from having QUIC deployed in the network and what impacts QUIC can lead to.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"36 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78227988","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 : 2017-05-21DOI: 10.1109/ICC.2017.7997005
Tri Nhu Do, D. B. D. Costa, T. Duong, Beongku An
In this paper, we investigate outage performance and diversity gain of transmit antenna selection (TAS) schemes in two-user multiple-input single-output non-orthogonal multiple access (MISO-NOMA) cooperative downlink transmissions. To this end, two TAS criteria, namely Criterion I and Criterion II, are proposed, which select an antenna that experiences the best fading condition of the channel from the source to the far user and to the near user, respectively. Additionally, considering the near user as a relay to help improve the reliability of the far user, hybrid simultaneous wireless information and power transfer (SWIPT) architecture is adopted to power the near user's relaying operation. Tight closed-form approximate expressions for the outage probability (OP) of both users are derived. Numerical results reveal that Criterion I and II achieve, respectively, the diversity order of K + 1 and 2 at the far user, and 1 and K at the near user, where K denotes the number of transmit antennas at the base station.
{"title":"Transmit antenna selection schemes for MISO-NOMA cooperative downlink transmissions with hybrid SWIPT protocol","authors":"Tri Nhu Do, D. B. D. Costa, T. Duong, Beongku An","doi":"10.1109/ICC.2017.7997005","DOIUrl":"https://doi.org/10.1109/ICC.2017.7997005","url":null,"abstract":"In this paper, we investigate outage performance and diversity gain of transmit antenna selection (TAS) schemes in two-user multiple-input single-output non-orthogonal multiple access (MISO-NOMA) cooperative downlink transmissions. To this end, two TAS criteria, namely Criterion I and Criterion II, are proposed, which select an antenna that experiences the best fading condition of the channel from the source to the far user and to the near user, respectively. Additionally, considering the near user as a relay to help improve the reliability of the far user, hybrid simultaneous wireless information and power transfer (SWIPT) architecture is adopted to power the near user's relaying operation. Tight closed-form approximate expressions for the outage probability (OP) of both users are derived. Numerical results reveal that Criterion I and II achieve, respectively, the diversity order of K + 1 and 2 at the far user, and 1 and K at the near user, where K denotes the number of transmit antennas at the base station.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"2 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91488314","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 : 2017-05-21DOI: 10.1109/ICC.2017.7997081
Walid Khallef, M. Molnár, A. Benslimane, Sylvain Durand
In recent years, there have been significant efforts to standardize a routing protocol for Low-power and Lossy Networks (LLNs). This effort has culminated in standard IPv6 routing protocol for LLNs (RPL). The main interest of RPL is to improve routing in an LLN minimizing the usage of network resources. For this, RPL builds acyclic graphs and applies an Objective Function (OF) which is responsible of choosing the preferred parent and the best links during the construction of the Destination Oriented Directed Acyclic Graph (DODAG). This paper introduces a new OF, based on a Non-Linear Length (NL-OF) which takes into account any number of metrics and constraints for QoS routing. NL-OF ensures that each path in the DODAG respects the input constraints. The NL-OF can be used to meet the requirements of sensible applications, such as real-time applications. A significant part of this work aims at studying the theoretical aspect of the NL-OF. Finally, using Cooja simulator, we evaluate the performance of NL-OF. We show that our new Objective Function gives a good result and outperforms the three existing OFs when considering three QoS parameters which are end-to-end Delay, Packet Loss and Jitter.
{"title":"Multiple constrained QoS routing with RPL","authors":"Walid Khallef, M. Molnár, A. Benslimane, Sylvain Durand","doi":"10.1109/ICC.2017.7997081","DOIUrl":"https://doi.org/10.1109/ICC.2017.7997081","url":null,"abstract":"In recent years, there have been significant efforts to standardize a routing protocol for Low-power and Lossy Networks (LLNs). This effort has culminated in standard IPv6 routing protocol for LLNs (RPL). The main interest of RPL is to improve routing in an LLN minimizing the usage of network resources. For this, RPL builds acyclic graphs and applies an Objective Function (OF) which is responsible of choosing the preferred parent and the best links during the construction of the Destination Oriented Directed Acyclic Graph (DODAG). This paper introduces a new OF, based on a Non-Linear Length (NL-OF) which takes into account any number of metrics and constraints for QoS routing. NL-OF ensures that each path in the DODAG respects the input constraints. The NL-OF can be used to meet the requirements of sensible applications, such as real-time applications. A significant part of this work aims at studying the theoretical aspect of the NL-OF. Finally, using Cooja simulator, we evaluate the performance of NL-OF. We show that our new Objective Function gives a good result and outperforms the three existing OFs when considering three QoS parameters which are end-to-end Delay, Packet Loss and Jitter.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"86 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84001325","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 : 2017-05-21DOI: 10.1109/ICC.2017.7996836
K. Magowe, A. Giorgetti, K. Sithamparanathan, Xinghuo Yu
Weighted centroid localization (WCL) based on received signal strength (RSS) measurements is an attractive low-complexity solution that enables cognitive radios (CRs) to have a geolocation awareness of the radio environment. In this paper, we propose a new analytical framework to accurately calculate the performance of WCL based on the statistical distribution of the ratio of two quadratic forms in normal variables. In particular, we derive an exact expression for the cumulative distribution function (CDF) of the two-dimensional location estimation in the presence of independent and identically distributed (i.i.d.) as well as correlated shadowing. Numerical results confirm that the analytical framework is able to predict the performance of WCL capturing all the essential aspects of propagation as well as CR network spatial topology.
{"title":"Statistical distribution of position error in weighted centroid localization","authors":"K. Magowe, A. Giorgetti, K. Sithamparanathan, Xinghuo Yu","doi":"10.1109/ICC.2017.7996836","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996836","url":null,"abstract":"Weighted centroid localization (WCL) based on received signal strength (RSS) measurements is an attractive low-complexity solution that enables cognitive radios (CRs) to have a geolocation awareness of the radio environment. In this paper, we propose a new analytical framework to accurately calculate the performance of WCL based on the statistical distribution of the ratio of two quadratic forms in normal variables. In particular, we derive an exact expression for the cumulative distribution function (CDF) of the two-dimensional location estimation in the presence of independent and identically distributed (i.i.d.) as well as correlated shadowing. Numerical results confirm that the analytical framework is able to predict the performance of WCL capturing all the essential aspects of propagation as well as CR network spatial topology.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"36 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85302330","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 : 2017-05-21DOI: 10.1109/ICC.2017.7996640
Carlos Cambra Baseca, S. Sendra, Jaime Lloret, Laura García
Wireless Sensor Networks (WSNs), Internet of things (IoT) and aerial mapping are nowadays being used very much in agriculture. The challenge of joining those technologies requires a new and smart wireless network topology for devices communication. Problems like scalability and manageability are important challenges when there are many devices. This paper presents the design of a smart IoT communication system manager used as a low cost irrigation controller. The proposal is a powerful irrigation tool that uses real time data such as the variable rate irrigation and some parameters taken from the field. The field parameters, the index vegetation (estimated using aerial images) and the irrigation events, such as flow level, pressure level or wind speed, are periodically sampled. Data is processed in a smart cloud service based on the Drools Guvnor (a Business Rules Manager). The developed multimedia platform can be controlled remotely by a mobile phone. Finally, we measured the bandwidth consumed when the system is sending different kinds of commands and data.
{"title":"An IoT service-oriented system for agriculture monitoring","authors":"Carlos Cambra Baseca, S. Sendra, Jaime Lloret, Laura García","doi":"10.1109/ICC.2017.7996640","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996640","url":null,"abstract":"Wireless Sensor Networks (WSNs), Internet of things (IoT) and aerial mapping are nowadays being used very much in agriculture. The challenge of joining those technologies requires a new and smart wireless network topology for devices communication. Problems like scalability and manageability are important challenges when there are many devices. This paper presents the design of a smart IoT communication system manager used as a low cost irrigation controller. The proposal is a powerful irrigation tool that uses real time data such as the variable rate irrigation and some parameters taken from the field. The field parameters, the index vegetation (estimated using aerial images) and the irrigation events, such as flow level, pressure level or wind speed, are periodically sampled. Data is processed in a smart cloud service based on the Drools Guvnor (a Business Rules Manager). The developed multimedia platform can be controlled remotely by a mobile phone. Finally, we measured the bandwidth consumed when the system is sending different kinds of commands and data.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"115 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84019195","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 : 2017-05-21DOI: 10.1109/ICC.2017.7996921
Junting Chen, D. Gesbert
This paper considers the exploitation of unmanned aerial vehicles (UAVs) in wireless networking, with which communication-enabled robots operate as flying wireless relays to help fill coverage or capacity gaps in the network. We focus on the particular problem of (automatic) UAV positioning, which is known to crucially affect performance. Existing methods typically rely on statistical models of the air-to-ground channel, and thus, they fail to exploit the fine-grained information of line-of-sight (LOS) conditions at some locations. This paper develops an efficient algorithm to find the best position of the UAV based on the fine-grained LOS information. In spite of the complex terrain topology, the algorithm is able to converge to the optimal UAV position to maximize the end-to-end throughput without a global exploration of a signal strength radio map. Numerical results demonstrate that in a dense urban area, the UAV-aided wireless system with the optimal UAV position can almost double the end-to-end capacity from the base station (BS) to the user as compared to that of a direct BS to user link.
{"title":"Optimal positioning of flying relays for wireless networks: A LOS map approach","authors":"Junting Chen, D. Gesbert","doi":"10.1109/ICC.2017.7996921","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996921","url":null,"abstract":"This paper considers the exploitation of unmanned aerial vehicles (UAVs) in wireless networking, with which communication-enabled robots operate as flying wireless relays to help fill coverage or capacity gaps in the network. We focus on the particular problem of (automatic) UAV positioning, which is known to crucially affect performance. Existing methods typically rely on statistical models of the air-to-ground channel, and thus, they fail to exploit the fine-grained information of line-of-sight (LOS) conditions at some locations. This paper develops an efficient algorithm to find the best position of the UAV based on the fine-grained LOS information. In spite of the complex terrain topology, the algorithm is able to converge to the optimal UAV position to maximize the end-to-end throughput without a global exploration of a signal strength radio map. Numerical results demonstrate that in a dense urban area, the UAV-aided wireless system with the optimal UAV position can almost double the end-to-end capacity from the base station (BS) to the user as compared to that of a direct BS to user link.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"438 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83679619","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 : 2017-05-21DOI: 10.1109/ICC.2017.7997232
Akarsh Pokkunuru, Qin Zhang, Pu Wang
Providing high-speed communication for mobile users in remote geographic areas or after a disaster occurs is not only critical but also challenging. To counter such challenge, unmanned aerial vehicles (UAVs) have been exploited to provide a fast-deployable and high-speed communication system, where each UAV can serve as an aerial small cell base station to provide WiFi and/or cellular services for the ground users. Despite its fast-deployable and highly maneuverable features, the capacity analysis of aerial small cells is largely missing. To close such gap, a stochastic propagation model for A-to-G aerial channels is first introduced, which takes into account the impact from wave propagation, gaseous absorption, Doppler spread, attitude-dependent shadowing, and multipath fading. Then, by exploiting such model, the area spectral efficiency of the aerial small cells is investigated for both SISO and MIMO cases. Our study reveals the inherent relationship among the area capacity, height and coverage and shows that there exists an optimal attitude that can maximize network capacity and cell coverage.
为偏远地区或灾害发生后的移动用户提供高速通信不仅至关重要，而且具有挑战性。为了应对这样的挑战，无人机(UAV)已经被用来提供快速部署和高速通信系统，其中每架无人机可以作为空中小型蜂窝基站为地面用户提供WiFi和/或蜂窝服务。尽管具有快速部署和高机动性的特点，但空中小型单元的能力分析在很大程度上是缺失的。为了缩小这种差距，首先引入了a - To - g航空信道的随机传播模型，该模型考虑了波传播、气体吸收、多普勒传播、姿态相关阴影和多径衰落的影响。然后，利用该模型，研究了空中小小区在SISO和MIMO两种情况下的面积频谱效率。我们的研究揭示了面积容量、高度和覆盖之间的内在关系，并表明存在一种使网络容量和小区覆盖最大化的最优态度。
{"title":"Capacity analysis of aerial small cells","authors":"Akarsh Pokkunuru, Qin Zhang, Pu Wang","doi":"10.1109/ICC.2017.7997232","DOIUrl":"https://doi.org/10.1109/ICC.2017.7997232","url":null,"abstract":"Providing high-speed communication for mobile users in remote geographic areas or after a disaster occurs is not only critical but also challenging. To counter such challenge, unmanned aerial vehicles (UAVs) have been exploited to provide a fast-deployable and high-speed communication system, where each UAV can serve as an aerial small cell base station to provide WiFi and/or cellular services for the ground users. Despite its fast-deployable and highly maneuverable features, the capacity analysis of aerial small cells is largely missing. To close such gap, a stochastic propagation model for A-to-G aerial channels is first introduced, which takes into account the impact from wave propagation, gaseous absorption, Doppler spread, attitude-dependent shadowing, and multipath fading. Then, by exploiting such model, the area spectral efficiency of the aerial small cells is investigated for both SISO and MIMO cases. Our study reveals the inherent relationship among the area capacity, height and coverage and shows that there exists an optimal attitude that can maximize network capacity and cell coverage.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"39 5","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91421229","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 : 2017-05-21DOI: 10.1109/ICC.2017.7996340
Hans C. Yu, Giorgio Quer, R. Rao
A promising approach for dealing with the increasing demand of data traffic is the use of device-to-device (D2D) technologies, in particular when the destination can be reached directly, or though few retransmissions by peer devices. Thus, the cellular network can offload local traffic that is transmitted by an ad hoc network, e.g., a mobile ad hoc network (MANET), or a vehicular ad hoc network (VANET). The cellular base station can help coordinate all the devices in the ad hoc network by reusing the software tools developed for software-defined networks (SDNs), which divide the control and the data messages, transmitted in two separate interfaces. In this paper, we present a practical implementation of an SDN MANET, describe in detail the software components that we adopted, and provide a repository for all the new components that we developed. This work can be a starting point for the wireless networking community to design new testbeds with SDN capabilities that can have the advantages of D2D data transmissions and the flexibility of a centralized network management. In order to prove the feasibility of such a network, we also showcase the performance of the proposed network implemented in real devices, as compared to a distributed ad hoc network.
{"title":"Wireless SDN mobile ad hoc network: From theory to practice","authors":"Hans C. Yu, Giorgio Quer, R. Rao","doi":"10.1109/ICC.2017.7996340","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996340","url":null,"abstract":"A promising approach for dealing with the increasing demand of data traffic is the use of device-to-device (D2D) technologies, in particular when the destination can be reached directly, or though few retransmissions by peer devices. Thus, the cellular network can offload local traffic that is transmitted by an ad hoc network, e.g., a mobile ad hoc network (MANET), or a vehicular ad hoc network (VANET). The cellular base station can help coordinate all the devices in the ad hoc network by reusing the software tools developed for software-defined networks (SDNs), which divide the control and the data messages, transmitted in two separate interfaces. In this paper, we present a practical implementation of an SDN MANET, describe in detail the software components that we adopted, and provide a repository for all the new components that we developed. This work can be a starting point for the wireless networking community to design new testbeds with SDN capabilities that can have the advantages of D2D data transmissions and the flexibility of a centralized network management. In order to prove the feasibility of such a network, we also showcase the performance of the proposed network implemented in real devices, as compared to a distributed ad hoc network.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"263 3","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91460462","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
扫码关注我们
求助内容：
应助结果提醒方式：