Solar cells combined with power management algorithms enable the dynamic scheduling of Wireless Sensor Networks applications in a reference period, where the objective of the scheduling is to maximize the application quality level while conserving an energy level sufficient to constantly maintain the sensor operation. In this paper we consider networked, solar cells powered wireless sensors and we propose an algorithm aims to find a global, (sub)optimal scheduling that maximizes the overall quality of service in the sensors and keeps the system energy neutral, thus ensuring that the system works uninterruptedly.
{"title":"Energy management of networked, solar cells powered, wireless sensors","authors":"Soledad Escolar, S. Chessa, J. Carretero","doi":"10.1145/2507924.2507991","DOIUrl":"https://doi.org/10.1145/2507924.2507991","url":null,"abstract":"Solar cells combined with power management algorithms enable the dynamic scheduling of Wireless Sensor Networks applications in a reference period, where the objective of the scheduling is to maximize the application quality level while conserving an energy level sufficient to constantly maintain the sensor operation. In this paper we consider networked, solar cells powered wireless sensors and we propose an algorithm aims to find a global, (sub)optimal scheduling that maximizes the overall quality of service in the sensors and keeps the system energy neutral, thus ensuring that the system works uninterruptedly.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"275 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":"122762332","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}
Low-energy communications is becoming an increasingly relevant research area, due to both economic and environmental reasons. Low-energy is particularly relevant in wireless because of the limited energy available to terminals and the high consumption of the base stations derived from wide geographical coverage. Green wireless aims to formulate a long term research goal in the wireless environment. In the talk, the speaker will present the motivation and formulation of this research goal, with an overview of the associated research challenges. The talk will also address in more detail one specific case of energy-efficiency consisting in the cross-factor, which consists of the energy penalty derived from a packet traversing the system protocol stack.
{"title":"Green wireless: towards minimum per-bit linear energy consumption in wireless communications","authors":"A. Azcorra","doi":"10.1145/2507924.2517481","DOIUrl":"https://doi.org/10.1145/2507924.2517481","url":null,"abstract":"Low-energy communications is becoming an increasingly relevant research area, due to both economic and environmental reasons. Low-energy is particularly relevant in wireless because of the limited energy available to terminals and the high consumption of the base stations derived from wide geographical coverage. Green wireless aims to formulate a long term research goal in the wireless environment. In the talk, the speaker will present the motivation and formulation of this research goal, with an overview of the associated research challenges. The talk will also address in more detail one specific case of energy-efficiency consisting in the cross-factor, which consists of the energy penalty derived from a packet traversing the system protocol stack.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"59 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":"114611458","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}
Content replication has gained much popularity in recent years both in the wired and wireless infrastructures. A key challenge faced by Wireless Mesh Networks (WMNs) is to determine the number and locations of content replicas (e.g. video clip) such that the mesh clients access cost is minimized. Furthermore, the dynamic nature of the wireless environment favors a distributed and adaptive solution to this problem. In this paper, we present an efficient, lightweight and scalable object replication and placement scheme for WMNs. Since the placement problem is NP-Complete, the scheme decomposes the problem into smaller sub-problems to facilitate the distributed approach in a P2P fashion. Moreover, it exploits the long-term link-quality routing metrics to augment the replica placement decision and the instantaneous link-quality metrics for replica server selection. The effectiveness of our scheme is evaluated through extensive simulation studies.
{"title":"Exploiting graph partitioning for hierarchical replica placement in WMNs","authors":"Zakwan Al-Arnaout, Q. Fu, Marcus Frean","doi":"10.1145/2507924.2507928","DOIUrl":"https://doi.org/10.1145/2507924.2507928","url":null,"abstract":"Content replication has gained much popularity in recent years both in the wired and wireless infrastructures. A key challenge faced by Wireless Mesh Networks (WMNs) is to determine the number and locations of content replicas (e.g. video clip) such that the mesh clients access cost is minimized. Furthermore, the dynamic nature of the wireless environment favors a distributed and adaptive solution to this problem. In this paper, we present an efficient, lightweight and scalable object replication and placement scheme for WMNs. Since the placement problem is NP-Complete, the scheme decomposes the problem into smaller sub-problems to facilitate the distributed approach in a P2P fashion. Moreover, it exploits the long-term link-quality routing metrics to augment the replica placement decision and the instantaneous link-quality metrics for replica server selection. The effectiveness of our scheme is evaluated through extensive simulation studies.","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":"128561295","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}
Adelina Madhja, S. Nikoletseas, Theofanis P. Raptis
We investigate the problem of efficient wireless energy recharging in Wireless Rechargeable Sensor Networks (WRSNs). In such networks special mobile entities (called the Mobile Chargers) traverse the network and wirelessly replenish the energy of sensor nodes. In contrast to most current approaches, we envision methods that are distributed and use limited network information. We propose four new protocols for efficient recharging, addressing key issues which we identify, most notably (i) what are good coordination procedures for the Mobile Chargers and (ii) what are good trajectories for the Mobile Chargers. Two of our protocols (DC, DCLK) perform distributed, limited network knowledge coordination and charging, while two others (CC, CCGK) perform centralized, global network knowledge coordination and charging. As detailed simulations demonstrate, one of our distributed protocols outperforms a known state of the art method, while its performance gets quite close to the performance of the powerful centralized global knowledge method.
{"title":"Efficient, distributed coordination of multiple mobile chargers in sensor networks","authors":"Adelina Madhja, S. Nikoletseas, Theofanis P. Raptis","doi":"10.1145/2507924.2507938","DOIUrl":"https://doi.org/10.1145/2507924.2507938","url":null,"abstract":"We investigate the problem of efficient wireless energy recharging in Wireless Rechargeable Sensor Networks (WRSNs). In such networks special mobile entities (called the Mobile Chargers) traverse the network and wirelessly replenish the energy of sensor nodes. In contrast to most current approaches, we envision methods that are distributed and use limited network information. We propose four new protocols for efficient recharging, addressing key issues which we identify, most notably (i) what are good coordination procedures for the Mobile Chargers and (ii) what are good trajectories for the Mobile Chargers. Two of our protocols (DC, DCLK) perform distributed, limited network knowledge coordination and charging, while two others (CC, CCGK) perform centralized, global network knowledge coordination and charging. As detailed simulations demonstrate, one of our distributed protocols outperforms a known state of the art method, while its performance gets quite close to the performance of the powerful centralized global knowledge method.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"24 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":"125958448","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}
Francisco Santos, B. Ertl, C. Barakat, T. Spyropoulos, T. Turletti
Emerging challenged networks require new protocols and strategies to cope with a high degree of mobility, high delays and unknown, possibly non-existing routes within the network. Researchers have proposed different store-carry-and-forward protocols for data delivery in challenged networks. These have been complemented with appropriate drop and scheduling policies that deal with the limitations of the nodes' buffers and the limited duration of opportunistic encounters in these networks. Nevertheless, the vast majority of these protocols and strategies are designed for end-to-end transmissions. Yet, a paradigm shift from the traditional way of addressing the endpoints in the network has been occurring towards content-centric networking. To this end, we present CEDO, a content-centric dissemination algorithm for challenged networks. CEDO aims at maximizing the total delivery-rate of distributed content in a setting where a range of contents of different popularity may be requested and stored, but nodes have limited resources. It achieves this by maintaining a delivery-rate utility per content that is proportional to the content miss rate and that is used by the nodes to make appropriate drop and scheduling decisions. This delivery-rate utility can be estimated locally by each node using unbiased estimators fed by sampled information on the mobile network obtained by gossiping. Both simulations and theory suggest that CEDO achieves its set goal, and outperforms a baseline LRU-based policy by 72%, even in relatively small scenarios. The framework followed by CEDO is general enough to be applied to other global performance objectives as well.
{"title":"CEDO: content-centric dissemination algorithm for delay-tolerant networks","authors":"Francisco Santos, B. Ertl, C. Barakat, T. Spyropoulos, T. Turletti","doi":"10.1145/2507924.2507931","DOIUrl":"https://doi.org/10.1145/2507924.2507931","url":null,"abstract":"Emerging challenged networks require new protocols and strategies to cope with a high degree of mobility, high delays and unknown, possibly non-existing routes within the network. Researchers have proposed different store-carry-and-forward protocols for data delivery in challenged networks. These have been complemented with appropriate drop and scheduling policies that deal with the limitations of the nodes' buffers and the limited duration of opportunistic encounters in these networks. Nevertheless, the vast majority of these protocols and strategies are designed for end-to-end transmissions. Yet, a paradigm shift from the traditional way of addressing the endpoints in the network has been occurring towards content-centric networking. To this end, we present CEDO, a content-centric dissemination algorithm for challenged networks. CEDO aims at maximizing the total delivery-rate of distributed content in a setting where a range of contents of different popularity may be requested and stored, but nodes have limited resources. It achieves this by maintaining a delivery-rate utility per content that is proportional to the content miss rate and that is used by the nodes to make appropriate drop and scheduling decisions. This delivery-rate utility can be estimated locally by each node using unbiased estimators fed by sampled information on the mobile network obtained by gossiping. Both simulations and theory suggest that CEDO achieves its set goal, and outperforms a baseline LRU-based policy by 72%, even in relatively small scenarios. The framework followed by CEDO is general enough to be applied to other global performance objectives as well.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"48 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":"134389759","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}
Udo Schilcher, S. Toumpis, A. Crismani, Günther Brandner, C. Bettstetter
We show by means of stochastic geometry that interference dynamics has a strong impact on the performance of cooperative relaying. For both conventional and multi-hop-aware cooperative relaying we show that the packet delivery probability significantly changes with the dependence of interference among the links. Depending on the scenario under consideration, this change could be either an increase or decrease of the packet delivery probability. Especially for multi-hop-aware cooperative relaying, the performance gain is heavily reduced when interference possesses high temporal and spatial dependence.
{"title":"How does interference dynamics influence packet delivery in cooperative relaying?","authors":"Udo Schilcher, S. Toumpis, A. Crismani, Günther Brandner, C. Bettstetter","doi":"10.1145/2507924.2507926","DOIUrl":"https://doi.org/10.1145/2507924.2507926","url":null,"abstract":"We show by means of stochastic geometry that interference dynamics has a strong impact on the performance of cooperative relaying. For both conventional and multi-hop-aware cooperative relaying we show that the packet delivery probability significantly changes with the dependence of interference among the links. Depending on the scenario under consideration, this change could be either an increase or decrease of the packet delivery probability. Especially for multi-hop-aware cooperative relaying, the performance gain is heavily reduced when interference possesses high temporal and spatial dependence.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"6 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":"132895371","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}
H. Yamaguchi, Akihito Hiromori, T. Higashino, Shigeki Umehara, Hirofumi Urayama, M. Yamada, T. Maeno, S. Kaneda, M. Takai
This paper presents a scheduling algorithm for a set of wireless stations such as road-side access points for vehicular networks and outdoor WiFi stations, which are deployed in wide urban areas and may compete with each other for limited wireless resources. Different from a number of conventional approaches most of which consider detailed information on individual stations and signal interference among them, we focus more on geography of the areas of interest, and provide a novel algorithm that pursues the best balance among (i) optimality of resource utilization, (ii) robustness to new station installation and traffic demand changes, and (iii) scalability to the population of stations and area size. We have confirmed the performance by experimental simulations with several scenarios, and the applicability of approach has been testified by a case study on a scheduling problem for roadside access points of vehicular networks in cooperation with a manufacturing corporation.
{"title":"A novel scheduling algorithm for densely-deployed wireless stations in urban areas","authors":"H. Yamaguchi, Akihito Hiromori, T. Higashino, Shigeki Umehara, Hirofumi Urayama, M. Yamada, T. Maeno, S. Kaneda, M. Takai","doi":"10.1145/2507924.2507939","DOIUrl":"https://doi.org/10.1145/2507924.2507939","url":null,"abstract":"This paper presents a scheduling algorithm for a set of wireless stations such as road-side access points for vehicular networks and outdoor WiFi stations, which are deployed in wide urban areas and may compete with each other for limited wireless resources. Different from a number of conventional approaches most of which consider detailed information on individual stations and signal interference among them, we focus more on geography of the areas of interest, and provide a novel algorithm that pursues the best balance among (i) optimality of resource utilization, (ii) robustness to new station installation and traffic demand changes, and (iii) scalability to the population of stations and area size. We have confirmed the performance by experimental simulations with several scenarios, and the applicability of approach has been testified by a case study on a scheduling problem for roadside access points of vehicular networks in cooperation with a manufacturing corporation.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"31 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":"131088960","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 Adaptive Publish-subscribe Distance Vector (APDV) protocol is introduced as an example of a new approach to allowing distance-vector routing to scale by integrating it with adaptive publish-subscribe mechanisms. APDV combines establishing routes to well-known controllers using distance-vector signaling with publish-subscribe mechanisms. The latter allow destinations to publish their presence with subsets of controllers, and sources to obtain routes to intended destinations from those same controllers. Controllers are selected dynamically using a fault-tolerant distributed election algorithm to ensure that each non-controller node is covered by at least a given number of controllers within a few hops. Extensive simulation experiments are used to compare APDV with AODV and OLSR, which are representative protocols for on-demand and proactive routing. The results show that APDV achieves significantly better data delivery, attains comparable delays for delivered packets, and incurs orders of magnitude less control overhead than AODV and OLSR, even under heavy data loads.
{"title":"APDV: making distance vector routing scale using adaptive publish-subscribe mechanisms","authors":"Qian Li, J. Garcia-Luna-Aceves","doi":"10.1145/2507924.2507925","DOIUrl":"https://doi.org/10.1145/2507924.2507925","url":null,"abstract":"The Adaptive Publish-subscribe Distance Vector (APDV) protocol is introduced as an example of a new approach to allowing distance-vector routing to scale by integrating it with adaptive publish-subscribe mechanisms. APDV combines establishing routes to well-known controllers using distance-vector signaling with publish-subscribe mechanisms. The latter allow destinations to publish their presence with subsets of controllers, and sources to obtain routes to intended destinations from those same controllers. Controllers are selected dynamically using a fault-tolerant distributed election algorithm to ensure that each non-controller node is covered by at least a given number of controllers within a few hops. Extensive simulation experiments are used to compare APDV with AODV and OLSR, which are representative protocols for on-demand and proactive routing. The results show that APDV achieves significantly better data delivery, attains comparable delays for delivered packets, and incurs orders of magnitude less control overhead than AODV and OLSR, even under heavy data loads.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"14 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":"115231019","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}
R. V. Glabbeek, P. Höfner, Wee Lum Tan, M. Portmann
In the area of mobile ad-hoc networks and wireless mesh networks, sequence numbers are often used in routing protocols to avoid routing loops. It is commonly stated in protocol specifications that sequence numbers are sufficient to guarantee loop freedom if they are monotonically increased over time. A classical example for the use of sequence numbers is the popular Ad hoc On-Demand Distance Vector (AODV) routing protocol. The loop freedom of AODV is not only a common belief, it has been claimed in the abstract of its RFC and at least two proofs have been proposed. AODV-based protocols such as AODVv2 (DYMO) and HWMP also claim loop freedom due to the same use of sequence numbers. In this paper we show that AODV is not a priori loop free; by this we counter the proposed proofs in the literature. In fact, loop freedom hinges on non-evident assumptions to be made when resolving ambiguities occurring in the RFC. Thus, monotonically increasing sequence numbers, by themselves, do not guarantee loop freedom.
{"title":"Sequence numbers do not guarantee loop freedom: AODV can yield routing loops","authors":"R. V. Glabbeek, P. Höfner, Wee Lum Tan, M. Portmann","doi":"10.1145/2507924.2507943","DOIUrl":"https://doi.org/10.1145/2507924.2507943","url":null,"abstract":"In the area of mobile ad-hoc networks and wireless mesh networks, sequence numbers are often used in routing protocols to avoid routing loops. It is commonly stated in protocol specifications that sequence numbers are sufficient to guarantee loop freedom if they are monotonically increased over time. A classical example for the use of sequence numbers is the popular Ad hoc On-Demand Distance Vector (AODV) routing protocol. The loop freedom of AODV is not only a common belief, it has been claimed in the abstract of its RFC and at least two proofs have been proposed. AODV-based protocols such as AODVv2 (DYMO) and HWMP also claim loop freedom due to the same use of sequence numbers. In this paper we show that AODV is not a priori loop free; by this we counter the proposed proofs in the literature. In fact, loop freedom hinges on non-evident assumptions to be made when resolving ambiguities occurring in the RFC. Thus, monotonically increasing sequence numbers, by themselves, do not guarantee loop freedom.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"40 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":"124104983","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}
Wireless relays will play an important role in future wireless communication networks. This talk will focus on the new concept of buffer-aided relaying. In conventional relay protocols, the schedule of when the different nodes in the network transmit is pre-fixed and non-adaptive. In contrast, buffer-aided relaying protocols exploit the additional degrees of freedom introduced by relays with buffers and employ an adaptive transmission schedule which takes into account the quality of the different links in the network. We will show that this new approach leads to substantial performance improvements in relay networks with fading links. In particular, buffer-aided relays enable significant gains in throughput as well as outage and error probability at the expense of an increased delay. These gains are introduced by adaptive link selection and/or adaptive transmission mode selection. We will first introduce the basic concept of buffer-aided relaying using the example of a simple three node one-way relay network before considering more complex networks such as relay-selection networks, multi-antenna relay networks, and two-way relay networks. We show that in some cases buffer-aided relaying protocols can double both the diversity gain and the throughput compared to conventional relaying protocols. Furthermore, in multi-antenna networks, buffer-aided relaying can also help to overcome the performance loss that half-duplex relays typically suffer compared to full-duplex relays.
{"title":"How much can we gain by exploiting buffers in wireless relay networks?","authors":"R. Schober","doi":"10.1145/2507924.2517478","DOIUrl":"https://doi.org/10.1145/2507924.2517478","url":null,"abstract":"Wireless relays will play an important role in future wireless communication networks. This talk will focus on the new concept of buffer-aided relaying. In conventional relay protocols, the schedule of when the different nodes in the network transmit is pre-fixed and non-adaptive. In contrast, buffer-aided relaying protocols exploit the additional degrees of freedom introduced by relays with buffers and employ an adaptive transmission schedule which takes into account the quality of the different links in the network. We will show that this new approach leads to substantial performance improvements in relay networks with fading links. In particular, buffer-aided relays enable significant gains in throughput as well as outage and error probability at the expense of an increased delay. These gains are introduced by adaptive link selection and/or adaptive transmission mode selection. We will first introduce the basic concept of buffer-aided relaying using the example of a simple three node one-way relay network before considering more complex networks such as relay-selection networks, multi-antenna relay networks, and two-way relay networks. We show that in some cases buffer-aided relaying protocols can double both the diversity gain and the throughput compared to conventional relaying protocols. Furthermore, in multi-antenna networks, buffer-aided relaying can also help to overcome the performance loss that half-duplex relays typically suffer compared to full-duplex relays.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"194 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":"124311954","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
扫码关注我们
求助内容：
应助结果提醒方式：