{"title":"A user-centric mobility framework for multimedia interactive applications","authors":"R. Bolla, R. Rapuzzi, M. Repetto","doi":"10.1109/ISWCS.2009.5285365","DOIUrl":"https://doi.org/10.1109/ISWCS.2009.5285365","url":null,"abstract":"Today users are getting used to have many heterogeneous devices available in their surroundings. This opens great opportunities to build pervasive communication environments. Pervasive communications are usually user-centric in nature, as they should target sessions to users rather than their specific devices. Mobility is a key issue in such context: users often move and that implies different devices and networks to become available to them dynamically. As a matter of fact, terminal handovers and session migrations could negatively impact the enjoyment of multimedia content in such scenarios. In this paper, we propose a user-centric mobility framework for multimedia interactive applications. To this aim, we implement the concept of Personal Address, that is a network identifier assigned to users. Our mobility framework exploits this concept to accounts for all aspects of mobility. Moreover, we describe our deployment for Voice-over-IP sessions; finally, we report the results from our experimental testbed.","PeriodicalId":344018,"journal":{"name":"2009 6th International Symposium on Wireless Communication Systems","volume":"19 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116168136","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}
Francisco Novillo, M. Churchman, R. Ferrús, R. Agustí
{"title":"A channel allocation algorithm for OSA-enabled IEEE 802.11 WLANs","authors":"Francisco Novillo, M. Churchman, R. Ferrús, R. Agustí","doi":"10.1109/ISWCS.2009.5285281","DOIUrl":"https://doi.org/10.1109/ISWCS.2009.5285281","url":null,"abstract":"Channel allocation problem is a major challenge in wireless local area networks (WLANs), especially in dense deployments of access points (APs) where congestion of the unlicensed spectrum bands (i.e., ISM bands) could undermine achieved network performance. This paper analyses the possibility to alleviate congestion of the ISM band by allowing some APs to use additional channels located in licensed bands in an opportunistic manner whenever licensee services (i.e., primary users) are not affected. Availability of these additional channels in licensed bands is assumed not to be the same for all the APs. Based on this assumption, we formulate the problem for the channel assignment as a Binary Linear Programming (BLP) problem, which allows us to obtain an optimal solution despite an elevated execution time. We also develop a heuristic method based on building a Minimum Spanning Tree (MST) graph attending to interference conditions that is able to find near-optimal solutions with a shorter execution time. Results are provided to assess the benefits of such a proposal under different WLAN deployment situations and primary channel availability conditions.","PeriodicalId":344018,"journal":{"name":"2009 6th International Symposium on Wireless Communication Systems","volume":"181 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125617924","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}
Nguyen Huu Thanh, Le Thi Thuy Hang, T. Quynh, V. V. Yem, Nguyen Xuan Dung
{"title":"Multimedia session continuity with context-aware capability in IMS-based network","authors":"Nguyen Huu Thanh, Le Thi Thuy Hang, T. Quynh, V. V. Yem, Nguyen Xuan Dung","doi":"10.1109/ISWCS.2009.5285326","DOIUrl":"https://doi.org/10.1109/ISWCS.2009.5285326","url":null,"abstract":"In this paper we firstly proved that Mobile IP protocols are designed for mobility but not for session continuity. In contradiction, mSCTP (mobile Stream Control Transmission Protocol) appears to be the best protocol with regard to session continuity support, however it does not support location management mechanisms, thus context-aware QoS as well as other mechanisms based on knowledge of location are hardly accommodated. On the other hand, the standardized IP Multimedia Subsystem (IMS) solution initially introduced by 3GPP adopts the policy-based QoS model to map user's subscription to a pre-defined QoS level, to apply service-based charging and to prevent Theft-of-Service. In this article we propose a new approach that integrates mSCTP into IMS networks to facilitate session continuity and to provide mechanisms for service control. It is realized by a proxy based on mSCTP (mobile Stream Control Transmission Protocol) that acts as an anchor point for soft vertical handover of mobile nodes, which have multiple physical interfaces (e.g., WLAN/UMTS). The mSCTP-based proxy also supports QoS provisioning and adaptation for the mobile nodes when moving in a heterogeneous wireless environment. Results show that the signaling cost for handover in our approach can be up to 23 times smaller than that in the conventional approach.","PeriodicalId":344018,"journal":{"name":"2009 6th International Symposium on Wireless Communication Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130080738","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 Interleave-Division Multiplexing Space-Time Codes for coded relay networks","authors":"P. Weitkemper, D. Wübben, K. Kammeyer","doi":"10.1109/ISWCS.2009.5285280","DOIUrl":"https://doi.org/10.1109/ISWCS.2009.5285280","url":null,"abstract":"In this paper the application of the recently proposed Interleave-Division Multiplexing Space-Time Codes (IDM-STC) in coded relay networks is investigated. IDM-STC are a very flexible scheme to exploit space diversity with the benefits of IDM such as robustness against asynchronism and efficient iterative detection. While IDM-STC have been investigated for MIMO systems, relay networks induce additional constraints like imperfect decoding at the relay and limited cooperation. Consequently, not only the choice of the diversity scheme, but also the applied relay functionality significantly influences the overall performance. In this paper different relay schemes in combination with IDM-STC are considered for coded relay networks. Amplify-Forward (AF) does not assume any signal processing at the relays and just forwards the received signal. Decode-Forward (DF) fully decodes the received signal which can lead to error propagation. Another relaying scheme called Estimate-Forward (EF), which combines the advantages of AF and DF, was recently extended to coded systems and is called Decode-Estimate-Forward (DEF). A coded IDM-STC relay system with different relay schemes is investigated to show the good performance of IDM-STC combined with DEF in realistic scenarios with small overhead and robustness against asynchronism.","PeriodicalId":344018,"journal":{"name":"2009 6th International Symposium on Wireless Communication Systems","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127771010","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 study of cooperative communication with consideration of power loss caused by relay abortion","authors":"Mayumi Suzuki, O. Takyu, Y. Umeda","doi":"10.1109/ISWCS.2009.5285276","DOIUrl":"https://doi.org/10.1109/ISWCS.2009.5285276","url":null,"abstract":"Recently, the cooperative communication is attracting much attention for enlarging the sell coverage and achieving large received SNR. In cooperative communication, the relay station receives the signal from the source station and then forwards it to the destination station. In the decoding and forwarding relay process, the bit error detection is performed the received signal for avoiding the erroneous information signal transmitted to the destination. Detecting the error bits, the forwarding of the information signal is aborted. However, the received SNR at the destination station is significantly reduced because the number of possibly received signals becomes small. In this paper, the technique for compensating the power loss caused by the relay abortion is proposed. The proposed technique is composed of the detection of the relay abortion in other relay station and of the control of the transmitting signal power. We show the effect of the proposed technique by computer simulation.","PeriodicalId":344018,"journal":{"name":"2009 6th International Symposium on Wireless Communication Systems","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129908929","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 power management and beamforming for base stations in Cognitive Radio systems","authors":"Xiao Fu, Jun Wang, Shaoqian Li","doi":"10.1109/ISWCS.2009.5285316","DOIUrl":"https://doi.org/10.1109/ISWCS.2009.5285316","url":null,"abstract":"This paper investigates the joint power control and transmit beamforming problem in multiuser Cognitive Radio systems (CR). Comparing to the conventional downlink transmit problems, joint power management and beamforming schemes in CR systems is more complicated because designers must take the interference to primary users (PUs) into consideration. Assuming perfect channel information to both CR users and PUs can be obtained at CR base stations, in this paper, we solve the formulated downlink optimization problem in two different ways. Since the objective with SINR constraint at each CR receiver and the interference threshold at each PU receiver can be regarded as a second order cone programming (SOCP) problem, we first show the problem can be efficiently solved by SOCP tools. Furthermore, we prove that the downlink problem in CR systems can be interpreted as a conventional uplink-like problem by using up and down duality, which provides a more convenient fixed iterative point method to achieve the optimal solution.","PeriodicalId":344018,"journal":{"name":"2009 6th International Symposium on Wireless Communication Systems","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129778049","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}
A. García-Sánchez, F. García-Sánchez, J. García-Haro
{"title":"Optimized Orphan Algorithm for IEEE 802.15.4 networks","authors":"A. García-Sánchez, F. García-Sánchez, J. García-Haro","doi":"10.1109/ISWCS.2009.5285294","DOIUrl":"https://doi.org/10.1109/ISWCS.2009.5285294","url":null,"abstract":"The IEEE 802.15.4 standard offers a low-cost, low-power and short-range wireless communications, which are known by the acronym LR-WPAN (Low Rate Wireless Personal Area Network). The loss of coverage of a device involves a long process when it has to join again the wireless network, having associated a high delay and energy waste. These drawbacks imply this Orphan device stays a long time unable to perform its network operation but simultaneously consuming power. In this paper we propose and design a new algorithm, called Optimized Orphan Algorithm (OOA), which provides a considerable reduction on the delay and energy consumption during the orphan process. Performance evaluation of the OOA algorithm is conducted by using a ns-2 simulation environment. Finally, a real-implementation is assessed as case of study. This real-case validates the simulation results.","PeriodicalId":344018,"journal":{"name":"2009 6th International Symposium on Wireless Communication Systems","volume":"578 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127581767","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":"Optimising transmission path selection in SCTP based wireless networking","authors":"Martin Hynes, L. Kilmartin","doi":"10.1109/ISWCS.2009.5285311","DOIUrl":"https://doi.org/10.1109/ISWCS.2009.5285311","url":null,"abstract":"A number of different protocols have been proposed to support the concept of wireless terminal mobility. One such protocol is SCTP which includes functionality to monitor the characteristics of the primary path and all alternate secondary paths connecting two hosts. This supports a basic mechanism by which traffic can be switched from a primary path to a secondary path in the case of a primary path failure. This paper focuses on further enhancing this functionality to support switching between the available paths in order to optimise the overall data throughput between the hosts. A number of alternate algorithms are proposed to control this mechanism and the performance of these algorithms has been evaluated in a simulated network environment. The results of these simulations show that they can offer a superior performance as quantified in terms of mean handover rates and handover latency compared to the current SCTP standard algorithm and a previously suggested solution. It is shown that the proposed algorithms results in a reduction in the mean handover rate to approximately 4% of the mean handover rate of existing suggested handover control algorithms.","PeriodicalId":344018,"journal":{"name":"2009 6th International Symposium on Wireless Communication Systems","volume":"254 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114275884","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":"Seed graph expansion for construction of structured LDPC codes","authors":"W. Sułek","doi":"10.1109/ISWCS.2009.5285248","DOIUrl":"https://doi.org/10.1109/ISWCS.2009.5285248","url":null,"abstract":"A lot of works concerning LDPC codes construction has been published so far. However, it is well known that efficient partially parallel hardware decoder architectures are allowed only for LDPC codes with blockwise partitioned structure of the parity check matrix, called structured LDPC codes. Two main steps in the structured LDPC code parity check matrix construction are the seed matrix (seed graph) construction and expansion of the seed matrix (seed graph). In this paper we present a flexible method for seed matrix expansion by computer search technique for the optimum shift values of the circulant submatrices. The proposed algorithm aims at reducing existence in the code graph of small cycles with low external connectivity that constitute structures known as Stopping Sets and Trapping Sets that are harmful to the code performance, especially in the high SNR region. The algorithm can be used for regular or irregular code construction of any block length and code rate.","PeriodicalId":344018,"journal":{"name":"2009 6th International Symposium on Wireless Communication Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123943853","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":"Evaluation of wireless channel quality for an ad hoc network in the sky, SKYMESH","authors":"Tomoaki Umeki, Hiraku Okada, K. Mase","doi":"10.1109/ISWCS.2009.5285366","DOIUrl":"https://doi.org/10.1109/ISWCS.2009.5285366","url":null,"abstract":"This paper investigates the statistical characteristics of the wireless channel in an ad hoc network in the sky “SKYMESH,” which is a solution for temporal communication networks in the large-scale natural disasters. SKYMESH consists of balloon nodes, which are located at 50–100 m high over the the ground, and build the wireless network in the air. In this system, line-of-sight (LoS) is kept between balloon nodes, and the disaster area can be covered effectively. Wireless channel quality is quickly changed due to the swinging of balloon nodes. In order to investigate the statistical characteristics of the wireless channel, receive signal strength indicator (RSSI) and swing strength of the balloon nodes is measured in the field experiment at Niigata University in August 2008, and at Yamakoshi, Nagaoka-city in October 2008. As a result, when the angle rate of communication equipments increases, the standard deviation of RSSI in the inter-balloon communications increases. In the communications between the balloon and the ground nodes, long-term statistics is caused by the change of the antenna direction by wind, and short-term statistics is Nakagami-Rice fading environment.","PeriodicalId":344018,"journal":{"name":"2009 6th International Symposium on Wireless Communication Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123102941","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}