Ibrahim Al-Nahhal, M. Alghoniemy, O. Muta, A. A. El-Rahman
{"title":"Reduced complexity K-best sphere decoding algorithms for ill-conditioned MIMO channels","authors":"Ibrahim Al-Nahhal, M. Alghoniemy, O. Muta, A. A. El-Rahman","doi":"10.1109/CCNC.2016.7444753","DOIUrl":"https://doi.org/10.1109/CCNC.2016.7444753","url":null,"abstract":"The traditional K-best sphere decoder retains the best K-nodes at each level of the search tree; these K-nodes, include irrelevant nodes which increase the complexity without improving the performance. A variant of the K-best sphere decoding algorithm for ill-conditioned MIMO channels is proposed, namely, the ill-conditioned reduced complexity K-best algorithm (ill-RCKB). The ill-RCKB provides lower complexity than the traditional K-best algorithm without sacrificing its performance; this is achieved by discarding irrelevant nodes that have distance metrics greater than a pruned radius value, which depends on the channel condition number. A hybrid-RCKB decoder is also proposed in order to balance the performance and complexity in both well and ill-conditioned channels. Complexity analysis for the proposed algorithms is provided as well. Simulation results show that the ill-RCKB provides significant complexity reduction without compromising the performance.","PeriodicalId":399247,"journal":{"name":"2016 13th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134234833","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":"Closer destination selection scheme for mobile sink and charger enabled WRSNs","authors":"Yuya Tamura, Kentaroh Toyoda, I. Sasase","doi":"10.1109/CCNC.2016.7444744","DOIUrl":"https://doi.org/10.1109/CCNC.2016.7444744","url":null,"abstract":"In WRSNs (Wireless Rechargeable Sensor Networks), the wireless energy transfer technology enables charging sensor batteries and maintaining perpetual operation of the network. The MC (mobile charger) is able to provide stable and reliable energy supply for sensor nodes. Although many researchers study the efficient scheduling of the MC, none of them considers the situation where both the static sink and the MC can collect packets. In this case, each sensor node should choose the appropriate destination, i.e., the static sink or the MC. In this paper, we propose closer destination selection scheme for mobile sink and charger enabled WRSNs where a static sink and an MC coexist. In order for each sensor node to send packets to the closer destination, i.e., the static sink or the MC, when an MC tours to charge sensor nodes, it constructs another temporal tree-based topology network by sending a route construction packet to sensor nodes within the limited area. Whenever the MC stays at a sensor node, it calculates the maximum number of hops that sensor nodes should switch to a temporal network. This temporal network that the MC creates does not disturb the original network. By constructing a temporal network, an MC relaxes the load of sensor nodes around the static sink without unnecessary path extension. We evaluate the performance of our scheme through the computer simulation. Results indicate that our scheme improves the packet arrival rate and energy efficiency compared to the conventional scheme.","PeriodicalId":399247,"journal":{"name":"2016 13th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114745707","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 scalability and communication in MMOGs","authors":"S. A. Abdulazeez, A. Rhalibi, D. Al-Jumeily","doi":"10.1109/CCNC.2016.7444812","DOIUrl":"https://doi.org/10.1109/CCNC.2016.7444812","url":null,"abstract":"Massively Multiplayer Online Games (MMOGs) can involve millions of synchronous players scattered across the world and participating with each other within a single shared game. One of the most significant issues in MMOGs is scalability and it is impact on the responsiveness and the quality of the game. In this paper, we propose a new architecture to increase the scalability without affecting the responsiveness of the game, using a hybrid Peer-to-Peer system. This mechanism consists of central servers to control and manage the game state, as well as super-peer and clone-super-peer to control and manage sub-networks of nodes sharing common regions of the game world. We use the OPNET Modeler to simulate the system and compare the results with client/server system to show the difference in delay and traffic received for various applications such as remote login, database, HTTP, and FTP sessions which are all part of an MMOG system. We use four scenarios for each system to evaluate the scalability of the system with different number of peers (i.e.125, 250, 500, and 1000 peers). The results show that the hybrid P2P system is more scalable for MMOGs when compared with client/server system.","PeriodicalId":399247,"journal":{"name":"2016 13th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127062633","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}
M. Baguena, G. Samaras, Andreas Pamboris, M. Sichitiu, P. Pietzuch, P. Manzoni
{"title":"Towards enabling hyper-responsive mobile apps through network edge assistance","authors":"M. Baguena, G. Samaras, Andreas Pamboris, M. Sichitiu, P. Pietzuch, P. Manzoni","doi":"10.1109/CCNC.2016.7444813","DOIUrl":"https://doi.org/10.1109/CCNC.2016.7444813","url":null,"abstract":"Poor Internet performance currently undermines the efficiency of hyper-responsive mobile apps such as augmented reality clients and online games, which require low-latency access to real-time backend services. While edge-assisted execution, i.e. moving entire services to the edge of an access network, helps eliminate part of the communication overhead involved, this does not scale to the number of users that share an edge infrastructure. This is due to a mismatch between the scarce availability of resources in access networks and the aggregate demand for computational power from client applications. Instead, this paper proposes a hybrid edge-assisted deployment model in which only part of a service executes on LTE edge servers. We provide insights about the conditions that must hold for such a model to be effective by investigating in simulation different deployment and application scenarios. In particular, we show that using LTE edge servers with modest capabilities, performance can improve significantly as long as at most 50% of client requests are processed at the edge. Moreover, we argue that edge servers should be installed at the core of a mobile network, rather than the mobile base station: the difference in performance is negligible, whereas the latter choice entails high deployment costs. Finally, we verify that, for the proposed model, the impact of user mobility on TCP performance is low.","PeriodicalId":399247,"journal":{"name":"2016 13th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123382524","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}
Hongjun Kim, Jinkyu Kang, Seongah Jeong, Kwang-Eog Lee, Joonhyuk Kang
{"title":"Secure beamforming and self-energy recycling with full-duplex wireless-powered relay","authors":"Hongjun Kim, Jinkyu Kang, Seongah Jeong, Kwang-Eog Lee, Joonhyuk Kang","doi":"10.1109/CCNC.2016.7444859","DOIUrl":"https://doi.org/10.1109/CCNC.2016.7444859","url":null,"abstract":"In this paper, we investigate a two-hop full-duplex wireless-powered relaying system consists of a source, a relay, and a destination in the presence of a passive eavesdropper. The relay assists the transmission of confidential information from the source to the destination, while simultaneously harvesting the energy with time switching scheme by the radio-frequency (RF) signals. Our goal is to maximize the physical-layer security under harvested energy constraints by designing the full-duplex wireless-powered relay, whose two relaying strategies are considered, namely amplify-and-forward (AF) and decode-and-forward (DF). The relay beamforming vector design is proposed for AF protocol, and is jointly optimized with the time ratio parameter in the case of DF protocol to maximize the physical-layer security under harvested energy constraints. Moreover, for the simultaneous energy and secure message transfer at the relay, a two-phase method is provided, which enables the relay to avoid the self-interference caused by full-duplex operation, and also to harvest the energy from the self-interference. The proposed algorithmic solutions leverage the rank relaxation, Majorization-Minimization (MM) programming, and line search method. Numerical results show that the proposed full-duplex relaying system outperforms the half-duplex relaying system in energy harvesting. Moreover, the trade-off between AF and DF protocols according to the occurrence probability of non-zero secrecy rate can be observed in terms of physical-layer security.","PeriodicalId":399247,"journal":{"name":"2016 13th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125019045","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 anonymous computation of social distance","authors":"E. Biagioni","doi":"10.1109/CCNC.2016.7444741","DOIUrl":"https://doi.org/10.1109/CCNC.2016.7444741","url":null,"abstract":"In a distributed social network, no single system holds information about all the individuals in the network, and no single system is trusted by all the individuals in the network. It is nonetheless desirable to reliably compute the social distance among individuals. This must be done anonymously, without giving away any identifying information about individuals in the social network, and reliably, without allowing anyone to pretend to be socially closer to someone else than they actually are. The Social Network Connectivity Algorithm, or SoNCA, accomplishes these goals in a distributed manner. This paper describes both the high-level algorithm and a concrete design that is intended for future use with a network, AllNet, designed to provide secure interpersonal communication utilizing all available means, including Internet, cellular communications, ad-hoc networking and delay-tolerant networking.","PeriodicalId":399247,"journal":{"name":"2016 13th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116815419","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":"Resource saving: Which resource sharing strategy to protect primary shortest paths?","authors":"M. Saidi, Bernard A. Cousin","doi":"10.1109/CCNC.2016.7444788","DOIUrl":"https://doi.org/10.1109/CCNC.2016.7444788","url":null,"abstract":"Two strategies of resource sharing are proposed in literature to provide protection while saving resources: (1) restrained sharing which applies the resource sharing to the backup paths only and (2) global sharing which extends the resource sharing to the primary and backup paths. In this paper, we compared the two strategies of resource sharing when the primary paths correspond to the shortest ones according to a strictly positive and static metric. Even when the amount of resources that can be shared between the primary and the backup paths is unbounded, we proved that the maximum number of backup paths is still bounded. Besides, our simulations showed that the resource sharing between the primary and backup paths has very slight impact on the backup path rejection, i.e. the two strategies of resource sharing have very close performances.","PeriodicalId":399247,"journal":{"name":"2016 13th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122227642","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}
Tim Panton, D. Llewellyn-Jones, Nathan Shone, Mahmoud Hashem Eiza
{"title":"Secure proximity-based identity pairing using an untrusted signalling service","authors":"Tim Panton, D. Llewellyn-Jones, Nathan Shone, Mahmoud Hashem Eiza","doi":"10.1109/CCNC.2016.7444914","DOIUrl":"https://doi.org/10.1109/CCNC.2016.7444914","url":null,"abstract":"New protocols such as WebRTC promise seamless in-browser peer-to-peer communications that in theory remove the need for third-party services. In practice, widespread use of Firewalls, NATS and dynamic IP addresses mean that overlay addressing or use of some fixed rendezvous point is still needed. In this paper we describe a proximity-based pairing scheme that uses a signalling service to minimise the trust requirements on the third party, achieving anonymity and avoiding the need for PKI, while still requiring only a simple asymmetric pairing protocol.","PeriodicalId":399247,"journal":{"name":"2016 13th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115713227","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}
G. Aravinthan, L. Roullet, Nessrine Trabelsi, Chung Shue Chen, A. Hebbar, Érick Bizouarn
{"title":"Generalized software defined network platform for Radio Access Networks","authors":"G. Aravinthan, L. Roullet, Nessrine Trabelsi, Chung Shue Chen, A. Hebbar, Érick Bizouarn","doi":"10.1109/CCNC.2016.7444851","DOIUrl":"https://doi.org/10.1109/CCNC.2016.7444851","url":null,"abstract":"Software defined networking (SDN) is growing rapidly in telecommunications due to its capability to efficiently manage end-to-end networks by decoupling control plane and data plane. The scalability and flexibility can bring benefits to network management and maintenance. However, it has yet to happen for wireless networks since there is a lack of practical solutions for migrating Radio Access Networks (RAN) to software defined wireless networks. Here, we design a wireless SDN controller based on OpenDayLight (ODL). We show how our framework can support typical use case and Self-Optimized Network algorithm. The design is highly flexible and can be leveraged for future wireless networks such as C-RAN and 5G.","PeriodicalId":399247,"journal":{"name":"2016 13th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127281085","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":"Demonstration of KAPUER: A privacy policy manager on Android","authors":"Arnaud Oglaza, R. Laborde, P. Zaraté","doi":"10.1109/CCNC.2016.7444781","DOIUrl":"https://doi.org/10.1109/CCNC.2016.7444781","url":null,"abstract":"In this demonstration, we present KAPUER, a system for managing users' privacy policies on Android. The system includes an authorization recommendation engine that learns user's preferences in terms of privacy and proposes him high level rules to protect his privacy from applications. Kapuer also provides a interface to manage all the rules it has created.","PeriodicalId":399247,"journal":{"name":"2016 13th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121355143","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}