{"title":"Toward Latency-Aware Dynamic Middlebox Scheduling","authors":"Pengfei Duan, Qing Li, Yong Jiang, Shutao Xia","doi":"10.1109/ICCCN.2015.7288478","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288478","url":null,"abstract":"Under the current Internet environment, middlebox management has become a significant challenge for network operators. Schemes in prior works tried to simplify it with Software-Defined Networking (SDN) technologies, and they provided reliable and flexible approaches to configure the middlebox-related flow entries. However, these schemes are inefficient in resource utilization with the dynamically changing traffic requirements, as they mainly focus on stationary hardware middleboxes. Further-more, latencies of packets lack controls under these schemes. In this paper, inspired by Network Function Virtualization (NFV), we employ software middleboxes, and build a processing delay model to formulate latency behaviours. And based on this model, we present a latency-aware NFV/SDN scheme called Quokka with portable software-based middleboxes that can be dynamically scheduled (placed) according to the changing traffic. Quokka controls the number of middleboxes by efficient and automatic scheduling of both traffic and middlebox positions, and thus reduces the transmission latencies of the network. Comprehensive experiments show: 1) compared with traditional configuration methods, Quokka reduces the transmission delay by about 20% on average; 2) Quokka requires 30% to 50% less middleboxes than traditional schemes to achieve the same performance.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"26 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":"122951696","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":"D2CS: Dynamic Duty Cycle Scheme in an Opportunistic Routing Sensor Network","authors":"Bingxin Niu, Heng Qi, Keqiu Li, Xiulong Liu, Weilian Xue","doi":"10.1109/ICCCN.2015.7288391","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288391","url":null,"abstract":"In Wireless Sensor Networks (WSNs), end-to-end delay is an important metric because the sensed information is necessary to be transmitted to the sink node within a predefined time threshold. Therefore, opportunistic routing protocols are proposed to reduce the end-to-end delay. As a matter of fact, increasing the number of wake-up slots will certainly reduce the transmission delay, however, also consumes more energy. Hence, it is interesting to control the number of wake-up slots to investigate the trade-off between the end-to-end delay and the energy-efficiency. To the best of our knowledge, no existing work takes both of end-to-end delay and energy-efficiency into consideration in the opportunistic routing networks. Therefore, this paper studies how to minimize the energy-consumption while guaranteeing that the expected end-to-end delay is below a given threshold. To solve this problem, we propose an energy-based Dynamic Duty Cycle Scheme(D2CS) in opportunistic routing network. Specifically, we first present an analytical model to measure the expected end-to-end delay. Then, we decompose the studied problem into a set of single-hop delay guarantee problems and using the feedback controller to approximate the optimal solution. Finally, extensive simulations are conducted to evaluate the performance of the proposed D2CS algorithm. The experimental results reveal that our D2CS can guarantee the delay requirement, meanwhile, significantly reduce the energy consumption compared with prior schemes.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"50 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":"126878178","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. D. Ayele, Jianjun Wen, Zeeshan Ansar, W. Dargie
{"title":"Adaptive Sleep-Time Management Model for WSNs","authors":"E. D. Ayele, Jianjun Wen, Zeeshan Ansar, W. Dargie","doi":"10.1109/ICCCN.2015.7288372","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288372","url":null,"abstract":"The energy consumption of a wireless sensor network affects its lifetime which in turn affects the scope and usefulness of the network. Most existing or proposed MAC protocols enable nodes to specify a duty cycle, so that they can sleep much of the time to save energy. However, only very few models exist to determine the appropriate time and duration of a sleep phase. Existing approaches rely on pre-calculated sleep durations or are difficult to implement on real platforms. We propose a runtime and adaptive model to estimate the sleep time and duration of wireless sensor nodes. Our model takes the statistics of incoming and outgoing packets at a relay node which is then supplied to a general queueing model. The model is lightweight and can be fitted into any existing MAC protocol. We have implemented our model for TelosB platform and TinyOS environment. We integrated our model with two existing protocols (TinyOS LPL MAC and XMAC) and compared the performance of these protocols with and without our model. The performance evaluation results show that the energy consumption of a relay node reduced by 11.4 - 64.8%. The overall throughput of the network increased by up to 24%. Moreover, our model readily responded to changes in packet traffic rate while at the same time increasing the packet transmission reliability by 64.5 - 67.4% for different traffic scenarios.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"32 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131776335","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":"A Robust Diffusion Adaptive Network Based on the Maximum Correntropy Criterion","authors":"W. Bazzi, A. Rastegarnia, A. Khalili","doi":"10.1109/ICCCN.2015.7288369","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288369","url":null,"abstract":"Adaptive estimation over distributed networks has received a lot of attention due to its broad range of applications. A useful estimation strategy is diffusion adaptive network, where the parameters of interest can be well estimated from noisy measurements through diffusion cooperation between nodes. The conventional diffusion algorithms exhibit good performance in the presence of Gaussian noise but their performance decreases in presence of impulsive noise. The aim of the present paper is to propose a robust diffusion based algorithm that alleviates the effect of impulsive noise. To this end, we move beyond mean squared error (MSE) criterion and recast the estimation problem in terms of the maximum correntropy criterion (MCC). We use stochastic gradient ascent and useful approximations to derive an adaptive algorithm which is appropriate for distributed implementation. The resultant algorithm has the computational simplicity of the popular LMS algorithm, along with the robustness that is obtained by using higher order moments. We present some simulations results which show that the proposed algorithm outperforms existing alternative that rely MSE criterion.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"29 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":"134221436","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":"HAEP: Hospital Assignment for Emergency Patients in a Big City","authors":"Peng Liu, Biao Xu, Zhen Jiang, Jie Wu","doi":"10.1109/ICCCN.2015.7288416","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288416","url":null,"abstract":"In the largely populated city of a developing country, the ambulance service usually sends an emergent patient to the available hospital with shortest pre-consultation delay. The problem is, a life-critical patient may encounter the lack of treatment resource, such as sickbed, in desired hospitals, and the delay to a next appropriate hospital would cause his death, because non-critical patients already occupied the resources. In the worst case, the service encountering a catastrophe may hold hundreds of people on their way to the hospital and require sickbeds be reserved in advance. In this paper, we propose a resource allocation to balance delay in sending patients to hospitals. We extend the scheme to consider sickbed reservation along the time scale by estimating from the past records in history. As a result, the occupancy is balanced in order to reduce the risk of life-critical patients being delayed. Then we develop an in-hospital waiting queue to keep serious patients waiting locally, when it costs more to reach another available hospital. Simulation results show the substantial improvement of our approach in average delay and number of failure-of-assignment.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"20 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":"129792913","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-Authority Attribute Based Encryption Scheme with Revocation","authors":"Xiaofang Huang, Qi Tao, Baodong Qin, ZhiQin Liu","doi":"10.1109/ICCCN.2015.7288431","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288431","url":null,"abstract":"Attribute Based Encryption (ABE) scheme can achieve information sharing of one-to-many users, without considering the number of users and the users identity. But, the traditional single Attribute Authority (AA) ABE scheme can hardly meet requirements of different agencies in distributed application environment and it is easy to form the system performance bottlenecks. Based on ciphertext-policy ABE scheme, this paper proposes a multi-authority revocable ABE scheme, where the classification manages user attributes, effectively relieving the management burden of single organization. In addition, it can achieve fine grained access control of shared information by adopting tree access strategy and secret sharing scheme, and support system attribute revocation. Finally, we show that the scheme is secure against chosen plaintext attack under the Decisional Bilinear Diffie-Hellman (DBDH) assumption.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"77 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":"116021250","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}
Menghan Li, Dan Pei, Xiaoping Zhang, Beichuan Zhang, Ke Xu
{"title":"NDN Live Video Broadcasting over Wireless LAN","authors":"Menghan Li, Dan Pei, Xiaoping Zhang, Beichuan Zhang, Ke Xu","doi":"10.1109/ICCCN.2015.7288434","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288434","url":null,"abstract":"Named Data Networking (NDN) is a new Internet architecture that replaces today's focus on where - addresses and hosts - with what - the content that users and applications care about. One of NDN's prominent advantages is scalable and efficient content distribution due to its native support of caching and multicast in the network. However, at the last hop to wireless users, often the WiFi link, current NDN implementation still treats the communication as multiple unicast sessions, which will cause duplicate packets and waste of bandwidth when multiple users request for the same popular content. WiFi's built-in broadcast mechanism can alleviate this problem, but it suffers from packet loss since there is no MAC-layer acknowledgement as in unicast. In this paper, we develop a new NDN-based cross-layer approach called NLB for efficient and scalable live video streaming over wireless LAN. The idea is to use WiFi's broadcast channel to deliver content from the access point to the users, a leader-based mechanism to suppress duplicate requests from users, and receiver-driven rate control and loss recovery. The design is implemented and evaluated in a physical testbed comprised of a commodity residential access point and 20 WiFi clients. While NDN with multiple unicast sessions or plain broadcast can support no more than 7 concurrent viewers of a 1Mbps streaming video, NDN plus NLB supports all 20 viewers, and can likely support many more when present.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"3 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":"114608464","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}
Mateusz Grabowski, M. Marschall, Wojciech Sirko, Maciej Debski, Marcin Ziombski, Przemyslaw Horban, Szymon Acedanski, Marcin Peczarski, D. Batorski, K. Iwanicki
{"title":"An Experimental Platform for Quantified Crowd","authors":"Mateusz Grabowski, M. Marschall, Wojciech Sirko, Maciej Debski, Marcin Ziombski, Przemyslaw Horban, Szymon Acedanski, Marcin Peczarski, D. Batorski, K. Iwanicki","doi":"10.1109/ICCCN.2015.7288377","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288377","url":null,"abstract":"Quantified crowd, a vision in which on-body sensors of nearby people collaborate to detect various phenomena within a crowd and produce feedback, is an emerging research area. One of the issues that impedes progress in this new area is a lack of a broadly applicable experimental platform, such as the platforms that enabled research on wireless sensor networks. In this paper, we aim to address this issue by presenting such an experimental hardware-software platform. Not only does the platform introduce custom badge-form low-power devices that feature a number of sensors relevant to quantified crowd, but it also ensures that these devices can interoperate with commercial off-the-shelf smartphones, wristbands, and other devices for self-quantification. In effect, it constitutes a powerful experimental instrument, as we show in a preliminary real-world evaluation.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"13 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":"114149204","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":"Demonstrating the Threat of Hardware Trojans in Wireless Sensor Networks","authors":"Maryam Jalalitabar, Marco Valero, A. Bourgeois","doi":"10.1109/ICCCN.2015.7288392","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288392","url":null,"abstract":"As the demand for cheaper electronic devices has increased, the location of manufacturing foundries has changed, sometimes to untrusted places in foreign countries. Some of these locations have limited oversight of the manufacturing of complicated and sensitive electronic components including integrated circuits (ICs). The integrated circuits are key component in all current electronic devices and can be modified to be malicious or to monitor the functions of their applications. These malicious modifications on the ICs are called hardware trojans (HWTs). HWTs can be designed to quietly monitor, to actively send out sensitive information, or to destroy their host device completely. The idea of hardware trojans in Wireless Sensor Networks (WSNs) has not been investigated before; thus, our goal is to demonstrate the potential threat that hardware trojans pose for sensor networks. This is important to study, given that in WSNs hundreds of sensors are deployed and in most cases left unattended, which gives the opportunity to an attacker to trigger a HWT on the sensors. For our investigation, we used TelosB sensors that have been used for some WSN applications. An attacker in a network can, for example, take advantage of the SPI bus that is used by the radio to eavesdrop messages and even disrupt communications completely. Currently, security breaches through software is given great importance in the WSN academic and research community. Our research shows that the same level of importance must be given to attacks through hardware to ensure a trusted and secure network.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"36 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":"116644042","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":"WiG: WiFi-Based Gesture Recognition System","authors":"Wenfeng He, Kaishun Wu, Yongpan Zou, Zhong Ming","doi":"10.1109/ICCCN.2015.7288485","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288485","url":null,"abstract":"Most recently, gesture recognition has increasingly attracted intense academic and industrial interest due to its various applications in daily life, such as home automation, mobile games. Present approaches for gesture recognition, mainly including vision-based, sensor-based and RF-based, all have certain limitations which hinder their practical use in some scenarios. For example, the vision-based approaches fail to work well in poor light conditions and the sensor-based ones require users to wear devices. To address these, we propose WiG in this paper, a device-free gesture recognition system based solely on Commercial Off-The-Shelf (COTS) WiFi infrastructures and devices. Compared with existing Radio Frequency (RF)-based systems, WiG stands out for its systematic simplicity, extremely low cost and high practicability. We implemented WiG in indoor environment and conducted experiments to evaluate its performance in two typical scenarios. The results demonstrate that WiG can achieve an average recognition accuracy of 92% in line-of-sight scenario and average accuracy of 88% in the none-line-of sight scenario.","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":"129370891","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}