2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)最新文献

筛选
英文 中文
A Hierarchical Green Mean-Field Power Control with eMBB-mMTC Coexistence in Ultradense 5G (Invited Paper) 超密集5G中eMBB-mMTC共存的分层绿均场功率控制(特邀论文)
Sami Nadif, Essaid Sabir, H. Elbiaze, Oussama Habachi, A. Haqiq
{"title":"A Hierarchical Green Mean-Field Power Control with eMBB-mMTC Coexistence in Ultradense 5G (Invited Paper)","authors":"Sami Nadif, Essaid Sabir, H. Elbiaze, Oussama Habachi, A. Haqiq","doi":"10.23919/WiOpt56218.2022.9930554","DOIUrl":"https://doi.org/10.23919/WiOpt56218.2022.9930554","url":null,"abstract":"Smal1 cell densification is recognized as one of the most significant characteristics in the fifth-generation of communication systems (5G) and beyond. A substantial capacity boost can be achieved at a low cost by supplementing macro networks with numerous small cells to create ultra-dense heterogeneous networks, which can serve as the foundation for the next generation of services. In this paper, we investigate a model that accounts for the location and channel quality of an enhanced Mobile Broadband (eMBB) user as well as the locations, density, and energy levels of a large number of Internet of Things (IoT) devices. More specifically, the eMBB user is randomly distributed in the coverage area of the MBS, and given its channel gain, it adjusts its transmit power to achieve an acceptable Quality of Service (QoS). In contrast, the IoT devices are gathered around SBS and regulate their transmission power in accordance with their energy budget to minimize energy-efficient utility function. Due to the coupling, the Stackelberg-Nash differential game is initially used to model the power allocation problem, with the eMBB user playing the role of the leader and the IoT devices playing the role of the followers. Then, we use the mean-field approximation to construct a hierarchical mean-field game from which we can recover a set of equations that may be solved iteratively to provide the optimal power allocation strategies. Simulation results illustrate the optimal power allocation strategies and show the effectiveness of the proposed approach.","PeriodicalId":228040,"journal":{"name":"2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116150570","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}
引用次数: 0
Cache-Aided Multi-Access Multi-User Private Information Retrieval 缓存辅助多访问多用户私有信息检索
Kanishak Vaidya, B. Rajan
{"title":"Cache-Aided Multi-Access Multi-User Private Information Retrieval","authors":"Kanishak Vaidya, B. Rajan","doi":"10.23919/WiOpt56218.2022.9930597","DOIUrl":"https://doi.org/10.23919/WiOpt56218.2022.9930597","url":null,"abstract":"In this paper, we consider the multi-access cache-aided multi-user Private Information Retrieval (MuPIR) problem. In this problem, N files are replicated across S servers. There are K users and C cache nodes, each capable of storing M files. Each user can access L cache nodes, and every cache node can be accessed by several users. Each user wants to retrieve one file from the servers, but users don’t want the servers to know their demands. This problem is an extension of the dedicated cache-aided MuPIR problem, which itself generalizes the single-user PIR setup. In this paper, we propose an order optimal MuPIR scheme that utilizes a multi-access setup of the coded caching problem where every set of L caches is accessed by one user resulting in K=$begin{pmatrix} c L end{pmatrix}$. We also propose","PeriodicalId":228040,"journal":{"name":"2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130901970","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}
引用次数: 2
Semantics-Aware Active Fault Detection in IoT 物联网中语义感知的主动故障检测
George J. Stamatakis, Nikolaos Pappas, Alexandros G. Fragkiadakis, A. Traganitis
{"title":"Semantics-Aware Active Fault Detection in IoT","authors":"George J. Stamatakis, Nikolaos Pappas, Alexandros G. Fragkiadakis, A. Traganitis","doi":"10.23919/WiOpt56218.2022.9930549","DOIUrl":"https://doi.org/10.23919/WiOpt56218.2022.9930549","url":null,"abstract":"In this work we address a problem of active fault detection in an IoT scenario, whereby a monitor probes a remote device in order to detect faults and acquire fresh information. However, probing can have a significant impact on the IoT network’s energy and communication resources. To address this problem we utilize Age of Information as a measure of the freshness of information at the monitor and adopt a semantics-aware communication approach between the monitor and the remote device. In semantics-aware communications, the processes of generating and transmitting information are treated jointly in order to consider the importance of information and the purpose of communication. We formulate the problem as a Partially Observable Markov Decision Process and propose a computationally efficient stochastic approximation algorithm to approximate the optimal policy. Finally, we present numerical results that exhibit the advantage of our approach compared to a conventional delay-based probing policy.","PeriodicalId":228040,"journal":{"name":"2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133787328","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}
引用次数: 6
Economics of Multi-Operator Network Slicing 多算子网络切片的经济学
George Darzanos, I. Koutsopoulos, Katia Papakonstantinopoulou, G. Stamoulis
{"title":"Economics of Multi-Operator Network Slicing","authors":"George Darzanos, I. Koutsopoulos, Katia Papakonstantinopoulou, G. Stamoulis","doi":"10.23919/WiOpt56218.2022.9930621","DOIUrl":"https://doi.org/10.23919/WiOpt56218.2022.9930621","url":null,"abstract":"Network slicing allows Mobile Network Operators (MNOs) to partition their physical infrastructure into multiple virtual logical networks, enabling the simultaneous servicing of applications with diverse Quality of Service characteristics. In this paper, we introduce and evaluate economic models and policies for the provisioning, across multiple MNOs, of network slice services to Application Providers. We introduce a Network-Slice-as-a-Service model that maps the service offered by a network slice to requirements on virtualized resources. The placement of virtualized resources over the physical infrastructure of MNOs is determined by an embedding problem, formulated as a Mixed Integer Program. We investigate the embedding under: (i) centralized approaches, where a central Broker determines the embedding for all network slice requests, and (ii) peer-to-peer approaches, where each MNO determines the embedding for the sub-set of network slice requests coming from its own customers. We introduce policies for cooperative modes, with the objective of total profit maximization, and for “coopetitive” (cooperative competition) modes, where MNOs aim to maximize their individual profits. The numerical results reveal that MNOs can maximize their aggregate and individual profits under any approach or mode, if they comply with the proposed policies.","PeriodicalId":228040,"journal":{"name":"2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)","volume":"235 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131886635","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}
引用次数: 0
On the Regret of Online Edge Service Hosting 论在线边缘服务托管的遗憾
Rudrabhotla Sri Prakash, N. Karamchandani, Sharayu Moharir
{"title":"On the Regret of Online Edge Service Hosting","authors":"Rudrabhotla Sri Prakash, N. Karamchandani, Sharayu Moharir","doi":"10.23919/WiOpt56218.2022.9930528","DOIUrl":"https://doi.org/10.23919/WiOpt56218.2022.9930528","url":null,"abstract":"We consider the problem of service hosting where a service provider can dynamically rent edge resources via short term contracts to ensure better quality of service to its customers. The service can also be partially hosted at the edge, in which case, customers’ requests can be partially served at the edge. The total cost incurred by the system is modeled as a combination of the rent cost, the service cost incurred due to latency in serving customers, and the fetch cost incurred as a result of the bandwidth used to fetch the code/databases of the service from the cloud servers to host the service at the edge. In this paper, we compare multiple hosting policies with regret as a metric, defined as the difference in the cost incurred by the policy and the optimal policy over some time horizon T. In particular we consider the Retro Renting (RR) and Follow The Perturbed Leader (FTPL) policies proposed in the literature and provide performance guarantees on the regret of these policies. We show that under i.i. d stochastic arrivals, RR policy has linear regret while FTPL policy has constant regret. Next, we propose a variant of FTPL, namely Wait then FTPL (W-FTPL), which also has constant regret while demonstrating much better dependence on the fetch cost. We also show that under adversarial arrivals, RR policy has linear regret while both FTPL and W-FTPL have regret O($sqrt{T}$) which is orderoptimal.","PeriodicalId":228040,"journal":{"name":"2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127523983","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}
引用次数: 0
Secret-less secured payment system for inter-broker communications 经纪人间通信的无秘密安全支付系统
Jean-Philippe Abegg, Quentin Bramas, Thomas Noël
{"title":"Secret-less secured payment system for inter-broker communications","authors":"Jean-Philippe Abegg, Quentin Bramas, Thomas Noël","doi":"10.23919/WiOpt56218.2022.9930579","DOIUrl":"https://doi.org/10.23919/WiOpt56218.2022.9930579","url":null,"abstract":"The growing importance of the data in today’s applications, such as machine learning, makes merchandising them more appealing, but it opens various challenges. Indeed, we want data to be delivered in a fast, reliable, and secure manner. This means we want guarantees about the payment and the correct delivery of the data, while still offering the ease of existing publish/subscribe protocols. There exists no state-of-the-art protocol that answers to all those challenges. Most of them lack the security properties needed for merchandising data and the few secured propositions do not scale well with the number of buyers, which prevents them from global use. In this paper, we present a data payment system based on SUPRA, a publish/subscribe protocol having delivery guarantees. With our solution, it is possible to securely sell data while sharing them using the publish/subscribe model, which is known for its scalability in one-to-many communications. After presenting how our system works, we explain how it answers the various challenges of merchandising data and compare it to the other state-of-the-art solutions.","PeriodicalId":228040,"journal":{"name":"2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126552522","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}
引用次数: 0
Towards Reliable mmWave 6G RAN: Reconfigurable Surfaces, Smart Repeaters, or Both? 迈向可靠的毫米波6G RAN:可重构表面,智能中继器,还是两者兼而有之?
Giuseppe Leone, Eugenio Moro, I. Filippini, A. Capone, Danilo De Donno
{"title":"Towards Reliable mmWave 6G RAN: Reconfigurable Surfaces, Smart Repeaters, or Both?","authors":"Giuseppe Leone, Eugenio Moro, I. Filippini, A. Capone, Danilo De Donno","doi":"10.23919/WiOpt56218.2022.9930587","DOIUrl":"https://doi.org/10.23919/WiOpt56218.2022.9930587","url":null,"abstract":"Mm-Wave 5G NR promises to provide unprecedented access throughput to mobile radio networks but comes with several challenges. Network densification is the only viable solution to increase robustness in front of link outages due to random obstacles. While Integrated-Access-and-Backhauling (IA B) architecture is commonly considered the enabling technology to reduce the cost of such dense deployments, Reconfigurable Intelligent Surfaces (RISs) and Smart Repeaters (SRs) are very recently emerging as promising tools to provide further capabilities to 6G networks in Smart Radio Environments. However, the impact of these devices on next-generation networks is yet to be fully understood. In this paper, we provide a first answer to the questions arising in the deployment of mmWave RAN equipped with SRs and RISs. By means of mathematical programming models for full network planning optimization, we produce optimal network layouts that we leverage to assess in which scenario, in which position, and with which configuration SRs and RISs can better improve the reliability of such networks.","PeriodicalId":228040,"journal":{"name":"2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)","volume":"179 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116162686","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}
引用次数: 3
Real-Time Recursive Routing in Payment Channel Network: A Bidding-based Design 支付通道网络中的实时递归路由:一种基于投标的设计
Jiayuan Liu, Canhui Chen, Lulu Zhou, Zhixuan Fang
{"title":"Real-Time Recursive Routing in Payment Channel Network: A Bidding-based Design","authors":"Jiayuan Liu, Canhui Chen, Lulu Zhou, Zhixuan Fang","doi":"10.23919/WiOpt56218.2022.9930529","DOIUrl":"https://doi.org/10.23919/WiOpt56218.2022.9930529","url":null,"abstract":"Payment Channel Network (PCN) is proposed as a promising layer-two solution to tackle the scalability problem of current blockchain systems, which allows the two transacting parties to perform off-chain transactions through their established payment channel. For the transacting parties who are not directly connected, PCN allows them to route the transaction through some intermediate nodes with sufficient balance. Designing an efficient routing protocol is one of the most important and challenging problems in improving the performance of PCN. To tackle this challenge, we propose Real-Time Recursive Routing (RTRR), an efficient routing algorithm that can achieve a short routing time with strong privacy protection and high flexibility in the dynamic scenario. In addition, we investigate the bidding process in RTRR and derive the equilibrium strategy, which implies that the proposed protocol prefers to route the transaction through the nodes with a higher success rate, contributing to a better performance. Both the theoretical analyses and the empirical experiment results demonstrate the high efficiency of RTRR.","PeriodicalId":228040,"journal":{"name":"2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114527140","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}
引用次数: 0
Interference Alignment in Reduced-Rank MIMO Networks with Application to Dynamic TDD 降阶MIMO网络的干扰对准及其在动态TDD中的应用
Amel Tibhirt, D. Slock, Y. Yuan-Wu
{"title":"Interference Alignment in Reduced-Rank MIMO Networks with Application to Dynamic TDD","authors":"Amel Tibhirt, D. Slock, Y. Yuan-Wu","doi":"10.23919/WiOpt56218.2022.9930564","DOIUrl":"https://doi.org/10.23919/WiOpt56218.2022.9930564","url":null,"abstract":"In Dynamic Time Division Duplex (DynTDD), downlink/uplink (DL/UL) slot allocation is adaptive with traffic load. DynTDD systems have received a lot of attention for 5th generation (5G) mobile communication systems, as the spectrum efficiency of wireless communication networks is improved by the flexible and dynamic duplex operation. However when using DynTDD, a different DL/UL slot configuration is likely to be selected by neighboring cells, leading to Cross Link Interference (CLI) between the Base Stations (BS), which is known as BS-to-BS or DL-to-UL interference, and between User Equipment (UE) which is known as UE-to-UE or UL-to-DL interference. Rank deficient channels are frequently encountered in Multi-Input Multi-Output (MIMO) networks, due to poor scattering and keyhole effects, or when using Massive MIMO and moving to mmWave. While the implications of rank deficient channels are well understood for the single user (SU) point to point setting, less is known for interference networks. In this paper, we extend a MIMO Interference Alignment (IA) feasibility investigation framework to rank deficient channels and we investigate the IA feasibility in DynTDD considering rank deficient MIMO interfering channels, by establishing the simultaneously necessary and sufficient conditions. These conditions allow us to evaluate the Degrees-of-Freedom (DoF) of centralized designs more precisely compared to the loose proper conditions. We then compare the achievable DoF of centralized designs with those of various distributed designs, allowing us to get a better idea of the DoF price to pay for distributedness (but not accounting for the gain in information exchange reduction that distributed designs permit).","PeriodicalId":228040,"journal":{"name":"2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123348544","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}
引用次数: 2
Game Theoretic Analysis of Citizens Broadband Radio Service 公民宽带无线电业务的博弈分析
Jonathan Chamberlain, D. Starobinski
{"title":"Game Theoretic Analysis of Citizens Broadband Radio Service","authors":"Jonathan Chamberlain, D. Starobinski","doi":"10.23919/WiOpt56218.2022.9930583","DOIUrl":"https://doi.org/10.23919/WiOpt56218.2022.9930583","url":null,"abstract":"The Citizens Broadband Radio Service (CBRS) is a spectrum sharing framework on the 3.5 GHz tier with three priority tiers: the incumbents, priority commercial users (PAL), and general commercial users (GAA). Thus, commercial users compete for resources within the second and third priority tiers. The interaction between commercial providers and customers is complicated by the presence of the incumbents, who impact the availability of spectrum but bypass the market entirely. In particular, PAL customers are themselves subject to preemption even with the priority purchase. In this paper, we propose a game-theoretic framework to shed light into the equilibrium outcomes and the impact of the incumbents into these. We determine that there exist several possible equilibrium regions, including one with a unique mixed equilibrium which is stable in the evolutionary stable strategy sense, and others featuring unstable mixed equilibria and stable pure equilibria. We show that for fixed parameters, the maximum possible revenue a provider can obtain is associated with a stable equilibrium and is thus guaranteed. However, changes in incumbent behavior can result in phase changes which have a sizable impact on the maximum potential revenue.","PeriodicalId":228040,"journal":{"name":"2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128285445","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}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信