{"title":"A Hierarchical Channel-Aware Uplink Scheduler for WiMAX Base Stations","authors":"Zeynep Yurdakul, S. Oktug","doi":"10.1109/AICT.2010.49","DOIUrl":"https://doi.org/10.1109/AICT.2010.49","url":null,"abstract":"The IEEE 802.16 standard defines MAC and physical layer protocols for broadband wireless access, however it does not specify any scheduling algorithm. In this paper, we propose a RED-based Weighted Fair Priority Queuing algorithm for inter-class scheduling and a channel aware algorithm for intra-class scheduling. Weights of the service classes are adaptive according to the QoS requirements of each service class. Weights of the subscriber stations are assigned based on their channel quality and bandwidth requests. Simulation results show that overall system throughput is improved without starving lower priority service classes.","PeriodicalId":339151,"journal":{"name":"2010 Sixth Advanced International Conference on Telecommunications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114670931","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":"Signal Classification Using Random Forest with Kernels","authors":"Jiguo Cao, Guangzhe Fan","doi":"10.1109/AICT.2010.81","DOIUrl":"https://doi.org/10.1109/AICT.2010.81","url":null,"abstract":"Here we propose a novel approach for some signal classification problems. It is a combination of three artificial intelligence approaches: tree-based approach, ensemble voting and kernel learning. We call this approach kernel-induced random forest. We use two examples, a phenome speech data and a waveform simulation data to illustrate its usage and evidences of improving on traditional methods such as neural networks and discriminant methods.","PeriodicalId":339151,"journal":{"name":"2010 Sixth Advanced International Conference on Telecommunications","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129660625","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":"Optimization of a Predictive Dialing Algorithm","authors":"S. Fourati, S. Tabbane","doi":"10.1109/AICT.2010.77","DOIUrl":"https://doi.org/10.1109/AICT.2010.77","url":null,"abstract":"Most of enterprises rely on the outbound call centers which play a very important role in Customer Relationship Management (CRM) and marketing. Outbound Calls centers that employ predictive dialing system obtain greater productivity and higher service levels by dynamically generating outbound traffic. An algorithm is proposed to provide a trade-off between outbound dialing rate and agent occupation in order to minimize customer’s waiting time in the queue. In this paper, we optimize the performance of the presented algorithm. The proposed system uses an analytical method for determining the frequency of calls generation. Evaluations are conducted by means of simulations. We also developed a continuous-time Markov chain (CTMC) to illustrate the system’s performances according to some key parameters.","PeriodicalId":339151,"journal":{"name":"2010 Sixth Advanced International Conference on Telecommunications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129691155","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":"Modeling of Flocking Behaviour System in SystemC","authors":"I. Aref, N. Ahmed, F. Salazar, K. Elgaid","doi":"10.1109/AICT.2010.29","DOIUrl":"https://doi.org/10.1109/AICT.2010.29","url":null,"abstract":"This paper introduces the integration of communication modelling into design modelling during the early stages of system development. It presents the modelling of flocking behaviour system in SystemC, which is emerging as a suitable language for designing and modelling. SystemC provides a consistent methodology for the design and refinement of complex digital systems. In this paper, a demonstrator implementing communication between particles has been constructed and incorporated into the entire design methodology. The communication has been implemented through the incorporation of a wireless channel that was previously modelled.","PeriodicalId":339151,"journal":{"name":"2010 Sixth Advanced International Conference on Telecommunications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129241505","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 Simple Method to Measure the Image Complexity on a Fault Tolerant Cluster Computing","authors":"D. Z. Rodríguez, R. L. Rosa, Eduardo Costa Alfaia","doi":"10.1109/AICT.2010.30","DOIUrl":"https://doi.org/10.1109/AICT.2010.30","url":null,"abstract":"The cluster computing is widely used for image processing in entertainment applications. Measuring the required number of nodes to be used in a cluster computing helps saving nodes processing time, even if this occurs on a fault tolerant scenario. The paper analyzes the images rendering process by ray tracing on the cluster computing using the freeware software fault tolerant message-passing interface with Povray software in a Linux-based operating system. This paper uses a simple method of image complexity measure, it is shown that depending on the images complexity level, a minimum number of cluster nodes is chose to render the image instead of using all the cluster nodes. It is useful to save machine processing time and meanwhile another image can be rendered in a parallel process with a previous one and where the solution is applied in a Fault Tolerant scenario, so independent of the network fault, the cluster continues working.","PeriodicalId":339151,"journal":{"name":"2010 Sixth Advanced International Conference on Telecommunications","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114024607","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":"Multiuser Spectral Efficiency Maximization in Cognitive Ultra Wideband Radio Systems","authors":"Liaoyuan Zeng, S. McGrath, E. Cano","doi":"10.1109/AICT.2010.61","DOIUrl":"https://doi.org/10.1109/AICT.2010.61","url":null,"abstract":"A novel multiuser dynamic radio resource allocation scheme for spectral efficiency optimization in a cognitive ultra wideband radio system is presented in this paper. A new expression of computing the interference power to the primary users over the UWB multipath channel is derived in this work based on the Fenton-Wilkinson method. The subcarriers of the UWB system are grouped into subcarrier blocks according to the system coherence bandwidth. Then, a series of M-ary quadrature amplitude modulation zones are generated over each UWB subcarrier block according to the channel gain of each block and the bit error rate threshold of the system. The transmitted power and bits are optimally distributed among the UWB subcarrier blocks for the use of those zones with a maximum modulation level on each subcarrier block. The performance of the radio resource allocation schemes is analyzed over different UWB channel models. The results show that the spectral efficiency of the system is significantly improved by an optimal resource allocation technique.","PeriodicalId":339151,"journal":{"name":"2010 Sixth Advanced International Conference on Telecommunications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128987395","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 Cooperative Multiagent Based Spectrum Sharing","authors":"Usama Mir, L. Merghem, D. Gaïti","doi":"10.1109/AICT.2010.31","DOIUrl":"https://doi.org/10.1109/AICT.2010.31","url":null,"abstract":"A major issue in recent wireless networks is the static utilization and allocation of the available spectrum. An effective solution to this problem is to detect the empty spectrum portions using cognitive radio devices and to share them with the neighboring users, in a dynamic and distributed manner. However, since nodes generally have limited knowledge about their environment, we suggest that cooperative behavior can provide them with the necessary information in order to solve the global issues. To this extend, we develop a novel approach for spectrum allocation using multiagent system cooperation that enables cognitive radio (or secondary user) devices to utilize the amount of available spectrum, dynamically and opportunistically. The key aspect of our design is the deployment of agents on each of the primary and secondary user devices that cooperate in order to have a better use of the spectrum. For cooperation, contract net protocol is considered, allowing spectrum to be dynamically allocated by having a series of exchange of messages amongst the devices. Simulation results show that our approach achieves up to 80% of the whole utility within the span of few messages, and provides an effective mechanism for distributed spectrum allocation.","PeriodicalId":339151,"journal":{"name":"2010 Sixth Advanced International Conference on Telecommunications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132367471","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":"Methods for Flow Graph Selection in Integral Network Coding","authors":"M. Ravanbakhsh, D. Haugland","doi":"10.1109/AICT.2010.71","DOIUrl":"https://doi.org/10.1109/AICT.2010.71","url":null,"abstract":"The search for optimal multicast subgraphs for network coding is considered. We assume unit link capacities and binary flow rates. In the first version of the problem, there is no constraint on the acyclicity of the subgraphs, whereas such constraints are imposed in the second version. These problems are known to be NP-hard. We provide heuristics to deal with both versions of the problem. The heuristics are based on well known optimization algorithms and they are therefore easy to implement. Through numerical experiments, we demonstrate that the proposed algorithm performs close to the lower bounds obtained from relaxed solutions.","PeriodicalId":339151,"journal":{"name":"2010 Sixth Advanced International Conference on Telecommunications","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133077458","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":"Distributed Control Using Cognitive Pilot Channels in a Centralized Cognitive Radio Network","authors":"Nicolás Bolívar, J. Marzo, E. Rodríguez-Colina","doi":"10.1109/AICT.2010.72","DOIUrl":"https://doi.org/10.1109/AICT.2010.72","url":null,"abstract":"In this paper, a cognitive radio network (CRN) model is presented. In this model, the control of the CRN is distributed among the frequency spectrum considered for transmission using cognitive pilot channels (CPCs). This control is performed by using frequency-division and time-division multiplexing techniques. Frequency-division is used to divide the spectrum into predetermined frequency slots in which cognitive radio users (CRUs) communicate. Then, the frequency slots are divided into sub-frequency slots, some of which are defined as CPC and used by the CRUs to communicate with a central cognitive base station (CCBS) and to determine availability in a frequency slot. Time-division is used to determine if a primary user (PU) has accessed the channel used by CRUs. Using this time-division approach, presence of PUs is detected. We have designed a CRN able to work with today’s available technologies and CRU devices that use different frequency bands of operation. Results of the performance of the network will be presented in terms of the number of CRU and the time these CRUs use the CPCs for control.","PeriodicalId":339151,"journal":{"name":"2010 Sixth Advanced International Conference on Telecommunications","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133843288","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 New Digital Modulation Recognition Technique Using the Phase Detector Reliability","authors":"Adel Metref, Daniel Le Guennec, J. Palicot","doi":"10.1109/AICT.2010.82","DOIUrl":"https://doi.org/10.1109/AICT.2010.82","url":null,"abstract":"A new feature based digital modulation identification algorithm has been developed and presented in this paper. The algorithm developed uses the reliability of a decision-directed (DD) phase detector as a modulation scheme classification feature. Unlike feature based methods found in literature, the classification decision of the proposed algorithm does not rely on decision thresholds. Simulation results covering 64-QAM, 16-QAM, 16-APSK and 8-PSK modulation schemes show promising identification statistics with high probability of correct classification in the presence of noise even with high order modulation schemes.","PeriodicalId":339151,"journal":{"name":"2010 Sixth Advanced International Conference on Telecommunications","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114838705","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}