2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)最新文献_第2页

2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928879

B. Cheng, Zhezhuang Xu, Cailian Chen, X. Guan

{"title":"Spatial correlated data collection in wireless sensor networks with multiple sinks","authors":"B. Cheng, Zhezhuang Xu, Cailian Chen, X. Guan","doi":"10.1109/INFCOMW.2011.5928879","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928879","url":null,"abstract":"Due to the high density of node deployment in wireless sensor network, the sensing data of nodes in spatially proximate locations are highly correlated. By effectively exploiting this spatial correlation in the data collection process, unnecessary energy costs for redundant data transmission can be largely reduced. In this paper, we focus on collecting spatial correlated data in multi-sink scenario. The main challenge in this scenario is that data collection process should consider how to exploit the spatial correlation and decide which sink the data are transmitted to at the same time. To address this challenge, we propose an algorithm to select a subset of sensor nodes to represent the whole multi-sink sensor network based on the spatial correlated sensing readings. In this algorithm, only these representatives named sources need to upload their data to the chosen sinks. The problem is firstly formulated as a Binary Integer Linear Programming (BILP). Since the problem is proved to be NP-Complete, two heuristic algorithms are designed for approximation. The simulation results show that the proposed algorithms can largely reduce the number of the sources and then significantly improve energy efficiency.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130466041","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}

引用次数: 20

Enforce truth-telling in wireless relay networks for secure communication 在无线中继网络中加强真实信息的传递，以确保通信安全

2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928786

Shuhang Liu, Rongqing Zhang, Lingyang Song, Zhu Han, B. Jiao

引用次数: 4

Utility-based resource allocation for mixed traffic in wireless networks 基于效用的无线网络混合业务资源分配

2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928944

Li Chen, Bin Wang, Xiaohang Chen, Xin Zhang, Dacheng Yang

引用次数: 93

Causal ordering group communication for cognitive radio ad hoc networks 认知无线电自组网的因果排序群通信

2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928900

Liming Xie, X. Jia, Kunxiao Zhou

引用次数: 4

On the design of relay caching in cellular networks for energy efficiency 基于能效的蜂窝网络中继缓存设计

2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928820

Xiaolei Wang, Yanan Bao, Xin Liu, Z. Niu

引用次数: 43

Diffusion-based channel characterization in molecular nanonetworks 分子纳米网络中基于扩散的通道表征

2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928858

I. Llatser, E. Alarcón, Massimiliano Pierobony

{"title":"Diffusion-based channel characterization in molecular nanonetworks","authors":"I. Llatser, E. Alarcón, Massimiliano Pierobony","doi":"10.1109/INFCOMW.2011.5928858","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928858","url":null,"abstract":"Nanotechnology is enabling the development of devices in a scale ranging from one to a few hundred nanometers, known as nanomachines. How these nanomachines will communicate is still an open debate. Molecular communication is a promising paradigm that has been proposed to implement nanonetworks, i.e., the interconnection of nanomachines. Recent studies have attempted to model the physical channel of molecular communication, mainly from a communication or information-theoretical point of view. In this work, we focus on the diffusion-based molecular communication, whose physical channel is governed by Fick's laws of diffusion. We characterize the molecular channel following two complementary approaches: first, we obtain the channel impulse response, transfer function and group delay; second, we propose a pulse-based modulation scheme and we obtain analytical expressions for the most relevant performance evaluation metrics, which we also validate by simulation. Finally, we compare the scalability of these metrics with their equivalents in a wireless electromagnetic channel. We consider that these results provide interesting insights which may serve designers as a guide to implement future molecular nanonetworks.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116453290","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}

引用次数: 67

A traffic-aware top-N firewall approximation algorithm 流量感知的top-N防火墙近似算法

2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928779

Ho-Yu Lam, Donghan Wang, H. Jonathan Chao

引用次数: 4

Resource allocation for security services in mobile cloud computing 移动云计算中安全业务的资源分配

2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928806

Hongbin Liang, Dijiang Huang, L. Cai, X. Shen, D. Peng

{"title":"Resource allocation for security services in mobile cloud computing","authors":"Hongbin Liang, Dijiang Huang, L. Cai, X. Shen, D. Peng","doi":"10.1109/INFCOMW.2011.5928806","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928806","url":null,"abstract":"Mobile cloud is a machine-to-machine service model, where a mobile device can use the cloud for searching, data mining, and multimedia processing. To protect the processed data, security services, i.e., encryption, decryption, authentications, etc., are performed in the cloud. In general, we can classify cloud security services in two categories: Critical Security (CS) service and Normal Security (NS) service. CS service provides strong security protection such as using longer key size, strict security access policies, isolations for protecting data, and so on. The CS service usually occupies more cloud computing resources, however it generates more rewards to the cloud provider since the CS service users need to pay more for using the CS service. With the increase of the number of CS and NS service users, it is important to allocate the cloud resource to maximize the system rewards with the considerations of the cloud resource consumption and incomes generated from cloud users. To address this issue, we propose a Security Service Admission Model (SSAM) based on Semi-Markov Decision Process to model the system reward for the cloud provider. We, first, define system states by a tuple represented by the numbers of cloud users and their associated security service categories, and current event type (i.e., arrival or departure).We then derive the system steady-state probability and service request blocking probability by using the proposed SSAM. Numerical results show that the obtained theoretic probabilities are consistent with our simulation results.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124010814","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}

引用次数: 67

Colluding injected attack in mobile ad-hoc networks 移动自组织网络中的串通注入攻击

2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928815

Farah I. Kandah, Yashaswi Singh, Chonggang Wang

{"title":"Colluding injected attack in mobile ad-hoc networks","authors":"Farah I. Kandah, Yashaswi Singh, Chonggang Wang","doi":"10.1109/INFCOMW.2011.5928815","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928815","url":null,"abstract":"The growth of laptops, personal digital assistant (PDA) and 802.11/Wi-Fi wireless networking have made mobile ad-hoc network (MANET) and machine-to-machine (M2M) popular research topics recently. With more attention on M2M and MANETs lately, the security issues become more important and urgent for managing and deploying in such networks. The flexible deployment nature and the lack of fixed infrastructure make MANETs suffer from varieties of security attacks. In this paper, we show how an adversary can utilize a colluding attack in MANET by injecting malicious nodes in the network, while hiding their identities from other legitimate nodes. We will name this attack as the Colluding Injected Attack (CIA). These injected nodes will work together to generate a severe attack in the network, which aims to create a collision at an arbitrary node, which in turn will result in making the attacked node unable to receive or relay any packet. As a result this node could be wrongly reported as having a malicious behavior by any other node in the same neighborhood, or it might be reported as unreachable if it is a destination node. Our simulation results show that the existence of an adversary that launching the colluding injected attack (CIA) will mislead the decision of previous attack detection schemes.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126185266","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}

引用次数: 21

Average delay analysis of opportunistic single copy delivery in Manhattan area using biased random walk 利用有偏随机漫步分析曼哈顿地区机会性单副本投递的平均延迟

2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928877

J. Jun, W. Fu, D. Agrawal

引用次数: 3