Pub Date : 2016-02-01DOI: 10.1109/ICCNC.2016.7440657
Hong Guo, G. Shen, S. Bose
This paper extends single failure to dual failure recovery for an elastic optical network (EON) with 1+1:1 network protection. The issue of routing and spectrum assignment (RSA) is studied with objective of minimizing the maximal number of frequency slots (FSs) used. The key principle for protection capacity sharing among second protection lightpaths is identified. An Integer Linear Programing (ILP) model and a spectrum window plane (SWP)-based heuristic algorithm are developed for RSA of 1+1:1 protected EON. Simulation results show that the proposed SWP-based algorithm can achieve better capacity utilization than the shortest-path (SP) algorithm and is almost as efficient as the ILP model.
{"title":"Routing and spectrum assignment for 1+1:1 lightpath services in elastic optical networks","authors":"Hong Guo, G. Shen, S. Bose","doi":"10.1109/ICCNC.2016.7440657","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440657","url":null,"abstract":"This paper extends single failure to dual failure recovery for an elastic optical network (EON) with 1+1:1 network protection. The issue of routing and spectrum assignment (RSA) is studied with objective of minimizing the maximal number of frequency slots (FSs) used. The key principle for protection capacity sharing among second protection lightpaths is identified. An Integer Linear Programing (ILP) model and a spectrum window plane (SWP)-based heuristic algorithm are developed for RSA of 1+1:1 protected EON. Simulation results show that the proposed SWP-based algorithm can achieve better capacity utilization than the shortest-path (SP) algorithm and is almost as efficient as the ILP model.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132003416","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-02-01DOI: 10.1109/ICCNC.2016.7440598
Mustafa Sanli, A. Pehlivanli, E. G. Schmidt
Video and voice traffic currently have the biggest share in the Internet. These applications require end-to-end Quality of Service (QoS) guarantees for each flow. The packet schedulers in the routers play an important role in providing end-to-end QoS support in the Internet. It is important that the implementation of packet schedulers scale with the steady increase in the data rates and the number of flows. In our previous work we proposed Window Based Fair Aggregator (WBFA) to decrease the number of flows. WBFA aggregates the flows preserving their end-to-end delay bounds with a relatively small aggregation delay. In this paper we present a detailed simulation study to demonstrate the features of WBFA and its effect on the performance of fair packet schedulers.
{"title":"Window based fair aggregator for the scalable support of QoS guarantees in the backbone: An experimental performance study","authors":"Mustafa Sanli, A. Pehlivanli, E. G. Schmidt","doi":"10.1109/ICCNC.2016.7440598","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440598","url":null,"abstract":"Video and voice traffic currently have the biggest share in the Internet. These applications require end-to-end Quality of Service (QoS) guarantees for each flow. The packet schedulers in the routers play an important role in providing end-to-end QoS support in the Internet. It is important that the implementation of packet schedulers scale with the steady increase in the data rates and the number of flows. In our previous work we proposed Window Based Fair Aggregator (WBFA) to decrease the number of flows. WBFA aggregates the flows preserving their end-to-end delay bounds with a relatively small aggregation delay. In this paper we present a detailed simulation study to demonstrate the features of WBFA and its effect on the performance of fair packet schedulers.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131359880","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-02-01DOI: 10.1109/ICCNC.2016.7440682
A. Seetharam, Peter Walker
With the proliferation of smartphones and the growth of cellular technology (e.g., 4G LTE), individuals are constantly accessing the Internet on the go. But, there is limited understanding of the variation in cellular network performance (i.e., throughput, latency, packet loss) for various wireless service providers. In this paper, we perform an empirical characterization of cellular network performance based on a large scale measurement study of the major wireless service providers in California. We describe the system and software application (CalSPEED) used to measure various network parameters such as TCP download/upload throughput, latency and packet loss for the different wireless service providers. Six rounds of measurement are conducted for a period of approximately three years in California, (referred to as field tests) starting from spring 2012. During each field test, personnel drove with mobile clients to different parts of the state and collected data by executing the software. Data is collected over approximately 1500 locations in the state during each field test1. Our data analysis demonstrates quantitatively that i) cellular network performance varies considerably with location and is poor overall - a large number of locations in our study report low network throughput, high latency and high loss rates ii) all cellular providers are not the same - network performance varies considerably among the different providers iii) on average, cellular network performance is improving over time iv) cellular network performance depends on a number of factors such as download/upload, server location and type of device used.
{"title":"An empirical characterization of cellular network performance","authors":"A. Seetharam, Peter Walker","doi":"10.1109/ICCNC.2016.7440682","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440682","url":null,"abstract":"With the proliferation of smartphones and the growth of cellular technology (e.g., 4G LTE), individuals are constantly accessing the Internet on the go. But, there is limited understanding of the variation in cellular network performance (i.e., throughput, latency, packet loss) for various wireless service providers. In this paper, we perform an empirical characterization of cellular network performance based on a large scale measurement study of the major wireless service providers in California. We describe the system and software application (CalSPEED) used to measure various network parameters such as TCP download/upload throughput, latency and packet loss for the different wireless service providers. Six rounds of measurement are conducted for a period of approximately three years in California, (referred to as field tests) starting from spring 2012. During each field test, personnel drove with mobile clients to different parts of the state and collected data by executing the software. Data is collected over approximately 1500 locations in the state during each field test1. Our data analysis demonstrates quantitatively that i) cellular network performance varies considerably with location and is poor overall - a large number of locations in our study report low network throughput, high latency and high loss rates ii) all cellular providers are not the same - network performance varies considerably among the different providers iii) on average, cellular network performance is improving over time iv) cellular network performance depends on a number of factors such as download/upload, server location and type of device used.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"292 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114384655","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-02-01DOI: 10.1109/ICCNC.2016.7440721
F. Foukalas, T. Khattab
In this paper, we investigate the optimal power allocation problem in dispersed cognitive radios with carrier aggregation. To this end, we model the carrier aggregation using an i - th frequency diversity policy, wherein each component carrier is provided with a maximal ratio combining. An ascending order is employed for the aggregation using maximal ratio combining receiver. Additionally, due to the dispersed nature of the channels, we assume an independent but non-identically distributed (i.n.i.d.) η - μ distribution for each channel branch. Having defined this model, we formulate the maximization problem over the transmit power of each CC with frequency diversity provision over the heterogeneous fading channels. The problem is solved using alternating direction method of multipliers (ADMM) as a dual decomposition application providing robustness. Distributed (without consensus) and centralized (with consensus) ADMM algorithms are devised and the corresponding simulation results are discussed. Simulation results corroborates the performance gain of the proposed ADMM solution both in terms of iterations and rate gain per CC.
研究了具有载波聚合的分散认知无线电的最优功率分配问题。为此，我们使用频率分集策略对载波聚合进行建模，其中每个分量载波具有最大比例组合。采用最大比值结合接收端，按升序进行聚合。此外，由于通道的分散性，我们假设每个通道分支具有独立但非同分布(i.n.i.d) η - μ分布。定义了该模型后，我们提出了在异构衰落信道上提供频率分集的每个CC的发射功率最大化问题。采用交替方向乘法器(ADMM)作为一种具有鲁棒性的对偶分解方法来解决该问题。设计了分布式(无共识)和集中式(有共识)ADMM算法，并讨论了相应的仿真结果。仿真结果证实了所提出的ADMM解决方案在迭代和每CC速率增益方面的性能增益。
{"title":"Optimal power allocation in dispersed cognitive radio systems with carrier aggregation","authors":"F. Foukalas, T. Khattab","doi":"10.1109/ICCNC.2016.7440721","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440721","url":null,"abstract":"In this paper, we investigate the optimal power allocation problem in dispersed cognitive radios with carrier aggregation. To this end, we model the carrier aggregation using an i - th frequency diversity policy, wherein each component carrier is provided with a maximal ratio combining. An ascending order is employed for the aggregation using maximal ratio combining receiver. Additionally, due to the dispersed nature of the channels, we assume an independent but non-identically distributed (i.n.i.d.) η - μ distribution for each channel branch. Having defined this model, we formulate the maximization problem over the transmit power of each CC with frequency diversity provision over the heterogeneous fading channels. The problem is solved using alternating direction method of multipliers (ADMM) as a dual decomposition application providing robustness. Distributed (without consensus) and centralized (with consensus) ADMM algorithms are devised and the corresponding simulation results are discussed. Simulation results corroborates the performance gain of the proposed ADMM solution both in terms of iterations and rate gain per CC.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114661911","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-02-01DOI: 10.1109/ICCNC.2016.7440719
Yantian Hou, Ming Li, Dejun Yang
MIMO is an emerging technology which can substantially increase the link capacity of wireless communications. MIMO has also been shown to enhance the throughput in the coexistence of heterogeneous wireless networks due to its capability of performing spatial-multiplexing (SM) and interference cancellation (IC). Practical protocols such as 802.11n+ have been proposed to address the coexistence problem in MIMO wireless networks. However, all the previous work focused on the physical-layer or MAC-layer design. None of them studied the networks' incentives to comply with or violate the low-level protocols. In this work, we study the coexistence of two single-link MIMO wireless networks with IC and SM capabilities, by analyzing their incentives of cooperation or non-cooperation (whether they will use their available degree-of-freedoms to cancel the interference to each other). We propose a novel two-round game framework, based on which we derive two networks' strategies in equilibrium and the corresponding closed-form utilities. We obtain numerical results of the equilibrium strategies under different network scenarios. Several insights are gained, which can guide us the design of real-world MIMO wireless systems in the future.
{"title":"A game theoretical approach to coexistence of heterogeneous MIMO wireless networks with interference cancellation","authors":"Yantian Hou, Ming Li, Dejun Yang","doi":"10.1109/ICCNC.2016.7440719","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440719","url":null,"abstract":"MIMO is an emerging technology which can substantially increase the link capacity of wireless communications. MIMO has also been shown to enhance the throughput in the coexistence of heterogeneous wireless networks due to its capability of performing spatial-multiplexing (SM) and interference cancellation (IC). Practical protocols such as 802.11n+ have been proposed to address the coexistence problem in MIMO wireless networks. However, all the previous work focused on the physical-layer or MAC-layer design. None of them studied the networks' incentives to comply with or violate the low-level protocols. In this work, we study the coexistence of two single-link MIMO wireless networks with IC and SM capabilities, by analyzing their incentives of cooperation or non-cooperation (whether they will use their available degree-of-freedoms to cancel the interference to each other). We propose a novel two-round game framework, based on which we derive two networks' strategies in equilibrium and the corresponding closed-form utilities. We obtain numerical results of the equilibrium strategies under different network scenarios. Several insights are gained, which can guide us the design of real-world MIMO wireless systems in the future.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133140504","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-02-01DOI: 10.1109/ICCNC.2016.7440614
L. Combi, U. Spagnolini
The optical links is one of the driving enablers of distributed antennas systems for future radio access networks (RAN). However, the increasing demand of the wireless band-width is a strong push toward an efficient usage of the fiber whose bandwidth is large, but not unlimited mainly if considering the electronics. Examples in the direction of bandwidth parsimony are the analog relaying of RAN signals according to the radio-over-fiber paradigm. In this paper we propose the transport of analog RAN signals by employing the pulse width modulation (PWM) as novel waveform for optical front-hauling. At transmitter the radio-signal is sampled and mapped onto the duration of on/off optical signal, at receiving end of the fiber each PW modulated sample is digitized so that the overall communication is transparent. The key contribution here stems from the noise-rejection capability of closed-loop PWM that trades some oversampling and filtering to gain in signal quality. The paper proposes a Sigma-Delta structure for PWM that is purposely designed to trade these benefits for RAN front-hauling architecture. Simulation results provide some room for discussion on pros/cons of this novel front-hauling.
{"title":"Sigma-delta PWM waveforms for optical front-hauling","authors":"L. Combi, U. Spagnolini","doi":"10.1109/ICCNC.2016.7440614","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440614","url":null,"abstract":"The optical links is one of the driving enablers of distributed antennas systems for future radio access networks (RAN). However, the increasing demand of the wireless band-width is a strong push toward an efficient usage of the fiber whose bandwidth is large, but not unlimited mainly if considering the electronics. Examples in the direction of bandwidth parsimony are the analog relaying of RAN signals according to the radio-over-fiber paradigm. In this paper we propose the transport of analog RAN signals by employing the pulse width modulation (PWM) as novel waveform for optical front-hauling. At transmitter the radio-signal is sampled and mapped onto the duration of on/off optical signal, at receiving end of the fiber each PW modulated sample is digitized so that the overall communication is transparent. The key contribution here stems from the noise-rejection capability of closed-loop PWM that trades some oversampling and filtering to gain in signal quality. The paper proposes a Sigma-Delta structure for PWM that is purposely designed to trade these benefits for RAN front-hauling architecture. Simulation results provide some room for discussion on pros/cons of this novel front-hauling.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"338 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122331675","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-02-01DOI: 10.1109/ICCNC.2016.7440644
Radwa A. Sultan, Lingyang Song, Karim G. Seddik, Zhu Han
In this paper, an investigation of the effect of deploying massive MIMO in two-tier cellular networks is presented. In our model, the macrocell base station (BS) as well as femtocell access points (FAPs) are equipped with a very large number of antennas. Each mobile user will attempt to connect to the BS or FAPs. However, it is assumed that the users may be biased to connect to FAPs rather than the BS. A resource allocation problem is formulated to find the optimal bias that maximizes the total system capacity while keeping the transmitted power from the BS and the FAPs within a certain limit. An algorithm for solving the optimization problem is proposed and numerical results are presented to illustrate how deploying massive MIMO can affect the optimal bias value and the total capacity. In addition, the performance of our proposed scheme is evaluated when using different precoding schemes.
{"title":"Users association in small cell networks with massive MIMO","authors":"Radwa A. Sultan, Lingyang Song, Karim G. Seddik, Zhu Han","doi":"10.1109/ICCNC.2016.7440644","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440644","url":null,"abstract":"In this paper, an investigation of the effect of deploying massive MIMO in two-tier cellular networks is presented. In our model, the macrocell base station (BS) as well as femtocell access points (FAPs) are equipped with a very large number of antennas. Each mobile user will attempt to connect to the BS or FAPs. However, it is assumed that the users may be biased to connect to FAPs rather than the BS. A resource allocation problem is formulated to find the optimal bias that maximizes the total system capacity while keeping the transmitted power from the BS and the FAPs within a certain limit. An algorithm for solving the optimization problem is proposed and numerical results are presented to illustrate how deploying massive MIMO can affect the optimal bias value and the total capacity. In addition, the performance of our proposed scheme is evaluated when using different precoding schemes.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130173594","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-02-01DOI: 10.1109/ICCNC.2016.7440581
J. P. Peña-Martín, C. Tellez-Labao, J. M. Romero-Jerez
Transmit antenna selection (TAS) is well-known to allow a reduced signal processing complexity while maintaining the diversity order of a MIMO system. Assuming Nakagami fading, we show in this work that antenna correlation in a maximal ratio combining (MRC) receiver, as well as severe fading, have a beneficial impact on ergodic capacity if TAS is used at the transmit end. This is in sharp contrast to MRC reception when a single transmit antenna is considered. We also derive novel closed-form expressions for the average symbol error rate (ASER) of TAS/MRC for different M-ary modulations, generalizing previous works by considering receive antenna correlation where the eigenvalues of the receive correlation matrix have an arbitrary multiplicity. Monte Carlo simulations are performed to validate the analysis. Our results show that, contrary to the behavior of ergodic capacity, antenna correlation and severe fading always have a detrimental impact on ASER for the average SNR values of interest, as in those cases the ASER is dominated by the diversity gain.
{"title":"Impact of fading severity and receive antenna correlation on TAS/MRC under Nakagami fading","authors":"J. P. Peña-Martín, C. Tellez-Labao, J. M. Romero-Jerez","doi":"10.1109/ICCNC.2016.7440581","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440581","url":null,"abstract":"Transmit antenna selection (TAS) is well-known to allow a reduced signal processing complexity while maintaining the diversity order of a MIMO system. Assuming Nakagami fading, we show in this work that antenna correlation in a maximal ratio combining (MRC) receiver, as well as severe fading, have a beneficial impact on ergodic capacity if TAS is used at the transmit end. This is in sharp contrast to MRC reception when a single transmit antenna is considered. We also derive novel closed-form expressions for the average symbol error rate (ASER) of TAS/MRC for different M-ary modulations, generalizing previous works by considering receive antenna correlation where the eigenvalues of the receive correlation matrix have an arbitrary multiplicity. Monte Carlo simulations are performed to validate the analysis. Our results show that, contrary to the behavior of ergodic capacity, antenna correlation and severe fading always have a detrimental impact on ASER for the average SNR values of interest, as in those cases the ASER is dominated by the diversity gain.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129072276","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-02-01DOI: 10.1109/ICCNC.2016.7440704
Xueqin Jiang, M. Lee, Huiming Wang, Jun Li, Miaowen Wen
For a given base graph, the protograph can be obtained by a copy-and-permute procedure. If the permutation is cyclic, the protograph corresponds to a quasi-cyclic (QC) protograph LDPC code. The girth of the QC protograph LDPC code is determined by the girth of the base graph and the permutation shifts. Progressive edge-growth (PEG) construction builds up a Tanner graph, or equivalently a parity-check matrix, for an LDPC code by maximizing the local girth at symbol nodes in a greedy algorithm. In this paper, we introduce a modified version of the PEG algorithm which can construct large girth base graph and determine the optimal permutation shifts, simultaneously, for QC protograph LDPC codes. Simulation results show that the QC protograph LDPC codes constructed by the proposed modified PEG algorithm have good frame error rate (FER) performance over the AWGN channel.
{"title":"Modified PEG algorithm for large girth Quasi-cyclic protograph LDPC codes","authors":"Xueqin Jiang, M. Lee, Huiming Wang, Jun Li, Miaowen Wen","doi":"10.1109/ICCNC.2016.7440704","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440704","url":null,"abstract":"For a given base graph, the protograph can be obtained by a copy-and-permute procedure. If the permutation is cyclic, the protograph corresponds to a quasi-cyclic (QC) protograph LDPC code. The girth of the QC protograph LDPC code is determined by the girth of the base graph and the permutation shifts. Progressive edge-growth (PEG) construction builds up a Tanner graph, or equivalently a parity-check matrix, for an LDPC code by maximizing the local girth at symbol nodes in a greedy algorithm. In this paper, we introduce a modified version of the PEG algorithm which can construct large girth base graph and determine the optimal permutation shifts, simultaneously, for QC protograph LDPC codes. Simulation results show that the QC protograph LDPC codes constructed by the proposed modified PEG algorithm have good frame error rate (FER) performance over the AWGN channel.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117327369","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}
Message dissemination issue in Vehicular ad hoc networks (VANETs) has been extensively studied both by computer simulations and experimental testbeds. Dedicated Short Range Communications (DSRC) technology has been standardized and used extensively as the main mechanism to support the message dissemination in VANETs. Nevertheless, other alternatives such as 3G/4G and WLAN have also been proposed to further assist with the message dissemination in VANETs. Due to the ubiquity of the smartphones, in this paper, we propose to leverage the use of smartphone to disseminate message in VANETs. An android-based system that uses WLAN ad-hoc technology is proposed. The feasibility and performance of the proposed system are investigated by simulations and the evaluation results show that given the high penetration of smartphones, the message dissemination can be done via the smartphones. Although the delay performance of the proposed system is inferior to DSRC-based system, the proposed system could still be very useful especially during the deployment stage of the DSRC technology (when the penetration rate of the technology is low).
{"title":"Performance analysis of android-based real-time message dissemination in VANETs","authors":"Wantanee Viriyasitavat, Soranut Midtrapanon, Takkachai Rittirat, Sornrakitch Thanumaiweerakun","doi":"10.1109/ICCNC.2016.7440594","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440594","url":null,"abstract":"Message dissemination issue in Vehicular ad hoc networks (VANETs) has been extensively studied both by computer simulations and experimental testbeds. Dedicated Short Range Communications (DSRC) technology has been standardized and used extensively as the main mechanism to support the message dissemination in VANETs. Nevertheless, other alternatives such as 3G/4G and WLAN have also been proposed to further assist with the message dissemination in VANETs. Due to the ubiquity of the smartphones, in this paper, we propose to leverage the use of smartphone to disseminate message in VANETs. An android-based system that uses WLAN ad-hoc technology is proposed. The feasibility and performance of the proposed system are investigated by simulations and the evaluation results show that given the high penetration of smartphones, the message dissemination can be done via the smartphones. Although the delay performance of the proposed system is inferior to DSRC-based system, the proposed system could still be very useful especially during the deployment stage of the DSRC technology (when the penetration rate of the technology is low).","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"217 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115214267","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
扫码关注我们
求助内容：
应助结果提醒方式：