This work seeks to develop an analytical model for the per-node throughput analysis of IEEE 802.11 WLAN networks with hidden nodes by extending the Bianchi's model. With the analytic model we derive the per-node throughput of each node and quantify the impact of hidden nodes on per-node throughput. Through our analysis, we find that nodes having more hidden nodes are likely to have worse throughput performance than nodes having less hidden nodes, so resulting in unfairness in per-node throughput. We next propose a new algorithm, called the fake collision algorithm, to solve the unfairness due to hidden nodes. The proposed fake collision algorithm allows nodes with poor throughput to acquire more transmission opportunities by slightly modifying the Binary Exponential Backoff algorithm of the IEEE 802.11 Distributed Coordination Function. To this end, the fake collision algorithm uses a new control parameter called the fake collision probability which can be obtained from a computation algorithm that we develop based on our analytic model. We show that the fairness in per-node throughput can be achieved with the fake collision probability for each node through simulation.
{"title":"Performance modeling and analysis of IEEE 802.11 wireless networks with hidden nodes","authors":"M. Lee, G. Hwang, Sumit Roy","doi":"10.1145/2507924.2507947","DOIUrl":"https://doi.org/10.1145/2507924.2507947","url":null,"abstract":"This work seeks to develop an analytical model for the per-node throughput analysis of IEEE 802.11 WLAN networks with hidden nodes by extending the Bianchi's model. With the analytic model we derive the per-node throughput of each node and quantify the impact of hidden nodes on per-node throughput. Through our analysis, we find that nodes having more hidden nodes are likely to have worse throughput performance than nodes having less hidden nodes, so resulting in unfairness in per-node throughput. We next propose a new algorithm, called the fake collision algorithm, to solve the unfairness due to hidden nodes. The proposed fake collision algorithm allows nodes with poor throughput to acquire more transmission opportunities by slightly modifying the Binary Exponential Backoff algorithm of the IEEE 802.11 Distributed Coordination Function. To this end, the fake collision algorithm uses a new control parameter called the fake collision probability which can be obtained from a computation algorithm that we develop based on our analytic model. We show that the fairness in per-node throughput can be achieved with the fake collision probability for each node through simulation.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114680015","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}
J. Oller, I. Demirkol, J. Casademont, J. Aspas, G. U. Gamm, L. Reindl
The use of duty-cycling in Medium Access Control (MAC) protocols effectively helps improving the energy efficiency of wireless networks. However, while the benefits of these protocols are unquestionable, most of them still suffer from overhearing and idle listening, two issues that prevent duty-cycled systems from achieving optimum energy usage, which is a crucial aspect in specific types of wireless networks such as Wireless Sensor Networks (WSN).Wake-up Radio (WuR) systems have been employed recently to overcome these issues. Under this approach, the nodes' MicroController Unit (MCU) and main radio transceiver are completely switched off and only activated when a secondary, extremely low-power receiver in the node is triggered by a particular wireless transmission. Wake-up Radio systems allow for drastic energy savings since receiver nodes are only activated on-demand, maximizing their battery lifetimes. In this paper, we have modeled and simulated a real, recent and promising WuR hardware platform based on its time and energy consumption characterization. By comparing such WuR approach to B-MAC and IEEE 802.15.4, two well-known and widely employed MAC protocols, we show it effectively out-performs the conventional WSN MAC approaches in terms of energy efficiency. To the best of authors' knowledge, this is the first study to include a comparative analysis for multi-hop networks based on a real WuR platform, which shows WuR systems represent an energy-efficient solution that also provides a good tradeoff between latency, packet delivery ratio and applicability..
{"title":"Wake-up radio as an energy-efficient alternative to conventional wireless sensor networks MAC protocols","authors":"J. Oller, I. Demirkol, J. Casademont, J. Aspas, G. U. Gamm, L. Reindl","doi":"10.1145/2507924.2507955","DOIUrl":"https://doi.org/10.1145/2507924.2507955","url":null,"abstract":"The use of duty-cycling in Medium Access Control (MAC) protocols effectively helps improving the energy efficiency of wireless networks. However, while the benefits of these protocols are unquestionable, most of them still suffer from overhearing and idle listening, two issues that prevent duty-cycled systems from achieving optimum energy usage, which is a crucial aspect in specific types of wireless networks such as Wireless Sensor Networks (WSN).Wake-up Radio (WuR) systems have been employed recently to overcome these issues. Under this approach, the nodes' MicroController Unit (MCU) and main radio transceiver are completely switched off and only activated when a secondary, extremely low-power receiver in the node is triggered by a particular wireless transmission. Wake-up Radio systems allow for drastic energy savings since receiver nodes are only activated on-demand, maximizing their battery lifetimes. In this paper, we have modeled and simulated a real, recent and promising WuR hardware platform based on its time and energy consumption characterization. By comparing such WuR approach to B-MAC and IEEE 802.15.4, two well-known and widely employed MAC protocols, we show it effectively out-performs the conventional WSN MAC approaches in terms of energy efficiency. To the best of authors' knowledge, this is the first study to include a comparative analysis for multi-hop networks based on a real WuR platform, which shows WuR systems represent an energy-efficient solution that also provides a good tradeoff between latency, packet delivery ratio and applicability..","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128478026","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}
The development of IPv6 stacks for wireless constrained devices that have limited hardware resources has paved the way for many new areas of applications and protocols. The Constrained Application Protocol (CoAP) has been designed by the IETF to enable the manipulation of resources for constrained devices that are capable of connecting to the Internet. Due to the limited radio channel capacities and hardware resources, congestion is a common phenomenon in networks of constrained devices. CoAP implements a basic congestion control mechanism for the transmission of reliable messages. Alternative CoAP congestion control approaches are a recent topic of interest in the IETF CoRE Working Group. New Internet-Drafts discuss the limitations of the default congestion control mechanisms and propose alternative ones, yet, there have been no studies in the literature that compare the original approach to the alternative ones. In this paper, we target this crucial study and perform evaluations that show how the default and alternative congestion control mechanisms compare to each other. We use the Cooja simulation environment, which is part of the Contiki development toolset, to simulate CoAP within a complete protocol stack that uses IETF protocols for constrained networks. Through simulations of different network topologies and varying traffic loads, we demonstrate how the advanced mechanisms proposed in the drafts perform relative to the basic congestion control mechanism.
{"title":"Congestion control in reliable CoAP communication","authors":"A. Betzler, Carles Gomez, I. Demirkol, J. Aspas","doi":"10.1145/2507924.2507954","DOIUrl":"https://doi.org/10.1145/2507924.2507954","url":null,"abstract":"The development of IPv6 stacks for wireless constrained devices that have limited hardware resources has paved the way for many new areas of applications and protocols. The Constrained Application Protocol (CoAP) has been designed by the IETF to enable the manipulation of resources for constrained devices that are capable of connecting to the Internet. Due to the limited radio channel capacities and hardware resources, congestion is a common phenomenon in networks of constrained devices. CoAP implements a basic congestion control mechanism for the transmission of reliable messages. Alternative CoAP congestion control approaches are a recent topic of interest in the IETF CoRE Working Group. New Internet-Drafts discuss the limitations of the default congestion control mechanisms and propose alternative ones, yet, there have been no studies in the literature that compare the original approach to the alternative ones. In this paper, we target this crucial study and perform evaluations that show how the default and alternative congestion control mechanisms compare to each other. We use the Cooja simulation environment, which is part of the Contiki development toolset, to simulate CoAP within a complete protocol stack that uses IETF protocols for constrained networks. Through simulations of different network topologies and varying traffic loads, we demonstrate how the advanced mechanisms proposed in the drafts perform relative to the basic congestion control mechanism.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126270427","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}
Underwater sensor networks have recently been proposed as a way to observe and to explore the lakes, rivers, seas, and oceans. A challenging issue in these networks is the communication, mainly due to the impairments of the acoustic transmission. Thus, efficient mechanisms to improve the data delivery must be proposed. In this work we present a novel anycast greedy geographic forwarding protocol and two topology control mechanisms. The proposed geo-routing protocol considers the anycast network architecture in the data forwarding process. The proposed centralized topology control (CTC) and distributed topology control (DTC) mechanisms organize the network via depth adjustment of some nodes. The simulation results show that with these mechanisms, the data packet delivery ratio achieves more than 90% even in hard and difficult scenarios of very sparse or very dense networks, the end-to-end delay and energy consumption per delivered packet is reduced.
{"title":"Movement assisted-topology control and geographic routing protocol for underwater sensor networks","authors":"Rodolfo W. L. Coutinho, L. Vieira, A. Loureiro","doi":"10.1145/2507924.2507956","DOIUrl":"https://doi.org/10.1145/2507924.2507956","url":null,"abstract":"Underwater sensor networks have recently been proposed as a way to observe and to explore the lakes, rivers, seas, and oceans. A challenging issue in these networks is the communication, mainly due to the impairments of the acoustic transmission. Thus, efficient mechanisms to improve the data delivery must be proposed. In this work we present a novel anycast greedy geographic forwarding protocol and two topology control mechanisms. The proposed geo-routing protocol considers the anycast network architecture in the data forwarding process. The proposed centralized topology control (CTC) and distributed topology control (DTC) mechanisms organize the network via depth adjustment of some nodes. The simulation results show that with these mechanisms, the data packet delivery ratio achieves more than 90% even in hard and difficult scenarios of very sparse or very dense networks, the end-to-end delay and energy consumption per delivered packet is reduced.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117213844","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}
Kazuma Kaneko, Y. Kawamoto, Hiroki Nishiyama, N. Kato, Shinichi Yamamoto, N. Yoshimura
Recently, since many kinds of wireless devices have been widely used and a large amount of contents is available on the Internet, a network system that provides adequate services anytime and anywhere is required. In this research, we focus on satellite networks using mass storage devices to provide the above mentioned services. In this kind of network, multiple satellites are used to cover the whole surface of the earth, and each satellite is equipped with a mass storage device. By using mass storage devices, the satellite network can manage a high buffer capacity to handle large amounts of data. However, no routing method has been developed for such kind of satellite network that can utilize the storage devices and manage the large amount of data in the network effectively. In this paper, we propose a novel routing scheme for the efficient utilization of the mass storage on satellites to mitigate network congestion. The proposed method is analyzed mathematically. The numerical results validate the effectiveness of our proposed method.
{"title":"An intelligent routing scheme effectively utilizing mass storage embedded on satellites to mitigate network congestions","authors":"Kazuma Kaneko, Y. Kawamoto, Hiroki Nishiyama, N. Kato, Shinichi Yamamoto, N. Yoshimura","doi":"10.1145/2507924.2507951","DOIUrl":"https://doi.org/10.1145/2507924.2507951","url":null,"abstract":"Recently, since many kinds of wireless devices have been widely used and a large amount of contents is available on the Internet, a network system that provides adequate services anytime and anywhere is required. In this research, we focus on satellite networks using mass storage devices to provide the above mentioned services. In this kind of network, multiple satellites are used to cover the whole surface of the earth, and each satellite is equipped with a mass storage device. By using mass storage devices, the satellite network can manage a high buffer capacity to handle large amounts of data. However, no routing method has been developed for such kind of satellite network that can utilize the storage devices and manage the large amount of data in the network effectively. In this paper, we propose a novel routing scheme for the efficient utilization of the mass storage on satellites to mitigate network congestion. The proposed method is analyzed mathematically. The numerical results validate the effectiveness of our proposed method.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"147 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115661285","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}
Thiago Abreu, B. Baynat, Thomas Begin, I. G. Lassous
IEEE 802.11 is implemented in many wireless networks, including multi-hop networks where communications between nodes are conveyed along a chain. We present a modeling framework to evaluate the performance of flows conveyed through such a chain. Our framework is based on a hierarchical modeling composed of two levels. The lower level is dedicated to the modeling of each node, while the upper level matches the actual topology of the chain. Our approach can handle different topologies, takes into account Bit Error Rate and can be applied to multi-hop flows with rates ranging from light to heavy workloads. We assess the ability of our model to evaluate loss rate, throughput, and end-to-end delay experienced by flows on a simple scenario, where the number of nodes is limited to three. Numerical results show that our model accurately approximates the performance of flows with a relative error typically less than 10%.
{"title":"Hierarchical modeling of IEEE 802.11 multi-hop wireless networks","authors":"Thiago Abreu, B. Baynat, Thomas Begin, I. G. Lassous","doi":"10.1145/2507924.2507949","DOIUrl":"https://doi.org/10.1145/2507924.2507949","url":null,"abstract":"IEEE 802.11 is implemented in many wireless networks, including multi-hop networks where communications between nodes are conveyed along a chain. We present a modeling framework to evaluate the performance of flows conveyed through such a chain. Our framework is based on a hierarchical modeling composed of two levels. The lower level is dedicated to the modeling of each node, while the upper level matches the actual topology of the chain. Our approach can handle different topologies, takes into account Bit Error Rate and can be applied to multi-hop flows with rates ranging from light to heavy workloads. We assess the ability of our model to evaluate loss rate, throughput, and end-to-end delay experienced by flows on a simple scenario, where the number of nodes is limited to three. Numerical results show that our model accurately approximates the performance of flows with a relative error typically less than 10%.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122901351","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}
In this paper, we consider a distributed opportunistic access (D-OSA), in which cognitive radio (CR) users attempt to access a channel licensed to a primary network. In this context, we formulate the problem of designing the equilibrium sensing time in a distributed manner, in order to maximize the throughput of CR users while guarantying a good protection to the primary users (PU). Next, we study the Nash equilibrium of the system, we also propose a combined learning algorithm for continuous actions that is fully distributed, and allows to the CR users to learn their equilibrium payoffs and their equilibrium sensing time. The simulation results show that the system can learn the sensing time and converge to a unique Nash equilibrium, which come to prove the theoretical study. A surprising feature is that there exists a correlation between the transmit probability and the sensing time. More precisely, lower transmit probability induces lower sensing times.
{"title":"Equilibrium sensing time for distributed opportunistic access incognitive radio networks","authors":"S. Bouferda, Essaid Sabir, A. Hayar, M. Rifi","doi":"10.1145/2507924.2507944","DOIUrl":"https://doi.org/10.1145/2507924.2507944","url":null,"abstract":"In this paper, we consider a distributed opportunistic access (D-OSA), in which cognitive radio (CR) users attempt to access a channel licensed to a primary network. In this context, we formulate the problem of designing the equilibrium sensing time in a distributed manner, in order to maximize the throughput of CR users while guarantying a good protection to the primary users (PU). Next, we study the Nash equilibrium of the system, we also propose a combined learning algorithm for continuous actions that is fully distributed, and allows to the CR users to learn their equilibrium payoffs and their equilibrium sensing time. The simulation results show that the system can learn the sensing time and converge to a unique Nash equilibrium, which come to prove the theoretical study. A surprising feature is that there exists a correlation between the transmit probability and the sensing time. More precisely, lower transmit probability induces lower sensing times.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"16 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113979614","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}
Dynamic base station activation (DBA) has recently emerged as a viable solution for reducing energy consumption in cellular networks. While most of the works on this topic focused on centralized decision making algorithms, in this paper we investigate distributive solutions. These solutions are particularly desirable due to importance of self-organization and self-optimization in future cellular networks. The goal of DBA is to achieve an optimal trade-off between network operator's revenue and operational cost while guaranteeing coverage for network users. The problem is posed as a network utility maximization aiming to find the optimal activation schedule of each base station. Using Lagrangian duality, the problem is decomposed into smaller subproblems, where each subproblem is solved locally at its associated base station. Controlled message passing among base stations ensures convergence to the global optimal solution. Moreover, this general solution is further extended to capture the combinatorial nature of DBA. Finally, numerical results are provided to demonstrate the behavior of our solution in terms of utility and cost trade-off and convergence in some example network scenarios.
{"title":"Distributed base station activation for energy-efficient operation of cellular networks","authors":"A. Abbasi, Majid Ghaderi","doi":"10.1145/2507924.2507961","DOIUrl":"https://doi.org/10.1145/2507924.2507961","url":null,"abstract":"Dynamic base station activation (DBA) has recently emerged as a viable solution for reducing energy consumption in cellular networks. While most of the works on this topic focused on centralized decision making algorithms, in this paper we investigate distributive solutions. These solutions are particularly desirable due to importance of self-organization and self-optimization in future cellular networks. The goal of DBA is to achieve an optimal trade-off between network operator's revenue and operational cost while guaranteeing coverage for network users. The problem is posed as a network utility maximization aiming to find the optimal activation schedule of each base station. Using Lagrangian duality, the problem is decomposed into smaller subproblems, where each subproblem is solved locally at its associated base station. Controlled message passing among base stations ensures convergence to the global optimal solution. Moreover, this general solution is further extended to capture the combinatorial nature of DBA. Finally, numerical results are provided to demonstrate the behavior of our solution in terms of utility and cost trade-off and convergence in some example network scenarios.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116264023","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}
Ming Li, Andrey Lukyanenko, S. Tarkoma, Antti Ylä-Jääski
When a TCP connection experiences a timeout, the sender must wait at least RTOmin (Minimum Retransmission Timeout) before doing the retransmission, during which the channel may be completely idle, undermining the throughput and channel efficiency. In this paper, we investigate the origin of RTOmin and find that it is needed to mitigate against spurious timeouts when the Delayed ACK (DA) scheme for TCP is implemented. Motivated by this observation, we propose a deployable and TCP-compatible new Delayed ACK (NDA) to replace the legacy DA. Our solution differs with previous work is that instead of using complex algorithms or fine-grained timer to tune RTOmin, we modify the DA scheme with minor changes to allow the sender to remove the RTOmin constraint while reserving the delayed ACK function at the receiver. In order to eliminate the aggressiveness of RTO (Retransmission Timeout) after removing RTOmin, we use coding techniques to encode the timeout retransmitted packets to make the potential spurious retransmissions useful. The simulation results demonstrate that in lossy wireless networks, NDA is efficient, because it achieves much higher TCP goodput and channel efficiency compared to DA. The gain we obtain by the use of NDA comes from two-order effects. One effect comes from removing the RTOmin constraint, because small RTO timer makes TCP react quickly to timeouts, resulting in small transmission idle. The other effect comes from eliminating consecutive RTO by allowing the receiver to acknowledge each timeout retransmission, which further reduces the RTO idle.
{"title":"Efficient new delayed ACK for TCP: old problem, new insight","authors":"Ming Li, Andrey Lukyanenko, S. Tarkoma, Antti Ylä-Jääski","doi":"10.1145/2507924.2507948","DOIUrl":"https://doi.org/10.1145/2507924.2507948","url":null,"abstract":"When a TCP connection experiences a timeout, the sender must wait at least RTOmin (Minimum Retransmission Timeout) before doing the retransmission, during which the channel may be completely idle, undermining the throughput and channel efficiency. In this paper, we investigate the origin of RTOmin and find that it is needed to mitigate against spurious timeouts when the Delayed ACK (DA) scheme for TCP is implemented. Motivated by this observation, we propose a deployable and TCP-compatible new Delayed ACK (NDA) to replace the legacy DA. Our solution differs with previous work is that instead of using complex algorithms or fine-grained timer to tune RTOmin, we modify the DA scheme with minor changes to allow the sender to remove the RTOmin constraint while reserving the delayed ACK function at the receiver. In order to eliminate the aggressiveness of RTO (Retransmission Timeout) after removing RTOmin, we use coding techniques to encode the timeout retransmitted packets to make the potential spurious retransmissions useful. The simulation results demonstrate that in lossy wireless networks, NDA is efficient, because it achieves much higher TCP goodput and channel efficiency compared to DA. The gain we obtain by the use of NDA comes from two-order effects. One effect comes from removing the RTOmin constraint, because small RTO timer makes TCP react quickly to timeouts, resulting in small transmission idle. The other effect comes from eliminating consecutive RTO by allowing the receiver to acknowledge each timeout retransmission, which further reduces the RTO idle.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123196794","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}
We present the detailed system model for adaptive modulation and coding (AMC) in the physical layer, and hybrid automatic repeat request (HARQ) in the data link layer, which play key roles in link layer of future wireless technologies as for e.g. LTE-Advanced. The packet combining schemes hard combining and weighted hard combining are compared in an attempt to reduce packet error rate (PER) and increase spectral efficiency. Simulation results show that both combining schemes will always keep the required quality of service (QoS) and increase spectral efficiency significantly over the system without AMC/HARQ. Moreover, with severe interference, hard combining will improve the system spectral efficiency more than weighted hard combining.
{"title":"Modelling and analysis of link adaptation for LTE-advanced","authors":"Parth Amin, S. Iraji, J. Nurminen","doi":"10.1145/2507924.2507986","DOIUrl":"https://doi.org/10.1145/2507924.2507986","url":null,"abstract":"We present the detailed system model for adaptive modulation and coding (AMC) in the physical layer, and hybrid automatic repeat request (HARQ) in the data link layer, which play key roles in link layer of future wireless technologies as for e.g. LTE-Advanced. The packet combining schemes hard combining and weighted hard combining are compared in an attempt to reduce packet error rate (PER) and increase spectral efficiency. Simulation results show that both combining schemes will always keep the required quality of service (QoS) and increase spectral efficiency significantly over the system without AMC/HARQ. Moreover, with severe interference, hard combining will improve the system spectral efficiency more than weighted hard combining.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128511921","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
扫码关注我们
求助内容：
应助结果提醒方式：