Pub Date : 2017-04-27DOI: 10.23919/WIOPT.2017.7959865
J. Elias, B. Błaszczyszyn
We state and solve a problem of the optimal geographic caching of content in cellular networks, where linear combinations of contents are stored in the caches of base stations. We consider a general content popularity distribution and a general distribution of the number of stations covering the typical location in the network. We are looking for a policy of content caching maximizing the probability of serving the typical content request from the caches of covering stations. The problem has a special form of monotone sub-modular set function maximization. Using dynamic programming, we find a deterministic policy solving the problem. We also consider two natural greedy caching policies. We evaluate our policies considering two popular stochastic geometric coverage models: the Boolean one and the Signal-to-Interference-and-Noise-Ratio one, assuming Zipf popularity distribution. Our numerical results show that the proposed deterministic policies are in general not worse than some randomized policy considered in the literature and can further improve the total hit probability in the moderately high coverage regime.
{"title":"Optimal geographic caching in cellular networks with linear content coding","authors":"J. Elias, B. Błaszczyszyn","doi":"10.23919/WIOPT.2017.7959865","DOIUrl":"https://doi.org/10.23919/WIOPT.2017.7959865","url":null,"abstract":"We state and solve a problem of the optimal geographic caching of content in cellular networks, where linear combinations of contents are stored in the caches of base stations. We consider a general content popularity distribution and a general distribution of the number of stations covering the typical location in the network. We are looking for a policy of content caching maximizing the probability of serving the typical content request from the caches of covering stations. The problem has a special form of monotone sub-modular set function maximization. Using dynamic programming, we find a deterministic policy solving the problem. We also consider two natural greedy caching policies. We evaluate our policies considering two popular stochastic geometric coverage models: the Boolean one and the Signal-to-Interference-and-Noise-Ratio one, assuming Zipf popularity distribution. Our numerical results show that the proposed deterministic policies are in general not worse than some randomized policy considered in the literature and can further improve the total hit probability in the moderately high coverage regime.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"17 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86243981","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-04-24DOI: 10.23919/WIOPT.2017.7959928
Cristian Tatino, Ilaria Malanchini, D. Aziz, D. Yuan
Communications using frequency bands in the millimeter-wave range can play a key role in future generations of mobile networks. By allowing large bandwidth allocations, high carrier frequencies will provide high data rates to support the ever-growing capacity demand. The prevailing challenge at high frequencies is the mitigation of large path loss and link blockage effects. Highly directional beams are expected to overcome this challenge. In this paper, we propose a stochastic model for characterizing beam coverage probability. The model takes into account both line-of-sight and first-order non-line-of-sight reflections. We model the scattering environment as a stochastic process and we derive an analytical expression of the coverage probability for any given beam. The results derived are validated numerically and compared with simulations to assess the accuracy of the model.
{"title":"Beam based stochastic model of the coverage probability in 5G millimeter wave systems","authors":"Cristian Tatino, Ilaria Malanchini, D. Aziz, D. Yuan","doi":"10.23919/WIOPT.2017.7959928","DOIUrl":"https://doi.org/10.23919/WIOPT.2017.7959928","url":null,"abstract":"Communications using frequency bands in the millimeter-wave range can play a key role in future generations of mobile networks. By allowing large bandwidth allocations, high carrier frequencies will provide high data rates to support the ever-growing capacity demand. The prevailing challenge at high frequencies is the mitigation of large path loss and link blockage effects. Highly directional beams are expected to overcome this challenge. In this paper, we propose a stochastic model for characterizing beam coverage probability. The model takes into account both line-of-sight and first-order non-line-of-sight reflections. We model the scattering environment as a stochastic process and we derive an analytical expression of the coverage probability for any given beam. The results derived are validated numerically and compared with simulations to assess the accuracy of the model.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"62 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89207510","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-04-19DOI: 10.23919/WIOPT.2017.7959930
Muhammad Junaid Farooq, Quanyan Zhu
Mission critical data dissemination in massive Internet of things (IoT) networks imposes constraints on the message transfer delay between devices. Due to low power and communication range of IoT devices, data is foreseen to be relayed over multiple device-to-device (D2D) links before reaching the destination. The coexistence of a massive number of IoT devices poses a challenge in maximizing the successful transmission capacity of the overall network alongside reducing the multi-hop transmission delay in order to support mission critical applications. There is a delicate interplay between the carrier sensing threshold of the contention based medium access protocol and the choice of packet forwarding strategy selected at each hop by the devices. The fundamental problem in optimizing the performance of such networks is to balance the tradeoff between conflicting performance objectives such as the spatial frequency reuse, transmission quality, and packet progress towards the destination. In this paper, we use a stochastic geometry approach to quantify the performance of multi-hop massive IoT networks in terms of the spatial frequency reuse and the transmission quality under different packet forwarding schemes. We also develop a comprehensive performance metric that can be used to optimize the system to achieve the best performance. The results can be used to select the best forwarding scheme and tune the carrier sensing threshold to optimize the performance of the network according to the delay constraints and transmission quality requirements.
{"title":"Optimizing mission critical data dissemination in massive IoT networks","authors":"Muhammad Junaid Farooq, Quanyan Zhu","doi":"10.23919/WIOPT.2017.7959930","DOIUrl":"https://doi.org/10.23919/WIOPT.2017.7959930","url":null,"abstract":"Mission critical data dissemination in massive Internet of things (IoT) networks imposes constraints on the message transfer delay between devices. Due to low power and communication range of IoT devices, data is foreseen to be relayed over multiple device-to-device (D2D) links before reaching the destination. The coexistence of a massive number of IoT devices poses a challenge in maximizing the successful transmission capacity of the overall network alongside reducing the multi-hop transmission delay in order to support mission critical applications. There is a delicate interplay between the carrier sensing threshold of the contention based medium access protocol and the choice of packet forwarding strategy selected at each hop by the devices. The fundamental problem in optimizing the performance of such networks is to balance the tradeoff between conflicting performance objectives such as the spatial frequency reuse, transmission quality, and packet progress towards the destination. In this paper, we use a stochastic geometry approach to quantify the performance of multi-hop massive IoT networks in terms of the spatial frequency reuse and the transmission quality under different packet forwarding schemes. We also develop a comprehensive performance metric that can be used to optimize the system to achieve the best performance. The results can be used to select the best forwarding scheme and tune the carrier sensing threshold to optimize the performance of the network according to the delay constraints and transmission quality requirements.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"29 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82694287","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-04-18DOI: 10.23919/WIOPT.2017.7959907
R. Vaze, Srikanth K. Iyer
In cellular networks, under ARQ and SINR model of transmission, the effective downlink rate of packet transmission is the reciprocal of the expected delay (number of retransmissions needed till success). We define the cellular network capacity as the ratio of the basestation (BS) density and the expected delay. Exact characterization of this natural and practical but non-trivial (because of SINR temporal correlations) capacity metric is derived. The capacity is shown to first increase polynomially with the BS density and then scale inverse exponentially with the increasing BS density. Two distinct upper bounds are derived that are relevant for the low and the high BS density regimes. A single power control strategy is shown to achieve the upper bounds in both the regimes upto constants. Our result is fundamentally different than the transport and transmission capacity for ad hoc networks that scale as the square root of the (high) BS density. Our results show that the strong temporal correlations of SINRs with PPP distributed BS locations model for cellular networks is limiting, and the realizable capacity is much smaller than previously thought.
{"title":"Capacity of cellular wireless network","authors":"R. Vaze, Srikanth K. Iyer","doi":"10.23919/WIOPT.2017.7959907","DOIUrl":"https://doi.org/10.23919/WIOPT.2017.7959907","url":null,"abstract":"In cellular networks, under ARQ and SINR model of transmission, the effective downlink rate of packet transmission is the reciprocal of the expected delay (number of retransmissions needed till success). We define the cellular network capacity as the ratio of the basestation (BS) density and the expected delay. Exact characterization of this natural and practical but non-trivial (because of SINR temporal correlations) capacity metric is derived. The capacity is shown to first increase polynomially with the BS density and then scale inverse exponentially with the increasing BS density. Two distinct upper bounds are derived that are relevant for the low and the high BS density regimes. A single power control strategy is shown to achieve the upper bounds in both the regimes upto constants. Our result is fundamentally different than the transport and transmission capacity for ad hoc networks that scale as the square root of the (high) BS density. Our results show that the strong temporal correlations of SINRs with PPP distributed BS locations model for cellular networks is limiting, and the realizable capacity is much smaller than previously thought.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"6 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2017-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89042132","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-03-28DOI: 10.23919/WIOPT.2017.7959888
Andrea Pizzo, L. Sanguinetti
This work analyzes a mmWave single-cell network, which comprises a macro base station (BS) and an overlaid tier of small-cell BSs using a wireless backhaul for data traffic. We look for the optimal number of antennas at both BS and small-cell BSs that maximize the energy efficiency (EE) of the system when a hybrid transceiver architecture is employed. Closed-form expressions for the EE-optimal values of the number of antennas are derived that provide valuable insights into the interplay between the optimization variables and hardware characteristics. Numerical and analytical results show that the maximal EE is achieved by a ‘close-to’ fully-digital system wherein the number of BS antennas is approximately equal to the number of served small cells.
{"title":"Optimal design of energy-efficient millimeter wave hybrid transceivers for wireless backhaul","authors":"Andrea Pizzo, L. Sanguinetti","doi":"10.23919/WIOPT.2017.7959888","DOIUrl":"https://doi.org/10.23919/WIOPT.2017.7959888","url":null,"abstract":"This work analyzes a mmWave single-cell network, which comprises a macro base station (BS) and an overlaid tier of small-cell BSs using a wireless backhaul for data traffic. We look for the optimal number of antennas at both BS and small-cell BSs that maximize the energy efficiency (EE) of the system when a hybrid transceiver architecture is employed. Closed-form expressions for the EE-optimal values of the number of antennas are derived that provide valuable insights into the interplay between the optimization variables and hardware characteristics. Numerical and analytical results show that the maximal EE is achieved by a ‘close-to’ fully-digital system wherein the number of BS antennas is approximately equal to the number of served small cells.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"20 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2017-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85429793","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-03-17DOI: 10.23919/WIOPT.2017.7959895
Suzhi Bi, Y. Zhang, Rui Zhang
Wireless powered communication network (WPCN) is a novel networking paradigm that uses radio frequency (RF) wireless energy transfer (WET) technology to power the information transmissions of wireless devices (WDs). When energy and information are transferred in the same frequency band, a major design issue is transmission scheduling to avoid interference and achieve high communication performance. Commonly used centralized scheduling methods in WPCN may result in high control signaling overhead and thus are not suitable for wireless networks constituting a large number of WDs with random locations and dynamic operations. To tackle this issue, we propose in this paper a distributed scheduling protocol for energy and information transmissions in WPCN. Specifically, we allow a WD that is about to deplete its battery to broadcast an energy request buzz (ERB), which triggers WET from its associated hybrid access point (HAP) to recharge the battery. If no ERB is sent, the WDs contend to transmit data to the HAP using the conventional p-persistent CSMA (carrier sensing multiple access). In particular, we propose an energy queueing model based on an energy decoupling property to derive the throughput performance. Our analysis is verified through simulations under practical network parameters, which demonstrate good throughput performance of the distributed scheduling protocol and reveal some interesting design insights that are different from conventional contention-based communication network assuming the WDs are powered with unlimited energy supplies.
{"title":"Distributed scheduling in wireless powered communication network: Protocol design and performance analysis","authors":"Suzhi Bi, Y. Zhang, Rui Zhang","doi":"10.23919/WIOPT.2017.7959895","DOIUrl":"https://doi.org/10.23919/WIOPT.2017.7959895","url":null,"abstract":"Wireless powered communication network (WPCN) is a novel networking paradigm that uses radio frequency (RF) wireless energy transfer (WET) technology to power the information transmissions of wireless devices (WDs). When energy and information are transferred in the same frequency band, a major design issue is transmission scheduling to avoid interference and achieve high communication performance. Commonly used centralized scheduling methods in WPCN may result in high control signaling overhead and thus are not suitable for wireless networks constituting a large number of WDs with random locations and dynamic operations. To tackle this issue, we propose in this paper a distributed scheduling protocol for energy and information transmissions in WPCN. Specifically, we allow a WD that is about to deplete its battery to broadcast an energy request buzz (ERB), which triggers WET from its associated hybrid access point (HAP) to recharge the battery. If no ERB is sent, the WDs contend to transmit data to the HAP using the conventional p-persistent CSMA (carrier sensing multiple access). In particular, we propose an energy queueing model based on an energy decoupling property to derive the throughput performance. Our analysis is verified through simulations under practical network parameters, which demonstrate good throughput performance of the distributed scheduling protocol and reveal some interesting design insights that are different from conventional contention-based communication network assuming the WDs are powered with unlimited energy supplies.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"50 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2017-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79176828","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-03-17DOI: 10.23919/WIOPT.2017.7959927
Italo Atzeni, Jesús Arnau, M. Kountouris
This paper analyzes the downlink performance of ultra-dense networks with elevated base stations (BSs). We consider a general dual-slope pathloss model with distance-dependent probability of line-of-sight (LOS) transmission between BSs and receivers. Specifically, we consider the scenario where each link may be obstructed by randomly placed buildings. Using tools from stochastic geometry, we show that both coverage probability and area spectral efficiency decay to zero as the BS density grows large. Interestingly, we show that the BS height alone has a detrimental effect on the system performance even when the standard single-slope pathloss model is adopted.
{"title":"Performance analysis of ultra-dense networks with elevated base stations","authors":"Italo Atzeni, Jesús Arnau, M. Kountouris","doi":"10.23919/WIOPT.2017.7959927","DOIUrl":"https://doi.org/10.23919/WIOPT.2017.7959927","url":null,"abstract":"This paper analyzes the downlink performance of ultra-dense networks with elevated base stations (BSs). We consider a general dual-slope pathloss model with distance-dependent probability of line-of-sight (LOS) transmission between BSs and receivers. Specifically, we consider the scenario where each link may be obstructed by randomly placed buildings. Using tools from stochastic geometry, we show that both coverage probability and area spectral efficiency decay to zero as the BS density grows large. Interestingly, we show that the BS height alone has a detrimental effect on the system performance even when the standard single-slope pathloss model is adopted.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"10 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84685881","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-03-14DOI: 10.23919/WIOPT.2017.7959944
Jihong Park, Dong-Min Kim, P. Popovski, Seong-Lyun Kim
One of the goals of 5G wireless systems stated by the NGMN alliance is to provide moderate rates (50+ Mbps) everywhere and with very high reliability. We term this service Ultra-Reliable Ubiquitous-Rate Communication (UR2C). This paper investigates the role of frequency reuse in supporting UR2C in the downlink. To this end, two frequency reuse schemes are considered: user-specific frequency reuse (FRu) and BS-specific frequency reuse (FRb). For a given unit frequency channel, FRu reduces the number of serving user equipments (UEs), whereas FRb directly decreases the number of interfering base stations (BSs). This increases the distance from the interfering BSs and the signal-to-interference ratio (SIR) attains ultra-reliability, e.g. 99% SIR coverage at a randomly picked UE. The ultra-reliability is, however, achieved at the cost of the reduced frequency allocation, which may degrade overall downlink rate. To fairly capture this reliability-rate tradeoff, we propose ubiquitous rate defined as the maximum downlink rate whose required SIR can be achieved with ultra-reliability. By using stochastic geometry, we derive closed-form ubiquitous rate as well as the optimal frequency reuse rules for UR2C.
NGMN联盟提出的5G无线系统的目标之一是在任何地方提供中等速率(50+ Mbps)，并且具有非常高的可靠性。我们称这种服务为超可靠的全速通信(UR2C)。本文研究了频率复用在支持UR2C下行链路中的作用。为此，考虑了两种频率复用方案:用户特定频率复用(user-specific frequency reuse, FRu)和用户特定频率复用(BS-specific frequency reuse, FRb)。对于给定的单位频率信道，FRu减少服务用户设备(ue)的数量，而FRb直接减少干扰基站(BSs)的数量。这增加了与干扰BSs的距离，并且信号干扰比(SIR)达到了超可靠性，例如在随机选择的UE上达到99%的SIR覆盖率。然而，实现超可靠性的代价是减少频率分配，这可能会降低整体下行速率。为了公平地捕获这种可靠性和速率之间的权衡，我们建议将泛在速率定义为最大下行速率，其所需的SIR可以通过超可靠性实现。利用随机几何方法，导出了UR2C的闭型泛在率和最优频率复用规则。
{"title":"Revisiting frequency reuse towards supporting ultra-reliable ubiquitous-rate communication","authors":"Jihong Park, Dong-Min Kim, P. Popovski, Seong-Lyun Kim","doi":"10.23919/WIOPT.2017.7959944","DOIUrl":"https://doi.org/10.23919/WIOPT.2017.7959944","url":null,"abstract":"One of the goals of 5G wireless systems stated by the NGMN alliance is to provide moderate rates (50+ Mbps) everywhere and with very high reliability. We term this service Ultra-Reliable Ubiquitous-Rate Communication (UR2C). This paper investigates the role of frequency reuse in supporting UR2C in the downlink. To this end, two frequency reuse schemes are considered: user-specific frequency reuse (FRu) and BS-specific frequency reuse (FRb). For a given unit frequency channel, FRu reduces the number of serving user equipments (UEs), whereas FRb directly decreases the number of interfering base stations (BSs). This increases the distance from the interfering BSs and the signal-to-interference ratio (SIR) attains ultra-reliability, e.g. 99% SIR coverage at a randomly picked UE. The ultra-reliability is, however, achieved at the cost of the reduced frequency allocation, which may degrade overall downlink rate. To fairly capture this reliability-rate tradeoff, we propose ubiquitous rate defined as the maximum downlink rate whose required SIR can be achieved with ultra-reliability. By using stochastic geometry, we derive closed-form ubiquitous rate as well as the optimal frequency reuse rules for UR2C.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"75 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86391008","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-03-10DOI: 10.23919/WIOPT.2017.7959905
Hao Guo, Behrooz Makki, T. Svensson
In this paper, we study the performance of initial access beamforming schemes in the cases with large but finite number of transmit antennas and users. Particularly, we develop an efficient beamforming scheme using genetic algorithms. Moreover, taking the millimeter wave communication characteristics and different metrics into account, we investigate the effect of various parameters such as number of antennas/receivers, beamforming resolution as well as hardware impairments on the system performance. As shown, our proposed algorithm is generic in the sense that it can be effectively applied with different channel models, metrics and beamforming methods. Also, our results indicate that the proposed scheme can reach (almost) the same end-to-end throughput as the exhaustive search-based optimal approach with considerably less implementation complexity.
{"title":"A genetic algorithm-based beamforming approach for delay-constrained networks","authors":"Hao Guo, Behrooz Makki, T. Svensson","doi":"10.23919/WIOPT.2017.7959905","DOIUrl":"https://doi.org/10.23919/WIOPT.2017.7959905","url":null,"abstract":"In this paper, we study the performance of initial access beamforming schemes in the cases with large but finite number of transmit antennas and users. Particularly, we develop an efficient beamforming scheme using genetic algorithms. Moreover, taking the millimeter wave communication characteristics and different metrics into account, we investigate the effect of various parameters such as number of antennas/receivers, beamforming resolution as well as hardware impairments on the system performance. As shown, our proposed algorithm is generic in the sense that it can be effectively applied with different channel models, metrics and beamforming methods. Also, our results indicate that the proposed scheme can reach (almost) the same end-to-end throughput as the exhaustive search-based optimal approach with considerably less implementation complexity.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"1 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2017-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89545223","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-03-02DOI: 10.23919/WIOPT.2017.7959892
Muhammad Junaid Farooq, Quanyan Zhu
The Internet of things (IoT) is revolutionizing the management and control of automated systems leading to a paradigm shift in areas such as smart homes, smart cities, health care, transportation, etc. The IoT technology is also envisioned to play an important role in improving the effectiveness of military operations in battlefields. The interconnection of combat equipment and other battlefield resources for coordinated automated decisions is referred to as the Internet of battlefield things (IoBT). IoBT networks are significantly different from traditional IoT networks due to the battlefield specific challenges such as the absence of communication infrastructure, and the susceptibility of devices to cyber and physical attacks. The combat efficiency and coordinated decision-making in war scenarios depends highly on real-time data collection, which in turn relies on the connectivity of the network and the information dissemination in the presence of adversaries. This work aims to build the theoretical foundations of designing secure and reconfigurable IoBT networks. Leveraging the theories of stochastic geometry and mathematical epidemiology, we develop an integrated framework to study the communication of mission-critical data among different types of network devices and consequently design the network in a cost effective manner.
{"title":"Secure and reconfigurable network design for critical information dissemination in the Internet of battlefield things (IoBT)","authors":"Muhammad Junaid Farooq, Quanyan Zhu","doi":"10.23919/WIOPT.2017.7959892","DOIUrl":"https://doi.org/10.23919/WIOPT.2017.7959892","url":null,"abstract":"The Internet of things (IoT) is revolutionizing the management and control of automated systems leading to a paradigm shift in areas such as smart homes, smart cities, health care, transportation, etc. The IoT technology is also envisioned to play an important role in improving the effectiveness of military operations in battlefields. The interconnection of combat equipment and other battlefield resources for coordinated automated decisions is referred to as the Internet of battlefield things (IoBT). IoBT networks are significantly different from traditional IoT networks due to the battlefield specific challenges such as the absence of communication infrastructure, and the susceptibility of devices to cyber and physical attacks. The combat efficiency and coordinated decision-making in war scenarios depends highly on real-time data collection, which in turn relies on the connectivity of the network and the information dissemination in the presence of adversaries. This work aims to build the theoretical foundations of designing secure and reconfigurable IoBT networks. Leveraging the theories of stochastic geometry and mathematical epidemiology, we develop an integrated framework to study the communication of mission-critical data among different types of network devices and consequently design the network in a cost effective manner.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"18 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2017-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82728489","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
扫码关注我们
求助内容：
应助结果提醒方式：