首页 > 最新文献

2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)最新文献

英文 中文
Spatial correlated data collection in wireless sensor networks with multiple sinks 多汇无线传感器网络空间相关数据采集
Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928879
B. Cheng, Zhezhuang Xu, Cailian Chen, X. Guan
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.
由于无线传感器网络中节点的高密度部署,使得空间上邻近位置节点的感知数据高度相关。通过在数据收集过程中有效地利用这种空间相关性,可以大大减少冗余数据传输的不必要能源成本。本文主要研究多汇场景下空间相关数据的采集。这种情况下的主要挑战是数据收集过程应考虑如何利用空间相关性,同时决定数据传输到哪个sink。为了解决这一挑战,我们提出了一种基于空间相关感知读数选择传感器节点子集来表示整个多汇传感器网络的算法。在此算法中,只有这些指定的代表源需要将其数据上传到所选的接收器。该问题首先被表述为二进制整数线性规划(BILP)。由于证明了问题是np完全的,设计了两种启发式算法进行逼近。仿真结果表明,提出的算法可以大大减少源的数量,从而显著提高能源效率。
{"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 在无线中继网络中加强真实信息的传递,以确保通信安全
Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928786
Shuhang Liu, Rongqing Zhang, Lingyang Song, Zhu Han, B. Jiao
To ensure security in data transmission is one of the most important issues for wireless relay networks. In this paper, we consider a cooperative network, consisting of one source node, one destination node, one eavesdropper node, and a number of relay nodes. Specifically, the source selects several relay nodes which can help forward the signal to the corresponding destination to achieve the best security performance. However, the relay nodes may have the incentive not to report their true private channel information in order to get more chance to be selected and gain more payoff from the source. We employ a self-enforcing truth-telling mechanism into the network to solve this cheating problem. By adding a transfer payoff to the total payoff of each selected relay node, we prove that each relay node would get its maximum expected payoff only when it tells the truth to the source. And then, an optimal secrecy capacity of the network can be achieved. Simulation results verify the efficiency of the proposed mechanism.
保证数据传输的安全性是无线中继网络的重要问题之一。本文考虑一个由一个源节点、一个目的节点、一个窃听节点和多个中继节点组成的协作网络。具体来说,信号源选择多个中继节点帮助将信号转发到相应的目的地,以达到最佳的安全性能。然而,中继节点可能有动机不报告其真实的私有信道信息,以获得更多的被选择的机会,并从源获得更多的回报。我们在网络中采用了一种自我执行的真相告知机制来解决这个作弊问题。通过在每个中继节点的总收益中增加一个转移收益,我们证明了每个中继节点只有在向源说出真相时才能获得最大的期望收益。从而达到网络的最优保密能力。仿真结果验证了该机构的有效性。
{"title":"Enforce truth-telling in wireless relay networks for secure communication","authors":"Shuhang Liu, Rongqing Zhang, Lingyang Song, Zhu Han, B. Jiao","doi":"10.1109/INFCOMW.2011.5928786","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928786","url":null,"abstract":"To ensure security in data transmission is one of the most important issues for wireless relay networks. In this paper, we consider a cooperative network, consisting of one source node, one destination node, one eavesdropper node, and a number of relay nodes. Specifically, the source selects several relay nodes which can help forward the signal to the corresponding destination to achieve the best security performance. However, the relay nodes may have the incentive not to report their true private channel information in order to get more chance to be selected and gain more payoff from the source. We employ a self-enforcing truth-telling mechanism into the network to solve this cheating problem. By adding a transfer payoff to the total payoff of each selected relay node, we prove that each relay node would get its maximum expected payoff only when it tells the truth to the source. And then, an optimal secrecy capacity of the network can be achieved. Simulation results verify the efficiency of the proposed mechanism.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"1 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":"131021856","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
Utility-based resource allocation for mixed traffic in wireless networks 基于效用的无线网络混合业务资源分配
Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928944
Li Chen, Bin Wang, Xiaohang Chen, Xin Zhang, Dacheng Yang
In order to solve the problem that the existing resource allocation strategies cannot give integrative consideration to QoS, spectrum efficiency for mixed traffic, this paper proposes a utility-based resource allocation algorithm for mixed traffic in wireless networks. The unified utility function for users with different traffics is studied first. After that, the optimization model for the resource allocation is established based on the unified utility function. A heuristic algorithm based on the solution of the model is proposed in the mixed traffic scenario after analyzing the optimization model. The algorithm which has lower complexity than the existing work can automatically guarantee the QoS requirement for the real-time traffic and make a tradeoff between throughput and fairness for users with best effort traffic due to the unified utility function. Numeric simulation results indicate that the algorithm is very applicable for mixed traffic, and the resource requirements for QoS users can be satisfied preferentially in the mixed traffic scenario.
为了解决现有资源分配策略不能综合考虑混合业务的QoS、频谱效率的问题,本文提出了一种基于效用的无线网络混合业务资源分配算法。首先研究了不同流量用户的统一效用函数。在此基础上,建立了基于统一效用函数的资源配置优化模型。在分析优化模型的基础上,提出了混合交通场景下基于模型解的启发式算法。该算法比现有算法的复杂度更低,能够自动保证实时流量的QoS要求,并通过统一的效用函数在吞吐量和公平性之间进行权衡。数值仿真结果表明,该算法非常适用于混合流量,能够优先满足QoS用户的资源需求。
{"title":"Utility-based resource allocation for mixed traffic in wireless networks","authors":"Li Chen, Bin Wang, Xiaohang Chen, Xin Zhang, Dacheng Yang","doi":"10.1109/INFCOMW.2011.5928944","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928944","url":null,"abstract":"In order to solve the problem that the existing resource allocation strategies cannot give integrative consideration to QoS, spectrum efficiency for mixed traffic, this paper proposes a utility-based resource allocation algorithm for mixed traffic in wireless networks. The unified utility function for users with different traffics is studied first. After that, the optimization model for the resource allocation is established based on the unified utility function. A heuristic algorithm based on the solution of the model is proposed in the mixed traffic scenario after analyzing the optimization model. The algorithm which has lower complexity than the existing work can automatically guarantee the QoS requirement for the real-time traffic and make a tradeoff between throughput and fairness for users with best effort traffic due to the unified utility function. Numeric simulation results indicate that the algorithm is very applicable for mixed traffic, and the resource requirements for QoS users can be satisfied preferentially in the mixed traffic scenario.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"33 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":"131162785","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}
引用次数: 93
Causal ordering group communication for cognitive radio ad hoc networks 认知无线电自组网的因果排序群通信
Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928900
Liming Xie, X. Jia, Kunxiao Zhou
In this paper, we discuss the causal ordering group communication for cognitive radio (CR) networks. The issue of causal ordering has been studied extensively by previous works. However, these works considered the problem at the application layer and the methods in the works incurred high communication overhead and the long latency for message delivery. In this paper, we discuss the causal ordering at the network layer.The problem of our concern is: given a group communication request in a CR network, how to set up the connection so that the causal ordering of the group communication can be preserved, and the bandwidth consumption of the communication is minimized. We propose a two-phase method to solve it. In the method, we first construct a multicast tree for the communication, and then assign slots for all tree links. It is proved that the method can preserve the causal ordering of messages without extra communication overhead nor the latency for delivering messages. Simulations are conducted to show the performance of our proposed method.
本文讨论了认知无线电(CR)网络中的因果顺序群通信。因果排序问题已被前人广泛研究。然而,这些工作考虑的是应用层的问题,其中的方法带来了较高的通信开销和较长的消息传递延迟。本文讨论了网络层的因果排序问题。我们关注的问题是:在CR网络中,给定一个组通信请求,如何建立连接,使组通信的因果顺序保持不变,并使通信的带宽消耗最小。我们提出了一个两阶段的方法来解决这个问题。在该方法中,我们首先为通信构造一个组播树,然后为所有树中的链路分配插槽。结果表明,该方法能够保持消息的因果顺序,且没有额外的通信开销和消息传递延迟。仿真结果表明了该方法的有效性。
{"title":"Causal ordering group communication for cognitive radio ad hoc networks","authors":"Liming Xie, X. Jia, Kunxiao Zhou","doi":"10.1109/INFCOMW.2011.5928900","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928900","url":null,"abstract":"In this paper, we discuss the causal ordering group communication for cognitive radio (CR) networks. The issue of causal ordering has been studied extensively by previous works. However, these works considered the problem at the application layer and the methods in the works incurred high communication overhead and the long latency for message delivery. In this paper, we discuss the causal ordering at the network layer.The problem of our concern is: given a group communication request in a CR network, how to set up the connection so that the causal ordering of the group communication can be preserved, and the bandwidth consumption of the communication is minimized. We propose a two-phase method to solve it. In the method, we first construct a multicast tree for the communication, and then assign slots for all tree links. It is proved that the method can preserve the causal ordering of messages without extra communication overhead nor the latency for delivering messages. Simulations are conducted to show the performance of our proposed method.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":" 37","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132187428","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
On the design of relay caching in cellular networks for energy efficiency 基于能效的蜂窝网络中继缓存设计
Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928820
Xiaolei Wang, Yanan Bao, Xin Liu, Z. Niu
In this work, we design a relay caching mechanism to improve the energy efficiency in cellular networks, especially for multimedia applications. We consider a single cell with one or more fixed relay stations (RSs) installed near the cell edge. In our design, RSs can receive and cache demanded multimedia content in the cell. After caching, a RS directly serves the users in its coverage area instead of the base station (BS) to reduce energy consumption. In order to find the optimal policy of when and how to cache, we formulate the problem as a Markov decision process (MDP) and obtain the optimal decision table. The numerical results show that the relay caching can save about 15% of total energy. We also present two heuristic policies that perform very close to the optimal one and have low complexity.
在这项工作中,我们设计了一种中继缓存机制,以提高蜂窝网络的能量效率,特别是多媒体应用。我们考虑在单个小区边缘附近安装有一个或多个固定中继站(RSs)的小区。在我们的设计中,RSs可以在单元格中接收和缓存所需的多媒体内容。经过缓存后,RS直接为其覆盖区域内的用户服务,而不是基站(BS),以减少能耗。为了找到何时和如何缓存的最优策略,我们将问题表述为马尔可夫决策过程(MDP),并得到最优决策表。数值结果表明,继电器缓存可以节省总能量的15%左右。我们还提出了两个启发式策略,它们的执行非常接近最优策略,并且具有较低的复杂性。
{"title":"On the design of relay caching in cellular networks for energy efficiency","authors":"Xiaolei Wang, Yanan Bao, Xin Liu, Z. Niu","doi":"10.1109/INFCOMW.2011.5928820","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928820","url":null,"abstract":"In this work, we design a relay caching mechanism to improve the energy efficiency in cellular networks, especially for multimedia applications. We consider a single cell with one or more fixed relay stations (RSs) installed near the cell edge. In our design, RSs can receive and cache demanded multimedia content in the cell. After caching, a RS directly serves the users in its coverage area instead of the base station (BS) to reduce energy consumption. In order to find the optimal policy of when and how to cache, we formulate the problem as a Markov decision process (MDP) and obtain the optimal decision table. The numerical results show that the relay caching can save about 15% of total energy. We also present two heuristic policies that perform very close to the optimal one and have low complexity.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"39 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":"114769745","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}
引用次数: 43
Diffusion-based channel characterization in molecular nanonetworks 分子纳米网络中基于扩散的通道表征
Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928858
I. Llatser, E. Alarcón, Massimiliano Pierobony
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.
纳米技术使一到几百纳米的设备得以发展,这些设备被称为纳米机器。这些纳米机器将如何进行通信仍是一个悬而未决的问题。分子通信是一种很有前途的范例,已经提出了实现纳米网络,即纳米机器的互连。最近的研究试图建立分子通信的物理通道模型,主要是从通信或信息理论的角度出发。在这项工作中,我们重点研究了基于扩散的分子通信,其物理通道受菲克扩散定律的支配。我们采用两种互补的方法来表征分子通道:首先,我们获得了通道的脉冲响应、传递函数和群延迟;其次,我们提出了一种基于脉冲的调制方案,我们得到了最相关的性能评估指标的解析表达式,我们也通过仿真验证了这一点。最后,我们将这些指标的可扩展性与无线电磁信道中的等效指标进行了比较。我们认为这些结果提供了有趣的见解,可以作为设计人员实施未来分子纳米网络的指南。
{"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防火墙近似算法
Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928779
Ho-Yu Lam, Donghan Wang, H. Jonathan Chao
Packet classification is widely used in various network security and operation applications. Two of the main challenges are the increasing number of classification rules, amount of traffic and network line speed. In this paper, we investigate an approximation algorithm for selecting the top- N most frequently matched subset of rules from the original ruleset. The goal is to obtain Top-N rules that covers as much traffic as possible while preserving the dependency relationships. Through simulations, we show that our approaches the optimal while runs in seconds, allowing online adaptation to changing traffic patterns.
报文分类广泛应用于各种网络安全和运营应用中。两个主要的挑战是越来越多的分类规则、流量和网络线路速度。本文研究了一种从原始规则集中选择前N个最频繁匹配的规则子集的近似算法。目标是获得Top-N规则,这些规则在保留依赖关系的同时涵盖尽可能多的流量。通过模拟,我们证明了我们的方法在秒内运行时是最优的,允许在线适应不断变化的流量模式。
{"title":"A traffic-aware top-N firewall approximation algorithm","authors":"Ho-Yu Lam, Donghan Wang, H. Jonathan Chao","doi":"10.1109/INFCOMW.2011.5928779","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928779","url":null,"abstract":"Packet classification is widely used in various network security and operation applications. Two of the main challenges are the increasing number of classification rules, amount of traffic and network line speed. In this paper, we investigate an approximation algorithm for selecting the top- N most frequently matched subset of rules from the original ruleset. The goal is to obtain Top-N rules that covers as much traffic as possible while preserving the dependency relationships. Through simulations, we show that our approaches the optimal while runs in seconds, allowing online adaptation to changing traffic patterns.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"88 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":"122093287","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
Resource allocation for security services in mobile cloud computing 移动云计算中安全业务的资源分配
Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928806
Hongbin Liang, Dijiang Huang, L. Cai, X. Shen, D. Peng
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.
移动云是一种机器对机器的服务模型,移动设备可以使用云进行搜索、数据挖掘和多媒体处理。为了保护处理后的数据,安全服务,即加密、解密、身份验证等,都在云中执行。通常,我们可以将云安全服务分为两类:关键安全(CS)服务和正常安全(NS)服务。CS服务提供了较长的密钥大小、严格的安全访问策略、隔离数据保护等强大的安全保护。CS服务通常会占用更多的云计算资源,但它会给云提供商带来更多的回报,因为CS服务用户使用CS服务需要支付更多的费用。随着CS和NS业务用户数量的增加,考虑云资源的消耗和云用户产生的收入,分配云资源以最大化系统回报是很重要的。为了解决这个问题,我们提出了一个基于半马尔可夫决策过程的安全服务准入模型(SSAM)来为云提供商建模系统奖励。首先,我们通过一个元组定义系统状态,该元组由云用户数量及其相关的安全服务类别和当前事件类型(即到达或离开)表示。然后,利用所提出的SSAM算法推导出系统稳态概率和服务请求阻塞概率。数值计算结果表明,所得的理论概率与仿真结果一致。
{"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 移动自组织网络中的串通注入攻击
Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928815
Farah I. Kandah, Yashaswi Singh, Chonggang Wang
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.
笔记本电脑、个人数字助理(PDA)和802.11/Wi-Fi无线网络的发展,使得移动自组网(MANET)和机器对机器(M2M)成为最近热门的研究课题。随着人们对M2M和manet的关注越来越多,在这些网络中管理和部署的安全问题变得更加重要和紧迫。灵活的部署特性和缺乏固定的基础设施使得manet面临各种安全攻击。在本文中,我们展示了攻击者如何通过在网络中注入恶意节点来利用MANET中的串通攻击,同时对其他合法节点隐藏其身份。我们将这种攻击命名为“串通注入攻击”(CIA)。这些注入的节点将共同在网络中产生严重的攻击,其目的是在任意节点上产生碰撞,从而导致被攻击节点无法接收或中继任何数据包。因此,该节点可能被同一邻域的任何其他节点错误地报告为具有恶意行为,或者如果它是目的节点,则可能被报告为不可达。仿真结果表明,发起串通注入攻击(CIA)的对手的存在会误导先前攻击检测方案的决策。
{"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 利用有偏随机漫步分析曼哈顿地区机会性单副本投递的平均延迟
Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928877
J. Jun, W. Fu, D. Agrawal
In Mobile Opportunistic Networks, the cost and effectiveness of any opportunistic forwarding is measured by the expected delay of a message. Hence, its critical goal is to have low delay for a message. This paper studies the average delay of a message in a Mobile Opportunistic Network on Manhattan area. We first model the mobility of a message as a biased random walk in tilted grid and analyze the delay of a message based on the hitting time of a bias random walk. We have derived an exact expression of expected delay for a walk starting from any point in tilted grid for both biased and unbiased random walks and provide a closed form approximation of average delay of a message for the case of unbiased random walk. The key result is that the average delay of a message in Mobile Opportunistic Networks is very sensitive to the biased level of a random walk at each stage of the walk (depends on the distance from destination at its current stage). Then, this key result explains why most of the smart message forwarding algorithm in Mobile Opportunistic Network works reasonably well.
在移动机会网络中,任何机会转发的成本和有效性都是通过消息的预期延迟来衡量的。因此,它的关键目标是为消息提供低延迟。本文研究了曼哈顿地区移动机会网络中报文的平均时延。我们首先将消息的移动性建模为倾斜网格中的有偏随机漫步,并根据有偏随机漫步的命中时间分析消息的延迟。对于有偏随机漫步和无偏随机漫步,我们导出了从倾斜网格中任意点出发的期望延迟的精确表达式,并提供了无偏随机漫步情况下消息平均延迟的封闭近似。关键的结果是,在移动机会网络中,消息的平均延迟对随机行走的每个阶段的偏差水平非常敏感(取决于当前阶段与目的地的距离)。然后,这一关键结果解释了为什么大多数智能消息转发算法在移动机会网络中工作得相当好。
{"title":"Average delay analysis of opportunistic single copy delivery in Manhattan area using biased random walk","authors":"J. Jun, W. Fu, D. Agrawal","doi":"10.1109/INFCOMW.2011.5928877","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928877","url":null,"abstract":"In Mobile Opportunistic Networks, the cost and effectiveness of any opportunistic forwarding is measured by the expected delay of a message. Hence, its critical goal is to have low delay for a message. This paper studies the average delay of a message in a Mobile Opportunistic Network on Manhattan area. We first model the mobility of a message as a biased random walk in tilted grid and analyze the delay of a message based on the hitting time of a bias random walk. We have derived an exact expression of expected delay for a walk starting from any point in tilted grid for both biased and unbiased random walks and provide a closed form approximation of average delay of a message for the case of unbiased random walk. The key result is that the average delay of a message in Mobile Opportunistic Networks is very sensitive to the biased level of a random walk at each stage of the walk (depends on the distance from destination at its current stage). Then, this key result explains why most of the smart message forwarding algorithm in Mobile Opportunistic Network works reasonably well.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"12 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":"128717654","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
期刊
2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1