Pub Date : 2011-11-01DOI: 10.1109/IWCLD.2011.6123082
Qing Bai, Yao Hao, J. Nossek
We consider the scheduling and resource allocation problem in the downlink of multicarrier systems where data is processed and transmitted in unit of packets. This involves the allocation of transmit power as well as time and frequency slots to packets generated by different service flows, which consequently have various lengths and allows for various latency time in delivery. An optimization to maximize system throughput under frequency division multiple access (FDMA) and available resources restrictions is formulated, and an interactive scheduling and resource allocation approach is proposed to solve this combinatorial-natured problem. The paper especially focuses on the design of packet scheduling algorithms and introduces the concept of virtual packet size and anxious scheduler, which allows for simple implementation and high flexibility. Simulation results show the efficient collaboration of the proposed scheduling algorithm with the resource allocation scheme, and the effectiveness of the system as a whole which favorably exhibits low complexity.
{"title":"Packet scheduling and resource allocation for downlink multicarrier systems with quality-of-service constraints","authors":"Qing Bai, Yao Hao, J. Nossek","doi":"10.1109/IWCLD.2011.6123082","DOIUrl":"https://doi.org/10.1109/IWCLD.2011.6123082","url":null,"abstract":"We consider the scheduling and resource allocation problem in the downlink of multicarrier systems where data is processed and transmitted in unit of packets. This involves the allocation of transmit power as well as time and frequency slots to packets generated by different service flows, which consequently have various lengths and allows for various latency time in delivery. An optimization to maximize system throughput under frequency division multiple access (FDMA) and available resources restrictions is formulated, and an interactive scheduling and resource allocation approach is proposed to solve this combinatorial-natured problem. The paper especially focuses on the design of packet scheduling algorithms and introduces the concept of virtual packet size and anxious scheduler, which allows for simple implementation and high flexibility. Simulation results show the efficient collaboration of the proposed scheduling algorithm with the resource allocation scheme, and the effectiveness of the system as a whole which favorably exhibits low complexity.","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":"120815142","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.6123084
James H. Martin, L. Dooley, K. Wong
Conventional single layer processing in Cognitive Radio Networks (CRN) can incur significant time costs in transferring information between the various layers of the Open System Interconnection (OSI) model, due its innate sequential structure. This is especially a problem for CRN which usually only has a narrow time window to access spectral gaps of either licensed or other secondary users (SU). To exploit this opportunity, cross layer processing (CLP) paradigms that share information between OSI layers and the radio system have been proposed to maximise throughput for SU, while maintaining Quality of Service (QoS) provision to the licensed primary user. With the global transference of TV systems to digital platforms, regulatory bodies have identified an opportunity to allocate additional digital TV (DTV) channels to CRNs on a localised basis, in what is called TV White Space (TVWS). This paper investigates how CLP of information can be effectively exploited to enhance CRN system performance by making key channel allocations to minimise disruption to the spectrum environment, while maximising available resources to fulfil application and network requirements within TVWS.
{"title":"A new cross-layer design strategy for TV White Space Cognitive Radio applications","authors":"James H. Martin, L. Dooley, K. Wong","doi":"10.1109/IWCLD.2011.6123084","DOIUrl":"https://doi.org/10.1109/IWCLD.2011.6123084","url":null,"abstract":"Conventional single layer processing in Cognitive Radio Networks (CRN) can incur significant time costs in transferring information between the various layers of the Open System Interconnection (OSI) model, due its innate sequential structure. This is especially a problem for CRN which usually only has a narrow time window to access spectral gaps of either licensed or other secondary users (SU). To exploit this opportunity, cross layer processing (CLP) paradigms that share information between OSI layers and the radio system have been proposed to maximise throughput for SU, while maintaining Quality of Service (QoS) provision to the licensed primary user. With the global transference of TV systems to digital platforms, regulatory bodies have identified an opportunity to allocate additional digital TV (DTV) channels to CRNs on a localised basis, in what is called TV White Space (TVWS). This paper investigates how CLP of information can be effectively exploited to enhance CRN system performance by making key channel allocations to minimise disruption to the spectrum environment, while maximising available resources to fulfil application and network requirements within TVWS.","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":"130032105","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.6123076
Mohamad Maaz, P. Mary, M. Hélard
Relay-assisted communication is a promising technique to increase the efficiency of future cellular systems. In this paper, we deal with resource allocations in relay-assisted OFDMA downlink communications. Our purpose is to find the optimal power, subcarrier and relay allocation maximizing the global data rate while keeping a low starvation rate, under heterogeneous data rate constraints among the users. A global algorithm jointly allocating the power, subcarriers and relays is first proposed. The achievable data rate is investigated as well as the average starvation rate in the network when the load, i.e. the number of active users in the network, is increasing. Our algorithm is compared to the existing literature by means of extensive simulation settings.
{"title":"Resource allocation for QoS aware relay-assisted OFDMA cellular networks","authors":"Mohamad Maaz, P. Mary, M. Hélard","doi":"10.1109/IWCLD.2011.6123076","DOIUrl":"https://doi.org/10.1109/IWCLD.2011.6123076","url":null,"abstract":"Relay-assisted communication is a promising technique to increase the efficiency of future cellular systems. In this paper, we deal with resource allocations in relay-assisted OFDMA downlink communications. Our purpose is to find the optimal power, subcarrier and relay allocation maximizing the global data rate while keeping a low starvation rate, under heterogeneous data rate constraints among the users. A global algorithm jointly allocating the power, subcarriers and relays is first proposed. The achievable data rate is investigated as well as the average starvation rate in the network when the load, i.e. the number of active users in the network, is increasing. Our algorithm is compared to the existing literature by means of extensive simulation settings.","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":"134428641","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.6123075
Sébastien Marcille, P. Ciblat, C. L. Le Martret
Hybrid ARQ (HARQ) schemes operate at the PHY and Medium Access (MAC) layers and their performance have been naturally studied at the MAC level. However, all the modern systems are going to be running under the IP protocol. Therefore, in order to get realistic performance of the whole system considering the multiple layer stacks, performance analysis at the IP layer is crucial. Very little work has been done so far in this direction, except in [2] which studies the delay statistics of IP packets with Selective-Repeat ARQ, and [1] which proposes a cross-layer optimization strategy between MAC and IP layers for ARQ, and in [8], [9] which consider the HARQ case. In this paper, we study the effect of erroneous feedbacks at the MAC layer on the performance at the IP layer considering both conventional HARQ schemes as well as the cross-layer strategy mentioned above. We derive in closed-form expressions the performance in terms of packet error rate (PER), efficiency, and delay with respect to the error probability of the feedback channel.
{"title":"Performance computation of cross-layer Hybrid ARQ schemes at IP layer in the presence of corrupted acknowledgments","authors":"Sébastien Marcille, P. Ciblat, C. L. Le Martret","doi":"10.1109/IWCLD.2011.6123075","DOIUrl":"https://doi.org/10.1109/IWCLD.2011.6123075","url":null,"abstract":"Hybrid ARQ (HARQ) schemes operate at the PHY and Medium Access (MAC) layers and their performance have been naturally studied at the MAC level. However, all the modern systems are going to be running under the IP protocol. Therefore, in order to get realistic performance of the whole system considering the multiple layer stacks, performance analysis at the IP layer is crucial. Very little work has been done so far in this direction, except in [2] which studies the delay statistics of IP packets with Selective-Repeat ARQ, and [1] which proposes a cross-layer optimization strategy between MAC and IP layers for ARQ, and in [8], [9] which consider the HARQ case. In this paper, we study the effect of erroneous feedbacks at the MAC layer on the performance at the IP layer considering both conventional HARQ schemes as well as the cross-layer strategy mentioned above. We derive in closed-form expressions the performance in terms of packet error rate (PER), efficiency, and delay with respect to the error probability of the feedback channel.","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":"123870121","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.6123089
Nabih Alaoui, J. Cances, V. Meghdadi
Optimizing architecture of sensor networks is a current topic of research. This research field can be applied in several contexts such as environmental monitoring or body area network. Performance improvement in terms of bit error rate is a major challenge. Reducing processing time and simplifying the operations of the network are the two main key points to be improved. A number of architectures have been designed to optimize the BER at destination. These architectures are mainly based on the LDPC codes (Low Density Parity Check) which have the disadvantage of the floor effect. The challenge is to find an optimal distribution of links between the sensors and relays to optimize the matrix H of the dual code and to avoid this floor effect. In this paper, we propose and simulate an efficient architecture for sensor network in a quasi-static Rayleigh fading channel environment. The new main idea is to enable communications between relays. Simulation results clearly show that the floor effect is significantly reduced with this kind of architecture.
{"title":"Efficient architecture design for mobile sensor networks","authors":"Nabih Alaoui, J. Cances, V. Meghdadi","doi":"10.1109/IWCLD.2011.6123089","DOIUrl":"https://doi.org/10.1109/IWCLD.2011.6123089","url":null,"abstract":"Optimizing architecture of sensor networks is a current topic of research. This research field can be applied in several contexts such as environmental monitoring or body area network. Performance improvement in terms of bit error rate is a major challenge. Reducing processing time and simplifying the operations of the network are the two main key points to be improved. A number of architectures have been designed to optimize the BER at destination. These architectures are mainly based on the LDPC codes (Low Density Parity Check) which have the disadvantage of the floor effect. The challenge is to find an optimal distribution of links between the sensors and relays to optimize the matrix H of the dual code and to avoid this floor effect. In this paper, we propose and simulate an efficient architecture for sensor network in a quasi-static Rayleigh fading channel environment. The new main idea is to enable communications between relays. Simulation results clearly show that the floor effect is significantly reduced with this kind of architecture.","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":"126502786","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.6123088
I. Atanasov, D. Marinska, E. Pencheva
The paper investigates an approach to exchange quality of service information across the layers between third party applications and network functions for bearer resource management. The focus is on Parlay X Web Services which may be used to access functions for policy and charging control in all IP-based multimedia networks. A functional mapping of Parlay X interfaces onto network control protocol is suggested. The Parlay X Gateway utilization is evaluated taking into account as its distributed architecture, as the processing of both requests and notifications of events, concerning QoS management.
本文研究了一种用于承载资源管理的第三方应用程序和网络功能之间跨层交换服务质量信息的方法。重点是Parlay X Web Services，它可用于访问所有基于ip的多媒体网络中的策略和收费控制功能。提出了Parlay X接口到网络控制协议的功能映射。Parlay X网关的利用率评估考虑到它的分布式架构，作为请求和事件通知的处理，涉及QoS管理。
{"title":"Open service access in cross layer design","authors":"I. Atanasov, D. Marinska, E. Pencheva","doi":"10.1109/IWCLD.2011.6123088","DOIUrl":"https://doi.org/10.1109/IWCLD.2011.6123088","url":null,"abstract":"The paper investigates an approach to exchange quality of service information across the layers between third party applications and network functions for bearer resource management. The focus is on Parlay X Web Services which may be used to access functions for policy and charging control in all IP-based multimedia networks. A functional mapping of Parlay X interfaces onto network control protocol is suggested. The Parlay X Gateway utilization is evaluated taking into account as its distributed architecture, as the processing of both requests and notifications of events, concerning QoS management.","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":"127891805","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.6123068
Zheng Chang, T. Ristaniemi
This paper considers a wireless cooperative OFDMA network with a base station and some relays. The relays adopt the decode-and-forward protocol and can assist the transmission from base station to mobile stations. The objective is to maximize the system transmission rate of downlink under various constraints. The optimal solution for such radio resource allocation problem has high computational complexity. Thus we divide our solution scheme into three steps. The first step is to select the relay that can achieve best transmission rate. Then the subcarrier is distributed to the selected relays. For each hop, the same subcarrier should not be used. Next, power allocation is adopted under the individual power constraints for each node. Simulation studies are conducted to evaluate the system performance. It confirms that our proposed algorithm can enhance the performance compared with newly proposed resource allocation schemes.
{"title":"Radio resource allocation for cooperative relay-assisted OFDMA wireless networks","authors":"Zheng Chang, T. Ristaniemi","doi":"10.1109/IWCLD.2011.6123068","DOIUrl":"https://doi.org/10.1109/IWCLD.2011.6123068","url":null,"abstract":"This paper considers a wireless cooperative OFDMA network with a base station and some relays. The relays adopt the decode-and-forward protocol and can assist the transmission from base station to mobile stations. The objective is to maximize the system transmission rate of downlink under various constraints. The optimal solution for such radio resource allocation problem has high computational complexity. Thus we divide our solution scheme into three steps. The first step is to select the relay that can achieve best transmission rate. Then the subcarrier is distributed to the selected relays. For each hop, the same subcarrier should not be used. Next, power allocation is adopted under the individual power constraints for each node. Simulation studies are conducted to evaluate the system performance. It confirms that our proposed algorithm can enhance the performance compared with newly proposed resource allocation schemes.","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":"121286905","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.6123087
V. Rodriguez
A wireless communication system work more efficiently if link-layer parameters such as modulation order, symbol rate and packet size are (adaptively) optimised. A common criterion is to maximise spectral efficiency subject to a very low bit-error constraint. But for systems equipped with strong error detection and a selective packet re-transmission mechanism, a packet-oriented criterion is more appropriate. Recently we showed that the link configuration that maximises bits per second or bits per Joule can be identified by drawing a tangent from the origin to the scaled graphs of the corresponding packet-success rate functions: the steeper the tangent the better the configuration. We now consider a tight symbol-rate constraint that forces the terminal to switch its configuration from the ideal as channel quality improves, and report on analytically-grounded performance experiments. A terminal with a flexible and unconstrained symbol rate enjoys a growing and overwhelming performance advantage over a similarly-endowed fixed-rate adaptive terminal. And the rate-flexible terminal retains a significant performance edge (up to 2-to-1) even when its symbol rate cannot exceed that of the fixed-rate terminal.
{"title":"Generalised link-layer optimisation: Application and performance evaluation","authors":"V. Rodriguez","doi":"10.1109/IWCLD.2011.6123087","DOIUrl":"https://doi.org/10.1109/IWCLD.2011.6123087","url":null,"abstract":"A wireless communication system work more efficiently if link-layer parameters such as modulation order, symbol rate and packet size are (adaptively) optimised. A common criterion is to maximise spectral efficiency subject to a very low bit-error constraint. But for systems equipped with strong error detection and a selective packet re-transmission mechanism, a packet-oriented criterion is more appropriate. Recently we showed that the link configuration that maximises bits per second or bits per Joule can be identified by drawing a tangent from the origin to the scaled graphs of the corresponding packet-success rate functions: the steeper the tangent the better the configuration. We now consider a tight symbol-rate constraint that forces the terminal to switch its configuration from the ideal as channel quality improves, and report on analytically-grounded performance experiments. A terminal with a flexible and unconstrained symbol rate enjoys a growing and overwhelming performance advantage over a similarly-endowed fixed-rate adaptive terminal. And the rate-flexible terminal retains a significant performance edge (up to 2-to-1) even when its symbol rate cannot exceed that of the fixed-rate terminal.","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":"130544592","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.6123078
Sami Ben Cheikh, Tim Esemann, H. Hellbruck
Wireless systems based on WLAN (802.11), ZigBee (802.15.4) and Bluetooth (802.15.1) are continuously deployed in new applications covering consumer, industry or medical fields. Especially, Bluetooth is recommended by the Health-Care-Organization for medical applications as frequency hopping is considered as a robust scheme. However dealing with frequency-dynamic sources of interference in the 2.4GHz ISM band is important due to the increase of wireless devices. Adaptive frequency hopping (AFH) suggested by the Bluetooth standard and implemented in many of todays products identifies and avoids using bad channels. It is a good and established coexistence mechanism in the presence of frequency-static sources of interference such as WLANs when the 2.4GHz band is not crowded. However, AFH is facing problems in a crowded 2.4GHz band, especially when the interference is dynamic. We developed a cross-layer algorithm SAFH (Smooth Adaptive Frequency Hopping) that is inspired by entropy maximization and the conventional Bluetooth AFH. SAFH assigns usage probabilities to all channels based on an exponential smoothing filter for frame error rates to estimate and predict the channel conditions. The application layer can adapt SAFH by parameter settings in a cross-layer approach. SAFH achieves low average frame error rate and responds fast to changing channel conditions if required from the application. Simulative Evaluation in the presence of different types of interference (802.11b, 802.15.4 and 802.15.1) shows that our algorithm outperforms conventional frequency hopping and AFH. Additionally, SAFH works smoothly and stable exploiting frequency diversity compared to previous approaches like entropy-maximization based adaptive frequency hopping and Utility Based Adaptive Frequency Hopping (UBAFH).
{"title":"SAFH - Smooth Adaptive Frequency Hopping","authors":"Sami Ben Cheikh, Tim Esemann, H. Hellbruck","doi":"10.1109/IWCLD.2011.6123078","DOIUrl":"https://doi.org/10.1109/IWCLD.2011.6123078","url":null,"abstract":"Wireless systems based on WLAN (802.11), ZigBee (802.15.4) and Bluetooth (802.15.1) are continuously deployed in new applications covering consumer, industry or medical fields. Especially, Bluetooth is recommended by the Health-Care-Organization for medical applications as frequency hopping is considered as a robust scheme. However dealing with frequency-dynamic sources of interference in the 2.4GHz ISM band is important due to the increase of wireless devices. Adaptive frequency hopping (AFH) suggested by the Bluetooth standard and implemented in many of todays products identifies and avoids using bad channels. It is a good and established coexistence mechanism in the presence of frequency-static sources of interference such as WLANs when the 2.4GHz band is not crowded. However, AFH is facing problems in a crowded 2.4GHz band, especially when the interference is dynamic. We developed a cross-layer algorithm SAFH (Smooth Adaptive Frequency Hopping) that is inspired by entropy maximization and the conventional Bluetooth AFH. SAFH assigns usage probabilities to all channels based on an exponential smoothing filter for frame error rates to estimate and predict the channel conditions. The application layer can adapt SAFH by parameter settings in a cross-layer approach. SAFH achieves low average frame error rate and responds fast to changing channel conditions if required from the application. Simulative Evaluation in the presence of different types of interference (802.11b, 802.15.4 and 802.15.1) shows that our algorithm outperforms conventional frequency hopping and AFH. Additionally, SAFH works smoothly and stable exploiting frequency diversity compared to previous approaches like entropy-maximization based adaptive frequency hopping and Utility Based Adaptive Frequency Hopping (UBAFH).","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":"116404469","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.6123090
D. Quintas, V. Friderikos
Cross layer scheduling techniques rely on accurate system state information, in particular the channel state. Since effective link gains are inherently time-varying, scheduling decisions have to be made every time the channel changes and hence accurate channel state information must be collected. In this paper we propose scheduling techniques that are robust to channel variations, allowing less frequent schedule updates and reducing in that sense the communication overhead and improving the system performance. Lower bounds on the achieved goodput when robust scheduling is used, in single and multi hop networks, are derived and through simulation we study the trade-offs between data rates, robustness and energy consumption. Finally, it is shown that the price of robustness in relay-aided networks is less when compared to traditional architectures.
{"title":"Robust resource management for energy efficient cellular networks","authors":"D. Quintas, V. Friderikos","doi":"10.1109/IWCLD.2011.6123090","DOIUrl":"https://doi.org/10.1109/IWCLD.2011.6123090","url":null,"abstract":"Cross layer scheduling techniques rely on accurate system state information, in particular the channel state. Since effective link gains are inherently time-varying, scheduling decisions have to be made every time the channel changes and hence accurate channel state information must be collected. In this paper we propose scheduling techniques that are robust to channel variations, allowing less frequent schedule updates and reducing in that sense the communication overhead and improving the system performance. Lower bounds on the achieved goodput when robust scheduling is used, in single and multi hop networks, are derived and through simulation we study the trade-offs between data rates, robustness and energy consumption. Finally, it is shown that the price of robustness in relay-aided networks is less when compared to traditional architectures.","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":"117067489","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
扫码关注我们
求助内容：
应助结果提醒方式：