{"title":"Asterisk as a Public Switched Telephone Network Gateway for an IMS test bed","authors":"Alton MacDonald, R. Cartas, J. Incera","doi":"10.1109/ICTEL.2010.5478843","DOIUrl":"https://doi.org/10.1109/ICTEL.2010.5478843","url":null,"abstract":"Network operators are in the process of adopting the IP Multimedia Subsystem (IMS) as their main underlying infrastructure which will in turn be used as a Service Delivery Platform (SDP). This process requires the migration of current services to their IMS counterparts, as well as a compatibility layer enabling successfull communication between IMS and other network infrastructures. Any and all functionality within IMS is normally available through an Application Server (AS). This paper presents an implementation of a Public Switched Telephone Network (PSTN) Gateway which is able to successfully interface with an IMS test bed. Consequently, it also allows calls to be placed between IMS and other Voice over IP (VoIP) providers. The gateway is enabled as an AS with the help of Asterisk.","PeriodicalId":208094,"journal":{"name":"2010 17th International Conference on Telecommunications","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123720260","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":"Data collection and monitoring using cellular wireless network: GSM","authors":"F. Basma, Y. Tachwali, Kyle Sparger, H. Refai","doi":"10.1109/ICTEL.2010.5478847","DOIUrl":"https://doi.org/10.1109/ICTEL.2010.5478847","url":null,"abstract":"Due to the rapid expansion of road and highway system around the world, there is a growing demand to monitor vehicle traffic patterns and road status by jurisdictional agencies charged with maintaining roads and ensuring the safety and usability of various highways within their jurisdictions. The feasibility of performing effective monitoring relies on cost, complexity and scalability of the traffic monitoring system. These factors are largely determined by the communication method between the monitoring system devices. This paper presents a novel application that uses commercially available wireless protocols coupled with Internet Protocol (IP) to integrate traffic counters placed at different locations with the State of Oklahoma. The system uses commercial cellular networks as its transport medium for communication with the traffic control. The system has been tested and deployed since July 2007 by Oklahoma Department of Transportation (ODOT).","PeriodicalId":208094,"journal":{"name":"2010 17th International Conference on Telecommunications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124991161","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":"Cycle analysis of time-invariant LDPC convolutional codes","authors":"Hua Zhou, N. Goertz","doi":"10.1109/ICTEL.2010.5478744","DOIUrl":"https://doi.org/10.1109/ICTEL.2010.5478744","url":null,"abstract":"Time-invariant low-density parity-check convolutional codes (LDPCccs) can be constructed from a polynomial form of a parity-check matrix that defines quasi-cyclic LDPC block codes based on circulant matrices. Based on this polynomial matrix, we discuss the relationships between the polynomial domain and the time domain parity-check and syndrome former matrices with respect to cycle properties. We present a novel, simple way to describe cycles in the polynomial version of the syndrome former matrix and we exploit this concept in a new cycle counting algorithm.","PeriodicalId":208094,"journal":{"name":"2010 17th International Conference on Telecommunications","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127832400","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":"FSK-signal detection in cognitive radios using first-order cyclostationarity","authors":"Yi Zhou, K. Qaraqe, E. Serpedin, O. Dobre","doi":"10.1109/ICTEL.2010.5478656","DOIUrl":"https://doi.org/10.1109/ICTEL.2010.5478656","url":null,"abstract":"Cognitive radio is regarded as a novel approach for improving the utilization of precious radio spectrum resources. The detection of low signal-to-noise ratio (SNR) signals with relaxed a priori information on the signal parameters is of high importance for cognitive radios. This paper proposes a detection algorithm based on the first-order cyclostationarity for frequency shift keying (FSK) signals that only requires rough information on the signal bandwidth, carrier frequency and symbol rate. A theoretical asymptotic analysis is performed. Simulation results show that the proposed algorithm performs well at low SNRs.","PeriodicalId":208094,"journal":{"name":"2010 17th International Conference on Telecommunications","volume":"474 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120876149","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":"Spectral efficiency under Transmit Antenna and LDC selection with throughput maximization using WiMAX","authors":"I. Gutiérrez, F. Bader, Alain A. M. Mourad","doi":"10.1109/ICTEL.2010.5478641","DOIUrl":"https://doi.org/10.1109/ICTEL.2010.5478641","url":null,"abstract":"In this paper the spectral efficiency using combinations of Transmit Antenna Selection with Linear Dispersion Code Selection (TACS) is studied. The selection criterion is defined in order to maximize the spectral efficiency while bounding the maximum error rate (Rate Adaptation). The performance of the proposed spatial link adaptation scheme is evaluated under low mobility environments concluding that in case of linear receivers (e.g. MMSE) the TACS scheme with adaptive coding and modulation achieves a noticeable SNR gain (up to 3dB) in a wide SNR range (from 6 to 18dB), and could be considered as a powerful technique to achieve a smooth transition between diversity and multiplexing in order to maximize the overall system throughput1.","PeriodicalId":208094,"journal":{"name":"2010 17th International Conference on Telecommunications","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120948299","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":"Outage probability and power optimization for asynchronous cooperative networks","authors":"M. Nahas, A. Saadani, W. Hachem","doi":"10.1109/ICTEL.2010.5478646","DOIUrl":"https://doi.org/10.1109/ICTEL.2010.5478646","url":null,"abstract":"In wireless cooperative networks, the asynchronism between the relays can be a source of diversity which is similar in its essence to the multipath diversity of frequency selective channels. In this context, an asynchronous two-relay cooperative wireless network using the Decode-and-Forward protocol is studied. Two strategies for relay coding are studied: independent coding and repetition coding. The outage probability in the high Signal to Noise Ratio (SNR) regime is derived for different relative delays between the two relays. An optimization of the power allocation is given to improve the network performance. We show that the use of independent coding by the asynchronous relays gives better outage probability performance.","PeriodicalId":208094,"journal":{"name":"2010 17th International Conference on Telecommunications","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121401378","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":"R-ALOHA with priority (PR-ALOHA) in non ideal channel with capture effects","authors":"N. Alsbou, Daniella Henry, H. Refai","doi":"10.1109/ICTEL.2010.5478849","DOIUrl":"https://doi.org/10.1109/ICTEL.2010.5478849","url":null,"abstract":"The performance of reservation ALOHA (R-ALOHA) with priority is analyzed using computer simulation. Priority is introduced to the R-ALOHA protocol by reserving specific time slots in the frame exclusively for high priority traffic. Traffic is produced and divided into either low or high priority. We considered non ideal channel with communication errors and capture effects. Performance is measured in terms of packet throughput and message transfer delay for each priority level. The analysis gives results for varying numbers of reserved high priority slots and varying levels of high priority traffic ultimately leading to a dynamic high priority slot reservation scheme. Multipriority protocols are important in such applications as intervehicle communication, where high priority may represent safety related messages, and multimedia communication, where high priority is given to streaming audio or video. In both applications low delay and high throughput are absolutely necessary for standard performance. The simulation results indicate that as the number of slots reserved for high priority traffic increases the delay of the high priority messages decreases. However, low priority throughput decreases and its delay increases.","PeriodicalId":208094,"journal":{"name":"2010 17th International Conference on Telecommunications","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116354655","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}
H. Chaouch, F. Küppers, S. Vorbeck, M. Schneiders, W. Weiershausen
{"title":"Simulation and optimization of 100 Gbit/s single channel modulation formats","authors":"H. Chaouch, F. Küppers, S. Vorbeck, M. Schneiders, W. Weiershausen","doi":"10.1109/ICTEL.2010.5478871","DOIUrl":"https://doi.org/10.1109/ICTEL.2010.5478871","url":null,"abstract":"The performance of various modulation schemes for 100 Gbit/s single channel serial transmission is investigated by means of numerical simulations. Different ASK and PSK modulation formats are compared in terms of total system reach for a 10-9 BER requirement. RZ-DQPSK format with a 1,920 km reach, without FEC and the support of additional Raman amplification, outperforms all the other schemes including 10×10 Gbit/s NRZ DWDM inverse multiplexing.","PeriodicalId":208094,"journal":{"name":"2010 17th International Conference on Telecommunications","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121990869","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":"Local spectrum sensing in non-Gaussian noise","authors":"Sayed Jalal Zahabi, A. Tadaion","doi":"10.1109/ICTEL.2010.5478825","DOIUrl":"https://doi.org/10.1109/ICTEL.2010.5478825","url":null,"abstract":"This paper deals with the local spectrum sensing problem in non-Gaussian noise. It is of great importance to reliably detect the presence of licensed users in cognitive radio. This task highly depends on the noise distribution, thus it is important to characterize the noise behavior as best as possible. Although Gaussian assumption for noise is of interest due to many reasons, it sometimes fails to model the behavior of noise in practice. In this paper we present a local spectrum sensing scheme in a broad family of non-Gaussian noise. We reasonably assume that the Primary User (PU) signal is Phase Shift Keying (PSK) modulated, where the number of constellation points, M, and the symbol code sequence are unknown to the Secondary Users (SU), as in practice. We also assume that the SUs are unaware of the PU signal complex amplitude and the non-Gaussian noise variance. Within this framework, we obtain the Generalized Likelihood Ratio Test (GLRT) as our spectrum sensing scheme and propose an approximate implementation of the resulting GLRT. Simulation results show that our proposed scheme has an acceptable performance.","PeriodicalId":208094,"journal":{"name":"2010 17th International Conference on Telecommunications","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123801687","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}
Maryam Homayouni, M. Jahanbakhsh, S. V. Azhari, A. Akbari
{"title":"Overload control in SIP servers: Evaluation and improvement","authors":"Maryam Homayouni, M. Jahanbakhsh, S. V. Azhari, A. Akbari","doi":"10.1109/ICTEL.2010.5478787","DOIUrl":"https://doi.org/10.1109/ICTEL.2010.5478787","url":null,"abstract":"The Session Initiation Protocol (SIP) has gained momentum and is being widely used both in the Internet and Next Generation Telecommunications network as the core signaling protocol. SIP operation relies on SIP servers which are responsible for forwarding of SIP messages. It has been shown that the performance of SIP servers is largely degraded during overload conditions due to the built in message retransmission mechanism of SIP. This is an obstacle in wide deployment of SIP for a realistic situation. In this paper we propose a distributed and adaptive window based overload control algorithm, which controls the amount of calls that are forwarded to a downstream SIP server in an attempt to prevent it from being overloaded. Our scheme uses the call establishment delay as a measure of the amount of load on the downstream server and unlike other methods does not rely on explicit feedback. Using simulations we show that our proposed method performs better than a commonly used overload control algorithm and exhibits fast convergence and is stable.","PeriodicalId":208094,"journal":{"name":"2010 17th International Conference on Telecommunications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124185431","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}