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

Design and Implementation of an Autonomous Wireless Sensor-Based Smart Home 基于自主无线传感器的智能家居设计与实现

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-10-05 DOI: 10.1109/ICCCN.2015.7288393

Christopher Osiegbu, S. Amsalu, F. Afghah, D. Limbrick, A. Homaifar

{"title":"Design and Implementation of an Autonomous Wireless Sensor-Based Smart Home","authors":"Christopher Osiegbu, S. Amsalu, F. Afghah, D. Limbrick, A. Homaifar","doi":"10.1109/ICCCN.2015.7288393","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288393","url":null,"abstract":"The Smart home has gained widespread attention due to its flexible integration into everyday life. This next generation green home system, transparently unifies various home appliances, smart sensors and wireless communication technologies. It can integrate diversified physical sensed information and control various consumer home devices, with the support of active sensor networks having both sensor and actuator components. Although smart homes are gaining popularity due to their energy saving and better living benefits, there is no standardized design for smart homes. In this paper, we put forward a concept by designing and implementing a smart home system which can classify and predict the state of the home based on historical data. We set up a wireless sensor network and collected months of data. By employing supervised machine learning technique, we were able to establish patterns and use the acquired information as a vital cog in our control system algorithm, thereby improving the intelligence of the home. We created a system capable of running with minimal human supervision, an attribute which makes our system an asset for senior care scenarios. Our system also caters to the safety of the home owner.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125467544","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}

引用次数: 10

Extending Software Defined Networking to End User Devices 将软件定义网络扩展到终端用户设备

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-10-05 DOI: 10.1109/ICCCN.2015.7288410

M. Moser, F. Jaramillo

引用次数: 4

RIMBED: Recommendation Incentive Mechanism Based on Evolutionary Dynamics in P2P Networks 基于演化动力学的P2P网络推荐激励机制

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-10-05 DOI: 10.1109/ICCCN.2015.7288458

Xing Jin, Mingchu Li, Guanghai Cui, Jia Liu, Cheng Guo, Yongli Gao, Bo Wang, Xing Tan

{"title":"RIMBED: Recommendation Incentive Mechanism Based on Evolutionary Dynamics in P2P Networks","authors":"Xing Jin, Mingchu Li, Guanghai Cui, Jia Liu, Cheng Guo, Yongli Gao, Bo Wang, Xing Tan","doi":"10.1109/ICCCN.2015.7288458","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288458","url":null,"abstract":"In autonomous environment (such as P2P, ad hoc, social networks and so on), all the rational individuals make independent decisions to maximize their profits. However, many interactions among individuals can be modeled as Prisoner's Dilemma game, which suppresses the emergence of cooperation. In order to provide scalable and robust services in such systems, incentive mechanisms need to be introduced. In this paper, we propose a novel incentive mechanism called recommendation incentive mechanism based on evolutionary dynamics(RIMBED). In our RIMBED system, players who pay an additional cost for recommendation service not only can get the information of the opponents, but also can have a higher probability to interact with cooperative individuals. Using the replicator dynamics equations in evolutionary game theory, we mathematically analyze the robustness and effectiveness of our RIMBED system. Meanwhile, simulation experiments can also validate our mathematical analysis. In our RIMBED system, players have three alternative strategies: always cooperative(ALLC), always defective(ALLD) and rational cooperative(RC). No one strategy can dominate the others forever and all the three strategies can survive in our system. When we bring in population invasion and a small mutation, our system can still work at an excellent level.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123837231","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

Making Dense Networks Work for You 让密集网络为你服务

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-10-05 DOI: 10.1109/ICCCN.2015.7288424

Farhana Ashraf, R. Kravets

{"title":"Making Dense Networks Work for You","authors":"Farhana Ashraf, R. Kravets","doi":"10.1109/ICCCN.2015.7288424","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288424","url":null,"abstract":"The increased contention and collisions in dense networks trigger excessive scans for finding AP. The collective effect of simultaneous probes from all devices create even more contention in the network. Eventually, the devices start continuous cycles of probing since network condition does not improve after the handoff. Traces we have collected during Infocom 2012 and at busy airport terminals show this impact of probing on dense networks. In this paper, we propose Dynamo-Probing that obtains AP information from nearby active scan using its novel scan mode, Opp-Scan, and by switching to active scan when such opportunities are not available. By avoiding sending probes for each device in the network, Dynamo-Probing reduces the network overload due to probing and thus improves communication quality. Results from our ns-2 simulations capture a 78% improvements in network association time and up to an 82% improvements in throughput for very dense networks. By being adaptive to network density and interoperable with legacy devices, Dynamo-Probing provides an appropriate scan solution that ensures survival in dense networks and good performance in sparse networks.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"2485 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131170743","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}

引用次数: 1

IPv6 Transition for the Other Billions 其他数十亿人的IPv6过渡

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-10-05 DOI: 10.1109/ICCCN.2015.7288422

Guoliang Han, CongXiao Bao, Xing Li, Shuo Liu

{"title":"IPv6 Transition for the Other Billions","authors":"Guoliang Han, CongXiao Bao, Xing Li, Shuo Liu","doi":"10.1109/ICCCN.2015.7288422","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288422","url":null,"abstract":"The transition to IPv6 has been an inevitable trend because there are still more than half of the world's population without the Internet access but the global IPv4 address space has been exhausted. Meanwhile, IPv6 users and emerging IPv6 services still need public IPv4 addresses to communicate with the global IPv4 users and resources, making it important for providers to share scarce global IPv4 addresses effectively. Existing IPv6 transition mechanisms have their own address sharing solutions, but none of them is good enough to be deployed in large-scale networks. In this paper, we propose a novel hybrid address sharing scheme, denoted by HAS, which can be both scalable and agile enough in large-scale deployments, and can help the other billion users access the Internet in a graceful manner. Moreover, the HAS scheme can be deployed in different phases of the IPv6 transition process and can provide a transparent, smooth, self-benefiting IPv6 transition strategy. We implemented the HAS scheme and have deployed it in the Tsinghua University Campus Network (TUNET) to provide Internet access for thousands of campus users. The real traffic data show that the HAS scheme has a good performance in actual deployments.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125040844","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

Primary Secrecy Is Achievable: Optimal Secrecy Rate in Overlay CRNs with an Energy Harvesting Secondary Transmitter 主保密是可实现的:具有能量收集二次发射机的覆盖crn的最优保密率

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-10-05 DOI: 10.1109/ICCCN.2015.7288450

Long Chen, Liusheng Huang, Hongli Xu, Chenkai Yang, Zehao Sun, Xinglong Wang

{"title":"Primary Secrecy Is Achievable: Optimal Secrecy Rate in Overlay CRNs with an Energy Harvesting Secondary Transmitter","authors":"Long Chen, Liusheng Huang, Hongli Xu, Chenkai Yang, Zehao Sun, Xinglong Wang","doi":"10.1109/ICCCN.2015.7288450","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288450","url":null,"abstract":"To tackle the challenging secrecy communication problem in energy harvesting cognitive radio networks, this paper considers an overlay system with one energy harvesting secondary user (SU) to assist primary transmission under the assumption that the primary channel at primary receiver is worse than the eavesdropper. Under such scenario, we optimize the secrecy rate of the PU transmitter by jointly investigating energy harvesting slot, cooperative transmission slot and so on. Given the transmission rate requirement between SUs, the optimization problem is formulated as a mixed integer non-linear (MINLP) program. Due to the special features, we design a polynomial time algorithm SRMA to optimally solve this problem. The algorithm computes the lower bound and upper bound of the transmission power in a secondary transmitter, which are relative with the QoS requirement and energy harvesting parameters. Then SRMA determines its optimal transmission power by iteratively searching between two bounds. Numerical results demonstrate that the primary secrecy rate grows with the increasing energy save ratio and optimal energy save ratio is inversely proportional to the energy harvesting rate.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130855334","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}

引用次数: 8

Robust Energy-Aware Routing with Uncertain Traffic Demands 具有不确定流量需求的鲁棒能量感知路由

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-10-05 DOI: 10.1109/ICCCN.2015.7288460

Heng Lin, Mingwei Xu, Yuan Yang

{"title":"Robust Energy-Aware Routing with Uncertain Traffic Demands","authors":"Heng Lin, Mingwei Xu, Yuan Yang","doi":"10.1109/ICCCN.2015.7288460","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288460","url":null,"abstract":"Energy conservation has become a major challenge to the Internet. Switching part of components into sleep mode is an effective way for energy conservation. Many existing approaches compute routing based on traffic matrices, to balance energy saving and traffic engineering goals, e.g., the maximum link utilization ratio (MLUR). However, accurate traffic matrices are difficult to obtain and change frequently, resulting in lack of routing stability and robustness. We propose to find one energy-aware routing robust to a set of traffic matrices. Such demand-oblivious routing problem has been studied without energy conservation, but it becomes more challenging when energy is considered. To overcome the challenges, we define a metric that reflects the MLUR distance from a routing to the optimal routing under certain energy conservation requirement. We model the problem of minimizing the metric, and analyze the upper bounds. Then, we propose a robust energy-aware routing (REAR) scheme to solve the problem by selecting sleeping links and computing the routing, based on a classical demand-oblivious routing algorithm. We evaluate our algorithms by simulations on real topologies. The results show that REAR is much more robust than existing approaches while more than 35% line card power can be saved.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126463059","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

Spectrum Sensing for a Subdivided Band in Cognitive Radio Networks 认知无线电网络中细分频带的频谱感知

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-10-05 DOI: 10.1109/ICCCN.2015.7288471

P. Paul, C. Xin, Min Song, Yanxiao Zhao

{"title":"Spectrum Sensing for a Subdivided Band in Cognitive Radio Networks","authors":"P. Paul, C. Xin, Min Song, Yanxiao Zhao","doi":"10.1109/ICCCN.2015.7288471","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288471","url":null,"abstract":"Spectrum sensing plays a critical role in cognitive radio networks. Most of existing works on spectrum sensing adopted energy detection which takes samples on a band and then compares the summation with a threshold to determine the state of the band. However, if a licensed band is subdivided by the primary users, such as in the unlicensed WiFi band, the energy detection faces a challenge. The threshold used to decide if there is a PU signal on the band now depends on the number of sub-bands that are being used by primary users, since the received signal power on the band is now dependent on the number of used sub-bands. In this work, we propose a wavelet based spectrum sensing approach that does not depend on the number of used sub-bands and adaptively detects PU signals on a licensed band. We use the measured real world signals to test the approach. The simulation results indicate that the proposed approach can effectively detect the PU signal on a licensed band without needing the knowledge of band subdivision. In addition, the comparative study with the existing techniques is performed to evaluate two performance metrics, true detection and false alarm, for primary users signal detection.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127476180","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}

引用次数: 1

A General Analytical Model for Spatial and Temporal Performance of Bitmap Index Compression Algorithms in Big Data 大数据中位图索引压缩算法时空性能的通用分析模型

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-10-05 DOI: 10.1109/ICCCN.2015.7288362

Yinjun Wu, Zhen Chen, Yuhao Wen, Junwei Cao, Wenxun Zheng, G. Ma

{"title":"A General Analytical Model for Spatial and Temporal Performance of Bitmap Index Compression Algorithms in Big Data","authors":"Yinjun Wu, Zhen Chen, Yuhao Wen, Junwei Cao, Wenxun Zheng, G. Ma","doi":"10.1109/ICCCN.2015.7288362","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288362","url":null,"abstract":"Bitmap indexing is flexible to conduct boolean operations in data retrieval. Besides, the query processing based on bitmap indexing is also very fast. Therefore it has been widely used in various big data analytics platforms, such as Druid and Spark etc. However, bitmap index can consume a large amount of memory, which leads to the invention of different kinds of bitmap index compression algorithms without sacrificing temporal performance. In practice, we are often discommoded by choosing a proper algorithm when handling specific problems. Besides, after devising a new algorithm that may outperform existing ones, it is essential to evaluate its performance in theory. Without appropriate theoretical analysis, the deficit of a new algorithm can only be spotted until final experimental results are drawn, thus wasting much time and effort. In this paper, we propose a general analytical model to analyze both the spatial and temporal performance for bitmap index compression algorithms, which can be applied to analyze all kinds of algorithms derived from WAH (word-aligned hybrid). In this model, two types of distributed bitmaps, uniformly distributed bitmaps and clustered bitmaps, are used separately. In order to illustrate this model, several bitmap index compression algorithms are analyzed and compared with each other. Algorithms herein are COMBAT (COMbining Binary And Ternary encoding), SECOMPAX (Scope Extended COMPAX) and CONCISE (Compressed 'n' Composable Integer Set), which are all derived from WAH. Evaluation results by MATLAB simulation about these algorithms are also presented. This paper paves the way for further researches on the performance evaluation of various bitmap index compression algorithms in the future.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134624463","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}

引用次数: 8

Building and Evaluating COTS Based Optical Interlinks for Nanosatellites 基于COTS的纳米卫星光链路构建与评价

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-10-05 DOI: 10.1109/ICCCN.2015.7288381

Tarek A. Idriss, M. Bayoumi

引用次数: 0