Pub Date : 2015-09-01DOI: 10.1109/CAMAD.2015.7390504
A. Salam, M. Luglio, C. Roseti, F. Zampognaro
DVB-RCS2 is conceived to improve satellite channel flexibility in supporting a vast gamut of applications. In particular, a Bandwidth on Demand (BoD) MAC profile is allowed for bulk transfers typical of Internet applications. As assessed for previous DVB-RCS systems, TCP performance is seriously impaired in this context mainly because of large latency, further inflated by BoD access delay. In addition, Web traffic became more and more bursty, so that the number of TCP connections results increased, while each connection manages a small amount of data. TCP Wave is a new protocol designed to transmit in burst instead of using Sliding Window concept with the objective to accelerate transmission of short transfers. This paper assesses TCP Wave performance in comparison with standard TCP mechanisms (i.e. TCP NewReno) over a realistic DVB-RCS2 implementation on the Ns-3. The main contribution herein provided is a first analysis of the actual DVB-S2/DVB-RCS2 operations on TCP-IP protocols.
{"title":"A burst-approach for transmission of TCP traffic over DVB-RCS2 links","authors":"A. Salam, M. Luglio, C. Roseti, F. Zampognaro","doi":"10.1109/CAMAD.2015.7390504","DOIUrl":"https://doi.org/10.1109/CAMAD.2015.7390504","url":null,"abstract":"DVB-RCS2 is conceived to improve satellite channel flexibility in supporting a vast gamut of applications. In particular, a Bandwidth on Demand (BoD) MAC profile is allowed for bulk transfers typical of Internet applications. As assessed for previous DVB-RCS systems, TCP performance is seriously impaired in this context mainly because of large latency, further inflated by BoD access delay. In addition, Web traffic became more and more bursty, so that the number of TCP connections results increased, while each connection manages a small amount of data. TCP Wave is a new protocol designed to transmit in burst instead of using Sliding Window concept with the objective to accelerate transmission of short transfers. This paper assesses TCP Wave performance in comparison with standard TCP mechanisms (i.e. TCP NewReno) over a realistic DVB-RCS2 implementation on the Ns-3. The main contribution herein provided is a first analysis of the actual DVB-S2/DVB-RCS2 operations on TCP-IP protocols.","PeriodicalId":370856,"journal":{"name":"2015 IEEE 20th International Workshop on Computer Aided Modelling and Design of Communication Links and Networks (CAMAD)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131579459","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 : 2015-09-01DOI: 10.1109/CAMAD.2015.7390487
Yiannos Kryftis, C. Mavromoustakis, G. Mastorakis, J. M. Batalla, P. Chatzimisios
This paper proposes a network architecture that goes a step beyond the current state-of-the-art, by elaborating on a novel resource reservation and provision scheme, through a Media Distribution Middleware (MDM), that is based on a Resource Prediction Engine (RPE) leading to both high resource utilization and quality guarantees. The architecture defines management planes and software components that provide the mechanisms for collecting monitoring data, predicting possible future values of the network metrics and resources usage, and applying management decisions to keep the provision optimal. The proposed research approach is based on novel time series and epidemic spread models, and the outcome is used for the optimal distribution of streaming data, among Content Delivery Networks, cloud-based providers and Home Media Gateways. The proposed epidemic diseases model adopts the characteristics of the multimedia content delivery over the network architecture. In this context, the paper aims to present the advantages of using such models, by presenting and analyzing an epidemic spread scheme for Video on Demand (VoD) delivery, to predict future epidemic spread behavior. The validity of the proposed system is verified through several sets of extended experimental simulation tests, carried out under controlled simulation conditions.
本文提出了一种超越当前技术水平的网络架构，通过基于资源预测引擎(RPE)的媒体分发中间件(MDM)详细阐述了一种新的资源预留和供应方案，从而实现了高资源利用率和质量保证。该体系结构定义了管理平面和软件组件，这些组件提供了收集监视数据的机制，预测网络度量和资源使用的未来可能值，并应用管理决策以保持供应的最佳状态。所提出的研究方法基于新颖的时间序列和流行病传播模型，其结果用于内容交付网络、基于云的提供商和家庭媒体网关之间流数据的最佳分配。提出的传染病模型采用了网络架构下多媒体内容传递的特点。在此背景下，本文旨在通过提出和分析视频点播(Video on Demand, VoD)的一种流行病传播方案来预测未来的流行病传播行为，从而展示使用这种模型的优势。通过在受控仿真条件下进行的几组扩展实验仿真测试，验证了所提出系统的有效性。
{"title":"Epidemic models using Resource Prediction mechanism for optimal provision of multimedia services","authors":"Yiannos Kryftis, C. Mavromoustakis, G. Mastorakis, J. M. Batalla, P. Chatzimisios","doi":"10.1109/CAMAD.2015.7390487","DOIUrl":"https://doi.org/10.1109/CAMAD.2015.7390487","url":null,"abstract":"This paper proposes a network architecture that goes a step beyond the current state-of-the-art, by elaborating on a novel resource reservation and provision scheme, through a Media Distribution Middleware (MDM), that is based on a Resource Prediction Engine (RPE) leading to both high resource utilization and quality guarantees. The architecture defines management planes and software components that provide the mechanisms for collecting monitoring data, predicting possible future values of the network metrics and resources usage, and applying management decisions to keep the provision optimal. The proposed research approach is based on novel time series and epidemic spread models, and the outcome is used for the optimal distribution of streaming data, among Content Delivery Networks, cloud-based providers and Home Media Gateways. The proposed epidemic diseases model adopts the characteristics of the multimedia content delivery over the network architecture. In this context, the paper aims to present the advantages of using such models, by presenting and analyzing an epidemic spread scheme for Video on Demand (VoD) delivery, to predict future epidemic spread behavior. The validity of the proposed system is verified through several sets of extended experimental simulation tests, carried out under controlled simulation conditions.","PeriodicalId":370856,"journal":{"name":"2015 IEEE 20th International Workshop on Computer Aided Modelling and Design of Communication Links and Networks (CAMAD)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129610906","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 : 2015-09-01DOI: 10.1109/CAMAD.2015.7390480
S. Dzulkifly, L. Giupponi, F. Said, M. Dohler
Fractional power control (FPC) is the simplified version of open loop power control (OLPC) in long term evolution (LTE) that relies on downlink path loss information from base station (BS). This allows user equipment (UE) to decide which power to use for uplink transmission. However, asymmetric behavior of uplink and downlink transmission in crowded network might cause unfair transmit power estimation. This motivates our investigation of implementing uplink path loss and q-learning algorithm to enable UE to decide appropriate transmit power on its own. In this study we apply the concept of FPC into q-learning, enabling UE to find suitable transmit power with respect to uplink path loss. 3GPP uplink path loss model is exploited in our study. We compare outputs between our proposed method and FPC. . From simulation, we find out that DQL performs better as compared to fractional power control in terms of signal-to-interference-noise-ratio (SINR) with average increase factor of 3.5.
{"title":"Decentralized Q-learning for uplink power control","authors":"S. Dzulkifly, L. Giupponi, F. Said, M. Dohler","doi":"10.1109/CAMAD.2015.7390480","DOIUrl":"https://doi.org/10.1109/CAMAD.2015.7390480","url":null,"abstract":"Fractional power control (FPC) is the simplified version of open loop power control (OLPC) in long term evolution (LTE) that relies on downlink path loss information from base station (BS). This allows user equipment (UE) to decide which power to use for uplink transmission. However, asymmetric behavior of uplink and downlink transmission in crowded network might cause unfair transmit power estimation. This motivates our investigation of implementing uplink path loss and q-learning algorithm to enable UE to decide appropriate transmit power on its own. In this study we apply the concept of FPC into q-learning, enabling UE to find suitable transmit power with respect to uplink path loss. 3GPP uplink path loss model is exploited in our study. We compare outputs between our proposed method and FPC. . From simulation, we find out that DQL performs better as compared to fractional power control in terms of signal-to-interference-noise-ratio (SINR) with average increase factor of 3.5.","PeriodicalId":370856,"journal":{"name":"2015 IEEE 20th International Workshop on Computer Aided Modelling and Design of Communication Links and Networks (CAMAD)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127187548","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 : 2015-09-01DOI: 10.1109/CAMAD.2015.7390524
Shen Qian, M. Juntti, T. Matsumoto
The primary objective of this paper is to make a performance comparison in terms of outage probability between decode-and-forward with joint decoding (DF-JD) and lossy-forward (LF) techniques. With DF-JD, only if the relay's received information sequence can be decoded with an arbitrarily low error probability, it is forwarded to the destination. On the contrary, with LF, the relay node always forwards decoded information sequence to the destination even if a decoding error is detected. Interleaving is used at relay and joint decoding is utilized at the destination to exploit the source-relay correlation for both techniques. The outage probability of conventional DF system with maximum ratio combining (DF-MRC) performed at the destination is also presented. Asymmetric statistical properties of the fading variations for each link are taken into account. It is shown that regardless of the presence of line-of-sight component, the outage probability with LF relay system is significantly smaller than that with DF-JD and DF-MRC relay systems. The impact of the per-link spectrum efficiency, representing the modulation multiplicity and channel coding rate, on outage probability is also investigated. It is found that, given that the specified per-link spectrum efficiency is satisfied, LF relay system always achieves lower outage performance than that with DF-JD and DF-MRC systems. The accuracy of the analytical results are verified by a series of Monte Carlo simulations.
{"title":"A comparative study on outage probabilities of decode-and-forward and lossy-forward relay techniques","authors":"Shen Qian, M. Juntti, T. Matsumoto","doi":"10.1109/CAMAD.2015.7390524","DOIUrl":"https://doi.org/10.1109/CAMAD.2015.7390524","url":null,"abstract":"The primary objective of this paper is to make a performance comparison in terms of outage probability between decode-and-forward with joint decoding (DF-JD) and lossy-forward (LF) techniques. With DF-JD, only if the relay's received information sequence can be decoded with an arbitrarily low error probability, it is forwarded to the destination. On the contrary, with LF, the relay node always forwards decoded information sequence to the destination even if a decoding error is detected. Interleaving is used at relay and joint decoding is utilized at the destination to exploit the source-relay correlation for both techniques. The outage probability of conventional DF system with maximum ratio combining (DF-MRC) performed at the destination is also presented. Asymmetric statistical properties of the fading variations for each link are taken into account. It is shown that regardless of the presence of line-of-sight component, the outage probability with LF relay system is significantly smaller than that with DF-JD and DF-MRC relay systems. The impact of the per-link spectrum efficiency, representing the modulation multiplicity and channel coding rate, on outage probability is also investigated. It is found that, given that the specified per-link spectrum efficiency is satisfied, LF relay system always achieves lower outage performance than that with DF-JD and DF-MRC systems. The accuracy of the analytical results are verified by a series of Monte Carlo simulations.","PeriodicalId":370856,"journal":{"name":"2015 IEEE 20th International Workshop on Computer Aided Modelling and Design of Communication Links and Networks (CAMAD)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128593271","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 : 2015-09-01DOI: 10.1109/CAMAD.2015.7390511
A. Dudnikova, P. Dini, L. Giupponi, D. Panno
The growth in mobile traffic demand is leading to a dense heterogeneous cellular network. This massive deployment of mobile equipment (i.e. base stations) may cause a high increment of the network energy consumption and therefore operational expenditure for operators. One of the most promising techniques to save energy (and costs) is to switch off some underutilized cells during off peak hours. In this line, our focus is to optimize the number of base stations in dense LTE pico cell deployments in order to maximize the energy saving, while satisfying the Quality of Service constraints. We use a combination of Fuzzy Logic, Grey Relational Analysis and Analytic Hierarchy Process tools to trigger the switch off actions, and jointly consider multiple decision inputs for each cell.
{"title":"Fuzzy multiple criteria switch off method for dense heterogeneous networks","authors":"A. Dudnikova, P. Dini, L. Giupponi, D. Panno","doi":"10.1109/CAMAD.2015.7390511","DOIUrl":"https://doi.org/10.1109/CAMAD.2015.7390511","url":null,"abstract":"The growth in mobile traffic demand is leading to a dense heterogeneous cellular network. This massive deployment of mobile equipment (i.e. base stations) may cause a high increment of the network energy consumption and therefore operational expenditure for operators. One of the most promising techniques to save energy (and costs) is to switch off some underutilized cells during off peak hours. In this line, our focus is to optimize the number of base stations in dense LTE pico cell deployments in order to maximize the energy saving, while satisfying the Quality of Service constraints. We use a combination of Fuzzy Logic, Grey Relational Analysis and Analytic Hierarchy Process tools to trigger the switch off actions, and jointly consider multiple decision inputs for each cell.","PeriodicalId":370856,"journal":{"name":"2015 IEEE 20th International Workshop on Computer Aided Modelling and Design of Communication Links and Networks (CAMAD)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128447650","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 : 2015-09-01DOI: 10.1109/CAMAD.2015.7390502
Jalaluddin Qureshi, A. Malik
It is a well-known result that constructing code-words over GF(2) to minimize the number of transmissions for a single-hop wireless multicasting is an NP-complete problem. Linearly independent codewords can be constructed in polynomial time for all the n clients, known as maximum distance separable (MDS) code, when the finite field size q is larger than or equal to the number of clients, q ≥ n. In this paper we quantify the exact minimum number of transmissions for a multicast network using erasure code when q = 2 and n = 3, such that q <; n. We first show that the use of Markov chain model to derive the minimum number of transmissions for such a network is limited for very small number of input packets. We then use combinatorial approach to derive an upper bound on the exact minimum number of transmissions. Our results show that the difference between the expected number of transmissions using XOR coding and MDS coding is negligible for n = 3.
{"title":"Throughput bound of XOR coded wireless multicasting to three clients","authors":"Jalaluddin Qureshi, A. Malik","doi":"10.1109/CAMAD.2015.7390502","DOIUrl":"https://doi.org/10.1109/CAMAD.2015.7390502","url":null,"abstract":"It is a well-known result that constructing code-words over GF(2) to minimize the number of transmissions for a single-hop wireless multicasting is an NP-complete problem. Linearly independent codewords can be constructed in polynomial time for all the n clients, known as maximum distance separable (MDS) code, when the finite field size q is larger than or equal to the number of clients, q ≥ n. In this paper we quantify the exact minimum number of transmissions for a multicast network using erasure code when q = 2 and n = 3, such that q <; n. We first show that the use of Markov chain model to derive the minimum number of transmissions for such a network is limited for very small number of input packets. We then use combinatorial approach to derive an upper bound on the exact minimum number of transmissions. Our results show that the difference between the expected number of transmissions using XOR coding and MDS coding is negligible for n = 3.","PeriodicalId":370856,"journal":{"name":"2015 IEEE 20th International Workshop on Computer Aided Modelling and Design of Communication Links and Networks (CAMAD)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132564484","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 : 2015-09-01DOI: 10.1109/CAMAD.2015.7390496
D. Speight, D. Titz, C. Luxey, W. Whittow
This paper presents working prototypes of an embroidered, wearable antenna. The ‘Bratenna’ as the name suggests is designed to be embroidered into a bra. The basic theory behind the use of a curved dipole antenna is presented and elaborated in the form of the curved wires of a bra. A prototype antenna is embroidered and measured, and the measured results in free space and on the body are compared with simulated results. Sufficient bandwidth and impedance matching is found around the 2.4 GHz band. A commercial sensor has been modified to include the embroidered antenna and an increase in read range was achieved compared the conventional antenna.
{"title":"Compact linear embroidered antenna research (CLEAR)","authors":"D. Speight, D. Titz, C. Luxey, W. Whittow","doi":"10.1109/CAMAD.2015.7390496","DOIUrl":"https://doi.org/10.1109/CAMAD.2015.7390496","url":null,"abstract":"This paper presents working prototypes of an embroidered, wearable antenna. The ‘Bratenna’ as the name suggests is designed to be embroidered into a bra. The basic theory behind the use of a curved dipole antenna is presented and elaborated in the form of the curved wires of a bra. A prototype antenna is embroidered and measured, and the measured results in free space and on the body are compared with simulated results. Sufficient bandwidth and impedance matching is found around the 2.4 GHz band. A commercial sensor has been modified to include the embroidered antenna and an increase in read range was achieved compared the conventional antenna.","PeriodicalId":370856,"journal":{"name":"2015 IEEE 20th International Workshop on Computer Aided Modelling and Design of Communication Links and Networks (CAMAD)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132721138","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 : 2015-09-01DOI: 10.1109/CAMAD.2015.7390516
R. Kiyumi, S. Vural, C. Foh, R. Tafazolli
The IEEE 802.15.4 protocol is widely adopted as the MAC sub-layer standard for wireless sensor networks, with two available modes: beacon-enabled and non-beacon-enabled. The non-beacon-enabled mode is simpler and does not require time synchronisation; however, it lacks an explicit energy saving mechanism that is crucial for its deployment on energy-constrained sensors. This paper proposes a distributed sleep mechanism for non-beacon-enabled IEEE 802.15.4 networks which provides energy savings to energy-limited nodes. The proposed mechanism introduces a sleep state that follows each successful packet transmission. Besides energy savings, the mechanism produces a traffic shaping effect that reduces the overall contention in the network, effectively improving packet delivery ratio. Based on traffic arrival rate and the level of network contention, a node can adjust its sleep period to achieve the highest packet delivery ratio. Performance results obtained by ns3 simulations validate these improvements as compared to the IEEE 802.15.4 standard.
{"title":"A distributed sleep mechanism for energy-efficiency in non-beacon-enabled IEEE 802.15.4 networks","authors":"R. Kiyumi, S. Vural, C. Foh, R. Tafazolli","doi":"10.1109/CAMAD.2015.7390516","DOIUrl":"https://doi.org/10.1109/CAMAD.2015.7390516","url":null,"abstract":"The IEEE 802.15.4 protocol is widely adopted as the MAC sub-layer standard for wireless sensor networks, with two available modes: beacon-enabled and non-beacon-enabled. The non-beacon-enabled mode is simpler and does not require time synchronisation; however, it lacks an explicit energy saving mechanism that is crucial for its deployment on energy-constrained sensors. This paper proposes a distributed sleep mechanism for non-beacon-enabled IEEE 802.15.4 networks which provides energy savings to energy-limited nodes. The proposed mechanism introduces a sleep state that follows each successful packet transmission. Besides energy savings, the mechanism produces a traffic shaping effect that reduces the overall contention in the network, effectively improving packet delivery ratio. Based on traffic arrival rate and the level of network contention, a node can adjust its sleep period to achieve the highest packet delivery ratio. Performance results obtained by ns3 simulations validate these improvements as compared to the IEEE 802.15.4 standard.","PeriodicalId":370856,"journal":{"name":"2015 IEEE 20th International Workshop on Computer Aided Modelling and Design of Communication Links and Networks (CAMAD)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132216838","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 : 2015-09-01DOI: 10.1109/CAMAD.2015.7390474
T. Vermeulen, Fernando Rosas, B. V. Liempd, M. Verhelst, S. Pollin
In-band full duplex (IBFD) is a promising technique that allows to potentially double the achievable bi-directional throughput over a given bandwidth. Moreover, it has been estimated that IBFD-equipped wireless networks can be more energy-efficient than half duplex ones due to the reduced energy cost of packet collisions. However, one key challenge for implementing an energy-efficient IBFD system is the cancellation of the interference produced by the transmitted signal. In fact, existing self-interference cancellation (SIC) techniques are not always energy-efficient, as the effect of the interference reduction might not be able to compensate the additional electronic power consumption introduced by the SIC module. Following this rationale, in this paper we propose and energy-efficient IBFD architecture that adapts the SIC module to the link conditions. By studying a symmetric bi-directional full duplex link, we show that the proposed architecture obtains significant energy savings by using a simple SIC scheme for short-range transmissions. More powerful SIC techniques are shown to be an energy-optimal choice only when transmitting over long link distances.
{"title":"An energy-scalable in-band full duplex architecture","authors":"T. Vermeulen, Fernando Rosas, B. V. Liempd, M. Verhelst, S. Pollin","doi":"10.1109/CAMAD.2015.7390474","DOIUrl":"https://doi.org/10.1109/CAMAD.2015.7390474","url":null,"abstract":"In-band full duplex (IBFD) is a promising technique that allows to potentially double the achievable bi-directional throughput over a given bandwidth. Moreover, it has been estimated that IBFD-equipped wireless networks can be more energy-efficient than half duplex ones due to the reduced energy cost of packet collisions. However, one key challenge for implementing an energy-efficient IBFD system is the cancellation of the interference produced by the transmitted signal. In fact, existing self-interference cancellation (SIC) techniques are not always energy-efficient, as the effect of the interference reduction might not be able to compensate the additional electronic power consumption introduced by the SIC module. Following this rationale, in this paper we propose and energy-efficient IBFD architecture that adapts the SIC module to the link conditions. By studying a symmetric bi-directional full duplex link, we show that the proposed architecture obtains significant energy savings by using a simple SIC scheme for short-range transmissions. More powerful SIC techniques are shown to be an energy-optimal choice only when transmitting over long link distances.","PeriodicalId":370856,"journal":{"name":"2015 IEEE 20th International Workshop on Computer Aided Modelling and Design of Communication Links and Networks (CAMAD)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130032277","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 : 2015-09-01DOI: 10.1109/CAMAD.2015.7390530
Ramtin Rabiee, K. H. Li
In a medium-traffic primary network, primary user (PU) changes its state (either idle or active) at most once during a frame period, resulting in the performance degradation of the secondary network. In this work, we evaluate the performance of the proposed improved double-threshold energy detector (IDED) in the case of cooperative spectrum sensing (CSS) when the secondary users (SUs) suffer from a medium-traffic primary network over Rayleigh-faded sensing and imperfect reporting channels. Numerical results show that the IDED outperforms conventional methods.
{"title":"Cooperative IDED in a medium-traffic primary network over Rayleigh-faded sensing channels","authors":"Ramtin Rabiee, K. H. Li","doi":"10.1109/CAMAD.2015.7390530","DOIUrl":"https://doi.org/10.1109/CAMAD.2015.7390530","url":null,"abstract":"In a medium-traffic primary network, primary user (PU) changes its state (either idle or active) at most once during a frame period, resulting in the performance degradation of the secondary network. In this work, we evaluate the performance of the proposed improved double-threshold energy detector (IDED) in the case of cooperative spectrum sensing (CSS) when the secondary users (SUs) suffer from a medium-traffic primary network over Rayleigh-faded sensing and imperfect reporting channels. Numerical results show that the IDED outperforms conventional methods.","PeriodicalId":370856,"journal":{"name":"2015 IEEE 20th International Workshop on Computer Aided Modelling and Design of Communication Links and Networks (CAMAD)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130651921","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
扫码关注我们
求助内容：
应助结果提醒方式：