Pub Date : 2017-05-01DOI: 10.23919/WIOPT.2017.7959934
Wilfried Yoro, Mamdouh El Tabach, T. En-Najjary, A. Gati, T. Chahed
We investigate in this paper the assessment of the energy efficiency of a wireless access network per service category. We consider five categories of service, two categories with high traffic: streaming and web browsing, and three other with lower traffic: download, voice and other minor data services. We introduce two scenarios, one where some services are mandatory, it is typically the case of Voice which is mandatory to be provided due to legal constraints, and another one where there is no mandatory service. We used our Shapley-based sharing model introduced in previous works to share the total energy consumption of the access network among the service categories, and then derive the energy efficiency of each service category as the ratio of its traffic volume (measured in the network) and its energy consumption assessed with our Shapley-based model. We applied the models on a real dataset extracted from an operational network in Europe, and analyze the energy efficiency of each considered service category.
{"title":"Energy efficiency of a network per service","authors":"Wilfried Yoro, Mamdouh El Tabach, T. En-Najjary, A. Gati, T. Chahed","doi":"10.23919/WIOPT.2017.7959934","DOIUrl":"https://doi.org/10.23919/WIOPT.2017.7959934","url":null,"abstract":"We investigate in this paper the assessment of the energy efficiency of a wireless access network per service category. We consider five categories of service, two categories with high traffic: streaming and web browsing, and three other with lower traffic: download, voice and other minor data services. We introduce two scenarios, one where some services are mandatory, it is typically the case of Voice which is mandatory to be provided due to legal constraints, and another one where there is no mandatory service. We used our Shapley-based sharing model introduced in previous works to share the total energy consumption of the access network among the service categories, and then derive the energy efficiency of each service category as the ratio of its traffic volume (measured in the network) and its energy consumption assessed with our Shapley-based model. We applied the models on a real dataset extracted from an operational network in Europe, and analyze the energy efficiency of each considered service category.","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-5"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87595470","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-01DOI: 10.23919/WIOPT.2017.7959887
Junlin Yu, M. H. Cheung, Jianwei Huang
To exploit users' heterogeneous data demands, several mobile network operators worldwide have launched the mobile data trading markets, where users can trade mobile data quota with each other. In this work, we aim to understand the users' optimal trading decisions and the operator's revenue maximizing strategy. We model the interactions between the mobile operator and the users as a two-stage Stackelberg game. In Stage I, the operator chooses the operation fee imposed on sellers to maximize its revenue. In Stage II, each user decides whether to be a seller or a buyer and optimizes the corresponding trading price and quantity. We derive the closed-form expression of the unique Nash equilibrium (NE) in Stage II in closed-form, and prove that the users' decisions can converge to the NE through distributed best response updates. We show that at the NE, different types of sellers and buyers should propose the same price such that the total demand matches the total supply. We further show that the Stage I operation fee optimization problem is convex, and derive the optimal operation fee in closed-form. Our analysis and numerical results show that the users who have less uncertainty of their data usages can benefit more from data trading. We also show that an operation fee that is too high hurts both the users' payoffs and the operator's revenue.
{"title":"Economics of mobile data trading market","authors":"Junlin Yu, M. H. Cheung, Jianwei Huang","doi":"10.23919/WIOPT.2017.7959887","DOIUrl":"https://doi.org/10.23919/WIOPT.2017.7959887","url":null,"abstract":"To exploit users' heterogeneous data demands, several mobile network operators worldwide have launched the mobile data trading markets, where users can trade mobile data quota with each other. In this work, we aim to understand the users' optimal trading decisions and the operator's revenue maximizing strategy. We model the interactions between the mobile operator and the users as a two-stage Stackelberg game. In Stage I, the operator chooses the operation fee imposed on sellers to maximize its revenue. In Stage II, each user decides whether to be a seller or a buyer and optimizes the corresponding trading price and quantity. We derive the closed-form expression of the unique Nash equilibrium (NE) in Stage II in closed-form, and prove that the users' decisions can converge to the NE through distributed best response updates. We show that at the NE, different types of sellers and buyers should propose the same price such that the total demand matches the total supply. We further show that the Stage I operation fee optimization problem is convex, and derive the optimal operation fee in closed-form. Our analysis and numerical results show that the users who have less uncertainty of their data usages can benefit more from data trading. We also show that an operation fee that is too high hurts both the users' payoffs and the operator's revenue.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"249 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76779991","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-01DOI: 10.23919/WIOPT.2017.7959911
Semih Cayci, A. Eryilmaz
We study the problem of serving randomly arriving and delay-sensitive traffic over a multi-channel communication system with time-varying channel states and unknown statistics. This problem deviates from the classical exploration-exploitation setting in that the design and analysis must accommodate the dynamics of packet availability and urgency as well as the cost of each channel use at the time of decision. To that end, we have developed and investigated two policies, one index-based (UCB-Deadline) and the other Bayesian (TS-Deadline), both of which perform dynamic channel allocation decisions that incorporate these traffic requirements and costs. Under symmetric channel conditions, we have proved that the UCB-Deadline policy can achieve bounded regret in the likely case where the cost of using a channel is not too high to prevent all transmissions, and logarithmic regret otherwise. In our numerical studies, we also show that TS-Deadline achieves superior performance over its UCB counterpart, making it a potentially useful alternative when fast convergence to optimal is important.
{"title":"Learning for serving deadline-constrained traffic in multi-channel wireless networks","authors":"Semih Cayci, A. Eryilmaz","doi":"10.23919/WIOPT.2017.7959911","DOIUrl":"https://doi.org/10.23919/WIOPT.2017.7959911","url":null,"abstract":"We study the problem of serving randomly arriving and delay-sensitive traffic over a multi-channel communication system with time-varying channel states and unknown statistics. This problem deviates from the classical exploration-exploitation setting in that the design and analysis must accommodate the dynamics of packet availability and urgency as well as the cost of each channel use at the time of decision. To that end, we have developed and investigated two policies, one index-based (UCB-Deadline) and the other Bayesian (TS-Deadline), both of which perform dynamic channel allocation decisions that incorporate these traffic requirements and costs. Under symmetric channel conditions, we have proved that the UCB-Deadline policy can achieve bounded regret in the likely case where the cost of using a channel is not too high to prevent all transmissions, and logarithmic regret otherwise. In our numerical studies, we also show that TS-Deadline achieves superior performance over its UCB counterpart, making it a potentially useful alternative when fast convergence to optimal is important.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"59 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84094776","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-01DOI: 10.23919/WIOPT.2017.7959883
Jiaxiao Zheng, Pablo Caballero Garces, G. Veciana, S. Baek, A. Banchs
Next generation wireless architectures are expected to enable slices of shared wireless infrastructure which are customized to specific mobile operators/services. Given infrastructure costs and the stochastic nature of mobile services' spatial loads, it is highly desirable to achieve efficient statistical multiplexing amongst network slices. We study a simple dynamic resource sharing policy which allocates a ‘share’ of a pool of (distributed) resources to each slice-Share Constrained Proportionally Fair (SCPF). We give a characterization of the achievable performance gains over static slicing, showing higher gains when a slice's spatial load is more ‘imbalanced’ than, and/or ‘orthogonal’ to, the aggregate network load. Under SCPF, traditional network dimensioning translates to a coupled share dimensioning problem, addressing the existence of a feasible share allocation given slices' expected loads and performance requirements. We provide a solution to robust share dimensioning for SCPF-based network slicing. Slices may wish to unilaterally manage their users' performance via admission control which maximizes their carried loads subject to performance requirements. We show this can be modeled as a "traffic shaping" game with an achievable Nash equilibrium. Under high loads the equilibrium is explicitly characterized, as are the gains in the carried load under SCPF vs. static slicing. Detailed simulations of a wireless infrastructure supporting multiple slices with heterogeneous mobile loads show the fidelity of our models and range of validity of our high load equilibrium analysis.
{"title":"Statistical multiplexing and traffic shaping games for network slicing","authors":"Jiaxiao Zheng, Pablo Caballero Garces, G. Veciana, S. Baek, A. Banchs","doi":"10.23919/WIOPT.2017.7959883","DOIUrl":"https://doi.org/10.23919/WIOPT.2017.7959883","url":null,"abstract":"Next generation wireless architectures are expected to enable slices of shared wireless infrastructure which are customized to specific mobile operators/services. Given infrastructure costs and the stochastic nature of mobile services' spatial loads, it is highly desirable to achieve efficient statistical multiplexing amongst network slices. We study a simple dynamic resource sharing policy which allocates a ‘share’ of a pool of (distributed) resources to each slice-Share Constrained Proportionally Fair (SCPF). We give a characterization of the achievable performance gains over static slicing, showing higher gains when a slice's spatial load is more ‘imbalanced’ than, and/or ‘orthogonal’ to, the aggregate network load. Under SCPF, traditional network dimensioning translates to a coupled share dimensioning problem, addressing the existence of a feasible share allocation given slices' expected loads and performance requirements. We provide a solution to robust share dimensioning for SCPF-based network slicing. Slices may wish to unilaterally manage their users' performance via admission control which maximizes their carried loads subject to performance requirements. We show this can be modeled as a \"traffic shaping\" game with an achievable Nash equilibrium. Under high loads the equilibrium is explicitly characterized, as are the gains in the carried load under SCPF vs. static slicing. Detailed simulations of a wireless infrastructure supporting multiple slices with heterogeneous mobile loads show the fidelity of our models and range of validity of our high load equilibrium analysis.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"32 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73179518","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-01DOI: 10.23919/WIOPT.2017.7959877
Mousie Fasil, Sabrina Müller, Hussein Al-Shatri, A. Klein
One of the key challenges in wireless communications is handling the ever growing traffic demand. A large fraction of this traffic is induced by popular content. One way to face this challenge is mobile content caching which improves the system performance by caching content closer to the user. The benefit of content caching depends on the applied content delivery strategy. In this paper, we investigate a scenario where multiple destinations are concurrently requesting a content, which is already cached at mobile devices and then delivered over a wireless multihop network. We propose a content delivery framework which jointly exploits content already cached at mobile devices as well as switching between mechanisms at the physical layer and the network layer in order to optimally deliver the content to all destinations under changing network conditions. In our framework, we use a unified graph model to jointly model the network, the cached content and different mechanisms at the lower three layers. From the unified graph model, an optimization problem is formulated, which is used to find the optimal content delivery strategy. In our numerical evaluation, we show the combined gain of caching and the capability of switching between mechanisms by comparing with conventional schemes which either cannot switch between mechanisms or do not exploit caching.
{"title":"Exploiting caching and cross-layer transitions for content delivery in wireless multihop networks","authors":"Mousie Fasil, Sabrina Müller, Hussein Al-Shatri, A. Klein","doi":"10.23919/WIOPT.2017.7959877","DOIUrl":"https://doi.org/10.23919/WIOPT.2017.7959877","url":null,"abstract":"One of the key challenges in wireless communications is handling the ever growing traffic demand. A large fraction of this traffic is induced by popular content. One way to face this challenge is mobile content caching which improves the system performance by caching content closer to the user. The benefit of content caching depends on the applied content delivery strategy. In this paper, we investigate a scenario where multiple destinations are concurrently requesting a content, which is already cached at mobile devices and then delivered over a wireless multihop network. We propose a content delivery framework which jointly exploits content already cached at mobile devices as well as switching between mechanisms at the physical layer and the network layer in order to optimally deliver the content to all destinations under changing network conditions. In our framework, we use a unified graph model to jointly model the network, the cached content and different mechanisms at the lower three layers. From the unified graph model, an optimization problem is formulated, which is used to find the optimal content delivery strategy. In our numerical evaluation, we show the combined gain of caching and the capability of switching between mechanisms by comparing with conventional schemes which either cannot switch between mechanisms or do not exploit caching.","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-7"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72641392","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-01DOI: 10.23919/WIOPT.2017.7959897
Ashwini Marathe, S. R. Pillai, R. Vaze
A two-way half-duplex communication model is considered, where two nodes want to exchange a fixed number of bits with each other, and both nodes are powered by energy harvesting (EH) sources. The problem of minimizing the sum of the time required to send the required bits in both the directions is considered. The model also includes the processing cost at each node, that models the power needed for nodes to stay powered on during transmission. In the offline setting, where the EH arrival profile is known non-causally, an iterative algorithm based on alternating maximization is shown to be optimal. In the more realistic setting of causal knowledge of the EH arrival profile, an online algorithm is shown to be optimal in terms of the competitive ratio and the optimal competitive ratio is shown to be 2.
{"title":"Opportunistic scheduling in two-way wireless communication with energy harvesting","authors":"Ashwini Marathe, S. R. Pillai, R. Vaze","doi":"10.23919/WIOPT.2017.7959897","DOIUrl":"https://doi.org/10.23919/WIOPT.2017.7959897","url":null,"abstract":"A two-way half-duplex communication model is considered, where two nodes want to exchange a fixed number of bits with each other, and both nodes are powered by energy harvesting (EH) sources. The problem of minimizing the sum of the time required to send the required bits in both the directions is considered. The model also includes the processing cost at each node, that models the power needed for nodes to stay powered on during transmission. In the offline setting, where the EH arrival profile is known non-causally, an iterative algorithm based on alternating maximization is shown to be optimal. In the more realistic setting of causal knowledge of the EH arrival profile, an online algorithm is shown to be optimal in terms of the competitive ratio and the optimal competitive ratio is shown to be 2.","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-8"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76732594","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-01DOI: 10.23919/WIOPT.2017.7959923
Mahdi Ben Ghorbel, Md. Jahangir Hossain
The spread in the use of wireless services resulted in a remarkable growth of power consumption for telecommunication systems to satisfy the continuous growth of data demand. On the other hand, the emergence of smart grids and the expansion of low-cost distributed powering solutions represented an opportunity to enhance the energy efficiency and improve communication systems' costs. In this paper, we propose to enhance the energy efficiency of self-powered wireless networks by exploiting the possibility of energy exchange between different micro-grids. The objective is to exploit the flexibility and non homogeneity of communication services' demand to maximize the global utility. Cooperation between cells is exploited to exchange additional/needed power as function of their respective users' demands and energy availabilities. While taking into consideration the power losses due to this exchange, we propose an efficient approach to allocate the available resources across the different cells. Numerical simulations show the gains that can be achieved due to this approach as a function of the demand and energy availability variations.
{"title":"Energy efficient hybrid-powered communication systems using joint adaptive power allocation and energy exchange","authors":"Mahdi Ben Ghorbel, Md. Jahangir Hossain","doi":"10.23919/WIOPT.2017.7959923","DOIUrl":"https://doi.org/10.23919/WIOPT.2017.7959923","url":null,"abstract":"The spread in the use of wireless services resulted in a remarkable growth of power consumption for telecommunication systems to satisfy the continuous growth of data demand. On the other hand, the emergence of smart grids and the expansion of low-cost distributed powering solutions represented an opportunity to enhance the energy efficiency and improve communication systems' costs. In this paper, we propose to enhance the energy efficiency of self-powered wireless networks by exploiting the possibility of energy exchange between different micro-grids. The objective is to exploit the flexibility and non homogeneity of communication services' demand to maximize the global utility. Cooperation between cells is exploited to exchange additional/needed power as function of their respective users' demands and energy availabilities. While taking into consideration the power losses due to this exchange, we propose an efficient approach to allocate the available resources across the different cells. Numerical simulations show the gains that can be achieved due to this approach as a function of the demand and energy availability variations.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"27 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72961039","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-01DOI: 10.23919/WIOPT.2017.7959882
Changhee Joo, A. Eryilmaz
We consider the problem of scheduling in wireless networks with the aim of maintaining up-to-date and synchronized (also called, aligned) information at the receiver across multiple flows. This is in contrast to the more conventional approach of scheduling for optimizing long-term performance metrics such as throughput, fairness, or average delay. Maintaining the age of information at a low and roughly equal level is particularly important for distributed cyber-physical systems, in which the effectiveness of the control decisions depends critically on the freshness and synchrony of information from multiple sources/sensors. In this work, we first expose the weakness of several popular MaxWeight scheduling solutions that utilize queue-length, delay, and age information as their weights. Then, we develop a novel age-based scheduler that combines age with the interarrival times of incoming packets in its decisions, which yields significant gains in the information freshness at the receiver. We characterize the performance of our strategy through a heavy-traffic analysis that establishes upper and lower bounds on the freshness of system information.
{"title":"Wireless scheduling for information freshness and synchrony: Drift-based design and heavy-traffic analysis","authors":"Changhee Joo, A. Eryilmaz","doi":"10.23919/WIOPT.2017.7959882","DOIUrl":"https://doi.org/10.23919/WIOPT.2017.7959882","url":null,"abstract":"We consider the problem of scheduling in wireless networks with the aim of maintaining up-to-date and synchronized (also called, aligned) information at the receiver across multiple flows. This is in contrast to the more conventional approach of scheduling for optimizing long-term performance metrics such as throughput, fairness, or average delay. Maintaining the age of information at a low and roughly equal level is particularly important for distributed cyber-physical systems, in which the effectiveness of the control decisions depends critically on the freshness and synchrony of information from multiple sources/sensors. In this work, we first expose the weakness of several popular MaxWeight scheduling solutions that utilize queue-length, delay, and age information as their weights. Then, we develop a novel age-based scheduler that combines age with the interarrival times of incoming packets in its decisions, which yields significant gains in the information freshness at the receiver. We characterize the performance of our strategy through a heavy-traffic analysis that establishes upper and lower bounds on the freshness of system information.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"67 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76654097","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-01DOI: 10.23919/WIOPT.2017.7959943
Pan Cao, J. Thompson
Millimeter wave (mm-wave) system performance may be degraded if the operation mechanism is not properly designed, because mm-wave systems suffer severe path loss and very short coherence time. Thanks to the sparse channel model and directional transmission property, it is usually sufficient to use analog beam codebooks in beam training to estimate dominant channel components instead of complete instantaneous channel matrices. With this viewpoint, we first characterize the achievable beam gain by the number of antennas and beamwidth, and then propose a low complexity mechanism that employs the offline designed analog beam codebooks for both beam training and data transmission. This mechanism not only avoids high overhead and delay caused by the online beamforming design based on instantaneous channels but also enables a much longer quasi coherence time, which is the new concept proposed in this work. In addition, it can realize a theoretical analysis of the role of system parameters in energy efficiency. We consider a phase-controlled point-to-point (P2P) mm-wave system example to illustrate the proposed concepts and mechanism. Numerical simulations also verify the effectiveness of the theoretical analysis result and also provide a suggestion for system design.
{"title":"Low complexity energy efficiency analysis in millimeter wave communication systems","authors":"Pan Cao, J. Thompson","doi":"10.23919/WIOPT.2017.7959943","DOIUrl":"https://doi.org/10.23919/WIOPT.2017.7959943","url":null,"abstract":"Millimeter wave (mm-wave) system performance may be degraded if the operation mechanism is not properly designed, because mm-wave systems suffer severe path loss and very short coherence time. Thanks to the sparse channel model and directional transmission property, it is usually sufficient to use analog beam codebooks in beam training to estimate dominant channel components instead of complete instantaneous channel matrices. With this viewpoint, we first characterize the achievable beam gain by the number of antennas and beamwidth, and then propose a low complexity mechanism that employs the offline designed analog beam codebooks for both beam training and data transmission. This mechanism not only avoids high overhead and delay caused by the online beamforming design based on instantaneous channels but also enables a much longer quasi coherence time, which is the new concept proposed in this work. In addition, it can realize a theoretical analysis of the role of system parameters in energy efficiency. We consider a phase-controlled point-to-point (P2P) mm-wave system example to illustrate the proposed concepts and mechanism. Numerical simulations also verify the effectiveness of the theoretical analysis result and also provide a suggestion for system design.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"68 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91499408","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-01DOI: 10.23919/WIOPT.2017.7959899
S. Weber
We consider a wireless network of static nodes where each transmitter-receiver pair employs slotted Aloha, electing to transmit with a common contention probability p, and we further assume the Rayleigh fading varies with each time slot. The random point processes of actual transmitters in a given time slot (along with their random fades) determine the interference seen by a reference receiver, and the interference across time slots is dependent due to common dependence on the underlying set of potential interferers. It follows that observations of the set of transmitters over several time slots (or summary statistics of this process) may be leveraged to yield improved estimates of the probability of success of the transmission attempted at the reference receiver. In this paper we study the value of several different forms of such observations in improving this estimated success probability. Specifically, we consider five cases: the observer has i) zero knowledge, ii) full knowledge of the point process of potential transmitters, iii) knowledge of the number of "nearby" potential transmitters, iv) N binary observations under the "physical" model at the reference receiver, and v) N binary observations under the "protocol" model at the reference receiver.
{"title":"The value of observations in predicting transmission success in wireless networks under slotted Aloha","authors":"S. Weber","doi":"10.23919/WIOPT.2017.7959899","DOIUrl":"https://doi.org/10.23919/WIOPT.2017.7959899","url":null,"abstract":"We consider a wireless network of static nodes where each transmitter-receiver pair employs slotted Aloha, electing to transmit with a common contention probability p, and we further assume the Rayleigh fading varies with each time slot. The random point processes of actual transmitters in a given time slot (along with their random fades) determine the interference seen by a reference receiver, and the interference across time slots is dependent due to common dependence on the underlying set of potential interferers. It follows that observations of the set of transmitters over several time slots (or summary statistics of this process) may be leveraged to yield improved estimates of the probability of success of the transmission attempted at the reference receiver. In this paper we study the value of several different forms of such observations in improving this estimated success probability. Specifically, we consider five cases: the observer has i) zero knowledge, ii) full knowledge of the point process of potential transmitters, iii) knowledge of the number of \"nearby\" potential transmitters, iv) N binary observations under the \"physical\" model at the reference receiver, and v) N binary observations under the \"protocol\" model at the reference receiver.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"128 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86595908","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
扫码关注我们
求助内容：
应助结果提醒方式：