Short Message Service (SMS) has been one of the most popular services in mobile communication for years, and its usage is still growing. However, with the usage of Turkish character(s) in SMS message text, the maximum length of a single message reduces from 160 to 70 characters due to the transmission regulations of SMS designated by Cellular Telecommunications and Internet Association. This results in inconvenient communication for cell phone users and causes extra SMS traffic congestion on GSM networks. In this paper, an algorithm – ThinOn, is proposed to solve problems arising with the usage of Turkish character(s). The proposed algorithm is language independent and can also be a prototype model for other languages having characters not included in GSM alphabet.
{"title":"An Approach on Short Message Service Text Transfer for Turkish GSM Operators","authors":"Ahmet Oguz Yilmaz, Cem Ergün, Y. Bi̇ti̇ri̇m","doi":"10.1109/AICT.2009.24","DOIUrl":"https://doi.org/10.1109/AICT.2009.24","url":null,"abstract":"Short Message Service (SMS) has been one of the most popular services in mobile communication for years, and its usage is still growing. However, with the usage of Turkish character(s) in SMS message text, the maximum length of a single message reduces from 160 to 70 characters due to the transmission regulations of SMS designated by Cellular Telecommunications and Internet Association. This results in inconvenient communication for cell phone users and causes extra SMS traffic congestion on GSM networks. In this paper, an algorithm – ThinOn, is proposed to solve problems arising with the usage of Turkish character(s). The proposed algorithm is language independent and can also be a prototype model for other languages having characters not included in GSM alphabet.","PeriodicalId":409336,"journal":{"name":"2009 Fifth Advanced International Conference on Telecommunications","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121730708","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}
In this paper, we investigate time-correlation of the connection request process of web browsing applications and other Internet applications. Evidence of self-similarity in the Internet traffic has been pointed out in several papers, but mainly with reference to the volume of traffic, to the packet arrival process, or to the connection arrival process of aggregated traffic. In our study, instead, we focus on the process of connection requests coming from a single client and study whether asymptotic self-similarity is evident even when there is low client activity, the observation window is short, or data is partial. The analysis is performed on publicly available traffic traces that include both Wide Area and Campus Network traffic. To identify time correlations, we use the novel, unbiased estimator of the power-law exponent based on the Modified Allan Variance (MAVAR). Our results show that self-similarity is evident in web traffic and Domain Name requests, provided that the client is active for more than a few connections. This study is valuable for researchers interested in the modeling of packet traffic sources or in the monitoring of network activity.
{"title":"An Empirical Study of Self-Similarity in the Per-User-Connection Arrival Process","authors":"G. Verticale","doi":"10.1109/AICT.2009.23","DOIUrl":"https://doi.org/10.1109/AICT.2009.23","url":null,"abstract":"In this paper, we investigate time-correlation of the connection request process of web browsing applications and other Internet applications. Evidence of self-similarity in the Internet traffic has been pointed out in several papers, but mainly with reference to the volume of traffic, to the packet arrival process, or to the connection arrival process of aggregated traffic. In our study, instead, we focus on the process of connection requests coming from a single client and study whether asymptotic self-similarity is evident even when there is low client activity, the observation window is short, or data is partial. The analysis is performed on publicly available traffic traces that include both Wide Area and Campus Network traffic. To identify time correlations, we use the novel, unbiased estimator of the power-law exponent based on the Modified Allan Variance (MAVAR). Our results show that self-similarity is evident in web traffic and Domain Name requests, provided that the client is active for more than a few connections. This study is valuable for researchers interested in the modeling of packet traffic sources or in the monitoring of network activity.","PeriodicalId":409336,"journal":{"name":"2009 Fifth Advanced International Conference on Telecommunications","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121045100","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}
A method of admission control based on both resource requests by applications and class-based traffic measurement results was developed. In this method, a wide range of admission-control policy can be realized by adjusting three parameters, α, β, and γ. A policy-server prototype using this method and simulated voice traffic was used in traffic measurements. The measurements results show that the proposed method improves bandwidth usage and decreases call-blocking ratio while incurring low measurement load. Interesting but possibly harmful dynamics (i.e., system behavior) were observed by the simulations using traffic generated by an on/off model. That is, this admission-control method may cause oscillation or long-term evolution that lasts for 100 to 150 minutes, and it may also cause band-width “overshooting”. The range of parameters with which such effects can be properly suppressed and the admission control correctly works was experimentally obtained.
{"title":"A Method of Admission Control Based on Both Resource Requests and Traffic Measurement and Its Dynamics under On/Off Model Traffic","authors":"Y. Kanada","doi":"10.1109/AICT.2009.16","DOIUrl":"https://doi.org/10.1109/AICT.2009.16","url":null,"abstract":"A method of admission control based on both resource requests by applications and class-based traffic measurement results was developed. In this method, a wide range of admission-control policy can be realized by adjusting three parameters, α, β, and γ. A policy-server prototype using this method and simulated voice traffic was used in traffic measurements. The measurements results show that the proposed method improves bandwidth usage and decreases call-blocking ratio while incurring low measurement load. Interesting but possibly harmful dynamics (i.e., system behavior) were observed by the simulations using traffic generated by an on/off model. That is, this admission-control method may cause oscillation or long-term evolution that lasts for 100 to 150 minutes, and it may also cause band-width “overshooting”. The range of parameters with which such effects can be properly suppressed and the admission control correctly works was experimentally obtained.","PeriodicalId":409336,"journal":{"name":"2009 Fifth Advanced International Conference on Telecommunications","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132319557","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}
This paper covers the design of electrical model of Sierpenski fractal antenna. The proposed model is based on the electrical model of triangular patch. Each elementary triangle of Sierpenski patch is replaced by its model and then the whole model is built. The return loss of the model is compared to both a physical patch and another electrical model. The proposed model has the same resonant frequency with the antenna and a few differences in band width and it’s very useful for parametric analysis of the Sierpenski gasket antenna. This work can open other opportunities in the electrical modeling of fractal antennas.
{"title":"An Electrical Model to Sierpenski Gasket Patch Antenna","authors":"F. Abdelhak, S. Noureddine, G. Ali","doi":"10.1109/AICT.2009.55","DOIUrl":"https://doi.org/10.1109/AICT.2009.55","url":null,"abstract":"This paper covers the design of electrical model of Sierpenski fractal antenna. The proposed model is based on the electrical model of triangular patch. Each elementary triangle of Sierpenski patch is replaced by its model and then the whole model is built. The return loss of the model is compared to both a physical patch and another electrical model. The proposed model has the same resonant frequency with the antenna and a few differences in band width and it’s very useful for parametric analysis of the Sierpenski gasket antenna. This work can open other opportunities in the electrical modeling of fractal antennas.","PeriodicalId":409336,"journal":{"name":"2009 Fifth Advanced International Conference on Telecommunications","volume":"33 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114121226","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}
In this paper performance enhancement of the system has been investigated by employing large girth Quasi-Cyclic low-density parity-check (QC-LDPC) codes as forward error correction code, coupled with differential phase shift keying (DPSK) over Rayleigh fading channels. Performance of the system is evaluated by measuring bit error rate (BER) for a given value of . Simulation results at diversity level L=4 have confirmed the robustness of the system with a gain of about 1.5 dB as compared to the results of known differential detection system over Rayleigh Fading Channels at a BER of10^-5 .
{"title":"System Model Performance Coupled with DPSK Modulation over Flat Rayleigh Fading Channels","authors":"O. Sidek, A. Yahya, M. Salleh","doi":"10.1109/AICT.2009.40","DOIUrl":"https://doi.org/10.1109/AICT.2009.40","url":null,"abstract":"In this paper performance enhancement of the system has been investigated by employing large girth Quasi-Cyclic low-density parity-check (QC-LDPC) codes as forward error correction code, coupled with differential phase shift keying (DPSK) over Rayleigh fading channels. Performance of the system is evaluated by measuring bit error rate (BER) for a given value of . Simulation results at diversity level L=4 have confirmed the robustness of the system with a gain of about 1.5 dB as compared to the results of known differential detection system over Rayleigh Fading Channels at a BER of10^-5 .","PeriodicalId":409336,"journal":{"name":"2009 Fifth Advanced International Conference on Telecommunications","volume":"276 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127293842","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}
In this paper we introduce ASN.1 scripts, securely computing cryptographic keys-trees, in smart cards. Keys-trees are used by various protocols such as AKA or EAP that are going to be deployed in next generations of wireless networks (WLAN, WiMAX, EUTRAN…). They provide services such as fast re-authentication, handover management, or Mobile IP support. We propose a trusted computing architecture for these structures, based on smart cards. We suggest two kinds of approaches, static trees working with embedded pre-defined keys generators, and dynamic trees, built from scripts. Finally we detail ASN.1 scripts, designed for dynamic keys-trees computing.
{"title":"Smart Card Benefits for Trusted Processing of Keys-Tree in WLANs","authors":"P. Urien","doi":"10.1109/AICT.2009.70","DOIUrl":"https://doi.org/10.1109/AICT.2009.70","url":null,"abstract":"In this paper we introduce ASN.1 scripts, securely computing cryptographic keys-trees, in smart cards. Keys-trees are used by various protocols such as AKA or EAP that are going to be deployed in next generations of wireless networks (WLAN, WiMAX, EUTRAN…). They provide services such as fast re-authentication, handover management, or Mobile IP support. We propose a trusted computing architecture for these structures, based on smart cards. We suggest two kinds of approaches, static trees working with embedded pre-defined keys generators, and dynamic trees, built from scripts. Finally we detail ASN.1 scripts, designed for dynamic keys-trees computing.","PeriodicalId":409336,"journal":{"name":"2009 Fifth Advanced International Conference on Telecommunications","volume":"177 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124781834","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}
D. C. Vasiliadis, G. Rizos, C. Vassilakis, E. Glavas
Multilayer MINs have emerged mainly due to the increased need for routing capacity in the presence of multicast and broadcast traffic, their performance prediction and evaluation however has not been studied sufficiently insofar. In this paper, we use simulation to evaluate the performance of multilayer MINs with switching elements of different buffer sizes and under different offered loads. The findings of this paper can be used by MIN designers to optimally configure their networks.
{"title":"Performance Evaluation of Multicast Routing over Multilayer Multistage Interconnection Networks","authors":"D. C. Vasiliadis, G. Rizos, C. Vassilakis, E. Glavas","doi":"10.1109/AICT.2009.72","DOIUrl":"https://doi.org/10.1109/AICT.2009.72","url":null,"abstract":"Multilayer MINs have emerged mainly due to the increased need for routing capacity in the presence of multicast and broadcast traffic, their performance prediction and evaluation however has not been studied sufficiently insofar. In this paper, we use simulation to evaluate the performance of multilayer MINs with switching elements of different buffer sizes and under different offered loads. The findings of this paper can be used by MIN designers to optimally configure their networks.","PeriodicalId":409336,"journal":{"name":"2009 Fifth Advanced International Conference on Telecommunications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122323113","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}
Personal devices can form a person-centric network, which is known as a Personal Network (PN). Besides person-oriented communications, there is a growing tendency for group-oriented communications, since it enables the users to enjoy cooperation and promises exciting opportunities for different applications in various fields, such as, entertainment, business healthcare, emergency and education. A Federation of PNs (Fednet) is a group-oriented network that enables the users to federate their personal networks and to share personal resources and services to achieve a common objective. One of the challenges in Fednets is managing a secure dynamic cooperation of PNs. In this paper, we present a secure access control and management framework for Fednets. The framework is based on the two-level approach to the access control: the access to the Fednet and the access to Fednet resources and services. The access control contains authentication, authorization and token granting processes. Furthermore, in this paper, we describe our initial prototyping experience of this framework. Preliminary results showed that the approach is suitable for Fednets of small sizes and therefore, further work is required to investigate the scalability issues. Finally, we briefly discuss the related work.
个人设备可以形成以人为中心的网络，称为个人网络(Personal network, PN)。除了面向个人的通信之外，面向群体的通信也有增长的趋势，因为它使用户能够享受合作，并为各种领域的不同应用提供了令人兴奋的机会，例如娱乐，商业，医疗保健，应急和教育。联邦网络(Federation of pn, federnet)是一种面向群体的网络，用户可以通过联合个人网络，共享个人资源和服务，实现共同的目标。联邦网络面临的挑战之一是如何管理pn之间的安全动态合作。在本文中，我们提出了一个联邦储备网的安全访问控制和管理框架。该框架基于访问控制的两级方法:对Fednet的访问和对Fednet资源和服务的访问。访问控制包含身份验证、授权和令牌授予过程。此外，在本文中，我们描述了我们对该框架的初始原型设计经验。初步结果表明，该方法适用于小型Fednets，因此，需要进一步研究可扩展性问题。最后，对相关工作进行了简要讨论。
{"title":"A Framework for Access Control and Management in Dynamic Cooperative and Federated Environments","authors":"Malohat Ibrohimovna, S. Groot","doi":"10.1109/AICT.2009.81","DOIUrl":"https://doi.org/10.1109/AICT.2009.81","url":null,"abstract":"Personal devices can form a person-centric network, which is known as a Personal Network (PN). Besides person-oriented communications, there is a growing tendency for group-oriented communications, since it enables the users to enjoy cooperation and promises exciting opportunities for different applications in various fields, such as, entertainment, business healthcare, emergency and education. A Federation of PNs (Fednet) is a group-oriented network that enables the users to federate their personal networks and to share personal resources and services to achieve a common objective. One of the challenges in Fednets is managing a secure dynamic cooperation of PNs. In this paper, we present a secure access control and management framework for Fednets. The framework is based on the two-level approach to the access control: the access to the Fednet and the access to Fednet resources and services. The access control contains authentication, authorization and token granting processes. Furthermore, in this paper, we describe our initial prototyping experience of this framework. Preliminary results showed that the approach is suitable for Fednets of small sizes and therefore, further work is required to investigate the scalability issues. Finally, we briefly discuss the related work.","PeriodicalId":409336,"journal":{"name":"2009 Fifth Advanced International Conference on Telecommunications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115094454","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}
D. Krstić, M. Stefanovic, P. Nikolic, S. Jovkovic, C. Stefanovic
The level crossing rate, the outage probability and the average time of fade duration of the Switch and Stay Combiner output signal, in the presence of Rice fading at the input, are determined in this paper. The results are shown graphically for different variance values, decision threshold values and signal and fading parameters values.
{"title":"The Outage Probability and Fade Duration of the SSC Combiner Output Signal in the Presence of Rice Fading","authors":"D. Krstić, M. Stefanovic, P. Nikolic, S. Jovkovic, C. Stefanovic","doi":"10.1109/AICT.2009.57","DOIUrl":"https://doi.org/10.1109/AICT.2009.57","url":null,"abstract":"The level crossing rate, the outage probability and the average time of fade duration of the Switch and Stay Combiner output signal, in the presence of Rice fading at the input, are determined in this paper. The results are shown graphically for different variance values, decision threshold values and signal and fading parameters values.","PeriodicalId":409336,"journal":{"name":"2009 Fifth Advanced International Conference on Telecommunications","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133663741","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}
The article proposes a new method for calculating occupancy distribution and blocking/loss probability in the limited availability group with bandwidth reservation. The proposed method makes it possible to model groups servicing multi-service BPP traffic streams (Binomial--Poisson--Pascal). The proposed method is based on the analysis of the service process occurring in the considered system on the basis of the one-dimensional Markov chain. Significant increase in the accuracy and precision of the proposed method, in relation to other methods known from the literature, was obtained as the result of a modification of service streams within the reservation space. The accuracy of the proposed method has been verified by simulation studies.
{"title":"Modelling Limited-Availability Groups with BPP Traffic and Bandwidth Reservation","authors":"M. Głąbowski, M. Sobieraj, M. Stasiak","doi":"10.1109/AICT.2009.21","DOIUrl":"https://doi.org/10.1109/AICT.2009.21","url":null,"abstract":"The article proposes a new method for calculating occupancy distribution and blocking/loss probability in the limited availability group with bandwidth reservation. The proposed method makes it possible to model groups servicing multi-service BPP traffic streams (Binomial--Poisson--Pascal). The proposed method is based on the analysis of the service process occurring in the considered system on the basis of the one-dimensional Markov chain. Significant increase in the accuracy and precision of the proposed method, in relation to other methods known from the literature, was obtained as the result of a modification of service streams within the reservation space. The accuracy of the proposed method has been verified by simulation studies.","PeriodicalId":409336,"journal":{"name":"2009 Fifth Advanced International Conference on Telecommunications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133506307","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
扫码关注我们
求助内容：
应助结果提醒方式：