{"title":"Optimized Cooperative Diversity for a Three-Node Decode-and-Forward Relay Channels","authors":"K. Wong, E. Elsheikh","doi":"10.1109/ISWPC.2007.342618","DOIUrl":"https://doi.org/10.1109/ISWPC.2007.342618","url":null,"abstract":"Due to space limitation, providing space diversity at mobile stations such as handsets or personal digital assistants (PDA) is problematic in mobile ad hoc networks (MANET). Recent studies, however, have shown that extraordinary diversity advantages can be obtained from a relay node in the proximity, which forwards the information from the source to the intended destination node via a diversity path. The diversity in reception can be easily translated into the benefits of increased achievable information rates or reduced outage probability. While previous works had demonstrated that remarkable gains can be achieved from simple fixed-relaying strategies when compared to without relaying, this paper takes an information-theoretic perspective to look into the optimal decode-and-forward (DF) single-relay scheme for 1) maximizing the mutual information between the source and the destination node given the instantaneous channel state information at all the participating nodes (CSIN), and 2) minimizing the outage rate probability given only the statistical channel information at the nodes (SCIN). In particular, we aim to find the optimal time-division between the direct transmission phase and the relaying phase, and the optimal power allocation for the two phases, for a three-node relay channel","PeriodicalId":403213,"journal":{"name":"2007 2nd International Symposium on Wireless Pervasive Computing","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121023066","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":"Designing Wireless Networks by Test Point Reduction","authors":"N. Pongthaipat, J. Kabara","doi":"10.1109/ISWPC.2007.342620","DOIUrl":"https://doi.org/10.1109/ISWPC.2007.342620","url":null,"abstract":"The problem of locating the minimum number of base stations (BSs) to provide sufficient signal coverage or to satisfy user, is often formulated in manner that results in a mixed-integer NP-hard (non-deterministic polynomial-time hard) problem. Solving a large size NP-hard problem is time-prohibitive because search space always increases exponentially. This paper presents a method to reduce a number of test points for placing BSs by employing a convolution process. Results show that the size of search space substantially decreases, and converging to the optimal solution can be achieved in a timely-fashion","PeriodicalId":403213,"journal":{"name":"2007 2nd International Symposium on Wireless Pervasive Computing","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128430215","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 Route Planning Method Using Cost Map for Mobile Sensor Nodes","authors":"M. Nakamiya, Y. Kishino, T. Terada, S. Nishio","doi":"10.1109/ISWPC.2007.342595","DOIUrl":"https://doi.org/10.1109/ISWPC.2007.342595","url":null,"abstract":"In this paper, we propose a route planning method for mobile sensor nodes using cost map. The proposed method achieves novel route planning that can solve several practical problems from previous works: the limitations of sensing ranges, obstacles on the node's routes, and restriction of their movements. This method can determine the route that has the lowest power consumption. We also propose a sensing area defining method for dealing with many kinds of sensors. Furthermore, we compared the proposed method to A*algorithm, a well-known route planning algorithm. We implemented a prototype of the sensor node to verify our algorithm in a real environment.","PeriodicalId":403213,"journal":{"name":"2007 2nd International Symposium on Wireless Pervasive Computing","volume":"402 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116659512","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":"Delay-Tolerant Space-Time Block Codes for Asynchronous Cooperative Relaying","authors":"M. O. Damen, A. R. Hammons","doi":"10.1109/ISWPC.2007.342651","DOIUrl":"https://doi.org/10.1109/ISWPC.2007.342651","url":null,"abstract":"In cooperative networks using a decode-and-forward strategy, the multiple relays effectively transmit a distributed space-time code, the performance of which can be severely degraded when timing synchronization among the relays is not assured. Recent work by Xia et al. and Hammons et al. have investigated the design of distributed space-time codes that are delay tolerant, in the sense that full spatial diversity is achieved regardless of relative timing offsets. In this paper, new distributed space-time codes are introduced that are fully delay tolerant","PeriodicalId":403213,"journal":{"name":"2007 2nd International Symposium on Wireless Pervasive Computing","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127425800","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":"Improving EDGE for rural environments through channel allocation for voice and data traffic","authors":"C.M. Ramirez Casanas, J. Aspas, S. P. Mansilla","doi":"10.1109/ISWPC.2007.342599","DOIUrl":"https://doi.org/10.1109/ISWPC.2007.342599","url":null,"abstract":"In this paper, we focus on improving EDGE technology with the aim that the benefits of mobile communication reach rural environments and isolated areas. We present a method of channel allocation that provides both voice and data services, improving data traffic transmission without putting aside the QoS of voice traffic. Firstly, a general analytical model is presented. Secondly, allocating sequentially the time slots, we study the best way of using few reserved time slots just for voice calls, in order to get greater probabilities of higher throughput. Finally, the results obtained are analysed and using them, the network operator can schedule the channel allocation of their users according to the QoS requirements of each of them.","PeriodicalId":403213,"journal":{"name":"2007 2nd International Symposium on Wireless Pervasive Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129624441","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":"Anchor-Based Geographic Routing for Sensor Networks Using Projection Distance","authors":"Gang Zhao, Xiangqian Liu, Min-Te Sun","doi":"10.1109/ISWPC.2007.342572","DOIUrl":"https://doi.org/10.1109/ISWPC.2007.342572","url":null,"abstract":"Geographic routing is an effective routing technique in wireless sensor networks based on locally available position information. It uses greedy forwarding whenever possible. When greedy forwarding is impossible, it changes to detouring mode to find a detour to a node where it can switch back to greedy forwarding. Routing in detouring mode is usually complex and may result in lengthy paths. To shorten the path and reduce the chance of routing in detouring mode, anchor-based geographic routing has been proposed, which aims at using some anchor nodes as intermediate destinations to reduce lengthy detouring. In this paper, we propose to obtain the anchor list based on the projection distance of nodes in detouring mode with respect to the virtual line linking the source and destination. It is shown that our algorithm outperforms existing anchor-based routing algorithms, with shorter paths and fewer anchors in random network topology. Simulation results are provided to validate the claims","PeriodicalId":403213,"journal":{"name":"2007 2nd International Symposium on Wireless Pervasive Computing","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121865305","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":"Time Slot Assignment for Maximum Bandwidth in a Mobile Ad Hoc Network","authors":"Jianping Li, Y. Wakahara","doi":"10.4304/jcm.2.6.56-64","DOIUrl":"https://doi.org/10.4304/jcm.2.6.56-64","url":null,"abstract":"Including some typical examples such as disaster recovery, search and rescue and military activities, applications of mobile ad hoc networks (MANETs) are drawing more and more attentions in a civilian life for complements of the Internet. Providing required bandwidth for these applications in MANETs has become an unavoidable and urgent task to achieve sufficient QoS (quality of service) because of the rising popularity of multimedia applications and potential commercial usage of MANETs. Time slot assignment is essential to provide the calculated bandwidth in TDMA (time division multiple access)-based MANETs, which are a focus of attention of this paper because of its collision-free packet transmission with QoS support. In this paper, a new time slot assignment algorithm-SAGO (slot assignment by global overview) is proposed, by which more available bandwidth can be obtained than conventional approximate solutions and much less time is consumed than MIP (mixed integer programming) method. In addition, the effectiveness of SAGO is proved by simulation results","PeriodicalId":403213,"journal":{"name":"2007 2nd International Symposium on Wireless Pervasive Computing","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130578728","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}