Pub Date : 2018-05-01DOI: 10.23919/WIOPT.2018.8362892
K. Haritha, C. Singh
We propose a class of binary queue length information based max-weight scheduling algorithms for wireless networks. In these algorithms, the scheduler, in addition to channel states, only needs to know when a link's queue length crosses a prescribed threshold. We show that these algorithms are throughput optimal. Further, we incorporate time-since-last-service (TSLS) information to improve delay and service regularity of the scheduling algorithms while ensuring throughput optimality. We also perform simulations to illustrate throughput, delay and service regularity performance of the proposed algorithms.
{"title":"Lightweight max weight scheduling algorithms for wireless networks","authors":"K. Haritha, C. Singh","doi":"10.23919/WIOPT.2018.8362892","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362892","url":null,"abstract":"We propose a class of binary queue length information based max-weight scheduling algorithms for wireless networks. In these algorithms, the scheduler, in addition to channel states, only needs to know when a link's queue length crosses a prescribed threshold. We show that these algorithms are throughput optimal. Further, we incorporate time-since-last-service (TSLS) information to improve delay and service regularity of the scheduling algorithms while ensuring throughput optimality. We also perform simulations to illustrate throughput, delay and service regularity performance of the proposed algorithms.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115425709","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-05-01DOI: 10.23919/WIOPT.2018.8362886
Antti Tölli, S. P. Shariatpanahi, Jarkko Kaleva, B. Khalaj
A wireless coded caching (CC) setup is considered, where a multi-antenna transmitter delivers contents to multiple cache-enabled users. Exploiting multicasting opportunities provided by the coded caching paradigm, novel interference management schemes are proposed by assigning carefully designed beamforming vectors to different multicast messages. Thereby, the proposed design benefits from spatial multiplexing gain, improved interference management and the global CC gain, simultaneously. In addition, a novel multicast mode selection scheme is proposed which determines the optimum multicast group sizes providing the best complexity-performance tradeoff for a given SNR range. While the proposed scheme exhibits the same near-optimal degrees-of-freedom (DoF) performance as previously proposed methods, it will surpass them at the practical finite SNR regimes. In addition to reducing the complexity, the proposed mode selection feature also provides significantly better rate than previously proposed schemes.
{"title":"Multicast mode selection for multi-antenna coded caching","authors":"Antti Tölli, S. P. Shariatpanahi, Jarkko Kaleva, B. Khalaj","doi":"10.23919/WIOPT.2018.8362886","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362886","url":null,"abstract":"A wireless coded caching (CC) setup is considered, where a multi-antenna transmitter delivers contents to multiple cache-enabled users. Exploiting multicasting opportunities provided by the coded caching paradigm, novel interference management schemes are proposed by assigning carefully designed beamforming vectors to different multicast messages. Thereby, the proposed design benefits from spatial multiplexing gain, improved interference management and the global CC gain, simultaneously. In addition, a novel multicast mode selection scheme is proposed which determines the optimum multicast group sizes providing the best complexity-performance tradeoff for a given SNR range. While the proposed scheme exhibits the same near-optimal degrees-of-freedom (DoF) performance as previously proposed methods, it will surpass them at the practical finite SNR regimes. In addition to reducing the complexity, the proposed mode selection feature also provides significantly better rate than previously proposed schemes.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129904458","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.23919/WIOPT.2018.8362888
Qianqian Yang, Parisa Hassanzadeh, Deniz Gündüz, E. Erkip
Content delivery in a multi-user cache-aided broadcast network is studied, where a server holding a database of correlated contents communicates with the users over a Gaussian broadcast channel (BC). The minimum transmission power required to satisfy all possible demand combinations is studied, when the users are equipped with caches of equal size. A lower bound on the required transmit power is derived, assuming uncoded cache placement, as a function of the cache capacity. A centralized joint cache and channel coding scheme is proposed, which not only utilizes the user's local caches, but also exploits the correlation among the contents in the database. This scheme provides an upper bound on the minimum required transmit power for a given cache capacity. Our results indicate that exploiting the correlations among the contents in a cache-aided Gaussian BC can provide significant energy savings.
{"title":"Centralized caching and delivery of correlated contents over a Gaussian broadcast channel","authors":"Qianqian Yang, Parisa Hassanzadeh, Deniz Gündüz, E. Erkip","doi":"10.23919/WIOPT.2018.8362888","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362888","url":null,"abstract":"Content delivery in a multi-user cache-aided broadcast network is studied, where a server holding a database of correlated contents communicates with the users over a Gaussian broadcast channel (BC). The minimum transmission power required to satisfy all possible demand combinations is studied, when the users are equipped with caches of equal size. A lower bound on the required transmit power is derived, assuming uncoded cache placement, as a function of the cache capacity. A centralized joint cache and channel coding scheme is proposed, which not only utilizes the user's local caches, but also exploits the correlation among the contents in the database. This scheme provides an upper bound on the minimum required transmit power for a given cache capacity. Our results indicate that exploiting the correlations among the contents in a cache-aided Gaussian BC can provide significant energy savings.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"96 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":"123545614","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.23919/WIOPT.2018.8362891
Cristian Tatino, Ilaria Malanchini, N. Pappas, D. Yuan
Multi-connectivity is emerging as promising solution to provide reliable communications and seamless connectivity at the millimeter-wave frequency range. Due to the obstacles that cause frequent interruptions at such high frequency range, connectivity to multiple cells can drastically increase the network performance in terms of throughput and reliability by coordination among the network elements. In this paper, we propose an algorithm for the link scheduling optimization that maximizes the network throughput for multi-connectivity in millimeter-wave cellular networks. The considered approach exploits a centralized architecture, fast link switching, proactive context preparation and data forwarding between millimeter-wave access points and the users. The proposed algorithm is able to numerically approach the global optimum and to quantify the potential gain of multi-connectivity in millimeter-wave cellular networks.
{"title":"Maximum throughput scheduling for multi-connectivity in millimeter-wave networks","authors":"Cristian Tatino, Ilaria Malanchini, N. Pappas, D. Yuan","doi":"10.23919/WIOPT.2018.8362891","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362891","url":null,"abstract":"Multi-connectivity is emerging as promising solution to provide reliable communications and seamless connectivity at the millimeter-wave frequency range. Due to the obstacles that cause frequent interruptions at such high frequency range, connectivity to multiple cells can drastically increase the network performance in terms of throughput and reliability by coordination among the network elements. In this paper, we propose an algorithm for the link scheduling optimization that maximizes the network throughput for multi-connectivity in millimeter-wave cellular networks. The considered approach exploits a centralized architecture, fast link switching, proactive context preparation and data forwarding between millimeter-wave access points and the users. The proposed algorithm is able to numerically approach the global optimum and to quantify the potential gain of multi-connectivity in millimeter-wave cellular networks.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"90 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":"125110549","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-19DOI: 10.23919/WIOPT.2018.8362878
M. Kountouris, N. Pappas, Apostolos Avranas
Quality of service (QoS) provisioning in next-generation mobile communications systems entails a deep under-standing of the delay performance. The delay in wireless networks is strongly affected by the traffic arrival process and the service process, which in turn depends on the medium access protocol and the signal-to-interference-plus-noise ratio (SINR) distribution. In this work, we characterize the conditional distribution of the service process given the point process in Poisson bipolar networks. We then provide an upper bound on the delay violation probability combining tools from stochastic network calculus and stochastic geometry. Furthermore, we analyze the delay performance under statistical queueing constraints using the effective capacity formulation. The impact of QoS requirements, network geometry and link distance on the delay performance is identified. Our results provide useful insights for guaranteeing stringent delay requirements in large wireless networks.
{"title":"QoS provisioning in large wireless networks","authors":"M. Kountouris, N. Pappas, Apostolos Avranas","doi":"10.23919/WIOPT.2018.8362878","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362878","url":null,"abstract":"Quality of service (QoS) provisioning in next-generation mobile communications systems entails a deep under-standing of the delay performance. The delay in wireless networks is strongly affected by the traffic arrival process and the service process, which in turn depends on the medium access protocol and the signal-to-interference-plus-noise ratio (SINR) distribution. In this work, we characterize the conditional distribution of the service process given the point process in Poisson bipolar networks. We then provide an upper bound on the delay violation probability combining tools from stochastic network calculus and stochastic geometry. Furthermore, we analyze the delay performance under statistical queueing constraints using the effective capacity formulation. The impact of QoS requirements, network geometry and link distance on the delay performance is identified. Our results provide useful insights for guaranteeing stringent delay requirements in large wireless networks.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128723387","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-03-21DOI: 10.23919/WIOPT.2018.8362861
Muhammad Junaid Farooq, Quanyan Zhu
Spectrum reservation is emerging as one of the potential solutions to cater for the communication needs of massive number of wireless Internet of Things (IoT) devices with reliability constraints particularly in mission-critical scenarios. In most mission-critical systems, the true utility of a reservation may not be completely known ahead of time as the unforseen events might not be completely predictable. In this paper, we present a dynamic contract approach where an advance payment is made at the time of reservation based on partial information about spectrum reservation utility. Once the complete information is obtained, a rebate on the payment is made if the reservation is released. In this paper, we present a contract theoretic approach to design an incentivized mechanism that coerces the applications to reveal their true application type resulting in greater profitability of the IoT network operator. The operator offers a menu of contracts with advanced payments and rebate to the IoT applications without having knowledge about the types of applications. The decision of the applications in selecting a contract leads to a revelation of their true type to the operator which allows it to generate higher profits than a traditional spectrum auction mechanism. Under some assumptions on distribution of the utility of the applications, closed form solutions for the optimal dynamic spectrum reservation contract are provided and the sensitivity against system parameters is analyzed.
{"title":"Optimal dynamic contract for spectrum reservation in mission-critical UNB-IoT systems","authors":"Muhammad Junaid Farooq, Quanyan Zhu","doi":"10.23919/WIOPT.2018.8362861","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362861","url":null,"abstract":"Spectrum reservation is emerging as one of the potential solutions to cater for the communication needs of massive number of wireless Internet of Things (IoT) devices with reliability constraints particularly in mission-critical scenarios. In most mission-critical systems, the true utility of a reservation may not be completely known ahead of time as the unforseen events might not be completely predictable. In this paper, we present a dynamic contract approach where an advance payment is made at the time of reservation based on partial information about spectrum reservation utility. Once the complete information is obtained, a rebate on the payment is made if the reservation is released. In this paper, we present a contract theoretic approach to design an incentivized mechanism that coerces the applications to reveal their true application type resulting in greater profitability of the IoT network operator. The operator offers a menu of contracts with advanced payments and rebate to the IoT applications without having knowledge about the types of applications. The decision of the applications in selecting a contract leads to a revelation of their true type to the operator which allows it to generate higher profits than a traditional spectrum auction mechanism. Under some assumptions on distribution of the utility of the applications, closed form solutions for the optimal dynamic spectrum reservation contract are provided and the sensitivity against system parameters is analyzed.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126674082","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-03-20DOI: 10.23919/WIOPT.2018.8362859
Samith Abeywickrama, Tharaka Samarasinghe, C. Yuen, Rui Zhang
This paper proposes a novel channel estimation method and a cluster-based opportunistic scheduling policy, for a wireless energy transfer (WET) system consisting of multiple low-complex energy receivers (ERs) with limited processing capabilities. Firstly, in the training stage, the energy transmitter (ET) obtains a set of Received Signal Strength Indicator (RSSI) feedback values from all ERs, and these values are used to estimate the channels between the ET and all ERs. Next, based on the channel estimates, the ERs are grouped into clusters, and the cluster that has its members closest to its centroid in phase is selected for dedicated WET. The beamformer that maximizes the minimum harvested energy among all ERs in the selected cluster is found by solving a convex optimization problem. All ERs have the same chance of being selected regardless of their distances from the ET, and hence, this scheduling policy can be considered to be opportunistic as well as fair. It is shown that the proposed method achieves significant performance gains over benchmark schemes.
{"title":"Cluster-based wireless energy transfer for low complex energy receivers","authors":"Samith Abeywickrama, Tharaka Samarasinghe, C. Yuen, Rui Zhang","doi":"10.23919/WIOPT.2018.8362859","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362859","url":null,"abstract":"This paper proposes a novel channel estimation method and a cluster-based opportunistic scheduling policy, for a wireless energy transfer (WET) system consisting of multiple low-complex energy receivers (ERs) with limited processing capabilities. Firstly, in the training stage, the energy transmitter (ET) obtains a set of Received Signal Strength Indicator (RSSI) feedback values from all ERs, and these values are used to estimate the channels between the ET and all ERs. Next, based on the channel estimates, the ERs are grouped into clusters, and the cluster that has its members closest to its centroid in phase is selected for dedicated WET. The beamformer that maximizes the minimum harvested energy among all ERs in the selected cluster is found by solving a convex optimization problem. All ERs have the same chance of being selected regardless of their distances from the ET, and hence, this scheduling policy can be considered to be opportunistic as well as fair. It is shown that the proposed method achieves significant performance gains over benchmark schemes.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130581736","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-03-17DOI: 10.23919/WIOPT.2018.8362818
Rajat Talak, S. Karaman, E. Modiano
Age of information (AoI), defined as the time elapsed since the last received update was generated, is a newly proposed metric to measure the timeliness of information updates in a network. We consider AoI minimization problem for a network with general interference constraints, and time varying channels. We propose two policies, namely, virtual-queue based policy and age-based policy when the channel state is available to the network scheduler at each time step. We prove that the virtual-queue based policy is nearly optimal, up to a constant additive factor, and the age-based policy is at-most factor 4 away from optimality. Comparison with previous work, which derived age optimal policies when channel state information is not available to the scheduler, demonstrates a 4 fold improvement in age due to the availability of channel state information.
信息年龄(Age of information, AoI)，定义为自上次接收到的更新生成以来所经过的时间，是一个新提出的度量网络中信息更新的时效性的指标。研究了具有一般干扰约束的时变信道网络的AoI最小化问题。当通道状态在每个时间步对网络调度程序可用时，我们提出了两种策略，即基于虚拟队列的策略和基于年龄的策略。我们证明了基于虚拟队列的策略几乎是最优的，直到一个常数的附加因子，而基于年龄的策略离最优性最多只有4个因子。与之前的工作(当通道状态信息对调度器不可用时导出年龄最优策略)相比，由于通道状态信息的可用性，年龄提高了4倍。
{"title":"Optimizing age of information in wireless networks with perfect channel state information","authors":"Rajat Talak, S. Karaman, E. Modiano","doi":"10.23919/WIOPT.2018.8362818","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362818","url":null,"abstract":"Age of information (AoI), defined as the time elapsed since the last received update was generated, is a newly proposed metric to measure the timeliness of information updates in a network. We consider AoI minimization problem for a network with general interference constraints, and time varying channels. We propose two policies, namely, virtual-queue based policy and age-based policy when the channel state is available to the network scheduler at each time step. We prove that the virtual-queue based policy is nearly optimal, up to a constant additive factor, and the age-based policy is at-most factor 4 away from optimality. Comparison with previous work, which derived age optimal policies when channel state information is not available to the scheduler, demonstrates a 4 fold improvement in age due to the availability of channel state information.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"63 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113943284","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-03-12DOI: 10.23919/WIOPT.2018.8362863
Chanaka Singhabahu, Tharaka Samarasinghe, Samith Abeywickrama, C. Yuen
This paper focuses on wireless energy transfer (WET) to a pair of low complex energy receivers (ER), by only utilizing received signal strength indicator (RSSI) values that are fed back from the ERs to the energy transmitter (ET). Selecting the beamformer that maximizes the total average energy transfer between the ET and the ERs, while satisfying a minimum harvested energy criterion at each ER, is studied. This is a non-convex constrained optimization problem which is difficult to solve analytically. Also, any analytical solution to the problem should only consists of parameters that the ET knows, or the ET can estimate, as utilizing only RSSI feedback values for channel estimation prohibits estimating some channel parameters. Thus, the paper focuses on obtaining a suboptimal solution analytically. It is proven that if the channels between the ET and the ERs satisfy a certain sufficient condition, this solution is in fact optimal. Simulations show that the optimality gap is negligibly small as well. Insights into a system with more than two ERs are also presented. To this end, it is highlighted that if the number of ERs is large enough, it is possible to always find a pair of ERs satisfying the sufficient condition, and hence, a pairwise scheduling policy that does not violate optimality can be used for the WET.
{"title":"Wireless energy transfer to a pair of energy receivers using signal strength feedback","authors":"Chanaka Singhabahu, Tharaka Samarasinghe, Samith Abeywickrama, C. Yuen","doi":"10.23919/WIOPT.2018.8362863","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362863","url":null,"abstract":"This paper focuses on wireless energy transfer (WET) to a pair of low complex energy receivers (ER), by only utilizing received signal strength indicator (RSSI) values that are fed back from the ERs to the energy transmitter (ET). Selecting the beamformer that maximizes the total average energy transfer between the ET and the ERs, while satisfying a minimum harvested energy criterion at each ER, is studied. This is a non-convex constrained optimization problem which is difficult to solve analytically. Also, any analytical solution to the problem should only consists of parameters that the ET knows, or the ET can estimate, as utilizing only RSSI feedback values for channel estimation prohibits estimating some channel parameters. Thus, the paper focuses on obtaining a suboptimal solution analytically. It is proven that if the channels between the ET and the ERs satisfy a certain sufficient condition, this solution is in fact optimal. Simulations show that the optimality gap is negligibly small as well. Insights into a system with more than two ERs are also presented. To this end, it is highlighted that if the number of ERs is large enough, it is possible to always find a pair of ERs satisfying the sufficient condition, and hence, a pairwise scheduling policy that does not violate optimality can be used for the WET.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116654038","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-02-28DOI: 10.23919/WIOPT.2018.8362817
Abhishek Sinha, E. Modiano
We consider the Network Utility Maximization (NUM) problem for wireless networks in the presence of arbitrary types of flows, including unicast, broadcast, multicast, and anycast traffic. Building upon the recent framework of a universal control policy (UMW), we design a utility optimal cross-layer admission control, routing and scheduling policy, called UMW+. The UMW+ policy takes packet level actions based on a precedence-relaxed virtual network. Using Lyapunov optimization techniques, we show that UMW+ maximizes network utility, while simultaneously keeping the physical queues in the network stable. Extensive simulation results validate the performance of UMW+ demonstrating both optimal utility performance and bounded average queue occupancy. Moreover, we establish a precise one-to-one correspondence between the dynamics of the virtual queues under the UMW+ policy, and the dynamics of the dual variables of an associated offline NUM program, under a subgradient algorithm. This correspondence sheds further insight into our understanding of UMW+.
{"title":"Network utility maximization with heterogeneous traffic flows","authors":"Abhishek Sinha, E. Modiano","doi":"10.23919/WIOPT.2018.8362817","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362817","url":null,"abstract":"We consider the Network Utility Maximization (NUM) problem for wireless networks in the presence of arbitrary types of flows, including unicast, broadcast, multicast, and anycast traffic. Building upon the recent framework of a universal control policy (UMW), we design a utility optimal cross-layer admission control, routing and scheduling policy, called UMW+. The UMW+ policy takes packet level actions based on a precedence-relaxed virtual network. Using Lyapunov optimization techniques, we show that UMW+ maximizes network utility, while simultaneously keeping the physical queues in the network stable. Extensive simulation results validate the performance of UMW+ demonstrating both optimal utility performance and bounded average queue occupancy. Moreover, we establish a precise one-to-one correspondence between the dynamics of the virtual queues under the UMW+ policy, and the dynamics of the dual variables of an associated offline NUM program, under a subgradient algorithm. This correspondence sheds further insight into our understanding of UMW+.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"488 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132196637","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
扫码关注我们
求助内容：
应助结果提醒方式：