{"title":"Performance of a novel power-loading algorithm over uncoded and convolutionally coded OFDM systems","authors":"Dr. Purushothaman Ravichandran, S. Nagaraj","doi":"10.1109/WTS.2007.4563305","DOIUrl":"https://doi.org/10.1109/WTS.2007.4563305","url":null,"abstract":"In this paper, a power-loading technique is presented for OFDM systems, which is a modified version of an existing power-loading algorithm that exhibits enhanced performance when compared to the latter under certain conditions. The impact of power loading on the coded OFDM system that uses convolutional codes is also studied. A comparative study is done to show the differences in performance of the proposed power- loading technique and certain existing ones. An analysis of the behavior of coded and uncoded systems towards power-loading is performed. The performance is evaluated in terms of the bit error probability of the system. Simulation results are used to validate the conclusions made.","PeriodicalId":296096,"journal":{"name":"2007 Wireless Telecommunications Symposium","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125282704","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":"Implementations of location awareness technologies and their applications","authors":"K. Elleithy, Arif Maqbool","doi":"10.1109/WTS.2007.4563299","DOIUrl":"https://doi.org/10.1109/WTS.2007.4563299","url":null,"abstract":"Location awareness technologies open the doors to developing exciting new applications. With the availability of commercial products built on this technology, it is possible to put this technology in everyday use. The most common implementations currently in use are navigation systems installed in most modern vehicles. These applications make use of global positioning system (GPS). This paper explores two location aware implementations namely Intel's Place Lab and Microsoft's mappoint location server which became available and are built around an alternate method of location determination. These cost effective and easy to integrate implementations can be leveraged for many useful applications to provide value added services ranging from living a more productive lifestyle to efficient response during emergency situations.","PeriodicalId":296096,"journal":{"name":"2007 Wireless Telecommunications Symposium","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125569282","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 comparative analysis of pilot placement schemes in frequency-selective fast fading MIMO channel","authors":"Xueyuan Zhao, R. Cheng, Danny C. Y. Ong","doi":"10.1109/WTS.2007.4563329","DOIUrl":"https://doi.org/10.1109/WTS.2007.4563329","url":null,"abstract":"The problem of pilot placement for channel estimation in time-frequency-space lattice in MIMO- OFDM system under frequency-selective fast fading MIMO channel is addressed in this paper. Given the least square channel estimation algorithm and orthogonal pilot signal format design, four different pilot placement schemes are analyzed in a uniformed manner. The theoretical and simulated mean square errors of the schemes show that, the scheme of placing pilots on frequency-equal-spaced and time-shifted subcarriers has good performance and balanced complexity.","PeriodicalId":296096,"journal":{"name":"2007 Wireless Telecommunications Symposium","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115036160","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":"International expansion of wireless telecommunications service providers: A comparative analysis","authors":"Steven R. Powell","doi":"10.1109/WTS.2007.4563339","DOIUrl":"https://doi.org/10.1109/WTS.2007.4563339","url":null,"abstract":"Facing increasing levels of competition and regulation in their maturing domestic markets some prominent telecommunications service providers (TSPs) have begun to expand their wireless operations internationally. This paper investigates the geographic expansion strategies of five major TSPs: Telefonica, Deutsche Telekom, Singapore Telecommunications, Vodafone, and America Movil. All of these companies have invested heavily in operations abroad, in some cases in the same countries. Using a proportionate customer weighting scheme the paper analyzes the impact of the TSPs' expansion strategies on the companies' performance from 2002 to 2005 in terms of the growth, profitability, and risk characteristics of their wireless telecommunications business portfolios.","PeriodicalId":296096,"journal":{"name":"2007 Wireless Telecommunications Symposium","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122998884","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":"Improvement of IEEE 802.11 for multimedia traffic in wireless LAN","authors":"M. Do, P. A. Tan, Jong Soo Lee, H. Oh","doi":"10.1109/WTS.2007.4563296","DOIUrl":"https://doi.org/10.1109/WTS.2007.4563296","url":null,"abstract":"In this paper, we propose to add a new queue in IEEE 802.11 MAC protocol for real-time multimedia traffic in wireless LAN. The queue contributes to improving multimedia service quality by reducing end to end delay, a QoS parameter. To control two queues, we use a scheduler based on the PAD algorithm which selects a packet from one of two queues appropriately for forwarding. Moreover, we adapt the value of random backoff in the IEEE 802.11 for multimedia packets, which reduces the channel access delay. We modify the IEEE 802.11 standard with the proposed scheme and evaluate the performance of the modified protocol. The result shows that our approach outperforms the IEEE 802.11 standard in packet loss rate and average packet delay.","PeriodicalId":296096,"journal":{"name":"2007 Wireless Telecommunications Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129304508","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}
T. Furuta, H. Miyazawa, F. Ishizaki, Mihiro Sasaki, Atsuo Suzuki
{"title":"A heuristic method for clustering a large-scale sensor network","authors":"T. Furuta, H. Miyazawa, F. Ishizaki, Mihiro Sasaki, Atsuo Suzuki","doi":"10.1109/WTS.2007.4563330","DOIUrl":"https://doi.org/10.1109/WTS.2007.4563330","url":null,"abstract":"We present a new heuristic method for a clustering problem of sensor networks. The heuristic method is using the uncapacitated facility location problem formulation for the clustering problem of sensor networks. It is an iterative method based on the Voronoi diagram. We also propose a parallel version of the heuristics to reduce the time to obtain a solution. The proposed algorithms are investigated for the quality of their approximate solutions and computational time to obtain them. By comparing the approximate solutions to the exact solutions for examples of one hundred sensors, we found that the quality of the approximate solutions is almost the same as that of the exact ones. The computational time to obtain the approximate solutions is a thousandth of that of obtaining the exact solution. For examples of ten thousand sensors, the computational time to obtain a solution is about 9.1 seconds by the sequential algorithm and about 6.0 seconds by our parallel algorithm with six computers.","PeriodicalId":296096,"journal":{"name":"2007 Wireless Telecommunications Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126992871","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":"Acimn protocol: A protocol for anonymous communication in multi hop wireless networks","authors":"Volker Fusenig, D. Spiewak, T. Engel","doi":"10.1109/WTS.2007.4563320","DOIUrl":"https://doi.org/10.1109/WTS.2007.4563320","url":null,"abstract":"Summary form only given. Anonymity is the state of not being identifiable within a set of subjects. Different strategies exist for assuring anonymity in computer networks, such as the dining cryptographers network and mix networks. But these strategies were designed for wired networks requiring direct communication links or fixed infrastructure. Therefore they are not applicable to multi hop wireless networks without modification. The Acimn protocol bases on the combination of these two main strategies enabling nodes to communicate anonymously among each other. Every node of the network acts as a mix so that the Mix approach can be used to hide the multi hop communication. By using this technique only one message overhead per communication path is generated because of the key establishment among the nodes on the path. During following communications only little computational power is needed by every node on the path to decrypt the messages before forwarding them to the next node. Additionally every one hop communication is kept anonymously by using the DC-net protocol. Therefor the nodes are arranged in groups of at most three members that are in communication range of each other. Sending of messages takes place in rounds where in every round only one group member is able to transmit information but every member has to send data. Because of the maximal group size of three there can be maximally three times more messages compared to the sending without the DC-net approach. By utilizing the combination of both techniques neither non participating eavesdropper nor nodes on the communication path are able to track the communication partners while the overhead is kept small.","PeriodicalId":296096,"journal":{"name":"2007 Wireless Telecommunications Symposium","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121546316","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":"PDA-based wireless food ordering system for hospitality industry — A case atudy of Box Hill Institute","authors":"Keyurkumar J. Patel, Umesh Patel, Andrew Obersnel","doi":"10.1109/WTS.2007.4563314","DOIUrl":"https://doi.org/10.1109/WTS.2007.4563314","url":null,"abstract":"This study aims to promote a project carried out by final year undergraduate students and teaching staff, involving the design and development of a wireless food ordering system in the training restaurant run by students at Box Hill Institute, Australia. The study presents in-depth the technical operation of the fountains integrated wireless ordering system (FIWOS) including systems architecture, workings, limitations and future work. We believe that with the increased use of PDAs in restaurants, this application will become an important teaching and learning tool for hospitality educators and students. Using PDAs to coordinate food ordering can increase efficiency for restaurants and caterers by saving time, reducing human errors and by providing higher quality customer service. With the combination of simple design and readily available emerging communications technologies, we conclude that this system is an attractive learning and teaching solution for the hospitality industry and educators.","PeriodicalId":296096,"journal":{"name":"2007 Wireless Telecommunications Symposium","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126554665","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 function modulation method for digital communications","authors":"Subhendu K. Das, Avtar Singh, N. Mohanty","doi":"10.1109/WTS.2007.4563308","DOIUrl":"https://doi.org/10.1109/WTS.2007.4563308","url":null,"abstract":"We present a novel modulation method for digital communication systems. The method uses orthogonal and/or non-orthogonal analytic functions as symbols. It is shown that, in the case of orthogonal functions, to transmit M bits using one symbol, the new receiver needs to search over only M functions as opposed to 2 symbols. A numerical method for generating the analytic symbols, called Constrained Gram Schmidt method, is presented. Experimental results demonstrating the proof of concept of the approach are also discussed.","PeriodicalId":296096,"journal":{"name":"2007 Wireless Telecommunications Symposium","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115826610","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":"Optimizing satellite broadcast scheduling problem using the competitive Hopfield neural network","authors":"Yu-Ju Shen, Ming-Shi Wang","doi":"10.1109/WTS.2007.4563323","DOIUrl":"https://doi.org/10.1109/WTS.2007.4563323","url":null,"abstract":"In this paper the competitive Hopfield neural network method for finding a broadcasting schedule in the satellite system will be described. The satellite broadcast scheduling (SBS) problem is known as an NP-complete problem. Communication links between satellites and ground terminals are provided in a repetition of time slots. The goal of the proposed algorithm is to find the broadcasting schedule of satellites with the maximum number of broadcasting time slots under the constraints. A competitive learning rule provides a highly effective means for obtaining a resonance solution and is capable of reducing the time-consuming effort to obtain coefficients. The proposed method can always satisfy the problem constraints and guarantee the viability of the solutions for the SBS problem. The competitive mechanism simplifies the network complexity. The proposed method is greatly suitable for implementation on a digital machine. Furthermore, the competitive Hopfield neural network method permits temporary energy increases to escape from local minima. Simulation results show that the competitive Hopfield neural network method can improve system performance and with fast convergence and high reliability.","PeriodicalId":296096,"journal":{"name":"2007 Wireless Telecommunications Symposium","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132875360","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}