{"title":"Call admission control schemes for high altitude platform station and terrestrial tower-based hierarchical UMTS","authors":"Y. Foo, W. L. Lim, R. Tafazolli","doi":"10.1109/ICCS.2004.1359433","DOIUrl":"https://doi.org/10.1109/ICCS.2004.1359433","url":null,"abstract":"One of the unique characteristics of high altitude platform station (HAPS) Universal Mobile Telecommunications System (UMTS) is that the onboard platform power available for the traffic channels can be centrally managed. In this paper, we make use of this unique characteristic and propose two centralized power reservation call admission control (CAC) schemes for HAPS and terrestrial tower-based hierarchical UMTS with HAPS providing the contiguous macrocell coverage and terrestrial tower-based UMTS providing the microcell coverage in hotspot areas. Simulation results show that the proposed schemes are able to achieve better grade of service (GoS) as compared to the conventional scheme","PeriodicalId":333629,"journal":{"name":"The Ninth International Conference onCommunications Systems, 2004. ICCS 2004.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121628817","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":"Low-complexity iterative MUD algorithm for asynchronous UWB systems","authors":"Xiaoli Wang, Lei Huang, C. Ko","doi":"10.1109/ICCS.2004.1359330","DOIUrl":"https://doi.org/10.1109/ICCS.2004.1359330","url":null,"abstract":"In this paper, a low-complexity iterative multiuser detection (MUD) algorithm specifically designed for asynchronous multiple access ultra-wideband (UWB) systems is proposed. The maximum a posteriori criterion is applied in the detection process by subtracting the multiple access interference precisely, and the computational complexity is reduced in an iterative manner. Considering the asynchronous scenario, a truncated detection window is introduced and studied. The simulation results demonstrate that the proposed iterative MUD algorithm can achieve a satisfactory bit-error-rate performance while maintain a considerably low complexity","PeriodicalId":333629,"journal":{"name":"The Ninth International Conference onCommunications Systems, 2004. ICCS 2004.","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126227182","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":"Joint estimation of timing delay and multipath parameters using sequential Monte Carlo","authors":"L.V. Mahesh, K. Prabhu","doi":"10.1109/ICCS.2004.1359408","DOIUrl":"https://doi.org/10.1109/ICCS.2004.1359408","url":null,"abstract":"The current paper addresses the problem of joint estimation of delay and multipath coefficients in a frequency selective fading channel. The channel and delay are modelled as first order auto regressive processes . Sequential Monte Carlo (SMC) methodology is applied to this joint estimation problem. SMC techniques are powerful tools to perform online inference of state variables of a complex probabilistic dynamic system. It is shown through simulations that this SMC based synchronizer tracks the delay and multipath channel coefficients efficiently","PeriodicalId":333629,"journal":{"name":"The Ninth International Conference onCommunications Systems, 2004. ICCS 2004.","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115900249","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":"An adaptive security end-system model based on active defense","authors":"Hanping Hu, Xing Liang, Baojia Zhang, Wenbin Guo","doi":"10.1109/ICCS.2004.1359393","DOIUrl":"https://doi.org/10.1109/ICCS.2004.1359393","url":null,"abstract":"In order to enhance the security of Web service as well as to support the differentiated service, the paper puts forward an adaptive model, which is based on active defense strategy. It uses a network prediction model on base of self-similar sequence theory to estimate current slates of transfer servers in end-system, then classifies them with fuzzy-C-means clustering method. Finally, we bring forward a load balancing algorithm that is founded on the classification results and grading users' requests. In that way, it optimizes the allocation of system resources and ensures data security and reliability. Moreover, this model is not dependent on the original operating system and is transplantable and extensible","PeriodicalId":333629,"journal":{"name":"The Ninth International Conference onCommunications Systems, 2004. ICCS 2004.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132223874","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":"Bit error probability for orthogonal space time block codes with differential detection","authors":"T. P. Soh, P. Kam, C. Ng","doi":"10.1109/GLOCOM.2005.1577927","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1577927","url":null,"abstract":"The bit error probability (BEP) of space time block codes (STBC) based on Alamouti's scheme with differential encoding and decoding and utilising 2b-ary phase shift keying (2b-PSK) modulation is studied, and close form analytical results are obtained. The channel model is that of a frequency non-selective and slow Rayleigh fading channel. While all the existing analyses assume no fading fluctuations, these are still considered in the analysis. For the case in which the fading process remains constant within any code block interval, but which fluctuates from one code block interval to the next, exact closed-form expressions for the BEP of binary and quadruple PSK are derived. An approximate result is obtained for 8PSK. For the case in which the fading process fluctuates from one symbol interval to the next, but which remains constant within the symbol interval, the upper and lower bounds are obtained for the BEP and a simple and yet accurate approximation of the BEP is developed. The analysis is applicable to any number of receive antennas","PeriodicalId":333629,"journal":{"name":"The Ninth International Conference onCommunications Systems, 2004. ICCS 2004.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130099182","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 class-based dynamic bandwidth allocation scheme for EPONs","authors":"Jing Xie, Shengming Jiang, Yuming Jiang","doi":"10.1109/ICCS.2004.1359398","DOIUrl":"https://doi.org/10.1109/ICCS.2004.1359398","url":null,"abstract":"In an Ethernet passive optical network (EPON), all optical network units (ONUs) share one uplink channel to transmit multiple traffic. To avoid data collision, a contention-free MAC protocol is needed to schedule the transmission order of different ONUs. An available solution is to assign a variable-sized time slot to each ONU. In this paper, we first review some existing bandwidth allocation schemes for EPON in the literature. Then we propose a novel scheme called dynamic weight priority scheduling (DWPS), which not only guarantees all the ONUs that fairly share the bandwidth of uplink channel on demand, but also supports differentiated services. To prevent one service class from monopolizing the bandwidth under heavy load, a bandwidth threshold determined by a weight ensures a minimum bandwidth for each traffic class","PeriodicalId":333629,"journal":{"name":"The Ninth International Conference onCommunications Systems, 2004. ICCS 2004.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130274350","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":"Algorithms for the diverse routing problem in WDM networks with shared risk link groups","authors":"X. Pan, Gaoxi Xiao","doi":"10.1109/ICCS.2004.1359403","DOIUrl":"https://doi.org/10.1109/ICCS.2004.1359403","url":null,"abstract":"In this paper, we study the heuristic algorithms for finding two paths that are not passing through any same shared risk link group (SRLG) between each pair of source-destination nodes. For this NP-complete problem, we design a heuristic algorithm which steadily outperforms the best existing algorithm in the first several iterations. When larger number of iterations is allowed, we show that several different algorithms manage to perform nearly the same, which provides some helpful insight into how to further improve the algorithm in the future","PeriodicalId":333629,"journal":{"name":"The Ninth International Conference onCommunications Systems, 2004. ICCS 2004.","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134016663","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":"New angle-of-arrival measurement technique for over ocean propagation studies","authors":"G. Woods, D. Maskell, A. Kerans","doi":"10.1109/ICCS.2004.1359451","DOIUrl":"https://doi.org/10.1109/ICCS.2004.1359451","url":null,"abstract":"Radio propagation experiments are a useful tool when verifying propagation models and identifying anomalies in a practical link. This paper describes a new method to measure the angle-of-arrival (AoA) of a radio signal for terrestrial propagation studies. The new technique allows the phase of radio signals received by incoherent detectors arranged in an array formation to be obtained. This measurement, along with the amplitude readings at each element of the array can then be processed to find the AoA of signals on the array. The proposed technique is novel in that frequency drift and offsets, arising because the different receivers are incoherent, are compensated for by way of a common reference signal injected into the front of the array. The phase of the incoming signals are obtained by processing the down-converted and digitized waveforms. A novel approach based on an adaptive, discrete-time quadrature delay estimator (QDE) algorithm is used for this purpose. This algorithm is insensitive to variations in the amplitudes of the input signals, and does not require an accurate prior estimate of the frequency of the input sinusoids. This approach is shown to be an accurate, low cost alternative to conventional vector measurement techniques when used with large antenna arrays and is therefore well suited to fixed link, angle-of-arrival measurements","PeriodicalId":333629,"journal":{"name":"The Ninth International Conference onCommunications Systems, 2004. ICCS 2004.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133350014","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 multi-hop borrowing channel assignment for wireless local loop systems","authors":"P. Satahack, C. Chayawan","doi":"10.1109/ICCS.2004.1359367","DOIUrl":"https://doi.org/10.1109/ICCS.2004.1359367","url":null,"abstract":"This paper proposes an alternative method for improving the performance of cellular-based wireless local loop (WLL) systems by using an algorithm namely multi-hop borrowing channel assignment (MHBCA). This algorithm modifies the concept of multi-hop and channel assignment in cellular mobile communication systems to the fixed wireless communication systems, which have some dissimilar critical constrains. The numerical results show that the proposed model significantly reduces the call blocking probability and also improves the system efficiency when the traffic load increases","PeriodicalId":333629,"journal":{"name":"The Ninth International Conference onCommunications Systems, 2004. ICCS 2004.","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115945709","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}
Tet Sen Teo, Chee Siang Lim, J. Lim, Kirn Loon Chee, P. Sivaprasad
{"title":"Feasibility stud of RSSI in improving hop-count based localization","authors":"Tet Sen Teo, Chee Siang Lim, J. Lim, Kirn Loon Chee, P. Sivaprasad","doi":"10.1109/ICCS.2004.1359452","DOIUrl":"https://doi.org/10.1109/ICCS.2004.1359452","url":null,"abstract":"In ad-hoc and sensor network applications, knowledge of the positions of the nodes within the network area is often necessary. Most localization methods involve trilateration of distances between an unknown node and a few nodes of fixed, known locations within the network. Most of these methods, though simple and computationally economical, can only provide coarse-grained localization results. This paper seeks to investigate and propose the additional use of radio signal strength intensity (RSSI) between nodes to improve and enhance the accuracy of such localizations in ad hoc networks. We present consolidated experimental results that demonstrate the feasibility of RSSI in addition to the existing systems","PeriodicalId":333629,"journal":{"name":"The Ninth International Conference onCommunications Systems, 2004. ICCS 2004.","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116040438","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}