2013 22nd International Conference on Computer Communication and Networks (ICCCN)最新文献_第2页

e-Health AON (Application-Oriented Networks) 电子保健AON(面向应用的网络)

2013 22nd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2013-10-24 DOI: 10.1109/ICCCN.2013.6614130

Wei Liu, Eun Kyo Park

引用次数: 7

An Optimal Algorithm for Time-Slot Assignment in SS/TDMA Satellite Systems SS/TDMA卫星系统时隙分配的优化算法

2013 22nd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2013-10-24 DOI: 10.1109/ICCCN.2013.6614107

Xili Wan, Feng Shan, Xiaojun Shen

{"title":"An Optimal Algorithm for Time-Slot Assignment in SS/TDMA Satellite Systems","authors":"Xili Wan, Feng Shan, Xiaojun Shen","doi":"10.1109/ICCCN.2013.6614107","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614107","url":null,"abstract":"Packet scheduling in switches plays an important role in providing guaranteed service to meet Quality-of-Service (QoS) requirements. In this paper, we revisit a historical Maximum Traffic Time-slot Scheduling (MTTS) problem for both circuit- and packet-switched traffic in SS/TDMA satellite systems proposed two decades ago by Bonuccelli et al.. They developed a two-step approach to solve the MTTS problem, which scheduled the circuit-switched traffic first into TDMA frames and then inserted packets from packet-switched traffic into empty slots in these scheduled TDMA frames as many as possible. This problem was referred as Incremental Time-slot Assignment (ITSA) Problem in their paper, and was proved to be NP-hard. Therefore, MTTS problem seems to be NP-hard due the the NP-hardness of ITSA problem induced by their two-step approach. However, in this paper, we show that MTTS problem is NOT NP-hard, since there exists an optimal algorithm for this problem. By aggregating the traffic in scheduled TDMA frames, an optimal algorithm based on network flow method is developed for MTTS problem, which can solve the MTTS problem in polynomial time. Theoretic proof for the optimality of our algorithm is given and simulations results further validate the correctness of our algorithm.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"61 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":"132884156","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

Secure RFID Authentication Protocol with Key Updating Technique 基于密钥更新技术的RFID安全认证协议

2013 22nd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2013-10-24 DOI: 10.1109/ICCCN.2013.6614192

G. Khan, G. Zhu

引用次数: 12

An Empirical Study of Receiver-Based AIMD Flow-Control Strategies for CCN CCN中基于接收端的AIMD流量控制策略的实证研究

2013 22nd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2013-10-24 DOI: 10.1109/ICCCN.2013.6614106

Stefan Braun, Massimo Monti, M. Sifalakis, C. Tschudin

{"title":"An Empirical Study of Receiver-Based AIMD Flow-Control Strategies for CCN","authors":"Stefan Braun, Massimo Monti, M. Sifalakis, C. Tschudin","doi":"10.1109/ICCCN.2013.6614106","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614106","url":null,"abstract":"The Content Centric Network (CCNx) protocol introduces a new routing and forwarding paradigm for the waist of the future Internet architecture. Below CCN, a volatile set of transport and flow-control strategies is envisioned, which can match better different service requirements, than current TCP/IP technology does. Although a broad range of possibilities has not been explored yet, there are already several proponents of strategies that come close to TCP's well-known flow control mechanism (timeout-driven, window-based, and AIMD- operated). In this paper, we carry out an empirical exploration of some proposed strategies in order to assert their feasibility and efficiency. Our contributions are twofold: First, we establish if receiver-based, timeout-driven, AIMD operated flow-control on Interest transmissions is sufficiently effective for CCN in a future Internet deployment, where it may co-exist with TCP. In this process we compare the performance of three different variants of this strategy, in presence of multi-homed content in the network (one of them proposed by the authors). Second, we provide indicators for the general efficiency of timeout-based flow-control at the CCN receiver, in presence of in-network caching, and exhibit some of the challenges faced by such strategies.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"73 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":"122294402","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}

引用次数: 47

On the Use of Distributed Beamforming to Increase Base Station Anonymity in Wireless Sensor Networks 利用分布式波束形成提高无线传感器网络中基站匿名性的研究

2013 22nd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2013-10-24 DOI: 10.1109/ICCCN.2013.6614164

Jon R. Ward, M. Younis

{"title":"On the Use of Distributed Beamforming to Increase Base Station Anonymity in Wireless Sensor Networks","authors":"Jon R. Ward, M. Younis","doi":"10.1109/ICCCN.2013.6614164","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614164","url":null,"abstract":"In recent years, Wireless Sensor Networks (WSNs) have become valuable assets to both the commercial and military communities with applications ranging from industrial control on a factory floor to reconnaissance of a hostile border. In most applications, the sensors act as data sources and forward information generated by event triggers to a central sink or base station (BS). The unique role of the BS makes it a natural target for an adversary that desires to achieve the most impactful attack possible against a WSN with the least amount of effort. Even if a WSN employs conventional security mechanisms such as encryption and authentication, an adversary may apply traffic analysis techniques to identify the BS. This motivates a significant need for improved BS anonymity to protect the identity, role, and location of the BS. In this paper we propose a novel cross-layer relay-selection algorithm and a distributed beamforming protocol to increase BS anonymity. We examine the effect of the proposed distributed beamforming technique on improving BS anonymity using evidence theory analysis and demonstrate the effectiveness of this approach through simulation.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"2 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":"121069980","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}

引用次数: 16

AFCD: An Approximated-Fair and Controlled-Delay Queuing for High Speed Networks 高速网络的近似公平和控制延迟排队

2013 22nd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2013-10-24 DOI: 10.1109/ICCCN.2013.6614103

Lin Xue, Suman Kumar, Cheng Cui, Praveenkumar Kondikoppa, Chui-Hui Chiu, Seung-Jong Park

{"title":"AFCD: An Approximated-Fair and Controlled-Delay Queuing for High Speed Networks","authors":"Lin Xue, Suman Kumar, Cheng Cui, Praveenkumar Kondikoppa, Chui-Hui Chiu, Seung-Jong Park","doi":"10.1109/ICCCN.2013.6614103","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614103","url":null,"abstract":"High speed networks have characteristics of high bandwidth, long queuing delay, and high burstiness which make it difficult to address issues such as fairness, low queuing delay and high link utilization. Current high speed networks carry heterogeneous TCP flows which makes it even more challenging to address these issues. Since sender centric approaches do not meet these challenges, there have been several proposals to address them at router level via queue management (QM) schemes. These QM schemes have been fairly successful in addressing either fairness issues or large queuing delay but not both at the same time. We propose a new QM scheme called Approximated-Fair and Controlled-Delay (AFCD) queuing for high speed networks that aims to meet following design goals: approximated fairness, controlled low queuing delay, high link utilization and simple implementation. The design of AFCD utilizes a novel synergistic approach by forming an alliance between approximated fair queuing and controlled delay queuing. It uses very small amount of state information in sending rate estimation of flows and makes drop decision based on a target delay of individual flow. Through experimental evaluation in a 10Gbps high speed networking environment, we show AFCD meets our design goals by maintaining approximated fair share of bandwidth among flows and ensuring a controlled very low queuing delay with a comparable link utilization.","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":"115314660","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

MINERVA: Information-Centric Programming for Social Sensing MINERVA:以信息为中心的社会感知编程

2013 22nd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2013-10-24 DOI: 10.1109/ICCCN.2013.6614152

Shiguang Wang, Shaohan Hu, Shen Li, Hengchang Liu, Md Yusuf Sarwar Uddin, T. Abdelzaher

{"title":"MINERVA: Information-Centric Programming for Social Sensing","authors":"Shiguang Wang, Shaohan Hu, Shen Li, Hengchang Liu, Md Yusuf Sarwar Uddin, T. Abdelzaher","doi":"10.1109/ICCCN.2013.6614152","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614152","url":null,"abstract":"In this paper, we introduce Minerva; an information-centric programming paradigm and toolkit for social sensing. The toolkit is geared for smartphone applications whose main objective is to collect and share information about the physical world. Information-centric programming refers to a publish-subscribe paradigm that maximizes the amount of information delivered. Unlike a traditional publish-subscribe system where publishers are assumed to have independent content, Minerva is geared for social sensing applications where different sources (participants sharing sensor data) often overlap in information they share. For example, through lack of coordination, they might collect redundant pictures of the same scene or redundant speed measurements of the same street. The main contribution of Minerva, therefore, lies in a data prioritization scheme that maximizes information delivery from publishers to subscribers by reducing redundancy, taking into account the non-independent nature of content. The algorithm is implemented on Android phones on top of the recently introduced named data networking framework. Evaluation results from both two smartphone-based experiments and a large-scale real data driven simulation demonstrate that the prioritization algorithm outperforms other candidates in terms of information coverage.","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":"116753155","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 Fast Approach to Unknown Tag Identification in Large Scale RFID Systems 大规模RFID系统中未知标签的快速识别方法

2013 22nd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2013-10-24 DOI: 10.1109/ICCCN.2013.6614086

Xiulong Liu, Keqiu Li, Yanming Shen, G. Min, Bin Xiao, W. Qu, Hongjuan Li

{"title":"A Fast Approach to Unknown Tag Identification in Large Scale RFID Systems","authors":"Xiulong Liu, Keqiu Li, Yanming Shen, G. Min, Bin Xiao, W. Qu, Hongjuan Li","doi":"10.1109/ICCCN.2013.6614086","DOIUrl":"https://doi.org/10.1109/ICCCN.2013.6614086","url":null,"abstract":"Radio Frequency Identification (RFID) technology has been widely applied in many scenarios such as inventory control, supply chain management due to its superior properties including fast identification and relatively long interrogating range over barcode systems. It is critical to efficiently identify the unknown tags because these tags can appear when new tagged objects are moved in or wrongly placed. The state-of-the-art Basic Unknown tag Identification Protocol-with Collision-Fresh slot paring (BUIP-CF) protocol can first deactivate all the known tags and then collect all the unknown tags. However, BUIP-CF protocol investigates an ALOHA-like technique and causes too many tag responses, which results in low efficiency. This paper proposes a Fast Unknown tag Identification (FUI) protocol which investigates an indicator vector to label the unknown tags with a given accuracy and removes the time-consuming tag responses in the deactivation phase. FUI also adopts the classical Enhanced Dynamic Framed Slotted ALOHA (EDFSA) protocol to collect the labeled unknown tags. We then investigate the optimal parameter settings to maximize the performance of the proposed FUI protocol. Extensive simulation experiments are conducted to evaluate the performance of the proposed FUI protocol and the experimental results show that it considerably outperforms the state-of-the-art protocol.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"71 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":"132648071","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}

引用次数: 9

Throughput Enhancement for WDS-Based WLANs 基于wds的wlan的吞吐量增强

2013 22nd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2013-10-24 DOI: 10.1109/ICCCN.2013.6614202

Jae-Pil Jeong, Wan-Seon Lim, Young-Joo Suh

引用次数: 2

OCNI - Open Cloud Networking Interface 开放云网络接口

2013 22nd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2013-10-24 DOI: 10.1109/ICCCN.2013.6614161

H. Medhioub, Bilel Msekni, D. Zeghlache

引用次数: 8