2014 23rd International Conference on Computer Communication and Networks (ICCCN)最新文献_第7页

A privacy protection policy combined with privacy homomorphism in the Internet of Things 物联网中结合隐私同态的隐私保护策略

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911856

Guozi Sun, Siqi Huang, W. Bao, Yitao Yang, Zhiwei Wang

引用次数: 15

Multi-bit sensing based target localization (MSTL) algorithm in wireless sensor networks 基于多比特感知的无线传感器网络目标定位(MSTL)算法

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911739

Quanlong Li, Qing Yang, Shaoen Wu

引用次数: 1

MT-NCOR: A practical optimization method for network coded opportunistic routing in WMN MT-NCOR:一种实用的WMN网络编码机会路由优化方法

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911724

Xiang Lan, Sanfeng Zhang

{"title":"MT-NCOR: A practical optimization method for network coded opportunistic routing in WMN","authors":"Xiang Lan, Sanfeng Zhang","doi":"10.1109/ICCCN.2014.6911724","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911724","url":null,"abstract":"Network coded opportunistic routing (NCOR) is a potential communication paradigm in wireless multi-hop networks (WMN) with lossy links. It leverages the multipath diversity of wireless networks and applies network coding to resist random erasures. Related optimization work minimizing transmission cost or maximizing throughput are based on the collision-free assumption, which either requires perfect schedule of MAC layer or only considers low traffic load and thus few packet collisions will occur. However, the assumption doesn't hold true because real WMNs often need to support content distribution service and bear a high level of traffic load, and 802.11 protocols cannot guarantee an ideal schedule with no collisions. In order to achieve an optimal forwarding rate distribution and reduce conflicting packets, this paper proposes a throughput optimization algorithm which takes into consideration the channel capacity and interference between neighboring nodes. Based on this algorithm, we implement a practical NCOR protocol aiming at achieving maximum throughput named MT-NCOR. Through extensive experiments, we show that MT-NCOR outperforms the state-of-art NCOR protocols in both throughput and total cost, especially in networks backing high traffic loads.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"14 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":"115741062","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}

引用次数: 3

Constructing belt-barrier providing β-quality of monitoring with minimum camera sensors 构建带式屏障，以最少的摄像机传感器提供高质量的监控

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911787

Ling Guo, Donghyun Kim, Deying Li, Wenping Chen, A. Tokuta

{"title":"Constructing belt-barrier providing β-quality of monitoring with minimum camera sensors","authors":"Ling Guo, Donghyun Kim, Deying Li, Wenping Chen, A. Tokuta","doi":"10.1109/ICCCN.2014.6911787","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911787","url":null,"abstract":"A wireless sensor network is said to form a belt-barrier for a region if it is able to detect any object moving from outside the region to inside. Recently, Cheng and Tsai found if camera sensors are used to form a belt-barrier, the breadth of the barrier becomes an important quality factor to ensure high quality of monitoring (QoM). Then, they proposed the minimum β-breadth belt-barrier construction problem ((β, 1)-B3CP) whose goal is to select a minimum number of camera sensors to form a β-breadth belt-barrier, which ensures the width of the picture of any object which moves through the barrier is at least β. In this paper, we perform more thorough investigation of the problem and introduce a new polynomial time exact algorithm for the problem under the assumption that the angle of each camera is fixed. Our simulation result shows our algorithm outperforms Cheng and Tsai's algorithm. We also introduce a variation of (β, 1)-B3CP, namely (β, k)-B3CP, which aims to construct k node-disjoint β-breadth belt-barrier for fault-tolerance purpose, propose a new heuristic algorithm for it, and conduct simulations to evaluate its performance.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"45 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":"121196329","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}

引用次数: 12

Age-based cooperative caching in information-centric networking 信息中心网络中基于年龄的协同缓存

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911725

Zhongxing Ming, Mingwei Xu, Dan Wang

引用次数: 82

Resource allocation for intercell device-to-device communication underlaying cellular network: A game-theoretic approach 基于蜂窝网络的单元间设备对设备通信的资源分配:一种博弈论方法

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911738

Jun Huang, Yanxiao Zhao, K. Sohraby

{"title":"Resource allocation for intercell device-to-device communication underlaying cellular network: A game-theoretic approach","authors":"Jun Huang, Yanxiao Zhao, K. Sohraby","doi":"10.1109/ICCCN.2014.6911738","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911738","url":null,"abstract":"Device-to-Device (D2D) communication is envisioned as a promising technology to significantly improve the performance of current cellular infrastructures. Allocating resources to the D2D link, however, raises an enormous challenge to the co-existing D2D and cellular communications due to mutual interference. While there have been many resource allocation solutions proposed for D2D underlaying cellular network, they have primarily focused on the intracell scenario while leaving the intercell settings untouched. In this paper, we investigate the resource allocation problem for intercell D2D communications underlaying cellular networks, where D2D link is located in the overlapping area of two neighboring cells. We present three inter-cell D2D scenarios regarding the resource allocation problem. To address this problem, we develop a repeated game model under these scenarios. Distinct from existing works, we characterize the communication infrastructure, namely Base Stations (BSs), as players competing resource allocation quota for D2D demand, and define the utility of each player as the payoff from both cellular and D2D communications using radio resources. We also propose a resource allocation algorithm and protocol based on the equilibrium derivations. Numerical results indicate that the developed model not only significantly enhances the system performance including sum rate and sum rate gain, but also sheds lights on resource configurations for intercell D2D scenarios.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"34 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":"121590840","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}

引用次数: 27

A multi-attribute routing protocol for opportunistic network environments 机会网络环境的多属性路由协议

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911876

Sadaf Yasmin, R. N. B. Rais, A. Qayyum

{"title":"A multi-attribute routing protocol for opportunistic network environments","authors":"Sadaf Yasmin, R. N. B. Rais, A. Qayyum","doi":"10.1109/ICCCN.2014.6911876","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911876","url":null,"abstract":"In opportunistic networks, nodes hold packets in permanent storage and make independent routing decisions on sporadically emerging links. This helps to achieve connectivity even if an end-to-end contemporaneous path does not exist between a pair of nodes. Next-hop decision is generally dependent on future probability of encounters with a destination node while other constraints on nodes' resources are ignored. We argue, in this paper that considering multiple parameters related to destination dependent and independent characteristics of a node, while determining its next-hop fitness, can help achieve better performance in resource-stringent opportunistic network environments. Our proposed routing protocol, MARS, not only gets itself cognizant of mobility patterns present within the network but also combines these mobility patterns with other stochastic information about nodes' characteristics. With the help of simulations, we show that MARS is able to achieve high delivery rates and comparable end-to-end latency with well-known routing protocols while maintaining its overhead to a significantly low limit.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"8 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":"114882686","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}

引用次数: 5

Channel assignment based on conflict-area for reducing interference in large-scale WLANs 大规模无线局域网中基于冲突区域的信道分配减少干扰

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911872

Wenqi Sun, Hewu Li, Jianping Wu

引用次数: 6

Keynote speakers: Big data science and social networks — Accelerating insights and building value 主题演讲嘉宾:大数据科学和社交网络——加速洞察和创造价值

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911711

A. Choudhary, John C.S. Lui, K. Ross

引用次数: 2

E-DARWIN: Energy Aware Disaster Recovery Network using WiFi Tethering E-DARWIN:使用WiFi连接的能源感知灾难恢复网络

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911770

M. Raj, K. Kant, Sajal K. Das

引用次数: 20