{"title":"Adaptive hybrid digital-analog video transmission in wireless mobile networks","authors":"Xiao Zhao, Hanchen Lu","doi":"10.1109/ICCCN.2014.6911779","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911779","url":null,"abstract":"This paper proposes an adaptive hybrid digital-analog video transmission scheme to eliminate cliff effect and improve user experience in wireless mobile networks. To achieve graceful degradation performance, each Group of Pictures (GOP) is transformed and efficiently compressed into a reference frame and several Motion Vector (MV) frames with Motion-Compensated Temporal Filtering (MCTF). Then, the critical reference frame is transmitted as base data in a reliable digital mode. MV frames in units of chunks are transmitted as enhancement data in an analog mode where power allocation is optimized among chunks based on their entropy. To combat channel fading, each chunk in MV frames is further divided into subbands with consideration of the channel coherence time. Then, Adaptive Power Distortion Optimization (APDO) with channel prediction is performed among the subbands within each chunk to provide error resilience with adaptive scaling factors varying with channel conditions. Simulation results show that the proposed scheme outperforms Softcast (about 5.6 ~ 10.3dB) and Parcast (about 0.9 ~ 6.1dB) in terms of Peak Signal-to-Noise Ratio (PSNR) under various degrees of channel fading. Furthermore, the proposed scheme also works effectively when coping with channel fluctuation in high mobility scenarios.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"86 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120920738","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}
K. Dhondge, Baek-Young Choi, Sejun Song, Hyungbae Park
{"title":"Optical Wireless authentication for smart devices using an onboard ambient light sensor","authors":"K. Dhondge, Baek-Young Choi, Sejun Song, Hyungbae Park","doi":"10.1109/ICCCN.2014.6911803","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911803","url":null,"abstract":"As recent smartphone technologies in software and hardware keep on improving, many smartphone users envision to perform various mission critical applications on their smart-phones that were previously accomplished by using PCs. Hence, smartphone authentication has become one of the most critical security issues. Due to the relatively small smartphone form factor, the traditional user id and password typed authentication is considered as an inconvenient and time-taking approach. Taking advantage of various sensor technologies of smartphones, alternative authentication methods such as pattern, gesture, finger print, and face recognition have been actively researched. However, those authentication methods still pose one of speed, reliability, and usability issues. They are especially not suitable for the users in rugged conditions and with physical challenges. In this paper, we evaluate existing alternative smartphone authentication approaches in various usage scenarios to propose ambient light sensor based authentication for smartphones. We have designed and prototyped a challenge-based programmable Fast, Inexpensive, Reliable, and Easy-to-use (FIRE) hardware authentication token. FIRE token uses an onboard LED to transmit passwords via an Optical Wireless Signal (OWS) to the smartphone that captures, and interprets it via its ambient light sensor. FIRE token is a part of the challenge-response technique in the Inverse Dual Signature (IDS) that we designed to facilitate a multi-factor authentication for the mission critical smartphone applications. Our experiments validate that FIRE can authenticate a user on a smartphone in a simple, fast, and reliable way without compromising the security quality and user experience.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"47 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120994704","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":"Link weights migration without congestion in IP networks","authors":"Xiong Wang, Mengchao Ran","doi":"10.1109/ICCCN.2014.6911729","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911729","url":null,"abstract":"When the traffic matrix of an IP network changes significantly, network operators will re-optimize the link weights to achieve optimal traffic distribution in the network. In such cases, network link weights need to be migrated from the old setting to the re-optimized setting based on a pre-determined sequence of migration operations. In this paper, we study the links weights migration problem in IP networks. Firstly, we defined a Generic Link Weights Migration (GLWM) problem, which tries to find an optimal sequence of migration operations that will not cause network congestion while minimizing the number of migration operations. And then we propose an approximation algorithm for the GLWM problem. Simulation results reveal that our proposed algorithm performs better than existing algorithms.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121963353","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 solution for IP mobility support in software defined networks","authors":"You Wang, J. Bi","doi":"10.1109/ICCCN.2014.6911783","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911783","url":null,"abstract":"A large number of solutions have been proposed to support mobility in IP networks including original Mobile IP, its derivatives and several newly proposed protocols. However, these solutions have drawbacks in different aspects including triangle routing, handover inefficiency, heavy signaling overhead, etc. In this paper, we argue that these problems can be addressed based on Software Defined Networks (SDN). We discuss why SDN helps to solve the problems in current IP mobility protocols and give our algorithms to demonstrate how the problems are solved. We also present an Openflow-based protocol design to realize our idea. We show performance benefits of our protocol comparing with existing IP mobility protocols through implementation and experiments on Mininet.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122128621","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":"Optimal candidate set for opportunistic routing in asynchronous wireless sensor networks","authors":"Xinming Zhang, Fan Yan, Lei Tao, D. Sung","doi":"10.1109/ICCCN.2014.6911799","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911799","url":null,"abstract":"In asynchronous wireless sensor networks, finding an optimal candidate set can significantly improve the efficiency of an opportunistic routing protocol by balancing the one-hop cost from a sender to a relay and the remaining cost from the relay to the sink. A larger candidate set indicates smaller one-hop waiting cost to wait for a candidate to wake up, however, a packet is more likely to deviate from the shortest path, which will induce larger remaining cost. Remaining cost of each candidate can be used to construct a coordinate system. Neighbors of a node with high coordinate value is excluded from the candidate set, thus, we can select the next-hop relay by simply taking the first wake-up candidate. In this paper, we propose a distributed algorithm which is similar to the Bellman-Ford algorithm to construct a coordinate system and find an optimal candidate set for each node. Moreover, we propose an algorithm which induces acceptable overhead to maintain the coordinate system and each node's optimal candidate set. We also use simulation results to show that our proposed opportunistic routing protocol is more efficient than conventional strategies in terms of delay, energy efficiency, and miss ratio.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130589546","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":"Intelligent grouping algorithms for regular expressions in deep inspection","authors":"Zhe Fu, Kai Wang, Liangwei Cai, Jun Li","doi":"10.1109/ICCCN.2014.6911804","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911804","url":null,"abstract":"Deep inspection is widely used to identify network traffic. Due to the complexity of payload in traffic, regular expressions are becoming the preferred choice to specify the rules of deep inspection. Compiling a set of regular expressions into one Deterministic Finite Automata (DFA) often leads to state explosion, which means huge or even impractical memory cost. Distributing a set of regular expressions into multiple groups and building DFAs independently for each group mitigates the problem, but the previous grouping algorithms are either brute-force or locally optimal and thus not efficient in practice. Inspired by the Intelligent Optimization Algorithms, we propose new grouping algorithms based on Genetic Algorithm and Ant Colony Optimization algorithm, to effectively solve the problem of state explosion by acquiring the global optimum tradeoff between memory consumption and the number of groups. Besides, to accelerate the execution speed of the intelligent grouping algorithms, we employ and improve an approximation algorithm that estimates the DFA states according to the conflicting relationship between each pair of regular expressions. Experimental results verify that our solutions save around 25% memory consumption or reduce around 20% of group number compared with existing popular grouping algorithms.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121474025","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":"Congestion exposure enabled TCP with network coding for hybrid wired-wireless network","authors":"Hong Zhang, Kaiping Xue, P. Hong, Sean Shen","doi":"10.1109/ICCCN.2014.6911733","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911733","url":null,"abstract":"TCP with network coding (TCP/NC) makes the packet loss, which is caused by wireless transmission error, have no effect on congestion control. Current proposals prefer to use delay-based congestion control aspect(congestion avoidance phase) of TCP Vegas to deal with the congestion problem of TCP/NC. However, it is oversimplified and may lead to unfairness when both TCP flow and TCP/NC flow coexist in the congested wired bottleneck link in hybrid wired-wireless network. In this paper, congestion exposure enabled TCP/NC, named CEE-TCP/NC, is proposed to make TCP/NC be friendlier to TCP protocols in the case of congestion. CEE-TCP/NC replaces TCP's loss-based congestion indicator with a method based on analyzing gaps in the ACK stream that arrive at the TCP sender. Further, different levels of congestion can be detected and actions against congestion are taken accordingly. By theoretic analysis and simulation, we show that the scheme not only inherits the advantage of network coding to eliminate the effect of wireless transmission error, but also avoids damaging the performance of other competing flows.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124418413","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":"Scheduling periodic real-time communication in multi-GPU systems","authors":"Uri Verner, A. Mendelson, A. Schuster","doi":"10.1109/ICCCN.2014.6911778","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911778","url":null,"abstract":"Multi-GPU systems have become a popular architecture for high-throughput processing of streaming data. In many such systems, data transfers inside the compute nodes are becoming a performance bottleneck due to insufficient bandwidth. The problem is even more acute for real-time systems, which sacrifice utilization and efficiency in order to achieve predictable and analyzable execution. Data transfer over the interconnect of a compute node is most efficient when it is streamed on multiple paths in parallel. However, this mode of operation greatly complicates the transfer time analysis due to the effects of bus contention, especially if the data transfers are asynchronous. This work presents a new scheduler for periodic data transfers with deadlines that uses the system interconnect efficiently. The scheduler analyzes the data transfer requirements and their time constraints and produces a verifiable schedule that transfers the data in parallel. Experiments on realistic systems show that our method achieves up to 74% higher system throughput than the classic scheduling methods.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130016173","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":"LAS: An effective anti-spoofing method using existing information","authors":"Baobao Zhang, J. Bi, Jianping Wu","doi":"10.1109/ICCCN.2014.6911764","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911764","url":null,"abstract":"In today's Internet, users can send packets with forged source IP addresses, called IP Spoofing, which causes many severe problems to the Internet, especially the security problem. Extensive methods have been proposed to prevent IP spoofing. One category of anti-spoofing methods is extra-information-based. The other category of anti-spoofing methods is existing-information-based. The existing-information-based anti-spoofing methods are much easier to deploy than the extra-information-based ones. Thus, we focus on the existing-information-based anti-spoofing methods in this paper. However, the existing existing-information-based anti-spoofing methods perform poorly on preventing IP spoofing. Therefore, in this paper we propose a new existing-information-based anti-spoofing method, named Link-state-based Anti-Spoofing (LAS), which works in a link-state-protocol-based network. LAS provides good effectiveness on preventing IP spoofing as our simulation results show that even if LAS is only deployed on 10% of routers in a link-state-protocol-based network, 80%~99% of spoofing cases in the network can be prevented in general.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131466086","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}
Sha Yuan, Ding Tang, Yinlong Liu, Shuotian Bai, Tao Lin, S. Ci
{"title":"Context-aware distributed service provisioning based on anycast for information-centric network","authors":"Sha Yuan, Ding Tang, Yinlong Liu, Shuotian Bai, Tao Lin, S. Ci","doi":"10.1109/ICCCN.2014.6911732","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911732","url":null,"abstract":"Information-Centric Networking (ICN) is a new emerging concept, in which the principal paradigm shifts from the traditional end-to-end connection to the information-centric communication model. In ICN, information unit, such as content or service, is distributed in different sites or data centers to provide large-scale services. A common supporting approach for scalable service provisioning is deploying multiple replica servers throughout the network. Accordingly, an efficient and flexible scheme is needed to direct distributed requests to an appropriate replica server. In this paper, we first propose an incrementally deployable ICN architecture based on edge/core separation. And then, a practical anycast-based service provisioning scheme is presented with joint considerations of both servers contexts and the underlying network conditions. Extensive experiments have been performed to evaluate the proposed scheme. Experiment results show that efficient context-aware distributed service provisioning can be achieved.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123182979","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}