{"title":"Spectral Efficient Half Duplex Relaying for Fountain Code with Wireless Network Coding","authors":"H. Wicaksana, S. Ting, Y. Guan","doi":"10.1109/ICCW.2008.62","DOIUrl":"https://doi.org/10.1109/ICCW.2008.62","url":null,"abstract":"In this paper, we present a novel spectral efficient relaying scheme for a random linear fountain code with two half duplex relay nodes at which simple network coding, which consists of an XOR operation, is performed. Only the destination node will have a fountain decoder. At the relay nodes, the received packets will be CRC decoded1 and randomly XOR with the earlier correctly CRC decoded packets which are stored in the relays' buffers. If the received packets cannot be correctly CRC decoded, the relays will just randomly XOR the packets in their respective buffers and forward the newly network coded packet to the destination. The theoretical upper bound for the outage probability of this proposed scheme is derived. Our simulation results show that the upper bound is tight and the proposed scheme outperforms existing schemes. It is also shown that with wireless network coding, 1-2 dB performance gains and faster fountain decoding especially for low SNR can be achieved.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"289 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123436450","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":"Analyzing the Concept of Involving Low End Devices in a Cooperative Network","authors":"P. Ekler, H. Charaf","doi":"10.1109/ICCW.2008.24","DOIUrl":"https://doi.org/10.1109/ICCW.2008.24","url":null,"abstract":"The development of hardware and software of low end mobile phones and even simple media players will increasingly allow different type of content to be consumed on them creating pressure for efficient ways to also access the content. Since efficient, scalable distribution of multimedia content is a key strength of peer-to-peer technologies, bringing that technology to the player devices seems attractive. This way low end devices would be able to join and cooperate in an existing peer-to-peer network. The paper introduces a complete J2ME based BitTorrent solution for mainstream phones, called MobTorrent which supports both downloading and uploading. We analyze the key elements of MobTorrent and introduce issues related to the limited capabilities of low end devices. The performance of the complete application is evaluated by speed measurements. In general handheld devices have small batteries, thus the energy consumption is a key property of applications on low end devices. The paper also discusses the possibility of implementing Bluetooth based local cooperation in MobTorrent and the key factors of how to bring peer-to-peer technology to simple media player devices.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131797819","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":"Cooperation Incentives and Enablers for Wireless Peers in Heterogeneous Networks","authors":"O. Karonen, J. Nurminen","doi":"10.1109/ICCW.2008.30","DOIUrl":"https://doi.org/10.1109/ICCW.2008.30","url":null,"abstract":"Various incentive schemes have been proposed to force or encourage peers to contribute their resources to peer-to-peer networks. Such schemes are typically designed for peers with fixed Internet connections and do not take the special properties of wireless peers into account. In this paper we propose a P2P credit system especially targeted for the cases where mobile devices join P2P networks. Instead of limiting the incentive and reputation mechanisms to a single device our scheme encompasses all the connected devices of a user. We discuss the limitations of today's incentive schemes from the wireless devices point of view, present the P2P credit system concept and highlight its operation with a number of use cases. Through mathematical analysis we illustrate the potential of the solution.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131956815","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":"Randomized Multi-User Strategy for Spectrum Sharing in Opportunistic Spectrum Access Network","authors":"Zhongliang Liang, W. Liu, Pan Zhou, Feng Gao","doi":"10.1109/ICCW.2008.96","DOIUrl":"https://doi.org/10.1109/ICCW.2008.96","url":null,"abstract":"In this paper, we consider the problem of opportunistic spectrum access (OSA) for multiple secondary users over multiple channels occupied by primary users whose occupancy state is modeled as discrete-time Markov Process. Taking collisions among secondary users into consideration, we develop a randomized strategy that allows secondary users to seek independently for spectrum opportunities without cooperation, while at the same time maximizing the spectrum utility of the whole system. Our proposed scheme can achieve higher total throughput for all secondary users with no additional message exchange when compared with other similar works. Additionally, our proposed strategy can easily incorporate the spectrum detector in physical layer and interference constraints set by primary users.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128767613","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":"Criteria on Utility Designing of Convex Optimization in FDMA Networks","authors":"Zheng Sun, Wenjun Xu, Zhiqiang He, K. Niu","doi":"10.1109/ICCW.2008.13","DOIUrl":"https://doi.org/10.1109/ICCW.2008.13","url":null,"abstract":"In this paper, we investigate the network utility maximization problem in FDMA systems. We summarize with a suite of criteria on designing utility functions so as to achieve the global optimization convex. After proposing the general form of the utility functions, we present examples of commonly used utility function forms that are consistent with the criteria proposed in this paper, which include the well-known proportional fairness function and the sigmoidal-like functions. In the second part of this paper, we use numerical results to demonstrate a case study based on the criteria mentioned above, which deals with the subcarrier scheduling problem with dynamic rate allocation in FDMA system.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126302535","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 Novel Interfacing Solution to Make IKEv2 Work in MIPv6 Environment","authors":"Ke Xu, Minpeng Qi, Haitao Li, Peng Yang, Hui Deng","doi":"10.1109/ICCW.2008.91","DOIUrl":"https://doi.org/10.1109/ICCW.2008.91","url":null,"abstract":"In IETF, mobile IPv6 signaling and data must be protected by IP security association, while IKEv2 is recommended to make dynamical IPSec security association maintenance. But when mobile node bootstrapped in foreign net work or handover to a new network, IKEv2 cannot get information about MIPv6 to negotiate right IP security associations, which will incur bootstrap failure and long handover delay. In this paper, a novel solution is proposed to interface IKEv2 and MIPv6 for information sharing and mobility detection. In according with our evaluation result, this solution could solve bootstrap problem and reduce the handover delay greatly.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126778102","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 Aspects of Peer Cooperation Measurements with a Mobile DHT System","authors":"I. Kelényi, J. Nurminen","doi":"10.1109/ICCW.2008.36","DOIUrl":"https://doi.org/10.1109/ICCW.2008.36","url":null,"abstract":"Distributed Hash Tables (DHTs) are widely studied from the fixed computer point of view, but very little research has been done on the performance of mobile clients. We have implemented a DHT client for mobile phones and carried out energy measurements to analyze the power profile of the application. By connecting to a widely deployed DHT, we were able to observe how mobile clients perform in a million user environment. We show that using a mobile phone as a full-peer is feasible only for a couple of hours due to the high power consumption. We also define the client-only mode that allows mobile nodes to use the services of the DHT with minimal energy consumption.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"349 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115299969","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 Efficient Clustering Algorithms for Wireless Sensor Networks","authors":"D. Wei, S. Kaplan, H. Chan","doi":"10.1109/ICCW.2008.50","DOIUrl":"https://doi.org/10.1109/ICCW.2008.50","url":null,"abstract":"Energy efficiency is a major concern in wireless sensor networks (WSNs). Many clustering algorithms have been proposed for such a purpose. This paper investigates the existing clustering algorithms. The algorithms have been classified and some representatives are described in each category. After analyzing the strengths and the weaknesses of each category, an important characteristic of WSNs is pointed out for further improvement of energy efficiency for WSNs.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121585695","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 Distributed Merge and Split Algorithm for Fair Cooperation in Wireless Networks","authors":"Walid Saad, Zhu Han, M. Debbah, A. Hjørungnes","doi":"10.1109/ICCW.2008.65","DOIUrl":"https://doi.org/10.1109/ICCW.2008.65","url":null,"abstract":"This paper introduces a novel concept from coalitional game theory which allows the dynamic formation of coalitions among wireless nodes. A simple and distributed merge and split algorithm for coalition formation is constructed. This algorithm is applied to study the gains resulting from the cooperation among single antenna transmitters for virtual MIMO formation. The aim is to find an ultimate transmitters coalition structure that allows cooperating users to maximize their utilities while accounting for the cost of coalition formation. Through this novel game theoretical framework, the wireless network transmitters are able to self-organize and form a structured network composed of disjoint stable coalitions. Simulation results show that the proposed algorithm can improve the average individual user utility by 26.4% as well as cope with the mobility of the distributed users.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127102182","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}