Pub Date : 2011-12-08DOI: 10.1109/ATNAC.2011.6096633
L. Gu, M. Gregory
The 4th generation (4G) mobile access network and the core network are evolving towards a secure, fast, and Internet Protocol-based network. With the emergence of next generation battery-powered smart mobile phone and open source application platforms, security and the terminal's energy consumption have become big issues. Long Term Evolution (LTE) is one of the most popular 4G technologies defined by 3rd Generation Partnership Projects (3GPP). It is observed that the end user requires two authentication steps to access multimedia services. The first is the LTE network layer authentication, and the second is the IP Multimedia Subsystem (IMS) service layer authentication. The authentication steps utilize energy and are carried out using the Authentication and Key Agreement (AKA) protocol. This paper proposes an Improved AKA (I-AKA) authentication protocol which authenticates the user on both the network layer and the service layer without double execution the AKA protocol and simplifies the authentication steps. Furthermore, the security and energy consumption were analyzed and the results showed the proposed I-AKA could save up to 81.82% of the terminal's energy consumption related to authentication with increased security.
{"title":"A green and secure authentication for the 4th generation mobile network","authors":"L. Gu, M. Gregory","doi":"10.1109/ATNAC.2011.6096633","DOIUrl":"https://doi.org/10.1109/ATNAC.2011.6096633","url":null,"abstract":"The 4th generation (4G) mobile access network and the core network are evolving towards a secure, fast, and Internet Protocol-based network. With the emergence of next generation battery-powered smart mobile phone and open source application platforms, security and the terminal's energy consumption have become big issues. Long Term Evolution (LTE) is one of the most popular 4G technologies defined by 3rd Generation Partnership Projects (3GPP). It is observed that the end user requires two authentication steps to access multimedia services. The first is the LTE network layer authentication, and the second is the IP Multimedia Subsystem (IMS) service layer authentication. The authentication steps utilize energy and are carried out using the Authentication and Key Agreement (AKA) protocol. This paper proposes an Improved AKA (I-AKA) authentication protocol which authenticates the user on both the network layer and the service layer without double execution the AKA protocol and simplifies the authentication steps. Furthermore, the security and energy consumption were analyzed and the results showed the proposed I-AKA could save up to 81.82% of the terminal's energy consumption related to authentication with increased security.","PeriodicalId":210916,"journal":{"name":"2011 Australasian Telecommunication Networks and Applications Conference (ATNAC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129745332","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 : 2011-12-08DOI: 10.1109/ATNAC.2011.6096643
F. Rafiq, T. Moors
Network use tends to follow other human activities in terms of peaking during the day and evening, and being light in the early hours of the morning. This can lead to links that are bottlenecks during peak periods having excess capacity during the night. This paper shows how trends in access by users in advanced (eastern) times zones can be used to predict future access by users in delayed (western) time zones, and so identify which objects should be pre-fetched during the (western) night so that they are ready for access when users in the delayed time zone waken. This can smooth access loads on bottleneck links, and may be particularly useful to prevent trans-Pacific submarine cables becoming a bottleneck in connecting the Australian National Broadband Network to the rest of the Internet.
{"title":"Monitoring access in advanced time zones to direct prefetching and so smooth access loads","authors":"F. Rafiq, T. Moors","doi":"10.1109/ATNAC.2011.6096643","DOIUrl":"https://doi.org/10.1109/ATNAC.2011.6096643","url":null,"abstract":"Network use tends to follow other human activities in terms of peaking during the day and evening, and being light in the early hours of the morning. This can lead to links that are bottlenecks during peak periods having excess capacity during the night. This paper shows how trends in access by users in advanced (eastern) times zones can be used to predict future access by users in delayed (western) time zones, and so identify which objects should be pre-fetched during the (western) night so that they are ready for access when users in the delayed time zone waken. This can smooth access loads on bottleneck links, and may be particularly useful to prevent trans-Pacific submarine cables becoming a bottleneck in connecting the Australian National Broadband Network to the rest of the Internet.","PeriodicalId":210916,"journal":{"name":"2011 Australasian Telecommunication Networks and Applications Conference (ATNAC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130221890","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 : 2011-12-08DOI: 10.1109/ATNAC.2011.6096659
P. Sofotasios, S. Freear
This work is devoted in the derivation of novel upper and lower bounds for the Rice Ie-function. These bounds are expressed in closed-form and are shown to be quite tight. This is particularly evident by the fact that for a certain range of parameter values, the derived lower bound virtually behaves as a remarkably accurate approximation. As a result, the offered expressions can be considered useful mathematical tools that can be efficiently employed in various analytical studies related to natural sciences and engineering. To this effect, they can be sufficiently applied in the area of digital communications over fading channels for the derivation of explicit representations for vital performance measures such as bit and symbol error probability, among others.
{"title":"Upper and lower bounds for the Rice Ie-function","authors":"P. Sofotasios, S. Freear","doi":"10.1109/ATNAC.2011.6096659","DOIUrl":"https://doi.org/10.1109/ATNAC.2011.6096659","url":null,"abstract":"This work is devoted in the derivation of novel upper and lower bounds for the Rice Ie-function. These bounds are expressed in closed-form and are shown to be quite tight. This is particularly evident by the fact that for a certain range of parameter values, the derived lower bound virtually behaves as a remarkably accurate approximation. As a result, the offered expressions can be considered useful mathematical tools that can be efficiently employed in various analytical studies related to natural sciences and engineering. To this effect, they can be sufficiently applied in the area of digital communications over fading channels for the derivation of explicit representations for vital performance measures such as bit and symbol error probability, among others.","PeriodicalId":210916,"journal":{"name":"2011 Australasian Telecommunication Networks and Applications Conference (ATNAC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125684007","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 : 2011-12-08DOI: 10.1109/ATNAC.2011.6096635
S. Kunarak, R. Suleesathira
Next generation wireless networks must be able to coordinate services between heterogeneous networks using a mobile terminal with multiple access interfaces. One of the challenges for continuous seamless mobility is vertical handoff which is the decision for a mobile node to switch for one network to another different type of networks. Moreover, how to select a desired target network is an important issue to balance against the network condition and user preferences. In this paper, the policies of multiple metrics to trigger a handoff while a mobile node is located in UMTS and WLAN/WiMAX are designed. The received signal strength (RSS) of neighbor networks predicted by the back propagation neural network is beneficial to perform handoff early. We propose a dwell time calculation depending to the user speed and moving pattern. If the RSS conditions are consistently true during dwell time, then unnecessary handoffs are avoidable. To select an optimal target network, policies in the merit function is presented. The weights of each handoff metric are dynamic to several networks. The results indicate that the proposed policy-enabled vertical handoff decision algorithm and network selection outperforms the other two approaches in reducing the number of vertical handoffs, Grade of Service (GoS) while increasing the average utilization per call of WLAN/WiMAX networks.
{"title":"Vertical handoff decision and network merit for integrated wireless and mobile networks","authors":"S. Kunarak, R. Suleesathira","doi":"10.1109/ATNAC.2011.6096635","DOIUrl":"https://doi.org/10.1109/ATNAC.2011.6096635","url":null,"abstract":"Next generation wireless networks must be able to coordinate services between heterogeneous networks using a mobile terminal with multiple access interfaces. One of the challenges for continuous seamless mobility is vertical handoff which is the decision for a mobile node to switch for one network to another different type of networks. Moreover, how to select a desired target network is an important issue to balance against the network condition and user preferences. In this paper, the policies of multiple metrics to trigger a handoff while a mobile node is located in UMTS and WLAN/WiMAX are designed. The received signal strength (RSS) of neighbor networks predicted by the back propagation neural network is beneficial to perform handoff early. We propose a dwell time calculation depending to the user speed and moving pattern. If the RSS conditions are consistently true during dwell time, then unnecessary handoffs are avoidable. To select an optimal target network, policies in the merit function is presented. The weights of each handoff metric are dynamic to several networks. The results indicate that the proposed policy-enabled vertical handoff decision algorithm and network selection outperforms the other two approaches in reducing the number of vertical handoffs, Grade of Service (GoS) while increasing the average utilization per call of WLAN/WiMAX networks.","PeriodicalId":210916,"journal":{"name":"2011 Australasian Telecommunication Networks and Applications Conference (ATNAC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122394209","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 : 2011-12-08DOI: 10.1109/ATNAC.2011.6096651
G. Ali, E. Chan
Nowadays, data dissemination using Road Side Units (RSUs) in Vehicular Ad Hoc Networks (VANETs) has received important consideration to assist the inter-vehicle communication for overcoming the vehicle to vehicle frequent disconnection problem. During rush hour, an RSU may be overloaded by many requests submitted by the vehicles. Due to strict realtime and short wireless transmission range coverage constraints, a heavily overloaded RSU may experience high deadline miss rate in effect of serving too many requests beyond its capacity. In this work, we investigate the vehicle submitted requests are generally two types: delay sensitive and delay tolerant. We propose a multiple-RSU model, which offers the opportunity to the RSUs suffering from handling high volume workload to transfer some of its delay tolerant requests to other RSUs, which have light workload and located in the direction in which the vehicle is heading. By a series of simulation experiments, we also support our multiple-RSU based co-operative load transferring model, which extensively outperforms the single independent RSU based VANETs model against a number of performance metrics.
{"title":"Co-operative data access in multiple Road Side Units (RSUs)-based Vehicular Ad Hoc Networks (VANETs)","authors":"G. Ali, E. Chan","doi":"10.1109/ATNAC.2011.6096651","DOIUrl":"https://doi.org/10.1109/ATNAC.2011.6096651","url":null,"abstract":"Nowadays, data dissemination using Road Side Units (RSUs) in Vehicular Ad Hoc Networks (VANETs) has received important consideration to assist the inter-vehicle communication for overcoming the vehicle to vehicle frequent disconnection problem. During rush hour, an RSU may be overloaded by many requests submitted by the vehicles. Due to strict realtime and short wireless transmission range coverage constraints, a heavily overloaded RSU may experience high deadline miss rate in effect of serving too many requests beyond its capacity. In this work, we investigate the vehicle submitted requests are generally two types: delay sensitive and delay tolerant. We propose a multiple-RSU model, which offers the opportunity to the RSUs suffering from handling high volume workload to transfer some of its delay tolerant requests to other RSUs, which have light workload and located in the direction in which the vehicle is heading. By a series of simulation experiments, we also support our multiple-RSU based co-operative load transferring model, which extensively outperforms the single independent RSU based VANETs model against a number of performance metrics.","PeriodicalId":210916,"journal":{"name":"2011 Australasian Telecommunication Networks and Applications Conference (ATNAC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124091197","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 : 2011-12-08DOI: 10.1109/ATNAC.2011.6096647
Nitin Khanna, A. Jagannatham
In this paper we present a novel scheme for video quality maximization in the context of H.264 scalable video coding (SVC) based 4G wireless broadcast and multicast video transmission. A typical wireless multicast group comprises of multimedia clients with varying wireless link qualities. Thus, the conventional fair rate static video (FRSV) transmission scheme, which aims to achieve QoS fairness in multicast video transmission is rate and hence quality constrained by the BMG subscriber with the worst link capacity. Hence, we propose a novel rate partitioning based scalable video (RPSV) transmission framework to overcome this limitation. The proposed RPSV scheme optimally partitions the multicast group for transmission of the H.264 coded base and enhancement scalable video layers. This is based on the Medium Grain Scalability (MGS) feature for enhancement layer coding in H.264 SVC. We demonstrate that the optimal wireless link quality based BMG partition and the associated quantization, time-fraction parameters can be computed by solving a series of convex objective minimization problems. RPSV naturally leads to a significant enhancement in the net multicast group video quality by avoiding the rate bottleneck otherwise caused by the worst link user, while simultaneously resulting in QoS fairness by avoiding service starvation of the user with the poorest link quality. We compare the resulting video quality obtained from the proposed RPSV based quantization parameter adaptation paradigm with the performance of the simplistic FRSV scheme and demonstrate the superiority of the former.
{"title":"Rate partitioning for optimal quantization parameter selection in H.264 (SVC) based 4G broadcast/multicast wireless video communication","authors":"Nitin Khanna, A. Jagannatham","doi":"10.1109/ATNAC.2011.6096647","DOIUrl":"https://doi.org/10.1109/ATNAC.2011.6096647","url":null,"abstract":"In this paper we present a novel scheme for video quality maximization in the context of H.264 scalable video coding (SVC) based 4G wireless broadcast and multicast video transmission. A typical wireless multicast group comprises of multimedia clients with varying wireless link qualities. Thus, the conventional fair rate static video (FRSV) transmission scheme, which aims to achieve QoS fairness in multicast video transmission is rate and hence quality constrained by the BMG subscriber with the worst link capacity. Hence, we propose a novel rate partitioning based scalable video (RPSV) transmission framework to overcome this limitation. The proposed RPSV scheme optimally partitions the multicast group for transmission of the H.264 coded base and enhancement scalable video layers. This is based on the Medium Grain Scalability (MGS) feature for enhancement layer coding in H.264 SVC. We demonstrate that the optimal wireless link quality based BMG partition and the associated quantization, time-fraction parameters can be computed by solving a series of convex objective minimization problems. RPSV naturally leads to a significant enhancement in the net multicast group video quality by avoiding the rate bottleneck otherwise caused by the worst link user, while simultaneously resulting in QoS fairness by avoiding service starvation of the user with the poorest link quality. We compare the resulting video quality obtained from the proposed RPSV based quantization parameter adaptation paradigm with the performance of the simplistic FRSV scheme and demonstrate the superiority of the former.","PeriodicalId":210916,"journal":{"name":"2011 Australasian Telecommunication Networks and Applications Conference (ATNAC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129215281","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 : 2011-12-08DOI: 10.1109/ATNAC.2011.6096673
A. A. Shukaili, N. Chilamkurti, P. Veeraraghavan
Nowadays, mobile devices are multi-interface systems which are, theoretically, capable of exploiting multiple Radio Access Technologies simultaneously. Furthermore, modern mobile devices have motion and location sensors that can used to facilitate robust network connectivity. We propose a Multi-Interface System Connectivity Manager that takes advantage of all the available resources in mobile devices. In this study, we emphasize on enhancing the Point of Attachment (PoA) discovery by using the aid of motion sensors and location data. In this work, we use real mobile phone using Android operating system to conduct our experiments. The results show that our proposed scheme performance more efficiently and only with small overhead in terms of power and computation.
{"title":"Enhancing network connectivity using smart mobile sensors","authors":"A. A. Shukaili, N. Chilamkurti, P. Veeraraghavan","doi":"10.1109/ATNAC.2011.6096673","DOIUrl":"https://doi.org/10.1109/ATNAC.2011.6096673","url":null,"abstract":"Nowadays, mobile devices are multi-interface systems which are, theoretically, capable of exploiting multiple Radio Access Technologies simultaneously. Furthermore, modern mobile devices have motion and location sensors that can used to facilitate robust network connectivity. We propose a Multi-Interface System Connectivity Manager that takes advantage of all the available resources in mobile devices. In this study, we emphasize on enhancing the Point of Attachment (PoA) discovery by using the aid of motion sensors and location data. In this work, we use real mobile phone using Android operating system to conduct our experiments. The results show that our proposed scheme performance more efficiently and only with small overhead in terms of power and computation.","PeriodicalId":210916,"journal":{"name":"2011 Australasian Telecommunication Networks and Applications Conference (ATNAC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116656977","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 : 2011-12-08DOI: 10.1109/ATNAC.2011.6096658
Xian Wang, S. Horng, R. Cheng, P. Fan
Both the Third Generation Partnership Project (3GPP) Long Term Evolution (LTE-Advanced) and IEEE 802.16m rely on relay technique to ameliorate cell edge throughput. Despite the throughput benefit achieved by relay technique, LTE-Advanced relay network is vulnerable to frequent handoffs, which can degrade the dropping performance, an important quality-of-service metric concerning realtime communications. This paper proposes a mathematical model to analyze the call dropping performance of the relay station (RS)-first channel access scheme, which prefers a RS-channel over an eNode-B (eNB)-channel when determining an access channel for a new and a handoff call. Closed-form analytical result is derived for the dropping probability of the RS-first policy and based on the result a numerical study is conducted to evaluate the influences of diverse parameters on the dropping performance. The result obtained in this paper can be availed of to develop appropriate call admission strategies in LTE-Advanced relay networks.
{"title":"Call dropping performance of the relay station (RS)-first channel access scheme in LTE-Advanced relay networks","authors":"Xian Wang, S. Horng, R. Cheng, P. Fan","doi":"10.1109/ATNAC.2011.6096658","DOIUrl":"https://doi.org/10.1109/ATNAC.2011.6096658","url":null,"abstract":"Both the Third Generation Partnership Project (3GPP) Long Term Evolution (LTE-Advanced) and IEEE 802.16m rely on relay technique to ameliorate cell edge throughput. Despite the throughput benefit achieved by relay technique, LTE-Advanced relay network is vulnerable to frequent handoffs, which can degrade the dropping performance, an important quality-of-service metric concerning realtime communications. This paper proposes a mathematical model to analyze the call dropping performance of the relay station (RS)-first channel access scheme, which prefers a RS-channel over an eNode-B (eNB)-channel when determining an access channel for a new and a handoff call. Closed-form analytical result is derived for the dropping probability of the RS-first policy and based on the result a numerical study is conducted to evaluate the influences of diverse parameters on the dropping performance. The result obtained in this paper can be availed of to develop appropriate call admission strategies in LTE-Advanced relay networks.","PeriodicalId":210916,"journal":{"name":"2011 Australasian Telecommunication Networks and Applications Conference (ATNAC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117186164","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 : 2011-12-08DOI: 10.1109/ATNAC.2011.6096653
R. Schoenen, H. Yanikomeroglu
Data traffic is expected to grow faster than capacity in future wireless networks. Therefore it will become unavoidable to deal with congestion. Bottlenecks are located on the wireless links because back-haul and Internet are overprovisioned. Traffic routed towards the user terminal (UT) in down-link direction keeps coming in through a big pipe until it reaches the base station (BS). The following wireless links can only carry a limited data rate due to congestion. In a multi-hop situation buffers before the bottlenecks ramp up and become unstable, leading to packet loss. While real-time traffic is safe due to call admission control (CAC), highest static priority and over-provisioning, best effort data traffic experiences congestion and therefore packet losses. A wireless flow control based on a credit-based hop-by-hop concept can solve this problem by avoiding any buffer overflow completely. This paper proposes extending the closed flow control loops to the source, either by a genuine credit-based flow control or by TCP rate control with deep packet inspection and ACK modification. This paper analyses the queueing behavior with stochastic Petri nets models. Markov state analysis provides numeric performance results. The example scenario consists of two wireless relayed hops and a wired back-haul with different control approaches for the hop between source and bottleneck.
{"title":"Wireless hop-by-hop credit-based flow control extended to source for stable best effort traffic","authors":"R. Schoenen, H. Yanikomeroglu","doi":"10.1109/ATNAC.2011.6096653","DOIUrl":"https://doi.org/10.1109/ATNAC.2011.6096653","url":null,"abstract":"Data traffic is expected to grow faster than capacity in future wireless networks. Therefore it will become unavoidable to deal with congestion. Bottlenecks are located on the wireless links because back-haul and Internet are overprovisioned. Traffic routed towards the user terminal (UT) in down-link direction keeps coming in through a big pipe until it reaches the base station (BS). The following wireless links can only carry a limited data rate due to congestion. In a multi-hop situation buffers before the bottlenecks ramp up and become unstable, leading to packet loss. While real-time traffic is safe due to call admission control (CAC), highest static priority and over-provisioning, best effort data traffic experiences congestion and therefore packet losses. A wireless flow control based on a credit-based hop-by-hop concept can solve this problem by avoiding any buffer overflow completely. This paper proposes extending the closed flow control loops to the source, either by a genuine credit-based flow control or by TCP rate control with deep packet inspection and ACK modification. This paper analyses the queueing behavior with stochastic Petri nets models. Markov state analysis provides numeric performance results. The example scenario consists of two wireless relayed hops and a wired back-haul with different control approaches for the hop between source and bottleneck.","PeriodicalId":210916,"journal":{"name":"2011 Australasian Telecommunication Networks and Applications Conference (ATNAC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124834540","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 : 2011-12-08DOI: 10.1109/ATNAC.2011.6096642
Kusha Panta, J. Armstrong
This paper provides an analysis of the continuous time domain representation of the baseband orthogonal frequency division multiplexing (OFDM) signal. It shows that some of the commonly used representations are not consistent with the signal obtained after digital to analog conversion and low pass filtering of the discrete baseband signal. A consistent representation of the continuous time domain OFDM signal is provided.
{"title":"Analysis of continuous time domain representation of OFDM signals","authors":"Kusha Panta, J. Armstrong","doi":"10.1109/ATNAC.2011.6096642","DOIUrl":"https://doi.org/10.1109/ATNAC.2011.6096642","url":null,"abstract":"This paper provides an analysis of the continuous time domain representation of the baseband orthogonal frequency division multiplexing (OFDM) signal. It shows that some of the commonly used representations are not consistent with the signal obtained after digital to analog conversion and low pass filtering of the discrete baseband signal. A consistent representation of the continuous time domain OFDM signal is provided.","PeriodicalId":210916,"journal":{"name":"2011 Australasian Telecommunication Networks and Applications Conference (ATNAC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123488806","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
扫码关注我们
求助内容：
应助结果提醒方式：