Pub Date : 2014-06-10DOI: 10.1109/ICC.2014.6883887
A. Afsharinejad, A. Davy, B. Jennings, S. Balasubramaniam
We propose and evaluate a number of of frequency selection strategies for nano-scale devices using graphene-based nano-antennas (“graphennas”), which operate in the Terahertz band. The strategies take into account the limitations of Terahertz channel and aim to optimize the overall network transmission rate of a network of nano-devices, while maximizing various objectives. We investigate the trade-off between cases where: 1) frequency duplication within the network is allowed or prevented; 2) limiting the spread of frequencies over the entire Terahertz range is required; and 3) balancing the load between the network sink nodes is required. We compare the network performance for the different objectives proposed against a random frequency selection strategy. Our simulation study demonstrates the efficiency of the proposed algorithms and indicates their usefulness in different application scenarios.
{"title":"GA-based frequency selection strategies for graphene-based nano-communication networks","authors":"A. Afsharinejad, A. Davy, B. Jennings, S. Balasubramaniam","doi":"10.1109/ICC.2014.6883887","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883887","url":null,"abstract":"We propose and evaluate a number of of frequency selection strategies for nano-scale devices using graphene-based nano-antennas (“graphennas”), which operate in the Terahertz band. The strategies take into account the limitations of Terahertz channel and aim to optimize the overall network transmission rate of a network of nano-devices, while maximizing various objectives. We investigate the trade-off between cases where: 1) frequency duplication within the network is allowed or prevented; 2) limiting the spread of frequencies over the entire Terahertz range is required; and 3) balancing the load between the network sink nodes is required. We compare the network performance for the different objectives proposed against a random frequency selection strategy. Our simulation study demonstrates the efficiency of the proposed algorithms and indicates their usefulness in different application scenarios.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"244 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128754511","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-06-10DOI: 10.1109/ICC.2014.6884260
Nikola Rendevski, D. Cassioli
Multi-gigabit 60 GHz radios are expected to match QoS requirements of modern multimedia applications. Several published standards were defined based on performance evaluations over standard channel models. Unfortunately, those models, and most models available in the literature, do not take into account the behavior of 60 GHz channels at different carrier frequencies, thus no guidelines are provided for the selection of the best suitable frequency band for a given service. This paper analyzes the impact of changes in multipath profiles, due to both frequency and distance, on the BER performance achieved by IEEE 802.11ad 60 GHz radios. Our analysis is based on real experimental channel impulse responses recorded through an indoor measurement campaign in seven sub-bands from 54 to 65 GHz with a break at 60 GHz at distances from 1 to 5 m. The small-scale fading is modeled by Rician distributions with K-factors extracted from experimental data, which are shown to give good agreement with the empirical distributions. A strong dependence of performance on both frequency and distance due to the sole multipath is observed, which calls for an appropriate selection of the best suitable frequency band according to the service required by the current session over the 802.11ad link.
{"title":"BER of IEEE 802.11ad OFDM radios vs. carrier frequency in real 60 GHz indoor channels","authors":"Nikola Rendevski, D. Cassioli","doi":"10.1109/ICC.2014.6884260","DOIUrl":"https://doi.org/10.1109/ICC.2014.6884260","url":null,"abstract":"Multi-gigabit 60 GHz radios are expected to match QoS requirements of modern multimedia applications. Several published standards were defined based on performance evaluations over standard channel models. Unfortunately, those models, and most models available in the literature, do not take into account the behavior of 60 GHz channels at different carrier frequencies, thus no guidelines are provided for the selection of the best suitable frequency band for a given service. This paper analyzes the impact of changes in multipath profiles, due to both frequency and distance, on the BER performance achieved by IEEE 802.11ad 60 GHz radios. Our analysis is based on real experimental channel impulse responses recorded through an indoor measurement campaign in seven sub-bands from 54 to 65 GHz with a break at 60 GHz at distances from 1 to 5 m. The small-scale fading is modeled by Rician distributions with K-factors extracted from experimental data, which are shown to give good agreement with the empirical distributions. A strong dependence of performance on both frequency and distance due to the sole multipath is observed, which calls for an appropriate selection of the best suitable frequency band according to the service required by the current session over the 802.11ad link.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128229789","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-06-10DOI: 10.1109/ICC.2014.6884212
Panagiotis Botsinis, S. Ng, L. Hanzo
The potentially excessive complexity of the Maximum Likelihood Multi-User Detector (ML MUD) in large-scale Spatial Division Multiple Access (SDMA) systems dictates the employment of low-complexity sub-optimal MUDs in the context of conventional systems. However, this limitation was circumvented by the recently proposed Dürr-Høyer Algorithm (DHA)-aided Quantum Weighted Sum Algorithm (QWSA)-based Quantum Multi-User Detector (QMUD) employed for performing optimal ML iterative detection in SDMA systems. Focusing our attention on the QWSA, we analyse the QMUD and the evolution of the quantum system with the aid of a simple SDMA uplink scenario. We characterize the performance of the DHA-QWSA QMUD advocated, which is capable of matching the performance of the ML MUD both in terms of its EXIT charts and BER curves.
在大规模空分多址(SDMA)系统中，最大似然多用户检测器(ML MUD)可能过于复杂，这决定了在传统系统中使用低复杂性的次优MUD。然而，最近提出的基于 rr- h øyer算法(DHA)辅助量子加权和算法(QWSA)的量子多用户检测器(QMUD)绕过了这一限制，该检测器用于在SDMA系统中执行最优ML迭代检测。我们将重点放在QWSA上，通过一个简单的SDMA上行场景分析QMUD和量子系统的演化。我们对所提倡的DHA-QWSA QMUD的性能进行了表征，它能够在出口图和BER曲线方面匹配ML MUD的性能。
{"title":"Low-complexity iterative quantum multi-user detection in SDMA systems","authors":"Panagiotis Botsinis, S. Ng, L. Hanzo","doi":"10.1109/ICC.2014.6884212","DOIUrl":"https://doi.org/10.1109/ICC.2014.6884212","url":null,"abstract":"The potentially excessive complexity of the Maximum Likelihood Multi-User Detector (ML MUD) in large-scale Spatial Division Multiple Access (SDMA) systems dictates the employment of low-complexity sub-optimal MUDs in the context of conventional systems. However, this limitation was circumvented by the recently proposed Dürr-Høyer Algorithm (DHA)-aided Quantum Weighted Sum Algorithm (QWSA)-based Quantum Multi-User Detector (QMUD) employed for performing optimal ML iterative detection in SDMA systems. Focusing our attention on the QWSA, we analyse the QMUD and the evolution of the quantum system with the aid of a simple SDMA uplink scenario. We characterize the performance of the DHA-QWSA QMUD advocated, which is capable of matching the performance of the ML MUD both in terms of its EXIT charts and BER curves.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128336248","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-06-10DOI: 10.1109/ICC.2014.6883637
Aseem Wadhwa, Upamanyu Madhow, Naresh R Shanbhag
As modern communication transceivers scale to multi-Gbps speeds, the power consumption and cost of highresolution, high-speed analog-to-digital converters (ADCs) become a crucial bottleneck in realizing “mostly digital” receiver architectures that leverage Moore's law. This bottleneck could potentially be alleviated by designing analog front ends for the more specific goal of analog-to-information conversion (i.e., preserving the digital information residing in the received signal). As one possible approach towards this goal, we consider a generalization of the standard flash ADC: instead of implementing n bit quantization of a sample by passing it through 2n -1 slicers as in a standard ADC, the slicers are dispersed in time as well as space (i.e., amplitude). Considering BPSK over a dispersive channel, we first show, using ideas similar to those underlying compressive sensing, that randomly dispersing enough one-bit slicers over space and time does provide information sufficient for reliable demodulation over a dispersive channel. We then propose an iterative algorithm for optimizing the design of the sampling times and amplitude thresholds, and provide numerical results showing that the number of slicers can be significantly reduced relative to a conventional flash ADC with comparable bit error rate (BER). These system-level results motivate further investigation, in terms of both circuit and system design, into looking beyond conventional ADC architectures when designing analog front-ends for high-speed communication.
{"title":"Space-time slicer architectures for analog-to-information conversion in channel equalizers","authors":"Aseem Wadhwa, Upamanyu Madhow, Naresh R Shanbhag","doi":"10.1109/ICC.2014.6883637","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883637","url":null,"abstract":"As modern communication transceivers scale to multi-Gbps speeds, the power consumption and cost of highresolution, high-speed analog-to-digital converters (ADCs) become a crucial bottleneck in realizing “mostly digital” receiver architectures that leverage Moore's law. This bottleneck could potentially be alleviated by designing analog front ends for the more specific goal of analog-to-information conversion (i.e., preserving the digital information residing in the received signal). As one possible approach towards this goal, we consider a generalization of the standard flash ADC: instead of implementing n bit quantization of a sample by passing it through 2n -1 slicers as in a standard ADC, the slicers are dispersed in time as well as space (i.e., amplitude). Considering BPSK over a dispersive channel, we first show, using ideas similar to those underlying compressive sensing, that randomly dispersing enough one-bit slicers over space and time does provide information sufficient for reliable demodulation over a dispersive channel. We then propose an iterative algorithm for optimizing the design of the sampling times and amplitude thresholds, and provide numerical results showing that the number of slicers can be significantly reduced relative to a conventional flash ADC with comparable bit error rate (BER). These system-level results motivate further investigation, in terms of both circuit and system design, into looking beyond conventional ADC architectures when designing analog front-ends for high-speed communication.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128555803","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-06-10DOI: 10.1109/ICC.2014.6883606
H. Boche, R. Schaefer
Research activities reveal a trend from an exclusive to a shared use of certain frequency bands. Then, uncoordinated interference will be unavoidable resulting in a channel that may vary in an arbitrary and unknown manner from channel use to channel use. This is the arbitrarily varying channel (AVC), for which it has been shown that the classical deterministic approaches with pre-specified encoder and decoder fail if the AVC is symmetrizable. This necessitates more sophisticated strategies such as common randomness (CR) assisted strategies or list decoding which are capable to resolve the ambiguity induced by symmetrizable AVCs. Here, we study the arbitrarily varying multiple access channel (AVMAC) with conferencing encoders, which is motivated by cooperating base stations or access points in future communication systems. The capacity region of the AVMAC with conferencing encoders is established and it is shown that list decoding allows for reliable communication also for symmetrizable AVMACs. The list capacity region equals the CR-assisted capacity region for large enough list size. Finally, for fixed probability of decoding error the amount of resources, i.e., CR or list size, is shown to be finite.
{"title":"List decoding for arbitrarily varying multiple access channels with conferencing encoders","authors":"H. Boche, R. Schaefer","doi":"10.1109/ICC.2014.6883606","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883606","url":null,"abstract":"Research activities reveal a trend from an exclusive to a shared use of certain frequency bands. Then, uncoordinated interference will be unavoidable resulting in a channel that may vary in an arbitrary and unknown manner from channel use to channel use. This is the arbitrarily varying channel (AVC), for which it has been shown that the classical deterministic approaches with pre-specified encoder and decoder fail if the AVC is symmetrizable. This necessitates more sophisticated strategies such as common randomness (CR) assisted strategies or list decoding which are capable to resolve the ambiguity induced by symmetrizable AVCs. Here, we study the arbitrarily varying multiple access channel (AVMAC) with conferencing encoders, which is motivated by cooperating base stations or access points in future communication systems. The capacity region of the AVMAC with conferencing encoders is established and it is shown that list decoding allows for reliable communication also for symmetrizable AVMACs. The list capacity region equals the CR-assisted capacity region for large enough list size. Finally, for fixed probability of decoding error the amount of resources, i.e., CR or list size, is shown to be finite.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128586350","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-06-10DOI: 10.1109/ICC.2014.6883935
Xiang Zhang, Dejun Yang, G. Xue
In a competitive environment, competing agents would maximize their ideas' influence for higher profits. For example, in an unsaturated market, when a new company participates in the market sharing competition, it would distribute free tryout or discount to several customers, let them adopt the product or service, and influence others to use this product as propagation goes. This situation can also be applied to other scenarios, such as spreading new ideas in online social networks, political elections, and so on. In this paper, we use a model called Dynamic Influence in Competitive Environments (DICE) to perform the influence propagation. We first prove that finding the optimal utility for the new agent is an NP-hard problem under DICE. Then, we provide an algorithm for these new companies, and prove that the algorithm has a (1/3 - ϵ/n)-approximation ratio to the maximum payoff value. Performance results show that our algorithm has a better performance compared to existing strategies in terms of maximizing the utility for new agents.
{"title":"Maximizing influence propagation for new agents in Competitive Environments","authors":"Xiang Zhang, Dejun Yang, G. Xue","doi":"10.1109/ICC.2014.6883935","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883935","url":null,"abstract":"In a competitive environment, competing agents would maximize their ideas' influence for higher profits. For example, in an unsaturated market, when a new company participates in the market sharing competition, it would distribute free tryout or discount to several customers, let them adopt the product or service, and influence others to use this product as propagation goes. This situation can also be applied to other scenarios, such as spreading new ideas in online social networks, political elections, and so on. In this paper, we use a model called Dynamic Influence in Competitive Environments (DICE) to perform the influence propagation. We first prove that finding the optimal utility for the new agent is an NP-hard problem under DICE. Then, we provide an algorithm for these new companies, and prove that the algorithm has a (1/3 - ϵ/n)-approximation ratio to the maximum payoff value. Performance results show that our algorithm has a better performance compared to existing strategies in terms of maximizing the utility for new agents.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128620652","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-06-10DOI: 10.1109/ICC.2014.6883736
P. Salvo, F. Cuomo, A. Baiocchi, I. Rubin
Implementations of data dissemination protocols in Vehicular Ad-Hoc Networks (VANETs) typically use multi-hopping approaches at the network layer, employing timers whose expiration times determine whether a vehicle should relay a message. These protocols, when they interact with lower access layers, such as the IEEE 802.11p MAC, are often affected by phenomena that impair the performance of the dissemination process. In this paper, we highlight the spurious forwarding phenomenon that arises when using timer-based protocols. We demonstrate the degradation incurred in the packet dissemination performance when the VANET is loaded by a high rate of packet flows. We then propose a probabilistic decimation approach, demonstrate its ability to alleviate the spurious forwarding problem, and discuss its performance as a function of vehicular traffic density and packet flow rate. Comparisons with other probabilistic dissemination protocols highlight the significant performance improvement attained by using our approach, assuring the realization of high throughput rate and packet delivery ratio.
{"title":"Probabilistic relay selection in timer-based dissemination protocols for VANETs","authors":"P. Salvo, F. Cuomo, A. Baiocchi, I. Rubin","doi":"10.1109/ICC.2014.6883736","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883736","url":null,"abstract":"Implementations of data dissemination protocols in Vehicular Ad-Hoc Networks (VANETs) typically use multi-hopping approaches at the network layer, employing timers whose expiration times determine whether a vehicle should relay a message. These protocols, when they interact with lower access layers, such as the IEEE 802.11p MAC, are often affected by phenomena that impair the performance of the dissemination process. In this paper, we highlight the spurious forwarding phenomenon that arises when using timer-based protocols. We demonstrate the degradation incurred in the packet dissemination performance when the VANET is loaded by a high rate of packet flows. We then propose a probabilistic decimation approach, demonstrate its ability to alleviate the spurious forwarding problem, and discuss its performance as a function of vehicular traffic density and packet flow rate. Comparisons with other probabilistic dissemination protocols highlight the significant performance improvement attained by using our approach, assuring the realization of high throughput rate and packet delivery ratio.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124652754","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-06-10DOI: 10.1109/ICC.2014.6883334
A. Ksentini, T. Taleb, Xiaohu Ge, Honglin Hu
This paper describes a device triggering optimization technique for controlling system overload when deploying massive Machine Type Communication (MTC) devices in 3GPP-based cellular networks. Triggering a large number of MTC devices can dramatically overload the underlying transport network system and incur congestion in both the Radio Access Network (RAN) and the Evolved Packet Core (EPC). The proposed solution aims at controlling the rate of device trigger requests that MTC servers can generate in order to reduce the system overload. For this purpose, we propose that the Mobility Management Entity (MME), or an alike core network node, computes the device trigger rate that alleviates congestion, and communicates this value to the MTC-Interworking Function (MTC-IWF) element that enforces MTC traffic control, via admission control or data aggregation, on the device trigger request rate received from the different MTC servers. The proposed solution is evaluated through computer simulations and encouraging results are obtained.
{"title":"Congestion-aware MTC device triggering","authors":"A. Ksentini, T. Taleb, Xiaohu Ge, Honglin Hu","doi":"10.1109/ICC.2014.6883334","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883334","url":null,"abstract":"This paper describes a device triggering optimization technique for controlling system overload when deploying massive Machine Type Communication (MTC) devices in 3GPP-based cellular networks. Triggering a large number of MTC devices can dramatically overload the underlying transport network system and incur congestion in both the Radio Access Network (RAN) and the Evolved Packet Core (EPC). The proposed solution aims at controlling the rate of device trigger requests that MTC servers can generate in order to reduce the system overload. For this purpose, we propose that the Mobility Management Entity (MME), or an alike core network node, computes the device trigger rate that alleviates congestion, and communicates this value to the MTC-Interworking Function (MTC-IWF) element that enforces MTC traffic control, via admission control or data aggregation, on the device trigger request rate received from the different MTC servers. The proposed solution is evaluated through computer simulations and encouraging results are obtained.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124674844","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-06-10DOI: 10.1109/ICC.2014.6884038
F. Penna, S. Stańczak, Zhe Ren, P. Fertl
We present a statistical approach for estimating the interference coupling coefficients in an LTE network based on a set of various measurements available at the network and terminal level. The proposed approach combines the measurements with prior information (spatial correlation among interference links) and takes into account measurement uncertainty. The result is a simple closed-form estimator that allows for fast realtime interference estimation.
{"title":"MMSE interference estimation in LTE networks","authors":"F. Penna, S. Stańczak, Zhe Ren, P. Fertl","doi":"10.1109/ICC.2014.6884038","DOIUrl":"https://doi.org/10.1109/ICC.2014.6884038","url":null,"abstract":"We present a statistical approach for estimating the interference coupling coefficients in an LTE network based on a set of various measurements available at the network and terminal level. The proposed approach combines the measurements with prior information (spatial correlation among interference links) and takes into account measurement uncertainty. The result is a simple closed-form estimator that allows for fast realtime interference estimation.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129428442","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-06-10DOI: 10.1109/ICC.2014.6883670
Xian Wang, Xianfu Lei, R. Hu, Y. Qian
Long Term Evolution uses a new location update (LU) scheme, called a tracking area list (TAL)-based scheme, to overcome the defects of the LU scheme used in 2G and 3G cellular networks. Under the TAL-based LU scheme, each time a user equipment (UE) performs an LU, it is allocated a group of tracking areas, referred to as a TAL, within which the UE can move freely without any LU. The UE performs an LU when moving out of the TAL. The performance of the TAL-based LU scheme depends on the allocated TAL. In this paper we develop a mathematical model to analyze the signaling overhead of the TAL-based LU scheme for local UEs whose mobility exhibits strong regularity. We derive formulas for the LU cost and the paging cost of a TAL allocation strategy. With these formulas we can find an optimal TAL allocation strategy to minimize the signaling cost of the TAL-based LU scheme.
Long Term Evolution使用一种新的位置更新(LU)方案，称为基于跟踪区域列表(TAL)的方案，以克服2G和3G蜂窝网络中使用的LU方案的缺陷。在基于逻辑单元的逻辑单元方案中，每次用户设备执行逻辑单元时，它被分配一组跟踪区域，称为TAL，在此区域内，终端可以自由移动而不需要任何逻辑单元。UE在移出TAL时执行LU。基于TAL的LU方案的性能取决于分配的TAL。本文建立了一个数学模型来分析基于tal的本地终端的信令开销，这些终端的移动性表现出很强的规律性。我们推导了TAL分配策略的LU成本和分页成本的公式。利用这些公式，我们可以找到一个最优的TAL分配策略，以最小化基于TAL的LU方案的信令成本。
{"title":"Modeling of tracking area list-based location update scheme in Long Term Evolution","authors":"Xian Wang, Xianfu Lei, R. Hu, Y. Qian","doi":"10.1109/ICC.2014.6883670","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883670","url":null,"abstract":"Long Term Evolution uses a new location update (LU) scheme, called a tracking area list (TAL)-based scheme, to overcome the defects of the LU scheme used in 2G and 3G cellular networks. Under the TAL-based LU scheme, each time a user equipment (UE) performs an LU, it is allocated a group of tracking areas, referred to as a TAL, within which the UE can move freely without any LU. The UE performs an LU when moving out of the TAL. The performance of the TAL-based LU scheme depends on the allocated TAL. In this paper we develop a mathematical model to analyze the signaling overhead of the TAL-based LU scheme for local UEs whose mobility exhibits strong regularity. We derive formulas for the LU cost and the paging cost of a TAL allocation strategy. With these formulas we can find an optimal TAL allocation strategy to minimize the signaling cost of the TAL-based LU scheme.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126858363","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
扫码关注我们
求助内容：
应助结果提醒方式：