Zejiao Li, Xin Su, Jie Zeng, Yujun Kuang, Haijun Wang
{"title":"A Study of SNR Wall Phenomenon under Cooperative Energy Spectrum Sensing","authors":"Zejiao Li, Xin Su, Jie Zeng, Yujun Kuang, Haijun Wang","doi":"10.1109/ICCCN.2013.6614095","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614095","url":null,"abstract":"Energy detection has a low complexity of receiver structure and requires no information about primary signal. However, a single user detection has been proved vulnerable to the noise uncertainty, which causes the existence of a SNR wall below which the detector cannot robustly a chieve the given detection requirement. Compared to single user detection, cooperative energy spectrum sensing algorithms can increase the detection probability significantly. In this paper we expound the SNR wall in a new perspective and analyze the SNR wall phenomenon under typical cooperative energy spectrum sensing algorithms. Besides, experimental tests have been made to study the influence of threshold setting methods to the detection performance. Analysis and simulation results show that cooperative sensing and suitable threshold setting are hopeful to decrease the limitation of SNR wall phenomenon.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125781966","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":"Machine-to-Machine Communication over TV White Spaces for Smart Metering Applications","authors":"L. Bedogni, A. Trotta, M. D. Felice, L. Bononi","doi":"10.1109/ICCCN.2013.6614149","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614149","url":null,"abstract":"Machine-to-Machine communications is envisioned to become one of the fundamental pillars of the future Internet of Things paradigm, enabling platoons of devices to be seamlessly connected and to cooperate over smart spaces. Among the possible application scenarios, smart metering represents an already existing technology that might take benefit from the capability of autonomous configuration and setup of M2M networks. At present, smart meters communicate over the 2G/3G network, however the utilization of the cellular technology poses several problems, such as low coverage and spectrum shortage over dense areas. To overcome these issues, in this paper we investigate the application of cognitive radio principles over TV White Spaces to M2M communication for the smart metering scenario. Following the recent regulations of FCC and Ofcom, that foresees the presence of a spectrum database for TV white spaces detection, we study the trade-off between protection of licensees and energy consumption in a cluster of smart meters. We provide three novel research contributions: (i) an analytical model to estimate the lifetime of a cluster of smart meters; (ii) centralized and distributed algorithms to determine the schedule operations of Master/Slave devices foreseen by the spectrum regulations; (iii) performance evaluation of the proposed framework through extensive Omnet++ simulations.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130569909","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}
Xuebin Ren, Xinyu Yang, Jie Lin, Qingyu Yang, Wei Yu
{"title":"On Scaling Perturbation Based Privacy-Preserving Schemes in Smart Metering Systems","authors":"Xuebin Ren, Xinyu Yang, Jie Lin, Qingyu Yang, Wei Yu","doi":"10.1109/ICCCN.2013.6614162","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614162","url":null,"abstract":"The smart grid poses great concern about the exposure of consumers' privacy as the fine-grained measurements in the smart metering system can expose consumer's privacy through the disclosure of accurate load profiles of home energy usage. To address this issue, in this paper we propose novel scaling perturbation based privacy-preserving schemes that can achieve great utility for fine-grained measurements in a privacy-friendly and cost-effective manner. Our schemes adopt the measurement-based scaling perturbation to hide original measurements with low cost. Through a combination of both extensive theoretical analysis and experiments, our results show that the proposed schemes can preserve consumers' privacy through fine-grained measurements and achieve a better utility-privacy tradeoff in comparison with the existing schemes.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132006187","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":"Network Coding for Multicasting over Rayleigh Fading Multi Access Channels","authors":"A. Zanko, Amir Leshem, E. Zehavi","doi":"10.1109/ICCCN.2013.6614159","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614159","url":null,"abstract":"This paper examines the problem of rate allocation for multicasting over slow Rayleigh fading channels using network coding. In the proposed model, the network is treated as a collection of Rayleigh fading multiple access channels. In this model, rate allocation schemes that are based solely on the statistics of the channels are presented. The schemes are aimed to minimize the outage probability. An upper bound is presented for the probability of outage in the fading MAC. A suboptimal solution based on this bound is given for the MAC network model. We also consider outage probability minimization for TDMA schemes for the multiple access channels.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115238646","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":"Multi Path PERT","authors":"Ankit Singh, A. Reddy","doi":"10.1109/ICCCN.2013.6614156","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614156","url":null,"abstract":"This paper presents a new multipath delay based algorithm, MPPERT (Multipath Probabilistic Early response TCP), which provides high throughput and efficient load balancing. In all-PERT environment, MPPERT suffers no packet loss and maintains much smaller queue sizes compared to existing MPTCP, making it suitable for real time data transfer. MPPERT is suitable for incremental deployment in a heterogeneous environment. PERT, being a delay based TCP protocol, has continuous information about the state of the bottleneck queue along its path. This information is valuable in enabling MPPERT to detect subflows sharing a common bottleneck and obtain a smaller set of disjoint subflows. This information can even be used to switch from coupled (a set of subflows having interdependent increase/decrease of congestion windows) to uncoupled (independent increase/decrease of congestion windows) subflows, yielding higher throughput when best single-path TCP constraint is relaxed. The ns-2 simulations support MPPERT as a highly competitive multipath approach, suitable for real time data transfer, which is capable of offering higher throughput and improved reliability.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124311219","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":"Controlled Path Traversal for a Mobile Element in Wireless Sensor Networks","authors":"Baris Tas, A. Tosun","doi":"10.1109/ICCCN.2013.6614119","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614119","url":null,"abstract":"Mobile elements (MEs) have been used to improve the scalability and the performance of wireless sensor networks (WSNs). In most of these approaches, the ME traverses an area of interest with a pre- determined path set by the basestation (BS) and is trusted to follow the determined path. This assumption is not realistic since the ME carries essential information about the network making it appealing to various attackers. An ME can be captured and can be used to deceive the BS. As a result, further protocols are required to verify the path travelled by the ME. In this paper, we propose two protocols to control the path of a semi-trusted ME using cryptographic methods including Message Authentication Code (MAC), and hash chains. First protocol collects node encounter information with MACs and allows the BS to construct an approximate path using this information. Density of the nodes and the broadcast range play an important role in the quality of the constructed path. Second protocol enforces a strict path using hash chains. The ME helps the sensors verify a hash chain in a distributed manner and deviation from the path results in breaking the chain. We believe these protocols will serve as a first step to a model where the ME has to prove all of its actions to the BS.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116348401","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":"ST-XCP: A Stable XCP Protocol","authors":"Zhiqiang Shi, D. Ionescu, Dongli Zhang","doi":"10.1109/ICCCN.2013.6614199","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614199","url":null,"abstract":"XCP is one of the most commonly used protocols in modern congestion control implementations. XCP can provide the available transmission rate to applications. It is well known fact that one of the issues of XCP is that the time-delay of its traditional implementation (TR-XCP) is twice the time-delay of its flow model. This leads to unstable behaviors when controlling the congestion in networks with heterogeneous propagation delays. This paper proposes an improvement of TR-XCP called the stable XCP (ST-XCP). ST-XCP decreases the control interval of XCP implementations and brings the behavior of the congestion control system back to the stability region. It is demonstrated in this paper, theoretically and through simulations, that ST-XCP outperforms TR-XCP as far as the queue size is concerned, and that it is also stable even while controlling the congestion in networks with heterogeneous propagation delays.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128584096","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":"EMC: The Effective Multi-Path Caching Scheme for Named Data Networking","authors":"Hao Wu, Jun Li, Yi Wang, B. Liu","doi":"10.1109/ICCCN.2013.6614132","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614132","url":null,"abstract":"The Named Data Networking (NDN) is proposed recently as a promising paradigm for the future Internet due to its built-in caching and name-based routing for efficient content distribution. For the time being, the research on NDN caching is still a preliminary topic, especially for the scenario of an ISP with multiple gateways. For more in-depth excavation, we have studied the effective intra-ISP caching under multiple gateways and multi-path routing in this paper. With the primary objective of reducing the inter-ISP traffic, we develop a popularity-based coordinated caching strategy named the Effective Multipath Caching scheme (EMC), which substantially saves more than 50% inter-ISP traffic and more than 30% content access latency. Through evaluation, we observe that EMC significantly outperforms the widely used Leaving Copies Everywhere (LCE) scheme and Leaving Copies with Probability (LCProb) scheme in terms of reducing both the inter-ISP traffic as well as the content access latency. Extensive simulation results demonstrate that our proposed caching scheme is effective, scalable and light-weight.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121817752","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":"Achieving Privacy of Data Requests in MANETs by Means of Piggybacking and Hop Modification","authors":"Noor Abbani, H. Artail","doi":"10.1109/ICCCN.2013.6614100","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614100","url":null,"abstract":"Caching systems have been proposed for MANETs to increase data availability and reduce data access delays. Every caching system is composed of three main components. The first component is requesting the data items from the server into the caching system. The second component is publishing the cached items in the network (or advertising them). While, the third component relates to nodes requesting cached items, or in other words pulling the items. These three aspects have inherent privacy problems that result in exposing the identities of the participants and in profiling their interests. In this work, we survey existing caching architectures for privacy vulnerabilities and propose a privacy preserving system that can operate on top of any existing caching system that provides anonymity and untraceability objectives. The system was implemented using ns-2 and proved to achieve high levels of anonymity with mitigated delays and overhead traffic.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121862714","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}
Nongda Hu, Dawei Wang, Zheng Cao, Xuejun An, Ninghui Sun
{"title":"Accelerating Allreduce Operation: A Switch-Based Solution","authors":"Nongda Hu, Dawei Wang, Zheng Cao, Xuejun An, Ninghui Sun","doi":"10.1109/ICCCN.2013.6614098","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614098","url":null,"abstract":"Collective operations, such as all reduce, are widely treated as the critical limiting factors in achieving high performance in massively parallel applications. Conventional host-based implementations, which introduce a large amount of point-to-point communications, are less efficient in large-scale systems. To address this issue, we propose a design of switch chip to accelerate collective operations, especially the allreduce operation. The major advantage of the proposed solution is the high scalability since expensive point-to-point communications are avoided. Two kinds of allreduce operations, namely block-allreduce and burst-allreduce, are implemented for short and long messages, respectively. We evaluated the proposed design with both a cycle-accurate simulator and a FPGA prototype system. The experimental results prove that switch-based allreduce implementation is quite efficient and scalable, especially in large-scale systems. In the prototype, our switch-based implementation significantly outperforms the host-based one, with a 16 times improvement in MPI time on 16 nodes. Furthermore, the simulation shows that, upon scaling from 2 to 4096 nodes, the switch-based allreduce latency only increases slightly by less than 2 us.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114407406","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}