{"title":"Using GSM/UMTS for single sign-on","authors":"A. Pashalidis, C. Mitchell","doi":"10.1109/TIC.2003.1249107","DOIUrl":"https://doi.org/10.1109/TIC.2003.1249107","url":null,"abstract":"At present, network users have to remember a user-name and a corresponding password for every service with which they are registered. Single sign-on (SSO) has been proposed as a solution to the usability, security and management implications of this situation. Under SSO, users authenticate themselves only once to an entity termed the 'authentication service provider' (ASP) and subsequently use disparate service providers (SPs) without re-authenticating. The information about the user's authentication status is handled between the ASP and the desired SP in a manner transparent to the user. We propose an SSO protocol where a GSM or UMTS operator plays the role of the ASP and by which its subscribers can be authenticated to SPs without any user interaction and in a way that preserves the user's privacy and mobility. The protocol requires only minimal changes to the deployed GSM infrastructure.","PeriodicalId":177770,"journal":{"name":"SympoTIC'03. Joint 1st Workshop on Mobile Future and Symposium on Trends in Communications","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123563433","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}
{"title":"Intelligent methods for simulation in ATM networks","authors":"D. Radev, S. Radeva","doi":"10.1109/TIC.2003.1249096","DOIUrl":"https://doi.org/10.1109/TIC.2003.1249096","url":null,"abstract":"The paper presents results from a number of investigations into the problems of implementing intelligent methods in the prediction and simulation of ATM traffic, based on time series and state models. A prognosis method based on a neuro-fuzzy model and learning vector quantization (LVQ) is suggested The implementation for stochastic and long range dependence source models is shown.","PeriodicalId":177770,"journal":{"name":"SympoTIC'03. Joint 1st Workshop on Mobile Future and Symposium on Trends in Communications","volume":"466 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116232109","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}
{"title":"Nexus - the mobile GIS-environment","authors":"Dieter Fritsch, S. Volz","doi":"10.1109/TIC.2003.1249074","DOIUrl":"https://doi.org/10.1109/TIC.2003.1249074","url":null,"abstract":"Individual mobility plays a crucial role in our everyday life. Since people spend a lot of time being mobile, making mobility more efficient is a demand of most of them. Due to the latest developments in the fields of computer technology and wireless communication, it has become possible for computer applications to meet the needs of mobile individuals. Since positioning techniques have also reached an acceptable accuracy, the location of users can be exploited by mobile applications, too. Thus, location-based services (LBS) evolved. They prepare information and services according to a user's position. The data and operations they provide very much coincide with those available in GIS. For this reason, LBS can be understood as mobile GIS applications. At the University of Stuttgart, a research project called Nexus has been initiated to create an open and global environment for mobile GIS. The paper briefly introduces the idea of Nexus and describes the architecture and the data model of the platform. Then, approaches for spatial data integration are outlined.","PeriodicalId":177770,"journal":{"name":"SympoTIC'03. Joint 1st Workshop on Mobile Future and Symposium on Trends in Communications","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122959006","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}
{"title":"Further results on the capacity estimation of two-dimensional run-length constrained channels using fractals","authors":"J. Mačica","doi":"10.1109/TIC.2003.1249085","DOIUrl":"https://doi.org/10.1109/TIC.2003.1249085","url":null,"abstract":"A capacity estimation method has been proposed for two-dimensional channels with constraints (Macica, J. and Farkas, P., 2003). Specific constraints are defined by two-dimensional binary patterns that satisfy one-dimensional (d,k) runlength constraints both horizontally and vertically and, for some of the patterns, also diagonally. Fractals are used for finding the state-transition matrices. The capacity calculation is based on exact calculations for small 2-dimensional areas, then estimation by extrapolation is used for bigger areas.","PeriodicalId":177770,"journal":{"name":"SympoTIC'03. Joint 1st Workshop on Mobile Future and Symposium on Trends in Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129068386","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}
{"title":"PANA/GSM authentication for Internet access","authors":"Paulo S. Pagliusi, Chris J. Mitchell","doi":"10.1109/TIC.2003.1249108","DOIUrl":"https://doi.org/10.1109/TIC.2003.1249108","url":null,"abstract":"Currently, there are no Internet access authentication protocols available that are lightweight, can be carried over arbitrary access networks, and are flexible enough to be used in all the likely future ubiquitous mobility access contexts. The IETF PANA (Protocol for carrying Authentication for Network Access) work aims to provide a protocol that will be a network-layer authentication carrier for access networks that support IP. The article proposes a PANA/GSM authentication protocol for heterogeneous network access as a step towards filling this gap. A security analysis of the PANA/GSM protocol is also provided. The article aims primarily at contributing to the design of authentication protocols suitable for use in future heterogeneous Internet access environments supporting ubiquitous mobility.","PeriodicalId":177770,"journal":{"name":"SympoTIC'03. Joint 1st Workshop on Mobile Future and Symposium on Trends in Communications","volume":"147 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123483776","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}
Dimitrios Kagklis, Christos Tsakiris, Nicolas Liampotis
{"title":"Approach for activation of IP services with guaranteed QoS using signalling mechanisms","authors":"Dimitrios Kagklis, Christos Tsakiris, Nicolas Liampotis","doi":"10.1109/TIC.2003.1249090","DOIUrl":"https://doi.org/10.1109/TIC.2003.1249090","url":null,"abstract":"Internet Protocol-based applications are the prevailing trend of the telecommunications market, but the path towards the \"IP over everything\" target is not unhampered. The main shortcoming of IP is its inability to provide guaranteed quality of service (QoS), although significant effort is spent within different standardization bodies and organizations. We propose an architecture for the activation of Internet services based on the existing service level specification (SLS), with guaranteed QoS using signalling mechanisms and IP QoS signalling protocols. The customer is provided with an uncomplicated interface to specify his service request while the service provider performs service management effectively in an aggregated manner. The novelty of the proposed approach is the reduction of the operational cost of an Internet service provider (ISP) and the time needed for a customer to request and access services.","PeriodicalId":177770,"journal":{"name":"SympoTIC'03. Joint 1st Workshop on Mobile Future and Symposium on Trends in Communications","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127748313","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}
{"title":"A modified Blahut algorithm for decoding Reed-Solomon codes beyond half the minimum distance","authors":"S. Egorov, G. Markarian","doi":"10.1109/TIC.2003.1249078","DOIUrl":"https://doi.org/10.1109/TIC.2003.1249078","url":null,"abstract":"A modification of the Blahut algorithm is proposed for decoding Reed-Solomon codes beyond half the minimum distance. An RS code is described as an (n, k) code, where the codeword consists of n symbols from a Galois field of q elements, k of which are information symbols, with r=(n-k) check symbols. We define the minimum distance, d=r+1, and the maximum number of error symbols that can be corrected, t. An effective method is offered for searching the unknown discrepancies needed for analytical continuation of the Berlekamp-Massey algorithm through two additional iterations. This reduces the search time by 2(q-1)n/((n+t+1)(n-t)) times compared to the Blahut algorithm. An architecture of a searcher for unknown discrepancies is given. The coding gain of the proposed algorithm is shown for some practical codes.","PeriodicalId":177770,"journal":{"name":"SympoTIC'03. Joint 1st Workshop on Mobile Future and Symposium on Trends in Communications","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134216139","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}
{"title":"On structured trellises of some best [n,k,d] codes","authors":"P. Farkaš, R. Hoc, H. Bali","doi":"10.1109/TIC.2003.1249086","DOIUrl":"https://doi.org/10.1109/TIC.2003.1249086","url":null,"abstract":"The paper presents new linear binary block codes, with codeword length, n, number of information symbols in codewords, k, and code distance, d, which reach the upper or lower bounds on maximal code-distance, using the construction of M. Kasahara et al. (see IEEE Trans. on Inform. Theory, vol.IT-22, p.462-8, 1976) for some combination of the mentioned parameters. The paper presents, as well, the structured trellises for these codes, using the construction method presented by P. Farka et al. (see Proc. 5th Int. Symp. on Wireless Personal Multimedia Communications, p.1262-4, 2002). The practical importance for wireless communications is that knowledge of the structured trellis can allow decoding of the corresponding code using different soft (turbo) algorithms. In this way, the set of useful codes for practical applications is broadened to 'best' codes, that would otherwise be difficult to decode using soft algorithms.","PeriodicalId":177770,"journal":{"name":"SympoTIC'03. Joint 1st Workshop on Mobile Future and Symposium on Trends in Communications","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131657336","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}
{"title":"Scalar multiple scattering model for remote sensing applications","authors":"M. Kocifaj, R. Psanecky, Ľ. Kohút","doi":"10.1109/TIC.2003.1249098","DOIUrl":"https://doi.org/10.1109/TIC.2003.1249098","url":null,"abstract":"The scalar radiative transfer model based on multiple scattering theory is presented. The method of successive orders is applied to solve the radiative transfer equation separately for each scattering order, when assuming Lambertian surface reflectance. It is shown that the presented multiple light scattering model provides us with an accurate atmospheric correction, and that the spectral upward and downward radiances as well as the radiative fluxes can be calculated with a sufficient accuracy. The computational effort when processing remote sensing data may be significantly minimized, because only 2 scattering orders have a measurable contribution to the detected radiation characteristics.","PeriodicalId":177770,"journal":{"name":"SympoTIC'03. Joint 1st Workshop on Mobile Future and Symposium on Trends in Communications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134157468","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}
{"title":"Two-dimensional orthogonal complete complementary codes","authors":"P. Farkaš, M. Turcsány","doi":"10.1109/TIC.2003.1249079","DOIUrl":"https://doi.org/10.1109/TIC.2003.1249079","url":null,"abstract":"Two families of two-dimensional orthogonal complete complementary codes (2D-OCCC) are presented They can be constructed, for example, over binary or complex symbols. The new 2D-OCCC retain most of the properties of the 1D-OCCC. The autocorrelation function is equal to zero for all nonzero shifts in both dimensions of any signature selected from the code. The cross-correlation for any pair of different signatures is equal to zero for all possible shifts in both dimensions.","PeriodicalId":177770,"journal":{"name":"SympoTIC'03. Joint 1st Workshop on Mobile Future and Symposium on Trends in Communications","volume":"56 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133391608","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}