Pub Date : 2011-11-01DOI: 10.1109/IWCLD.2011.6123073
Qing Bai, Jingrui Li, J. Nossek
We investigate the throughput maximizing data transmission strategy of an energy harvesting node which is able to harvest and store energy for communication. Solar cell and rechargeable battery technologies have made such nodes feasible. In addition to the energy arrival process and the battery capacity limitation, the energy consumption of the circuits of the node also plays an important role in the way how the harvested energy should be utilized. To this end, we assume for the transmitting node an active mode for which a constant circuit power is incurred, and a sleep mode for which no energy is consumed. The criteria that an optimal transmission strategy should satisfy are discussed, and based on them, a construction procedure of the optimal transmission strategy is proposed. Numerical simulations are performed to verify the theoretical results, and the impact of circuit power on the optimal transmission strategy and the maximal achievable throughput is studied.
{"title":"Throughput maximizing transmission strategy of energy harvesting nodes","authors":"Qing Bai, Jingrui Li, J. Nossek","doi":"10.1109/IWCLD.2011.6123073","DOIUrl":"https://doi.org/10.1109/IWCLD.2011.6123073","url":null,"abstract":"We investigate the throughput maximizing data transmission strategy of an energy harvesting node which is able to harvest and store energy for communication. Solar cell and rechargeable battery technologies have made such nodes feasible. In addition to the energy arrival process and the battery capacity limitation, the energy consumption of the circuits of the node also plays an important role in the way how the harvested energy should be utilized. To this end, we assume for the transmitting node an active mode for which a constant circuit power is incurred, and a sleep mode for which no energy is consumed. The criteria that an optimal transmission strategy should satisfy are discussed, and based on them, a construction procedure of the optimal transmission strategy is proposed. Numerical simulations are performed to verify the theoretical results, and the impact of circuit power on the optimal transmission strategy and the maximal achievable throughput is studied.","PeriodicalId":149596,"journal":{"name":"2011 Third International Workshop on Cross Layer Design","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114137326","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 : 2011-11-01DOI: 10.1109/IWCLD.2011.6123080
Amir Minayi Jalil, V. Meghdadi, J. Cances
This paper deals with the problem of relay assignment in cooperative networks. We consider a network which consists of N nodes and a single destination. Each node is a potential relay to help other nodes to communicate with the destination. The problem is how to assign some nodes (as relays) to some nodes (as sources) in order to optimize a convenient objective function in the network. To find the optimized topology, we need to feedback the SNR information to a centralized resource allocator. Throughout this paper, we introduce a Vehicle Routing Problem (VRP) formulation for the problem at hand which can be efficiently solved with Binary Integer Programming (BIP). The proposed formulation can solve many clustering and relay assignment problems in a unified framework. Two different scenarios are described to show this flexibility. In the first scenario, only one of the nodes in each cooperating set benefits from the cooperation whereas in the other scenario both nodes benefit. The proposed approach combines a simultaneous optimization of physical and network layers with the cooperative diversity concept. Some scenarios and network configurations are described throughout the paper to show the flexibility of the proposed method.
{"title":"A cross-layer approach to clustering and relay assignment based on Vehicle Routing Problem","authors":"Amir Minayi Jalil, V. Meghdadi, J. Cances","doi":"10.1109/IWCLD.2011.6123080","DOIUrl":"https://doi.org/10.1109/IWCLD.2011.6123080","url":null,"abstract":"This paper deals with the problem of relay assignment in cooperative networks. We consider a network which consists of N nodes and a single destination. Each node is a potential relay to help other nodes to communicate with the destination. The problem is how to assign some nodes (as relays) to some nodes (as sources) in order to optimize a convenient objective function in the network. To find the optimized topology, we need to feedback the SNR information to a centralized resource allocator. Throughout this paper, we introduce a Vehicle Routing Problem (VRP) formulation for the problem at hand which can be efficiently solved with Binary Integer Programming (BIP). The proposed formulation can solve many clustering and relay assignment problems in a unified framework. Two different scenarios are described to show this flexibility. In the first scenario, only one of the nodes in each cooperating set benefits from the cooperation whereas in the other scenario both nodes benefit. The proposed approach combines a simultaneous optimization of physical and network layers with the cooperative diversity concept. Some scenarios and network configurations are described throughout the paper to show the flexibility of the proposed method.","PeriodicalId":149596,"journal":{"name":"2011 Third International Workshop on Cross Layer Design","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125966703","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}
Much attention has been paid to schedulers exploiting multiuser diversity in wireless networks, because such schedulers can increase the information theoretic capacity. It is, however, known that there exists a tradeoff between capacity and fairness achieved by schedulers exploiting multiuser diversity. Due to its good balance between capacity and fairness, the one-bit feedback fair scheduler is considered as an attractive choice. In this paper, we consider the one-bit feedback fair scheduler and investigate its short term fairness. In particular, we consider the statistical time-access fairness index (STAFI) as a short term fairness index, and we study the impact of the initial states of mobile stations (MSs) on the STAFI. Numerical results show that the effect of the initial states of MSs on the STAFI remains for a relatively long time.
{"title":"Effect of initial states on statistical time-access fairness index of one-bit feedback fair scheduler","authors":"F. Ishizaki","doi":"10.1145/2021216.2021225","DOIUrl":"https://doi.org/10.1145/2021216.2021225","url":null,"abstract":"Much attention has been paid to schedulers exploiting multiuser diversity in wireless networks, because such schedulers can increase the information theoretic capacity. It is, however, known that there exists a tradeoff between capacity and fairness achieved by schedulers exploiting multiuser diversity. Due to its good balance between capacity and fairness, the one-bit feedback fair scheduler is considered as an attractive choice. In this paper, we consider the one-bit feedback fair scheduler and investigate its short term fairness. In particular, we consider the statistical time-access fairness index (STAFI) as a short term fairness index, and we study the impact of the initial states of mobile stations (MSs) on the STAFI. Numerical results show that the effect of the initial states of MSs on the STAFI remains for a relatively long time.","PeriodicalId":149596,"journal":{"name":"2011 Third International Workshop on Cross Layer Design","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114318387","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
扫码关注我们
求助内容：
应助结果提醒方式：