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

D2CS: Dynamic Duty Cycle Scheme in an Opportunistic Routing Sensor Network 机会路由传感器网络中的动态占空比方案

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

Bingxin Niu, Heng Qi, Keqiu Li, Xiulong Liu, Weilian Xue

{"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}

引用次数: 1

Multi-Authority Attribute Based Encryption Scheme with Revocation 基于多授权机构属性的可撤销加密方案

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

Xiaofang Huang, Qi Tao, Baodong Qin, ZhiQin Liu

引用次数: 15

NDN Live Video Broadcasting over Wireless LAN 无线局域网NDN视频直播

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

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}

引用次数: 12

HAEP: Hospital Assignment for Emergency Patients in a Big City 大城市急诊病人的医院分配

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

Peng Liu, Biao Xu, Zhen Jiang, Jie Wu

{"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}

引用次数: 8

A Robust Diffusion Adaptive Network Based on the Maximum Correntropy Criterion 基于最大熵准则的鲁棒扩散自适应网络

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

W. Bazzi, A. Rastegarnia, A. Khalili

{"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}

引用次数: 14

Adaptive Sleep-Time Management Model for WSNs 无线传感器网络的自适应睡眠时间管理模型

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

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}

引用次数: 6

Toward Latency-Aware Dynamic Middlebox Scheduling 面向延迟感知的动态中间盒调度

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

Pengfei Duan, Qing Li, Yong Jiang, Shutao Xia

{"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}

引用次数: 17

A Framework for Security-Aware Virtual Network Embedding 一种安全感知虚拟网络嵌入框架

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

Yang Wang, Phanvu Chau, Fuyu Chen

引用次数: 9

parkITsmart: Minimization of Cruising for Parking parkITsmart:停车巡航最小化

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

Christos Tsiaras, Livio Hobi, Fabian Hofstetter, S. Liniger, B. Stiller

{"title":"parkITsmart: Minimization of Cruising for Parking","authors":"Christos Tsiaras, Livio Hobi, Fabian Hofstetter, S. Liniger, B. Stiller","doi":"10.1109/ICCCN.2015.7288448","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288448","url":null,"abstract":"Finding a parking space in urban areas is a daily challenge for drivers across the world, due to the increasing amount of vehicles and the limited amount of parking spaces. Drivers who are looking for a parking space in peak hours are often forced to drive around city blocks until they spot a free parking space. This process is termed in literature \"cruising for parking\" and is proven to (a) cost a lot of time and gas for drivers, (b) generate unnecessary traffic load, and (c) affect the environment negatively due to increased vehicle emissions. This work proposes a Parking Monitoring and Management System (PMMS) that collects, processes, and presents data about available parking spaces and their tariffs within a geographical region. The end-user application of the PMMS, parkITsmart, delivers at drivers bird's-eye view concerning the parking availability. To facilitate this, the PMMS gathers data from drivers', vehicles, their mobile phones, and Parking Inspectors (PIs). This work shows that in the Internet-of-Things (IoT) environment, \"pairing\" cars and drivers' mobile phones, collecting data from their sensors, and from PIs in a parking monitoring and management system, can decrease significantly cruising times for parking and can increase the time demands of the parking controlling process.","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":"115885609","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

An Experimental Platform for Quantified Crowd 一个量化人群的实验平台

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

Mateusz Grabowski, M. Marschall, Wojciech Sirko, Maciej Debski, Marcin Ziombski, Przemyslaw Horban, Szymon Acedanski, Marcin Peczarski, D. Batorski, K. Iwanicki

引用次数: 5