{"title":"Efficient Protocols for Rule Checking in RFID Systems","authors":"Yafeng Yin, Lei Xie, Sanglu Lu, Daoxu Chen","doi":"10.1109/ICCCN.2013.6614129","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614129","url":null,"abstract":"With the rapid proliferation of RFID technologies, RFID has been introduced to the applications like safety inspection and warehouse management. Conventionally a number of deployment rules are specified for these applications. This paper studies a practically important problem of rule checking over a large set of RFID tags, i.e., checking whether the specified rules are satisfied according to the RFID tags within the monitoring area. This rule checking function may need to be executed frequently over a large number of tags and therefore should be made efficient in terms of execution time. Aiming to achieve time efficiency, we propose two efficient protocols based on the collision detection and the logical features of rules, respectively. Simulation results indicate that our protocols achieve much better performance than other solutions in terms of time efficiency.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"25 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":"124063456","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":"Preserving Data Query Privacy in Mobile Mashups through Mobile Cloud Computing","authors":"Rodney Owens, Weichao Wang","doi":"10.1109/ICCCN.2013.6614169","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614169","url":null,"abstract":"Mobile mashups promise great data aggregation and processing capabilities for all end users. During the data collection procedures, some data providers fail to protect confidentiality and privacy of user queries and transmit information in plain text. This enables attackers to eavesdrop on networks and compromise user information. Since mobile mashups can adopt server-side, client-side, or hybrid architectures, no one-size-fits-all solutions can be designed to solve this problem. In this paper, we propose to design two mechanisms using mobile clouds to preserve data query privacy in mobile mashups. For server-side mashups, we propose to use dynamically created virtual machines as proxies to process data collection and aggregation in order to prevent information leakage through eavesdropping. For client-side mashups, we propose to use live migration of the application level virtual machines into mobile cloud to hide the data collection and aggregation procedures from attackers. We will evaluate the proposed approaches through both analysis and experiments on real platforms.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"43 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":"121492338","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 Control with QoS and Delays Utility Function","authors":"Hengky Susanto, Byung-Guk Kim","doi":"10.1109/ICCCN.2013.6614116","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614116","url":null,"abstract":"This paper primarily addresses how available bandwidth should be optimally distributed among competing streams of elastic traffic like TCP traffic while taking Quality-of-Service (QoS) and delay into consideration. Network Utility Maximization (NUM) in [1], a congestion control algorithm, allows users to set for an optimum network-wide rate allocation through their utility. By incorporating delay into utility function, users can accommodate for QoS requirements.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"79 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":"134267403","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}
Haipeng Dai, Xiaobing Wu, Lijie Xu, Guihai Chen, Shan Lin
{"title":"Using Minimum Mobile Chargers to Keep Large-Scale Wireless Rechargeable Sensor Networks Running Forever","authors":"Haipeng Dai, Xiaobing Wu, Lijie Xu, Guihai Chen, Shan Lin","doi":"10.1109/ICCCN.2013.6614207","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614207","url":null,"abstract":"Wireless Rechargeable Sensor Networks (WRSNs) can be recharged after deployment for sustainable operations. Recent works propose to use a single mobile charger (MC) traveling through the network fields to recharge every sensor node. These algorithms work well in small scale networks. However, in large scale networks these algorithms do not work efficiently, especially when the amount of energy the MC can provide is limited. To address these challenges, multiple MCs can be used. In this paper, we investigate the minimum MCs problem (MinMCP) for rechargeable sensor networks: how to find the minimum number of energy-constrained MCs and design their recharging routes given a sensor network such that each sensor node in the WRSN maintains continuous work. Our results are three folds. We first prove that for any ϵ > 0, there is no (2-ϵ)-approximation algorithm for Distance Constrained Vehicle Routing Problem (DVRP) on a general metric space, which is the best as far as we know. By reducing from DVRP, we prove that MinMCP is NP-hard, and the inapproximability bound for MinMCP is the same as that of DVRP. Then we propose approximation algorithms for this problem. Finally, we conduct simulations to validate the effectiveness of our algorithms.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"88 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":"131769137","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":"Video Browsing - A Study of User Behavior in Online VoD Services","authors":"Liang Chen, Yipeng Zhou, D. Chiu","doi":"10.1109/ICCCN.2013.6614209","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614209","url":null,"abstract":"A big portion of Internet traffic nowadays is video. A good understanding of user behavior in online VoD systems can help us design, configure and manage video content distribution. With the help of a major video on demand (VoD) service provider, we conduct a detailed study of user behavior watching streamed videos over the Internet. We engineered the video player at the client side to collect user behavior reports for over 540 million sessions.In order to isolate the possible effect of session quality of experience (QoE) on user behavior, we focus on the sessions with perfect QoE, and leave out those sessions with QoE impairments (such as freezes).Our main finding is that users spend a lot of time browsing: viewing part of one video after another, and only occasionally (around 20% of the time) watching a video to its completion. We consider seek (jump to a new position of the video) as a special form of browsing - repeating partial viewing of the same video. Our analysis leads towards a user behavior model in which a user transitions through a random number of short views before a longer view, and repeats the process a random number of times. A purely abstract version of such user behavior model was proposed by Wu et al [1] as a closed queueing network formulation. Our study uncovers the parameters and distributions of such a stochastic behavior model based on observations in practice.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"1 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":"129048289","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}
Baobao Zhang, J. Bi, Yangyang Wang, Yu Zhang, Jianping Wu
{"title":"Refining IP-to-AS Mappings for AS-Level Traceroute","authors":"Baobao Zhang, J. Bi, Yangyang Wang, Yu Zhang, Jianping Wu","doi":"10.1109/ICCCN.2013.6614180","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614180","url":null,"abstract":"It is of great significance for network operators and researchers to obtain accurate AS-level traceroute paths, for which mapping IP addresses to correct AS numbers is critical. Thus, there have been a lot of efforts to improve the original IP-to-AS mapping table, which was extracted from BGP routing tables. One of these efforts is called pair matching, which refines the original mapping table by maximizing the number of matched pairs of traceroute and BGP AS paths. However, the existing pair-matching-based methods refine the original IP-to-AS mapping table only with the prefix granularity, i.e., IP addresses in the same /24 prefix are mapped to the same AS or the same set of ASes, which does not fit reality. In this paper, we attempt to refine the IP-to-AS mapping table with the IP address granularity, i.e., allowing IP addresses in the same prefix to be mapped to different ASes. The results show that our fine-grained method can produce a more accurate IP-to-AS mapping table. In addition, this paper also provides a better understanding for the pair-matching-based methods.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"31 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":"131455941","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}
S. Subik, Dennis Kaulbars, Patrick-Benjamin Bok, C. Wietfeld
{"title":"Dynamic Link Classification Based on Neuronal Networks for QoS Enabled Access to Limited Resources","authors":"S. Subik, Dennis Kaulbars, Patrick-Benjamin Bok, C. Wietfeld","doi":"10.1109/ICCCN.2013.6614128","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614128","url":null,"abstract":"In this paper, the authors present a study of a network fingerprinting classification using monotone multilayer perceptron neuronal networks. It is part of an overall performance engineering approach. The classification is used to increase the performance of an active queue management on the quality of service for a next generation public safety communication system based on an IP overlay network. This network combines heterogeneous communication networks and technologies to increase the overall systems performance. Public safety users have higher requirements regarding coverage, data rates and quality of service than standard commercial ones. Main challenge for this study is the optimization of the overall system for voice group communication, which is still the most important communication within public safety scenarios. This paper shows that with the given parametrization, an ensemble of multi-layer perceptrons gives a satisfactory classification probability, if a setup of three technologies (EDGE, UMTS and LTE) is assumed to be in usage as communication technologies. This setup is practicable enough to have a chance to be implemented in a future system.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"25 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":"131502740","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":"On the Performance of the IEEE 802.11 in a Multi-Channel Environment","authors":"Marcos F. Caetano, Bruno F. Lourenço, J. Bordim","doi":"10.1109/ICCCN.2013.6614163","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614163","url":null,"abstract":"Wireless networking enhanced with multiple transmitting channels has been considered to improve the utilization of the electromagnetic spectrum and to provide ways to accommodation the growing demand for connectivity. In this scenario, the use of a common control channel to coordinate the stations and networking resources is usually employed. This work evaluates the control channel capacity and its impact on the overall system throughput when multiple channels are available. The CSMA/CA mechanism is considered as it is the most used access control mechanism in the wireless local area network. To this end, an analytical model is proposed to evaluate the saturation conditions of the control channel. Empirical results are also provided and compared with the analytical model. The results show that the empirical results are consistent with the analytical model. In particular, it is shown that the ratio of eight data channels per control channel attains the best results.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"140 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":"115730340","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":"Re-Thinking 802.11 Rate Selection in the Face of Non-Altruistic Behavior","authors":"A. Blaich, Shu Liu, A. Striegel","doi":"10.1109/ICCCN.2013.6614185","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614185","url":null,"abstract":"The use of bandwidth intensive applications in the limited 802.11 wireless spectrum has lead to increased congestion and interference in the mobile space. Sending more data in a timely manner requires a fast transmission speed. The transmission speeds in turn are governed by rate adaptation algorithms that seek to optimize the delivery probability of packets. However, optimizing for an individual node also has a significant impact on other nodes in the wireless network. Despite this impact of rate selection on the larger wireless network, individual nodes tend to be non-altruistic resulting in multi-rate WLANs, thus incurring the \"rate anomaly'' problem. In this paper, we posit that rate changes must be justified, i.e. goodput improvement must be commensurate with effective channel cost. We present the concept of rate zones to challenge when rate adaptation is justified with regards to the performance of the larger wireless network. Our experimental, simulation, and real-world results show that on average rate adaptation negatively impacts performance.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"55 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":"116749847","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}
E. Gazis, K. Sasloglou, Nikolaos Frangiadakis, Panayotis Kikiras, A. Merentitis, Kostas Mathioudakis, G. Mazarakis
{"title":"Architectural Blueprints of a Unified Sensing Platform for the Internet of Things","authors":"E. Gazis, K. Sasloglou, Nikolaos Frangiadakis, Panayotis Kikiras, A. Merentitis, Kostas Mathioudakis, G. Mazarakis","doi":"10.1109/ICCCN.2013.6614109","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614109","url":null,"abstract":"The Internet of Things (IoT) is understood as a major embodiment of the convergence between device-oriented sensor networks and data-oriented applications that is facilitated through the Internet portfolio of technologies. From an architecture perspective, the wide range of operational parameters entailed by multiple application domains myriads of combinations of sensors and applications is the most significant challenge brought on by the IoT vision. To this end, the design blueprint of a platform that enables the seamless integration of multiple dissimilar devices and their efficient use by independently contributed applications is an essential architecture concern. Herein we address this concern by introducing a Unified Sensing Platform (USP) designed to accommodate an open set of sensor types and to expose their functional capabilities to applications in an efficient, reusable and context-aware way.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"50 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":"125868594","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}