2015 24th International Conference on Computer Communication and Networks (ICCCN)最新文献_第10页

Attribute-Based Online/Offline Encryption in Smart Grid 基于属性的智能电网在线/离线加密

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-08-01 DOI: 10.1109/ICCCN.2015.7288380

Zhiwei Wang, F. Chen, Aidong Xia

引用次数: 8

Exploiting Active Sub-Areas for Multi-Copy Routing in VDTNs 利用vddn中的活动子区域实现多副本路由

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-08-01 DOI: 10.1109/ICCCN.2015.7288409

Bo Wu, Haiying Shen, Kang-Peng Chen

{"title":"Exploiting Active Sub-Areas for Multi-Copy Routing in VDTNs","authors":"Bo Wu, Haiying Shen, Kang-Peng Chen","doi":"10.1109/ICCCN.2015.7288409","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288409","url":null,"abstract":"In Vehicle Delay Tolerant Networks (VDTNs), current routing algorithms select relay vehicles based on either vehicle encounter history or predicted future locations. The former method may fail to find relays that can encounter the target vehicle in a large-scale VDTN while the latter method may not provide accurate location prediction due to traffic variance. Therefore, these methods cannot achieve high performance in terms of routing success rate and delay. In this paper, we aim to improve the routing performance in VDTNs. We first analyze vehicle network traces and observe that i) each vehicle has only a few active sub-areas that it frequently visits, and ii) two frequently encountered vehicles usually encounter each other in their active sub-areas. We then propose Active Area based Routing method (AAR) which consists of two steps based on the two observations correspondingly. AAR first distributes a packet copy to each active sub-area of the target vehicle using a traffic-considered shortest path spreading algorithm, and then in each sub-area, each packet carrier tries to forward the packet to a vehicle that has high encounter frequency with the target vehicle. Extensive trace-driven simulation demonstrates that AAR produces higher success rates and shorter delay in comparison with the state-of-the-art routing algorithms in VDTNs.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121076521","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}

引用次数: 20

Collaborative Heterogeneous Sensing: An Application to Contamination Detection in Water Distribution Networks 协同异构感知:在配水管网污染检测中的应用

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-08-01 DOI: 10.1109/ICCCN.2015.7288385

Amitangshu Pal, K. Kant

引用次数: 6

Padded-Dyck-Path-Based Rendezvous Algorithms for Heterogeneous Cognitive Radio Networks 基于填充dyk路径的异构认知无线网络交会算法

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-08-01 DOI: 10.1109/ICCCN.2015.7288447

Bofu Yang, M. Zheng, W. Liang

引用次数: 6

Energy Minimization for Cellular Network Interfaces with Dynamic Link Quality 具有动态链路质量的蜂窝网络接口能量最小化

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-08-01 DOI: 10.1109/ICCCN.2015.7288406

Xiao Lei, Zaiyang Tang, Peng Li, Hai Jin, Song Guo, Xiaofei Liao, Feng Lu

引用次数: 2

Minimizing Bandwidth Cost of CCN: A Coordinated In-Network Caching Approach 最小化CCN的带宽成本:一种协调的网络内缓存方法

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-08-01 DOI: 10.1109/ICCCN.2015.7288426

Yuemei Xu, Zihou Wang, Yang Li, Tao Lin, W. An, S. Ci

{"title":"Minimizing Bandwidth Cost of CCN: A Coordinated In-Network Caching Approach","authors":"Yuemei Xu, Zihou Wang, Yang Li, Tao Lin, W. An, S. Ci","doi":"10.1109/ICCCN.2015.7288426","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288426","url":null,"abstract":"To reduce data access latency, network traffic volume and server load, in-network caching was proposed and has become an intrinsic component of the content-centric network (CCN) architecture. The content-oriented characteristics of in-network caching, such as arbitrary topology, volatile content locations and line speed requirements, make routers content-aware and supportive of fast content distribution. Meanwhile, they also raise new challenges in content placement and request routing, namely, how to optimally make content storage decisions and provision individual router's bandwidth to serve user requests, so as to minimize the bandwidth cost under storage and link capacity limit. To address this problem, we build a distributed in-network caching model to formulate the content placement and request routing in CCN, aiming at minimizing the bandwidth cost with strict storage and bandwidth constraints. Based on the proposed model, we design a scalable, adaptive and low-complexity in-network caching scheme for content placement and request routing and analyze the performance gains via simulations on a real ISP network topology and traffic traces. The experimental results show the proposed model and scheme are superior. Compared with the existing works, we also observe significant performance enhancements in terms of hit ratio of requests, reduction of server load, and bandwidth cost.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127000927","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}

引用次数: 7

Mynah: Enabling Lightweight Data Plane Authentication for SDN Controllers Mynah:为SDN控制器启用轻量级数据平面认证

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-08-01 DOI: 10.1109/ICCCN.2015.7288433

Jin Won Kang, Sae Hyong Park, Jaeho You

引用次数: 14

Towards Effective Intra-Flow Network Coding in Software Defined Wireless Mesh Networks 软件定义无线Mesh网络中有效的流内网络编码

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-08-01 DOI: 10.4108/eai.19-1-2016.150998

Donghai Zhu, Xinyu Yang, Peng Zhao, Wei Yu

{"title":"Towards Effective Intra-Flow Network Coding in Software Defined Wireless Mesh Networks","authors":"Donghai Zhu, Xinyu Yang, Peng Zhao, Wei Yu","doi":"10.4108/eai.19-1-2016.150998","DOIUrl":"https://doi.org/10.4108/eai.19-1-2016.150998","url":null,"abstract":"Wireless Mesh Networks (WMNs) have potential to provide convenient broadband wireless Internet access to mobile users. With the emergence of Software-Defined Networking (SDN) paradigm that separates control plane and data plane, WMNs can be easily deployed and managed. In addition, by exploiting the broadcast nature of the wireless medium and the spatial diversity of multi-hop wireless networks, intra-flow network coding has shown a greater benefit in comparison with traditional routing paradigms in data transmission for WMNs. In this paper, we develop a novel OpenCoding protocol, which combines the SDN technique with intra-flow network coding for WMNs. Our developed protocol can simplify the deployment and management of the network and improve network performance. In OpenCoding, a controller working on the control plane makes routing decisions for mesh routers and the hop-by-hop forwarding function is replaced by network coding functions in data plane. Through a simulation study, we show the effectiveness of the OpenCoding protocol in comparison with existing schemes. Our data shows that OpenCoding outperforms both traditional routing and intra-flow network coding schemes.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129440919","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}

引用次数: 13

Efficient Location Privacy for Moving Clients in Database-Driven Dynamic Spectrum Access 数据库驱动的动态频谱访问中移动客户端的有效位置隐私

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-08-01 DOI: 10.1109/ICCCN.2015.7288403

Erald Troja, S. Bakiras

{"title":"Efficient Location Privacy for Moving Clients in Database-Driven Dynamic Spectrum Access","authors":"Erald Troja, S. Bakiras","doi":"10.1109/ICCCN.2015.7288403","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288403","url":null,"abstract":"Dynamic spectrum access (DSA) is envisioned as a promising framework for addressing the spectrum shortage caused by the rapid growth of connected wireless devices. In contrast to the legacy fixed spectrum allocation policies, DSA allows license-exempt users to access the licensed spectrum bands when not in use by their respective owners. More specifically, in the database-driven DSA model, mobile users issue location-based queries to a white-space database, in order to identify idle channels in their area. To preserve location privacy, existing solutions suggest the use of private information retrieval (PIR) protocols when querying the database. Nevertheless, these methods are not communication efficient and fail to take into account user mobility. In this paper, we address these shortcomings and propose an efficient privacy-preserving protocol based on the Hilbert space filling curve. We provide optimizations for mobile users that require privacy on-the-fly and users that have full a priori knowledge of their trajectory. Through experimentation with two real life datasets, we show that, compared to the current state-of-the-art protocol, our methods reduce the query response time at the mobile clients by a large factor.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130127419","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}

引用次数: 18

Community and Social Feature-Based Multicast in Opportunistic Mobile Social Networks 机会移动社交网络中基于社区和社会特征的多播

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-08-01 DOI: 10.1109/ICCCN.2015.7288387

Charles Shang, Britney Wong, Xiao Chen, Wenzhong Li, Suho Oh

{"title":"Community and Social Feature-Based Multicast in Opportunistic Mobile Social Networks","authors":"Charles Shang, Britney Wong, Xiao Chen, Wenzhong Li, Suho Oh","doi":"10.1109/ICCCN.2015.7288387","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288387","url":null,"abstract":"Opportunistic Mobile Social Networks (OMSNs), formed by people moving around carrying mobile devices such as smartphones, PDAs, and laptops, have become popular in recent years. The OMSNs we discuss here are a special kind of delay tolerant networks (DTNs) that help enhance spontaneous interaction and communication among users that opportunistically encounter each other, without additional infrastructure support. Multicast is an important routing service in OMSNs which supports the dissemination of messages to a group of users. Most of the existing multicast algorithms are designed for general-purpose DTNs where social factors are neglected or reflected in static social features which are not updated to catch nodes' dynamic contact behavior. In this paper, we introduce the concept of dynamic social features and its enhancement to capture nodes' dynamic contact behavior, consider more social relationships among nodes, and adopt the community structure in the multicast compare-split scheme to select the best relay node for each destination in each hop to improve multicast efficiency. We propose two multicast algorithms based on these new features. The first community and social feature-based multicast algorithm is called Multi-CSDO which involves destination nodes only in community detection, and the second one is called Multi-CSDR which involves both the destination nodes and the relay candidates in community detection. The analysis of the algorithms is given and simulation results using a real trace of an OMSN show that our new algorithms outperform the existing one in terms of delivery rate, latency, and number of forwardings.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131119951","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}

引用次数: 4