Pub Date : 2014-10-23DOI: 10.1109/ISWCS.2014.6933352
Daniel Papsdorf, R. S. Ganesan, Xiang Li, T. Weber, A. Klein
In this paper, a network consisting of several partially connected subnetworks where each subnetwork includes one relay is considered. “Partially connected” means that not all nodes are connected to all relays. Some nodes may be connected to multiple relays. The entire bidirectional pair-wise communication between the nodes takes place via the intermediate half-duplex amplify-and-forward relays, considering two-way relaying. The algorithm proposed in this paper is a closed-form solution which requires only local channel state information (CSI) to achieve interference alignment. The properness condition for the proposed algorithm is derived. The process of interference alignment is decomposed into signal alignment, channel alignment and transceive zero forcing. It is shown that all subnetworks can be investigated separately. This means the whole problem can be divided into subproblems. The simulation results show that the degrees of freedom increase for the considered partially connected network in comparison with the fully connected version of the considered network.
{"title":"Combining interference alignment and two-way relaying in partially connected networks with only local CSI","authors":"Daniel Papsdorf, R. S. Ganesan, Xiang Li, T. Weber, A. Klein","doi":"10.1109/ISWCS.2014.6933352","DOIUrl":"https://doi.org/10.1109/ISWCS.2014.6933352","url":null,"abstract":"In this paper, a network consisting of several partially connected subnetworks where each subnetwork includes one relay is considered. “Partially connected” means that not all nodes are connected to all relays. Some nodes may be connected to multiple relays. The entire bidirectional pair-wise communication between the nodes takes place via the intermediate half-duplex amplify-and-forward relays, considering two-way relaying. The algorithm proposed in this paper is a closed-form solution which requires only local channel state information (CSI) to achieve interference alignment. The properness condition for the proposed algorithm is derived. The process of interference alignment is decomposed into signal alignment, channel alignment and transceive zero forcing. It is shown that all subnetworks can be investigated separately. This means the whole problem can be divided into subproblems. The simulation results show that the degrees of freedom increase for the considered partially connected network in comparison with the fully connected version of the considered network.","PeriodicalId":431852,"journal":{"name":"2014 11th International Symposium on Wireless Communications Systems (ISWCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117191348","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 : 2014-10-23DOI: 10.1109/ISWCS.2014.6933445
L. Baltar, A. Mezghani, J. Nossek
Spectrally efficient channel impulse response (CIR) estimation in the sense of minimal training overhead is a key issue for the successful deployment of Filter Bank Multicarrier (FBMC) with Offset Quadrature Amplitude Modulation (OQAM). In this contribution we perform a comparison between channel estimation algorithms considering two different models for the received subcarrier signals: a per-subcarrier narrowband and a broadband channel model. We also consider three cases of spectrally efficient channel estimation by employing different training sequence occupation of the subcarriers.
{"title":"Spectral efficient channel estimation algorithms for FBMC/OQAM systems: A comparison","authors":"L. Baltar, A. Mezghani, J. Nossek","doi":"10.1109/ISWCS.2014.6933445","DOIUrl":"https://doi.org/10.1109/ISWCS.2014.6933445","url":null,"abstract":"Spectrally efficient channel impulse response (CIR) estimation in the sense of minimal training overhead is a key issue for the successful deployment of Filter Bank Multicarrier (FBMC) with Offset Quadrature Amplitude Modulation (OQAM). In this contribution we perform a comparison between channel estimation algorithms considering two different models for the received subcarrier signals: a per-subcarrier narrowband and a broadband channel model. We also consider three cases of spectrally efficient channel estimation by employing different training sequence occupation of the subcarriers.","PeriodicalId":431852,"journal":{"name":"2014 11th International Symposium on Wireless Communications Systems (ISWCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122148230","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 : 2014-10-23DOI: 10.1109/ISWCS.2014.6933416
Marwa Chami, M. Pischella, D. L. Ruyet
This paper proposes a new underlay cooperative cognitive radio system, where a paid cooperation between the primary and the secondary systems is allowed. We consider both decoding strategy at the secondary receiver and the power efficiency optimization problem, in order to maximize the rate of the cognitive system. The secondary user has to communicate to the receiver in the presence of primary transmission, under two constraints: the total budget of power and the interference limit at the primary user. In this paper, we investigate the utility to optimally distribute the maximum allowed power with Gradient Descent method, when the Superposition Coding strategy is applied at the secondary system. The decoding strategy is a heuristic method that aims to maximize the sum rate of both the primary and the secondary users, taking into account the interweave and underlay cognitive radio constraints.
{"title":"Optimal power control for cooperative underlay cognitive system","authors":"Marwa Chami, M. Pischella, D. L. Ruyet","doi":"10.1109/ISWCS.2014.6933416","DOIUrl":"https://doi.org/10.1109/ISWCS.2014.6933416","url":null,"abstract":"This paper proposes a new underlay cooperative cognitive radio system, where a paid cooperation between the primary and the secondary systems is allowed. We consider both decoding strategy at the secondary receiver and the power efficiency optimization problem, in order to maximize the rate of the cognitive system. The secondary user has to communicate to the receiver in the presence of primary transmission, under two constraints: the total budget of power and the interference limit at the primary user. In this paper, we investigate the utility to optimally distribute the maximum allowed power with Gradient Descent method, when the Superposition Coding strategy is applied at the secondary system. The decoding strategy is a heuristic method that aims to maximize the sum rate of both the primary and the secondary users, taking into account the interweave and underlay cognitive radio constraints.","PeriodicalId":431852,"journal":{"name":"2014 11th International Symposium on Wireless Communications Systems (ISWCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126092842","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 : 2014-10-23DOI: 10.1109/ISWCS.2014.6933391
Takumi Matsunaga, Kentaroh Toyoda, I. Sasase
The IPv6 Routing Protocol for Low-power and Lossy networks (RPL) is a standard routing protocol to realize the Internet of Things (IoT). In order to realize secure IoT network, the Destination-Oriented Directed Acyclic Graph (DODAG) root collects information such as neighbor and parent ranks in each node and then observes network consistency by comparing a rank that a node sends to DODAG root with the rank that the same node sends to its neighbor nodes. However, the scheme has a problem that false detection rate is high since the DODAG root might compare a certain node's rank after update with its rank that its node sends to its neighbor nodes before update due to timing inconstancy between rank measurements. In this paper, we propose a low false alarm rate RPL network monitoring system by considering timing inconstancy between rank measurements. In the proposed scheme, each node sends ranks at the time when each node broadcasts the latest rank to the DODAG root so as to avoid inherent timing inconstancy, and each node attaches a timestamp at the time when each node sends and receives ranks and then sends the timestamp to the DODAG root in order to take timing inconstancy into consideration. We evaluate the false detection rates by computer simulation and we show that the proposed scheme reduces the false detection rate in comparison with the conventional scheme.
IPv6 RPL (Routing Protocol for Low-power and Lossy networks)是实现物联网的标准路由协议。为了实现安全的物联网网络，DODAG (Destination-Oriented Directed Acyclic Graph)根节点在每个节点中收集邻居和父节点的排名等信息，然后通过比较一个节点发送给DODAG根节点的排名与该节点发送给其邻居节点的排名来观察网络的一致性。然而，由于秩测量之间的时间不恒定，DODAG根可能会将某个节点更新后的秩与更新前该节点发送给相邻节点的秩进行比较，因此该方案存在误检率高的问题。本文提出了一种考虑秩次测量间时序不恒定的低虚警率RPL网络监测系统。在该方案中，每个节点在每个节点向DODAG根广播最新排名的时间发送排名，以避免固有的时间不恒定，并且每个节点在每个节点发送和接收排名的时间附加一个时间戳，然后将时间戳发送给DODAG根，以考虑时间不恒定。通过计算机仿真评估了该方案的误检率，结果表明，与传统方案相比，该方案降低了误检率。
{"title":"Low false alarm rate RPL network monitoring system by considering timing inconstancy between the rank measurements","authors":"Takumi Matsunaga, Kentaroh Toyoda, I. Sasase","doi":"10.1109/ISWCS.2014.6933391","DOIUrl":"https://doi.org/10.1109/ISWCS.2014.6933391","url":null,"abstract":"The IPv6 Routing Protocol for Low-power and Lossy networks (RPL) is a standard routing protocol to realize the Internet of Things (IoT). In order to realize secure IoT network, the Destination-Oriented Directed Acyclic Graph (DODAG) root collects information such as neighbor and parent ranks in each node and then observes network consistency by comparing a rank that a node sends to DODAG root with the rank that the same node sends to its neighbor nodes. However, the scheme has a problem that false detection rate is high since the DODAG root might compare a certain node's rank after update with its rank that its node sends to its neighbor nodes before update due to timing inconstancy between rank measurements. In this paper, we propose a low false alarm rate RPL network monitoring system by considering timing inconstancy between rank measurements. In the proposed scheme, each node sends ranks at the time when each node broadcasts the latest rank to the DODAG root so as to avoid inherent timing inconstancy, and each node attaches a timestamp at the time when each node sends and receives ranks and then sends the timestamp to the DODAG root in order to take timing inconstancy into consideration. We evaluate the false detection rates by computer simulation and we show that the proposed scheme reduces the false detection rate in comparison with the conventional scheme.","PeriodicalId":431852,"journal":{"name":"2014 11th International Symposium on Wireless Communications Systems (ISWCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130441940","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 : 2014-10-23DOI: 10.1109/ISWCS.2014.6933383
C. Reinsch, Qi Wang, Ansgar R. S. Gerlicher, C. Grecos
Service discovery in vehicular networks has been extensively investigated in literature. Collecting and disseminating data in high mobility networks in a reliable and efficient way without exhausting network bandwidth is still challenging, due to unreliable channel access in broadcast scenarios and thus results in loss of time through resending packets. Sending delta information to reduce network traffic, grouping vehicles of same direction and velocity into clusters, performing multiplexing to access the shared wireless network channel are interesting existing approaches in vehicular networks. Discovery protocols do not profit from a combination of those techniques yet. This paper proposes the High Mobility Gossip-Konark for high mobility vehicular networks. Simulations underline the proposed design.
{"title":"Accelerated service discovery in vehicular networks","authors":"C. Reinsch, Qi Wang, Ansgar R. S. Gerlicher, C. Grecos","doi":"10.1109/ISWCS.2014.6933383","DOIUrl":"https://doi.org/10.1109/ISWCS.2014.6933383","url":null,"abstract":"Service discovery in vehicular networks has been extensively investigated in literature. Collecting and disseminating data in high mobility networks in a reliable and efficient way without exhausting network bandwidth is still challenging, due to unreliable channel access in broadcast scenarios and thus results in loss of time through resending packets. Sending delta information to reduce network traffic, grouping vehicles of same direction and velocity into clusters, performing multiplexing to access the shared wireless network channel are interesting existing approaches in vehicular networks. Discovery protocols do not profit from a combination of those techniques yet. This paper proposes the High Mobility Gossip-Konark for high mobility vehicular networks. Simulations underline the proposed design.","PeriodicalId":431852,"journal":{"name":"2014 11th International Symposium on Wireless Communications Systems (ISWCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130549107","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 : 2014-10-23DOI: 10.1109/ISWCS.2014.6933433
Y. Medjahdi, D. L. Ruyet, F. Bader, L. Martinod
This paper focuses on the use of Long Term Evolution (LTE) broadband system in coexistence with currently deployed Professional Mobile Radio (PMR) communication systems. The coexistence capabilities are analyzed using of an LTE like based system with Orthogonal Frequency Division Multiplexing (OFDM) and Filter Bank MultiCarrier (FBMC) physical layers. Obtained results show that, in order to achieve the LTE-PMR coexistence, we need to filter the synthesized OFDM signal. This filtering is made to protect the PMR (TETRA, TETRAPOL, TETRA TEDS standards, etc.) systems by reducing the sidelobes levels due the use of modulated OFDM scheme. On the other hand, the FBMC signal fits perfectly the LTE-TEDS harmful interference protection requirements starting from the minimum frequency offset allowed by the TEDS standard mask. This can be explained by the fact that a good frequency localization is achieved by the prototype filter used in the FBMC scheme.
{"title":"Integrating LTE broadband system in PMR band: OFDM vs. FBMC coexistence capabilities and performances","authors":"Y. Medjahdi, D. L. Ruyet, F. Bader, L. Martinod","doi":"10.1109/ISWCS.2014.6933433","DOIUrl":"https://doi.org/10.1109/ISWCS.2014.6933433","url":null,"abstract":"This paper focuses on the use of Long Term Evolution (LTE) broadband system in coexistence with currently deployed Professional Mobile Radio (PMR) communication systems. The coexistence capabilities are analyzed using of an LTE like based system with Orthogonal Frequency Division Multiplexing (OFDM) and Filter Bank MultiCarrier (FBMC) physical layers. Obtained results show that, in order to achieve the LTE-PMR coexistence, we need to filter the synthesized OFDM signal. This filtering is made to protect the PMR (TETRA, TETRAPOL, TETRA TEDS standards, etc.) systems by reducing the sidelobes levels due the use of modulated OFDM scheme. On the other hand, the FBMC signal fits perfectly the LTE-TEDS harmful interference protection requirements starting from the minimum frequency offset allowed by the TEDS standard mask. This can be explained by the fact that a good frequency localization is achieved by the prototype filter used in the FBMC scheme.","PeriodicalId":431852,"journal":{"name":"2014 11th International Symposium on Wireless Communications Systems (ISWCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131234406","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 : 2014-10-23DOI: 10.1109/ISWCS.2014.6933487
S. Samarakoon, M. Bennis, W. Saad, M. Latva-aho
In this paper, a novel cluster-based approach for optimizing the energy efficiency of wireless small cell networks is proposed. A dynamic mechanism based on the spectral clustering technique is proposed to dynamically form clusters of small cell base stations. Such clustering enables intra-cluster coordination among the base stations for optimizing the downlink performance through load balancing, while satisfying users' quality-of-service requirements. In the proposed approach, the clusters use an opportunistic base station sleep-wake switching mechanism to strike a balance between delay and energy consumption. The inter-cluster interference affects the performance of the clusters and their choices of active or sleep state. Due to the lack of inter-cluster communications, the clusters have to compete with each other to make decisions on improving the energy efficiency. This competition is formulated as a noncooperative game among the clusters that seek to minimize a cost function which captures the tradeoff between energy expenditure and load. To solve this game, a distributed learning algorithm is proposed using which the clusters autonomously choose their optimal transmission strategies. Simulation results show that the proposed approach yields significant performance gains in terms of reduced energy expenditures up to 40% and reduced load up to 23% compared to conventional approaches.
{"title":"Dynamic clustering and sleep mode strategies for small cell networks","authors":"S. Samarakoon, M. Bennis, W. Saad, M. Latva-aho","doi":"10.1109/ISWCS.2014.6933487","DOIUrl":"https://doi.org/10.1109/ISWCS.2014.6933487","url":null,"abstract":"In this paper, a novel cluster-based approach for optimizing the energy efficiency of wireless small cell networks is proposed. A dynamic mechanism based on the spectral clustering technique is proposed to dynamically form clusters of small cell base stations. Such clustering enables intra-cluster coordination among the base stations for optimizing the downlink performance through load balancing, while satisfying users' quality-of-service requirements. In the proposed approach, the clusters use an opportunistic base station sleep-wake switching mechanism to strike a balance between delay and energy consumption. The inter-cluster interference affects the performance of the clusters and their choices of active or sleep state. Due to the lack of inter-cluster communications, the clusters have to compete with each other to make decisions on improving the energy efficiency. This competition is formulated as a noncooperative game among the clusters that seek to minimize a cost function which captures the tradeoff between energy expenditure and load. To solve this game, a distributed learning algorithm is proposed using which the clusters autonomously choose their optimal transmission strategies. Simulation results show that the proposed approach yields significant performance gains in terms of reduced energy expenditures up to 40% and reduced load up to 23% compared to conventional approaches.","PeriodicalId":431852,"journal":{"name":"2014 11th International Symposium on Wireless Communications Systems (ISWCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131713751","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 : 2014-10-23DOI: 10.1109/ISWCS.2014.6933311
Rebal Al-Jurdi, G. Sayegh, Hawraa Salami, I. Abou-Faycal, F. Zaraket
One of the challenges in designing wireless ad-hoc broadcast networks is to minimize the total power consumed. While many studies are available in the literature, they all invariably ignore message corruption due to possible crosstalk with the inherent assumption of ideal division multiplexing. In this work, we develop an interference model and incorporate it in the problem formulation. This proposed model is based on incorporating an additional power cost that should be incurred by transmitting nodes to compensate for the effect of interference at the receiving nodes. We focus on the scenario where transmitting nodes share the same medium and use it at the same time. We compare the solutions with and without interference and analyze the applicability, benefits and shortcomings of each.
{"title":"Minimum power broadcast trees subject to interference","authors":"Rebal Al-Jurdi, G. Sayegh, Hawraa Salami, I. Abou-Faycal, F. Zaraket","doi":"10.1109/ISWCS.2014.6933311","DOIUrl":"https://doi.org/10.1109/ISWCS.2014.6933311","url":null,"abstract":"One of the challenges in designing wireless ad-hoc broadcast networks is to minimize the total power consumed. While many studies are available in the literature, they all invariably ignore message corruption due to possible crosstalk with the inherent assumption of ideal division multiplexing. In this work, we develop an interference model and incorporate it in the problem formulation. This proposed model is based on incorporating an additional power cost that should be incurred by transmitting nodes to compensate for the effect of interference at the receiving nodes. We focus on the scenario where transmitting nodes share the same medium and use it at the same time. We compare the solutions with and without interference and analyze the applicability, benefits and shortcomings of each.","PeriodicalId":431852,"journal":{"name":"2014 11th International Symposium on Wireless Communications Systems (ISWCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132093708","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 : 2014-10-23DOI: 10.1109/ISWCS.2014.6933411
Omid Taghizadeh, R. Mathar
In this paper we propose a design framework for a multi-user full-duplex (FD) relaying system, which operates with decode-and-forward (DF) protocol. Our study starts with defining a system model which encompasses the limits of a FD system to overcome its own loopback self-interference. Afterwards we present a fair design strategy for the defined system focusing on the case where perfect channel state information (CSI) is available at the relay. Furthermore, we generalize our solution to the case with erroneous CSI following the wost-case enhancement approach. In the end the proposed methods are evaluated via numerical simulations and the obtained gains are observed.
{"title":"Robust multi-user decode-and-forward relaying with full-duplex operation","authors":"Omid Taghizadeh, R. Mathar","doi":"10.1109/ISWCS.2014.6933411","DOIUrl":"https://doi.org/10.1109/ISWCS.2014.6933411","url":null,"abstract":"In this paper we propose a design framework for a multi-user full-duplex (FD) relaying system, which operates with decode-and-forward (DF) protocol. Our study starts with defining a system model which encompasses the limits of a FD system to overcome its own loopback self-interference. Afterwards we present a fair design strategy for the defined system focusing on the case where perfect channel state information (CSI) is available at the relay. Furthermore, we generalize our solution to the case with erroneous CSI following the wost-case enhancement approach. In the end the proposed methods are evaluated via numerical simulations and the obtained gains are observed.","PeriodicalId":431852,"journal":{"name":"2014 11th International Symposium on Wireless Communications Systems (ISWCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133971637","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 : 2014-10-23DOI: 10.1109/ISWCS.2014.6933332
Xiang Li, Hussein Al-Shatri, R. S. Ganesan, Daniel Papsdorf, A. Klein, T. Weber
In this paper, large partially connected wireless relay interference networks are considered. The entire network is made up of multiple disjoint groups of source-destination node pairs and relays called subnetworks. Each subnetwork is assumed to be fully connected. The different subnetworks are mutually connected by a few inter-subnetwork links. A two-hop relay-aided interference alignment scheme is applied to achieve interference-free communication in the whole network. The feasibility conditions for interference alignment in the considered networks are investigated. To this end, we extend the concept of external constraints, which was proposed in [1] for the two-subnetwork case, and characterize the proper relay antenna configurations in large networks with an arbitrary number of subnetworks.
{"title":"Relay-aided interference alignment for multiple partially connected subnetworks","authors":"Xiang Li, Hussein Al-Shatri, R. S. Ganesan, Daniel Papsdorf, A. Klein, T. Weber","doi":"10.1109/ISWCS.2014.6933332","DOIUrl":"https://doi.org/10.1109/ISWCS.2014.6933332","url":null,"abstract":"In this paper, large partially connected wireless relay interference networks are considered. The entire network is made up of multiple disjoint groups of source-destination node pairs and relays called subnetworks. Each subnetwork is assumed to be fully connected. The different subnetworks are mutually connected by a few inter-subnetwork links. A two-hop relay-aided interference alignment scheme is applied to achieve interference-free communication in the whole network. The feasibility conditions for interference alignment in the considered networks are investigated. To this end, we extend the concept of external constraints, which was proposed in [1] for the two-subnetwork case, and characterize the proper relay antenna configurations in large networks with an arbitrary number of subnetworks.","PeriodicalId":431852,"journal":{"name":"2014 11th International Symposium on Wireless Communications Systems (ISWCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134193311","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
扫码关注我们
求助内容：
应助结果提醒方式：