Pub Date : 2016-12-01DOI: 10.1109/ATNAC.2016.7878791
H. Nguyen, Thien Pham, Khanh Hoang, D. Nguyen, Eric Parsonage
In the past few years, significant progress has been made in using software defined networking to increase automation, improve network security, simplify network configuration and reduce human effort to establish and maintain the network. There are now a vast number of studies exploring how to utilise policies to achieve the above goals. In this paper, we apply policy defined networking to wireless access network functions. We describe the details of our prototype policy defined networking solution that automatically translates high-level policies into device level implementations. We develop a novel metagraph model that can be used for policy specification, verification and refinement. We show that sophisticated traffic engineering policies can be implemented automatically on commodity hardware using our framework.
{"title":"A prototype of policy defined wireless access networks","authors":"H. Nguyen, Thien Pham, Khanh Hoang, D. Nguyen, Eric Parsonage","doi":"10.1109/ATNAC.2016.7878791","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878791","url":null,"abstract":"In the past few years, significant progress has been made in using software defined networking to increase automation, improve network security, simplify network configuration and reduce human effort to establish and maintain the network. There are now a vast number of studies exploring how to utilise policies to achieve the above goals. In this paper, we apply policy defined networking to wireless access network functions. We describe the details of our prototype policy defined networking solution that automatically translates high-level policies into device level implementations. We develop a novel metagraph model that can be used for policy specification, verification and refinement. We show that sophisticated traffic engineering policies can be implemented automatically on commodity hardware using our framework.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124288091","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 : 2016-12-01DOI: 10.1109/ATNAC.2016.7878810
Mingkai Chen, Lei Wang, B. Zheng, Jingwu Cui
Device-to-device (D2D) communication has been widely studied to improve network performance and it has been considered as a potential technological component for the next generation of communication. Targeting the video distribution, a significant challenge in D2D communication network is to efficiently provide media services with the constraints of limited resources, user's mobility, opportunistic contact. In this paper, we have developed a distributed media service scheme based on QoE (Quality of Experience) model that jointly solves the content dissemination, cache update problems for cellular networks. Importantly, our work aims at achieving maximal users' MOS (Mean Opinion Score) by jointly considering media-aware, random walking models and epidemic model. Extensive simulation results have been provided, which demonstrate the effectiveness of our proposed schemes.
设备到设备(D2D)通信已被广泛研究，以提高网络性能，并被认为是下一代通信的潜在技术组成部分。针对视频分发，D2D通信网络面临的一个重大挑战是如何在资源有限、用户移动性、机会接触等条件下高效地提供媒体服务。本文提出了一种基于QoE (Quality of Experience)模型的分布式媒体服务方案，共同解决了蜂窝网络的内容传播、缓存更新问题。重要的是，我们的工作旨在通过联合考虑媒体感知模型、随机行走模型和流行病模型来实现最大的用户MOS (Mean Opinion Score)。大量的仿真结果证明了所提方案的有效性。
{"title":"Mobile media service distribution in device-to-device communication underlaying cellular networks","authors":"Mingkai Chen, Lei Wang, B. Zheng, Jingwu Cui","doi":"10.1109/ATNAC.2016.7878810","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878810","url":null,"abstract":"Device-to-device (D2D) communication has been widely studied to improve network performance and it has been considered as a potential technological component for the next generation of communication. Targeting the video distribution, a significant challenge in D2D communication network is to efficiently provide media services with the constraints of limited resources, user's mobility, opportunistic contact. In this paper, we have developed a distributed media service scheme based on QoE (Quality of Experience) model that jointly solves the content dissemination, cache update problems for cellular networks. Importantly, our work aims at achieving maximal users' MOS (Mean Opinion Score) by jointly considering media-aware, random walking models and epidemic model. Extensive simulation results have been provided, which demonstrate the effectiveness of our proposed schemes.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129794484","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 : 2016-12-01DOI: 10.1109/ATNAC.2016.7878785
D. Nguyen, H. Nguyen, L. White
Radio access technology (RAT) selection has recently received much attention from the research community due to the increasing deployment of heterogeneous wireless networks. Most prior works mainly focus on proposing an efficient algorithm that yields good performances, and evaluate their solutions on a certain network model, particularly in cases when every user can connect to all the available base stations (BSs). In this paper, we evaluate the impact of different aspects of network models, including (i) network topology and (ii) bandwidth allocation, on the performance of RAT selection algorithms to fully understand their limitations. Using simulations on realistic network models, this paper evaluates how different network parameters such as link density, user density or bandwidth distribution can lead to significant differences in algorithm performance. The paper demonstrates that among all the parameters, the performance of adaptive RAT selection algorithms are most significantly effected by the number of base stations that a user can connect to.
{"title":"Performance of adaptive RAT selection algorithms in 5G heterogeneous wireless networks","authors":"D. Nguyen, H. Nguyen, L. White","doi":"10.1109/ATNAC.2016.7878785","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878785","url":null,"abstract":"Radio access technology (RAT) selection has recently received much attention from the research community due to the increasing deployment of heterogeneous wireless networks. Most prior works mainly focus on proposing an efficient algorithm that yields good performances, and evaluate their solutions on a certain network model, particularly in cases when every user can connect to all the available base stations (BSs). In this paper, we evaluate the impact of different aspects of network models, including (i) network topology and (ii) bandwidth allocation, on the performance of RAT selection algorithms to fully understand their limitations. Using simulations on realistic network models, this paper evaluates how different network parameters such as link density, user density or bandwidth distribution can lead to significant differences in algorithm performance. The paper demonstrates that among all the parameters, the performance of adaptive RAT selection algorithms are most significantly effected by the number of base stations that a user can connect to.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125238098","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 : 2016-12-01DOI: 10.1109/ATNAC.2016.7878807
Ananda Maiti, Andrew D. Maxwell, A. Kist
Smart devices networks make the backbone of many Internet of Things (IoT) applications. The performance of these systems can be depended on many factors including response time or latency between them and the ability to interconnect between devices. In this paper, a Peer-to-peer (P2P) overlay network is discussed that can be used for real-time end-to-end remote instrumentation for IoT applications. P2P overlay networks are used for various purposes from content distribution through to media sharing. But in contrast to traditional P2P systems, IoT systems can be highly sensitive to network latency. The main contribution of this paper is a distributed algorithm to create the overlay network that assigns peer nodes to super-peer nodes in the network containing large numbers of smart devices with the aim of minimizing system wide network latency. Other constraints regarding the nodes ability to become a super-peer node such as connectivity and limited processing capacities of the smart devices are also considered in context of a P2P remote instrumentation system. The algorithm has been validated through simulation.
{"title":"Node allocation in Peer-to-peer overlay networks based remote instrumentation with smart devices","authors":"Ananda Maiti, Andrew D. Maxwell, A. Kist","doi":"10.1109/ATNAC.2016.7878807","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878807","url":null,"abstract":"Smart devices networks make the backbone of many Internet of Things (IoT) applications. The performance of these systems can be depended on many factors including response time or latency between them and the ability to interconnect between devices. In this paper, a Peer-to-peer (P2P) overlay network is discussed that can be used for real-time end-to-end remote instrumentation for IoT applications. P2P overlay networks are used for various purposes from content distribution through to media sharing. But in contrast to traditional P2P systems, IoT systems can be highly sensitive to network latency. The main contribution of this paper is a distributed algorithm to create the overlay network that assigns peer nodes to super-peer nodes in the network containing large numbers of smart devices with the aim of minimizing system wide network latency. Other constraints regarding the nodes ability to become a super-peer node such as connectivity and limited processing capacities of the smart devices are also considered in context of a P2P remote instrumentation system. The algorithm has been validated through simulation.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122449463","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 : 2016-12-01DOI: 10.1109/ATNAC.2016.7878816
Farzaneh Pakzad, S. Layeghy, M. Portmann
Mininet is a Linux-based network emulator that is particularly widely used for Software Defined Network experiments, due to its in-built support for OpenFlow switches. However, Mininet currently lacks support for wireless links. A recent work has addressed this limitation by using the real-time feature of ns-3 to integrate the IEEE 802.11 channel emulation feature with Mininet, which we refer to as Mininet-ns3-WiFi. While this approach has great potential to serve as an experimental platform, in particular for Software Defined Wireless Networks, it has not been extensively evaluated in terms of experiment result accuracy and fidelity. This is critical for any system that integrates simulation with real-time components. In this paper, we present a detailed evaluation of the fidelity of experimental results of Mininet-ns3-WiFi. We further present a reliable and low cost method that gives an experimenter an indicator about the fidelity and trustworthiness of the results.
{"title":"Evaluation of Mininet-WiFi integration via ns-3","authors":"Farzaneh Pakzad, S. Layeghy, M. Portmann","doi":"10.1109/ATNAC.2016.7878816","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878816","url":null,"abstract":"Mininet is a Linux-based network emulator that is particularly widely used for Software Defined Network experiments, due to its in-built support for OpenFlow switches. However, Mininet currently lacks support for wireless links. A recent work has addressed this limitation by using the real-time feature of ns-3 to integrate the IEEE 802.11 channel emulation feature with Mininet, which we refer to as Mininet-ns3-WiFi. While this approach has great potential to serve as an experimental platform, in particular for Software Defined Wireless Networks, it has not been extensively evaluated in terms of experiment result accuracy and fidelity. This is critical for any system that integrates simulation with real-time components. In this paper, we present a detailed evaluation of the fidelity of experimental results of Mininet-ns3-WiFi. We further present a reliable and low cost method that gives an experimenter an indicator about the fidelity and trustworthiness of the results.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"207 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115984066","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 : 2016-12-01DOI: 10.1109/ATNAC.2016.7878784
A. Willig, Yakir Matusovsky, A. Kind
We consider the scheduling of retransmissions in the low-latency deterministic network (LLDN) extension to the IEEE 802.15.4 standard. We propose a number of retransmission schemes with varying degree of required changes to the LLDN specification. In particular, we propose a retransmission scheme which uses cooperative relayers and where the best relayer for a source node is learned using reinforcement-learning method. The method allows to adapt relayer selections in face of time-varying channels. Our results show that the relayer-based methods achieve a much better reliability over the other methods, both over static (but unknown) and over time-varying channels.
{"title":"Retransmission scheduling in 802.15.4e LLDN - a reinforcement learning approach with relayers","authors":"A. Willig, Yakir Matusovsky, A. Kind","doi":"10.1109/ATNAC.2016.7878784","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878784","url":null,"abstract":"We consider the scheduling of retransmissions in the low-latency deterministic network (LLDN) extension to the IEEE 802.15.4 standard. We propose a number of retransmission schemes with varying degree of required changes to the LLDN specification. In particular, we propose a retransmission scheme which uses cooperative relayers and where the best relayer for a source node is learned using reinforcement-learning method. The method allows to adapt relayer selections in face of time-varying channels. Our results show that the relayer-based methods achieve a much better reliability over the other methods, both over static (but unknown) and over time-varying channels.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121076374","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 : 2016-12-01DOI: 10.1109/ATNAC.2016.7878806
Hung-Chin Jang, Chien-Hsiung Chang
In response to increase of mobile data traffic, telecom operators usually employ “enforced handover” policy to direct data traffic to WiFi AP (Access Point). Once their user clients enter into WiFi AP coverage, they will be handed over to WiFi AP from BS in order to offload mobile data traffic. However, if there are too many BS user clients enter into WiFi AP coverage, it may lead to excessive handover to WiFi AP and thus reduce the data rate even slower than that of BS. On the other hand, Software Defined Network (SDN) is a promising technic to efficiently manage various kinds of networks. This paper proposes a FMSDN (Flow Management on Mobile Data Using SDN) mechanism, which uses SDN technology to manage the handover among WiFi AP and 3G/4G base stations. The design philosophy is that the SDN controller is responsible for making handover decision according to whichever access network (WiFi or 3G/4G) is able to offer higher service data rate to clients. Simulation results show that compared to Enforced Handover and Horizontal Handover methods, FMSDN is proved to be able to enhance service data rate with QoS guaranteed.
为了应对移动数据流量的增加，电信运营商通常采用“强制切换”策略将数据流量引导至WiFi AP (Access Point)。一旦他们的用户客户端进入WiFi AP覆盖范围，他们将从BS转移到WiFi AP，以卸载移动数据流量。但是，如果有太多的BS用户客户端进入WiFi AP覆盖范围，可能会导致过度切换到WiFi AP，从而降低数据速率，甚至比BS更慢。另一方面，软件定义网络(SDN)是一种很有前途的技术，可以有效地管理各种类型的网络。本文提出了一种FMSDN (Flow Management on Mobile Data Using SDN)机制，该机制利用SDN技术来管理WiFi AP与3G/4G基站之间的切换。其设计理念是SDN控制器负责根据能够向客户端提供更高业务数据速率的接入网(WiFi或3G/4G)做出切换决策。仿真结果表明，与强制切换和水平切换方法相比，FMSDN能够在保证QoS的情况下提高业务数据速率。
{"title":"Context aware mobile data offload using SDN","authors":"Hung-Chin Jang, Chien-Hsiung Chang","doi":"10.1109/ATNAC.2016.7878806","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878806","url":null,"abstract":"In response to increase of mobile data traffic, telecom operators usually employ “enforced handover” policy to direct data traffic to WiFi AP (Access Point). Once their user clients enter into WiFi AP coverage, they will be handed over to WiFi AP from BS in order to offload mobile data traffic. However, if there are too many BS user clients enter into WiFi AP coverage, it may lead to excessive handover to WiFi AP and thus reduce the data rate even slower than that of BS. On the other hand, Software Defined Network (SDN) is a promising technic to efficiently manage various kinds of networks. This paper proposes a FMSDN (Flow Management on Mobile Data Using SDN) mechanism, which uses SDN technology to manage the handover among WiFi AP and 3G/4G base stations. The design philosophy is that the SDN controller is responsible for making handover decision according to whichever access network (WiFi or 3G/4G) is able to offer higher service data rate to clients. Simulation results show that compared to Enforced Handover and Horizontal Handover methods, FMSDN is proved to be able to enhance service data rate with QoS guaranteed.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126500344","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 : 2016-12-01DOI: 10.1109/ATNAC.2016.7878813
H. Troger, M. Hartmann, L. Patino-Studencki, J. Robert, A. Heuberger
One of the most promising ways of bringing localization services to GPS denied areas is the use of wireless sensor networks. For time difference of arrival (TDOA) systems, the achievable accuracy highly depends on the synchronization accuracy between the sensor nodes. In this paper we describe a new algorithm that achieves an ultra-precise wireless frequency synchronization using OFDM signals. Especially for indoor environments, which typically suffer from multi-path propagation, significant improvements compared to state-of-the-art algorithms can be reached. An additional benefit of our algorithm is the low complexity, which allows for low-cost implementations. After the explanation of our concept and the algorithms, its simulated performance is evaluated.
{"title":"Time-domain OFDM carrier phase estimation for wireless sensor network syntonization","authors":"H. Troger, M. Hartmann, L. Patino-Studencki, J. Robert, A. Heuberger","doi":"10.1109/ATNAC.2016.7878813","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878813","url":null,"abstract":"One of the most promising ways of bringing localization services to GPS denied areas is the use of wireless sensor networks. For time difference of arrival (TDOA) systems, the achievable accuracy highly depends on the synchronization accuracy between the sensor nodes. In this paper we describe a new algorithm that achieves an ultra-precise wireless frequency synchronization using OFDM signals. Especially for indoor environments, which typically suffer from multi-path propagation, significant improvements compared to state-of-the-art algorithms can be reached. An additional benefit of our algorithm is the low complexity, which allows for low-cost implementations. After the explanation of our concept and the algorithms, its simulated performance is evaluated.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124693004","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 : 2016-12-01DOI: 10.1109/ATNAC.2016.7878812
S. Shankar, Pinxing Lin, A. Herkersdorf, Thomas Wild
Content aware networking will be an integral feature in the next generation Residential Gateway Routers (RGR). Signature matching is the most time critical operation in content aware networking. Improving broadband speed necessitates the need for hardware acceleration of signature matching to manage and safeguard all the Internet of Things (IOT) clients connected to the smart home. Deterministic Finite Automata (DFA) allows the signature matching operation to be performed in linear time but has an exponential storage complexity. Bitmap based transition compression techniques are hardware friendly and can be used to achieve signature matching at multi gigabit throughput. However, its drawback is inefficient transition compression which results in storage of redundant transitions after the compression. We propose two bit masking techniques to efficiently compress transitions over existing bitmap based techniques. Compression ratios of 98% can be achieved using the proposed techniques, which in turn results in a 50% reduction of memory usage to store the compressed automata. A hardware acceleration architecture is proposed for each technique to decompress the transitions to achieve signature matching at multi gigabit rates.
{"title":"Hardware acceleration of signature matching through multi-layer transition bit masking","authors":"S. Shankar, Pinxing Lin, A. Herkersdorf, Thomas Wild","doi":"10.1109/ATNAC.2016.7878812","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878812","url":null,"abstract":"Content aware networking will be an integral feature in the next generation Residential Gateway Routers (RGR). Signature matching is the most time critical operation in content aware networking. Improving broadband speed necessitates the need for hardware acceleration of signature matching to manage and safeguard all the Internet of Things (IOT) clients connected to the smart home. Deterministic Finite Automata (DFA) allows the signature matching operation to be performed in linear time but has an exponential storage complexity. Bitmap based transition compression techniques are hardware friendly and can be used to achieve signature matching at multi gigabit throughput. However, its drawback is inefficient transition compression which results in storage of redundant transitions after the compression. We propose two bit masking techniques to efficiently compress transitions over existing bitmap based techniques. Compression ratios of 98% can be achieved using the proposed techniques, which in turn results in a 50% reduction of memory usage to store the compressed automata. A hardware acceleration architecture is proposed for each technique to decompress the transitions to achieve signature matching at multi gigabit rates.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"2019 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116753324","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 : 2016-09-24DOI: 10.1109/ATNAC.2016.7878824
O. W. Gnilke, Amaro Barreal, Alex Karrila, H. Tran, David A. Karpuk, C. Hollanti
The concept of well-rounded lattices has recently found important applications in the setting of a fading single-input single-output (SISO) wiretap channel. It has been shown that, under this setup, the property of being well-rounded is critical for minimizing the eavesdropper's probability of correct decoding in lower SNR regimes. The superior performance of coset codes constructed from well-rounded lattices has been illustrated in several simulations. In the present article, this work is extended to fading multiple-input multiple-output (MIMO) wiretap channels, and similar design criteria as in the SISO case are derived. Further, explicit coset codes for Rayleigh fading MIMO wiretap channels are designed. In particular, it is shown through extensive simulations that sublattices of the well-known Alamouti code and Golden code which meet our design criteria perform better than scalar multiples of the code lattice for the same parameters.
{"title":"Well-rounded lattices for coset coding in MIMO wiretap channels","authors":"O. W. Gnilke, Amaro Barreal, Alex Karrila, H. Tran, David A. Karpuk, C. Hollanti","doi":"10.1109/ATNAC.2016.7878824","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878824","url":null,"abstract":"The concept of well-rounded lattices has recently found important applications in the setting of a fading single-input single-output (SISO) wiretap channel. It has been shown that, under this setup, the property of being well-rounded is critical for minimizing the eavesdropper's probability of correct decoding in lower SNR regimes. The superior performance of coset codes constructed from well-rounded lattices has been illustrated in several simulations. In the present article, this work is extended to fading multiple-input multiple-output (MIMO) wiretap channels, and similar design criteria as in the SISO case are derived. Further, explicit coset codes for Rayleigh fading MIMO wiretap channels are designed. In particular, it is shown through extensive simulations that sublattices of the well-known Alamouti code and Golden code which meet our design criteria perform better than scalar multiples of the code lattice for the same parameters.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125243208","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
扫码关注我们
求助内容：
应助结果提醒方式：