{"title":"Overhead of shared NACK feedback channels","authors":"T. Höhne, Yi Wu","doi":"10.1109/ICTEL.2010.5478768","DOIUrl":"https://doi.org/10.1109/ICTEL.2010.5478768","url":null,"abstract":"In this paper we examine the shared NACK feedback channel, which allows several users to signal a negative acknowledgment. The advantage lies in its minimal resource usage in the feedback, and its disadvantage in the limited amount of information which users actually have signaled. We derive an expression for the average overall overhead and show how to approach minimal overhead with low complexity algorithms.","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":"124418505","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":"Air interface dimensioning techniques for coverage and capacity-limited HSPA based networks","authors":"A. Masmoudi, S. Tabbane","doi":"10.1109/ICTEL.2010.5478740","DOIUrl":"https://doi.org/10.1109/ICTEL.2010.5478740","url":null,"abstract":"Dimensioning and planning air interface of the evolution of UMTS networks based on HSPA technique is interesting for mobile operators. This paper deals with coverage-limited and capacity-limited dimensioning of HSPA based Beyond 3G networks with the necessary analytical support. The models established for coverage-limited case are exploited to generate abacuses useful mainly for initial dimensioning. The capacity-limited dimensioning case is also studied through different methods based on scheduling techniques. We suggest enhancing “Fair Throughput” scheduling technique to improve coverage and capacity dimensioning performance. Finally, we assess performance of the different introduced methods for HSPA dimensioning by comparing them to basic UMTS (Release 99) dimensioning.","PeriodicalId":208094,"journal":{"name":"2010 17th International Conference on Telecommunications","volume":"20 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":"129237693","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":"Throughput maximization over temporally correlated fading channels in cognitive radio networks","authors":"Doha Hamza, M. Nafie","doi":"10.1109/ICTEL.2010.5478781","DOIUrl":"https://doi.org/10.1109/ICTEL.2010.5478781","url":null,"abstract":"We consider a primary link and a secondary link, each composed of a transmitter and a receiver. The primary channel and the channel between the secondary transmitter and the primary receiver follow a first-order Markov model for channel variation over time. Under this assumption of temporal correlation and via exploiting the channel state information (CSI) feedback, we pose the cognitive power control problem as the maximization of secondary throughput subject to a constraint on the primary outage. To solve this problem, we assume that the primary transmitter sends with a constant-rate and with a constant-power, and we consider two types of feedback: perfect delayed CSI and one-bit automatic repeat request (ARQ) CSI. To reduce the computational complexity in the case of ARQ-CSI, we reformulate the cognitive power control problem as the maximization of the weighted sum of primary and secondary throughput which we solve optimally for delayed-CSI and greedily for ARQ-CSI. We also solve the cognitive power control problem for a constant-power variablerate primary link where the primary transmitter exploits the channel temporal correlation. In this scheme, we only consider a temporally correlated primary link and perfect delayed CSI. We solve the weighted sum throughput maximization problem under two scenarios. In the first, the primary rate is adapted without considering the secondary link. In the second, the primary rate and secondary power are determined simultaneously assuming a central controller.","PeriodicalId":208094,"journal":{"name":"2010 17th International Conference on Telecommunications","volume":"100 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":"115920453","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":"Ant-DYMO: A bio-inspired algorithm for MANETS","authors":"J. Martins, Sergio Correia, J. Celestino","doi":"10.1109/ICTEL.2010.5478808","DOIUrl":"https://doi.org/10.1109/ICTEL.2010.5478808","url":null,"abstract":"Mobile ad hoc networks are a set of wireless mobile devices that communicate without fixed infrastructure, forming temporary networks dynamically. Each node in such a network is more than a data receiver/sender, it is also a router that forwards data packets to its proper destination. The main characteristics of ad hoc networks are frequent change in the network topology, limited power of its links and restriction on the bandwidth. A routing protocol for ad hoc networks is composed of a routing algorithm with a set of rules that monitor the operation of the network. Thus, the nodes participating in the network have an important role in the management of resources in ad hoc networks. Ant-based routing is an efficient routing scheme based on the behavior of foraging ants. The study of the collective behavior of ants shows that they are able to find the shortest path from the nest to a food source, using a particular mode of communication by the means of a chemical substance called pheromones. This work uses a mechanism from collective intelligence applied to ad hoc networks, in particular the application of ants for routing in ad hoc networks. We have brought some characteristics from the Dynamic MANET On-demand Routing protocol and other MANET protocols in order to propose the new routing algorithm, called Ant-DYMO. We compare Ant-DYMO with DYMO, and we show that our proposition has improved the packet loss and the end-to-end delay.","PeriodicalId":208094,"journal":{"name":"2010 17th International Conference on Telecommunications","volume":"47 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":"115997991","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}
Amin Azari, M. G. Roozbahani, S. Nader-Esfahani, Mahdi Shakiba
{"title":"Novel frame synchronization for WiMAX OFDM systems","authors":"Amin Azari, M. G. Roozbahani, S. Nader-Esfahani, Mahdi Shakiba","doi":"10.1109/ICTEL.2010.5478754","DOIUrl":"https://doi.org/10.1109/ICTEL.2010.5478754","url":null,"abstract":"Frame synchronization is a critical factor for effective operation of Orthogonal Frequency Division Multiplexing (OFDM) schemes. This paper studies the frame synchronization of OFDM based wireless systems and proposes a new method for IEEE 802.16 (WiMAX) to improve its performance. The preamble, which is used in this method, is consists of two identical halves, and our method uses the correlation between these two parts in a new efficient form. Our metric calculates the start point within two levels. It finds some possible points as start point in the first level and removes the irrelevant candidates at the second level. The performance of proposed metric and existing ones is compared in terms of mean square error (MSE) and probability of correct detection in AWGN and multipath fading channels. Simulation results show that the proposed method has better performances than famous methods, which were proposed by Schmidl, Minn, Park, Kim, Meng, and in both AWGN and multipath fading Rayleigh channels. Also, compared to new methods with more accurate performance, proposed method has egual performance with less complexity.","PeriodicalId":208094,"journal":{"name":"2010 17th International Conference on Telecommunications","volume":"1 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":"125458656","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":"Energy-time efficiency of two routing strategies with chase packets in expanding ring search","authors":"Ida M. Pu, Jinguk Kim, Yuji Shen","doi":"10.1109/ICTEL.2010.5478807","DOIUrl":"https://doi.org/10.1109/ICTEL.2010.5478807","url":null,"abstract":"We investigate the energy-time efficiency of two reactive route discovery protocols (BERS and DTC) with chase packets in the expanding ring search (ERS). BERS introduces deliberately waiting time in broadcasts of RREQs. DTC uses a threshold to switch between two different channel speeds to allow the chase packets to catch up with fulfilled RREQs. Taking an analytical approach, we gain the insight into these protocols and explore the trade-off nature of the energy and time efficiency. An optimal threshold for DTC is identified, and the performance of DTC under this optimal condition is used to compare with the performance of BERS in the light of ERS. Our results have practical values and implications as well as theoretical interests. We found that BERS has achieved the best overall performance in terms of energy-time efficiency, while DTC achieved the least overall performance despite the reduction of latency.","PeriodicalId":208094,"journal":{"name":"2010 17th International Conference on Telecommunications","volume":"14 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":"126935783","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":"BiO4SeL: A Bio-Inspired routing algorithm for Sensor Network Lifetime Optimization","authors":"Levi Bayde Ribeiro, M. D. Castro","doi":"10.1109/ICTEL.2010.5478805","DOIUrl":"https://doi.org/10.1109/ICTEL.2010.5478805","url":null,"abstract":"Sensors are emerging devices on a world leading to ubiquity and pervasiveness. For the sake of users' convenience, the organization of these sensors in operational networks must be done in an autonomic and self-sustained way. This paper proposes BiO4SeL (Bio-Inspired Optimization for Sensor Network Lifetime), a biologically-inspired routing algorithm for sensor networks where the main goal is autonomy, while aiming to optimize the sensor networks' lifetime, i.e., the maximization of the full coverage duration. BiO4SeL is based on Swarm Intelligence, more specifically on Ant Colonies. Results show that BiO4SeL achieves its objectives when compared with similar approaches: ARAMA (Ant-based Routing Algorithm for Manets) and AODV (Ad-hoc On-demand Distance Vector).","PeriodicalId":208094,"journal":{"name":"2010 17th International Conference on Telecommunications","volume":"10 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":"124293444","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 capable, lightweight communication concept by combining Ambient Network approaches with Cognitive Radio aspects","authors":"M. Vodel, M. Caspar, W. Hardt","doi":"10.1109/ICTEL.2010.5478784","DOIUrl":"https://doi.org/10.1109/ICTEL.2010.5478784","url":null,"abstract":"In this paper, we present a feasible communication concept within the field of cognitive radios and ambient networking. The approach deals with the integration of different radio modules into an embedded communication platform. Basic idea is the simultaneous coexistence of multiple independent network interfaces, which allows us to combine the advantages of different communication technologies. At the same time we bypass the disadvantages of one single radio standard with its application specific design limitations. The result is a lightweight, radio standard spanning communication system, specially in the field of mobile ad hoc networks. The approach enables interesting new ways to create a reliable, heterogeneous network infrastructure. To avoid the influences of interferences in the topology, a special Link Management Unit identifies an increasing interference behaviour based on parameters like the packet loss rate, packet transmission time or fluctuations of the signal quality. With this knowledge base, we are able to adapt the transmission technology dynamically. Thus, the system takes an active influence on the local interference level in the network. Unlike other related research projects, this concept requires no special hardware devices and no complex software architecture. Instead, our approach focuses on standardised, low cost hardware components to realise an embedded communication platform. The presented paper analyses the feasibility with application-specific simulations and evaluate the results based on real world measurements with a designed prototype platform.","PeriodicalId":208094,"journal":{"name":"2010 17th International Conference on Telecommunications","volume":"41 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":"121631660","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 achievable rate regions for interference and cognitive radio channels","authors":"G. Hodtani","doi":"10.1109/ICTEL.2010.5478850","DOIUrl":"https://doi.org/10.1109/ICTEL.2010.5478850","url":null,"abstract":"First, the Han-Kobayashi (HK) rate region for general interference channel (IC) is partially improved allowing the input random variables to be correlated. Second, considering a general input distribution and using a combination of the HK jointly decoding strategy, Marton like coding and binning scheme, we obtain a new achievable rate region for the cognitive radio channel (CRC) and show that this new region (i) is a generalized and improved version of the Devroye-Mitran-Tarokh (DMT) region, (ii) has an interesting interpretation, i.e., any rate in the region has generally three additional terms in comparison with the HK region and (iii) contains some of simply described rate regions as its subsets.","PeriodicalId":208094,"journal":{"name":"2010 17th International Conference on Telecommunications","volume":"9 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":"121912444","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":"Implementing Globally Asynchronous Locally Synchronous processor pipeline on commercial synchronous FPGAs","authors":"H. Farouk, M. El-Hadidi","doi":"10.1109/ICTEL.2010.5478856","DOIUrl":"https://doi.org/10.1109/ICTEL.2010.5478856","url":null,"abstract":"In this paper a Globally-Asynchronous Locally-Synchronous (GALS) pipelined processor is implemented on synchronous commercial FPGAs. A simple pipelined accumulator-based processor is implemented as an example for a pipelined processor with varying stages' delays. A novel port controller is designed to ensure the proper operation of the pipeline under any distribution of stage delays. The results show that the GALS approach increase the pipeline throughput by 21% and reduces the power consumption by 26.8%.","PeriodicalId":208094,"journal":{"name":"2010 17th International Conference on Telecommunications","volume":"20 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":"130483115","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}