{"title":"Performance evaluation of resource allocation policies for energy harvesting devices","authors":"M. Gorlatova, A. Bernstein, G. Zussman","doi":"10.1109/WIOPT.2011.5930014","DOIUrl":"https://doi.org/10.1109/WIOPT.2011.5930014","url":null,"abstract":"We focus on resource allocation for energy harvesting devices. We analytically and numerically evaluate the performance of algorithms that determine time fair energy allocation in systems with predictable and stochastic energy inputs. To gain insight into the performance of networks of devices, we obtain results for the simple cases of a single node and a link. Due to the need for low complexity algorithms, we focus on simple policies (some of which proposed in the past as heuristics) and analytically derive performance guarantees. We also evaluate the performance via simulation, using real-world energy traces that we collected for over a year, and in a testbed of energy harvesting devices developed within the EnHANTs project.","PeriodicalId":430755,"journal":{"name":"2011 International Symposium of Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134343658","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}
{"title":"Lower bounds on the success probability for ad hoc networks with local FDMA scheduling","authors":"Ralph Tanbourgi, J. Elsner, H. Jaekel, F. Jondral","doi":"10.1109/WIOPT.2011.5930038","DOIUrl":"https://doi.org/10.1109/WIOPT.2011.5930038","url":null,"abstract":"This paper studies the performance of ad hoc networks with local FDMA scheduling using stochastic point processes. In such networks, the Poisson assumption is not justified due to interdependencies between points introduced by scheduling. For this reason, an upper bound on the second reduced moment measure is derived. Using this result, two lower bounds on the success probability are given, based on the second order product density and a non-homogeneous Poisson approximation. The relative performance of local FDMA is compared to random channel access. It is shown that the relative outage probability reduction of local FDMA highly depends on the SIR threshold as well as on the ratio of transmission distance to orthogonalization distance. If these two quantities are small, the improvement is high; the number of channels has only a minor effect on the relative improvement.","PeriodicalId":430755,"journal":{"name":"2011 International Symposium of Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133928309","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}
{"title":"Energy-neutral source-channel coding in energy-harvesting wireless sensors","authors":"P. Castiglione, O. Simeone, E. Erkip, T. Zemen","doi":"10.1109/WIOPT.2011.5930013","DOIUrl":"https://doi.org/10.1109/WIOPT.2011.5930013","url":null,"abstract":"This work addresses the problem of energy allocation over source compression and transmission for a single energy-harvesting sensor. An optimal class of policies is identified that simultaneously guarantees a maximal average distortion and the stability of the queue connecting source and channel encoders, whenever this is feasible by any other strategy. This class of policies performs an independent resource optimization for the source and channel encoders. Analog transmission techniques as well as suboptimal strategies that do not use the energy buffer (battery) or use it only for adapting either source or channel encoder energy allocation are also studied.","PeriodicalId":430755,"journal":{"name":"2011 International Symposium of Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122829640","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}
Sreenath Ramanath, E. Altman, Konstantin Avrachenkov
{"title":"A heterogeneous approach to fair resource allocation and its application in femtocell networks","authors":"Sreenath Ramanath, E. Altman, Konstantin Avrachenkov","doi":"10.1109/WIOPT.2011.5930060","DOIUrl":"https://doi.org/10.1109/WIOPT.2011.5930060","url":null,"abstract":"We have recently extended the notion of alpha fairness to include time scale considerations for fair assignment of resources. Two extreme cases are elastic traffic (file transfer) and interactive voice. In this paper we consider time scale separation in the fairness that is related to the mobility of the users. We propose and solve the problem when the utilities are linear in the resources. We apply these results in the context of fair resource allocation in femtocell networks in a dynamic setting. We show how mobility and the constraints on the averaging durations impact the amount of resources each user gets.","PeriodicalId":430755,"journal":{"name":"2011 International Symposium of Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115817825","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}
{"title":"Dynamic channel assignment and power allocation in multichannel wireless networks with per-user bandwidth guarantees","authors":"Xiang Luo, K. Kar","doi":"10.1109/WIOPT.2011.5930048","DOIUrl":"https://doi.org/10.1109/WIOPT.2011.5930048","url":null,"abstract":"We address the joint channel assignment and power allocation question in a multichannel wireless (access point) network where channel states differ across channels as well as users, and vary with time. Our goal is to obtain channel assignment and power allocation solutions that can dynamically adapt to changing channel conditions, and would maximize system throughput under per-user bandwidth (QoS) constraints, in a long-term sense. Using stochastic optimization techniques, we obtain an optimal scheduling policy that operates without knowledge of arrival rates and channel statistics (depending only on the instantaneous channel states and the queue lengths), and attains the overall system throughput that is arbitrarily close to the maximum achievable value with all per-user bandwidth constraints satisfied.","PeriodicalId":430755,"journal":{"name":"2011 International Symposium of Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114458043","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}
{"title":"Radio resource management and packet scheduling in femtocell networks","authors":"Volkan Sevindik, O. Bayat, J. Weitzen","doi":"10.1109/WIOPT.2011.5930058","DOIUrl":"https://doi.org/10.1109/WIOPT.2011.5930058","url":null,"abstract":"In wireless networks, resource management is a very challenging task since network resources are always limited, and wireless channel is time varying. Sharing resources among resource users needs to be coordinated, and this coordination is achieved by packet schedulers. This research presents the performance of state-of-the-art macrocell scheduling algorithms in a CDMA 2000 1×EVDO femtocell network. The performance of Round Robin (RR), maximum Data Rate Control (DRC), proportional fairness (PF), exponent DRC (expDRC), average DRC (aveDRC), and maxDRC-PF schedulers are investigated. For performance analysis, paper introduces a unique methodology which combines real femtocell network experiments with computer simulations. Data rate control (DRC) values collected through real experiments are used in computer simulations in order to assess the performance of scheduling methods in femtocell environment. Best effort (BE) and Voice over IP (VoIP) traffic are modeled and simulated in computer simulations. Schedulers' performance are measured in terms of total delivered throughput, Vo I P packet delay, and throughput fairness. In conclusion, expDRC and maxDRC-PF scheduler is recommended since they have the lowest Vo I P packet delay bound error, and the high throughput and throughput fairness compared to other scheduling methods.","PeriodicalId":430755,"journal":{"name":"2011 International Symposium of Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123197648","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}
Rahul Urgaonkar, E. Ciftcioglu, A. Yener, M. Neely
{"title":"Quality of Information aware scheduling in task processing networks","authors":"Rahul Urgaonkar, E. Ciftcioglu, A. Yener, M. Neely","doi":"10.1109/WIOPT.2011.5930052","DOIUrl":"https://doi.org/10.1109/WIOPT.2011.5930052","url":null,"abstract":"We investigate Quality of Information (QoI) aware scheduling in task processing networks. Specifically, we consider the scenario where a network sequentially receives tasks from an end user, utilizes its resources to process them, and sends back its response. The utility derived by the end user from this response depends on both the accuracy and the freshness of the information. There is often a trade-off between these two attributes and we present a model that quantifies this dependence. Using dynamic programming and optimal stopping theory, we characterize the optimal scheduling policy that maximizes the time average utility delivered by the network. We show that for many scenarios of practical interest, the optimal policy has a simple threshold structure. We also propose a method to approximately compute the threshold in closed-form. This work takes a step towards incorporating application aware objectives in making optimal scheduling decisions.","PeriodicalId":430755,"journal":{"name":"2011 International Symposium of Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124604474","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}
{"title":"Optimal scheduling on an energy harvesting Broadcast Channel","authors":"M. Antepli, E. Uysal-Biyikoglu, Hakan Erkal","doi":"10.1109/WIOPT.2011.5930015","DOIUrl":"https://doi.org/10.1109/WIOPT.2011.5930015","url":null,"abstract":"The minimization of transmission completion time for a given number of bits per user in an energy harvesting communication system, where energy harvesting instants are known in an offline manner is considered. An achievable rate region with structural properties satisfied by the 2-user AWGN Broadcast Channel capacity region is assumed. It is shown that even though all data are available at the beginning, a non-negative amount of energy from each energy harvest is deferred for later use such that the transmit power starts at its lowest value and rises as time progresses. The optimal scheduler ends the transmission to both users at the same time. Exploiting the special structure in the problem, the iterative offline algorithm, FlowRight, from earlier literature, is adapted and proved to solve this problem. The solution has polynomial complexity in the number of harvests used, and is observed to converge quickly on numerical examples.","PeriodicalId":430755,"journal":{"name":"2011 International Symposium of Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116615158","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}
{"title":"Deadline constrained scheduling for data aggregation in unreliable sensor networks","authors":"S. Hariharan, N. Shroff","doi":"10.1109/WIOPT.2011.5930006","DOIUrl":"https://doi.org/10.1109/WIOPT.2011.5930006","url":null,"abstract":"We study the problem of maximizing the aggregated information in a wireless sensor network. We consider a sensor network with a tree topology, where the root corresponds to the sink, and the rest of the network detects an event and transmits data to the sink. We formulate an integer optimization problem that maximizes the aggregated information that reaches the sink under deadline and interference constraints. This framework allows using a variety of error recovery schemes to tackle link unreliability. We show that the optimal solution involves solving a Job Interval Selection Problem (JISP) which is known to be MAX SNP-Hard. We construct a sub-optimal version, and develop a low complexity, distributed optimal solution to this version. We investigate tree structures for which this solution is optimal to the original problem. Our numerical results show that the sub-optimal solution outperforms existing JISP approximation algorithms even for general trees.","PeriodicalId":430755,"journal":{"name":"2011 International Symposium of Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124963624","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}
{"title":"Open loop optimal control of base station activation for green networks","authors":"Sreenath Ramanath, V. Kavitha, E. Altman","doi":"10.1109/WIOPT.2011.5930009","DOIUrl":"https://doi.org/10.1109/WIOPT.2011.5930009","url":null,"abstract":"In recent years there has been an increasing awareness that the deployment as well as utilization of new information technology may have some negative ecological impact. This includes awareness to energy consumption which could have negative consequences on the environment. In recent years, it was suggested to increase energy saving by deactivating base stations during periods in which the traffic is expected to be low. In this paper we study the optimal deactivation policies, using recent tools from Multimodularity (which is the analog concept of convexity in optimization over integers). We consider two scenarios: In the first case, a central control derives the optimal open loop policies so as to maximize the expected throughput of the system given that at least a certain percentage of Base stations are deactivated (switched OFF). In the second case, we derive optimal open loop polices, which each base station can employ in a decentralized manner to minimize the average buffer occupancy cost when the fraction of time for which the BS station is deactivated (idle mode) is lower bounded. In both the cases, we show that the cost structure is Multimodular and characterize the structure of optimal policies.","PeriodicalId":430755,"journal":{"name":"2011 International Symposium of Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126190078","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}