发布求助
文献互助 智能选刊 最新文献

... IEEE Global Communications Conference. IEEE Global Communications Conference最新文献

筛选
英文 中文
Effectively auditing IaaS cloud servers 有效审计IaaS云服务器
... IEEE Global Communications Conference. IEEE Global Communications Conference Pub Date : 2013-01-01 DOI: 10.1109/GLOCOM.2013.6831151
Chunlu Wang, Chuanyi Liu, Xiaoliang Wang, Yingfei Dong
{"title":"Effectively auditing IaaS cloud servers","authors":"Chunlu Wang, Chuanyi Liu, Xiaoliang Wang, Yingfei Dong","doi":"10.1109/GLOCOM.2013.6831151","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831151","url":null,"abstract":"","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"316 1","pages":"682-688"},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80110993","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}
引用次数: 0
Double auction-based optimal relay assignment for many-to-many cooperative wireless networks 基于双拍卖的多对多协作无线网络中继最优分配
... IEEE Global Communications Conference. IEEE Global Communications Conference Pub Date : 2012-12-01 DOI: 10.1109/GLOCOM.2012.6503348
Yong Wang, Yun Li, Xiaolong Yang, Chao Liao, Quan Chen
{"title":"Double auction-based optimal relay assignment for many-to-many cooperative wireless networks","authors":"Yong Wang, Yun Li, Xiaolong Yang, Chao Liao, Quan Chen","doi":"10.1109/GLOCOM.2012.6503348","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503348","url":null,"abstract":"Recently, as it can increase the capacity of wireless networks greatly through spatial diversity by taking advantage of antennas on other nodes, cooperative communication (CC) has been obtaining more and more attention. However, as the selfish nature, the wireless node may be unwilling to serve as relay node if they can't get the corresponding reward. In this paper, we constructs a real double-auction scenario between source nodes and relay nodes instead of idealized truthful market which may obtain relatively lower system performance. We consider the system performance involving (1) successful source-relay pairs, (2) system capacity and (3) social welfare (SW). We transform the double auction-based optimal relay assignment problem into Maximum Matching (MM) and Maximum Weighted Matching (MWM) problem respectively and solve them using corresponding algorithms. Extensive experiments show that this mechanism can achieve higher system efficiency than truthful auction.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"59 1","pages":"1635-1640"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73325305","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
Energy-efficient power allocation in cognitive sensor networks: A game theoretic approach 认知传感器网络中的节能功率分配:一种博弈论方法
... IEEE Global Communications Conference. IEEE Global Communications Conference Pub Date : 2012-12-01 DOI: 10.1109/GLOCOM.2012.6503148
Bo Chai, Ruilong Deng, Peng Cheng, Jiming Chen
{"title":"Energy-efficient power allocation in cognitive sensor networks: A game theoretic approach","authors":"Bo Chai, Ruilong Deng, Peng Cheng, Jiming Chen","doi":"10.1109/GLOCOM.2012.6503148","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503148","url":null,"abstract":"In this paper, we study power allocation in cognitive sensor networks where cognitive users (cognitive enabled sensor nodes) opportunistically share a common spectrum with primary users (licensed devices). We define an energy efficiency-oriented utility function as a new metric to evaluate power allocation. Consider that sensor nodes are self-interested to maximize their own utility, we formulate the energy efficient power allocation problem as a non-cooperative game. We firstly prove that there exist Nash equilibriums in the proposed game. Secondly, we prove that the power allocation game is a supermodular game with some conditions. Finally, we use best response algorithm to identify the Nash equilibrium. Simulations are conducted to demonstrate that the proposed power allocation strategy can achieve satisfactory performance in terms of energy efficiency, convergence speed and fairness in cognitive sensor networks.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"33 1","pages":"416-421"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76400103","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}
引用次数: 19
Capacity analysis and power allocation under imperfect channel estimation for AF-based cooperative relay systems 基于af的协同中继系统不完全信道估计下的容量分析与功率分配
... IEEE Global Communications Conference. IEEE Global Communications Conference Pub Date : 2012-12-01 DOI: 10.1109/GLOCOM.2012.6503857
Chin-Liang Wang, Jyun-Yu Chen, Hung-Chin Wang
{"title":"Capacity analysis and power allocation under imperfect channel estimation for AF-based cooperative relay systems","authors":"Chin-Liang Wang, Jyun-Yu Chen, Hung-Chin Wang","doi":"10.1109/GLOCOM.2012.6503857","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503857","url":null,"abstract":"In this paper, we investigate the effect of channel estimation errors on the capacity of amplify-and-forward cooperative relay systems. Since an exact capacity expression in the presence of channel estimation errors is difficult to be found, we turn to derive its lower bound instead. Accordingly, by maximizing the derived lower bound, we propose power allocation schemes for both single-relay and multi-relay systems. For single-relay systems, an analytical solution for inequality constrained problem is too complicated to be obtained. Thus, we propose a gradient descent algorithm with a log-barrier function to solve the inequality constrained problem. For multi-relay systems, in terms of the channel estimates and the corresponding mean-squared errors, we provide a water-filling solution for the optimal power allocation among the relays. Simulation results show that the proposed power allocation schemes yield capacity gain compared with equal power allocation at low to medium signal-to-noise ratios.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"65 1","pages":"4677-4682"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83951781","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}
引用次数: 7
A Congestion Level based end-to-end acknowledgement mechanism for Delay Tolerant Networks 延迟容忍网络中基于拥塞级别的端到端确认机制
... IEEE Global Communications Conference. IEEE Global Communications Conference Pub Date : 2012-12-01 DOI: 10.1109/GLOCOM.2012.6503338
Ying An, Jiawei Huang, Hong Song, Jianxin Wang
{"title":"A Congestion Level based end-to-end acknowledgement mechanism for Delay Tolerant Networks","authors":"Ying An, Jiawei Huang, Hong Song, Jianxin Wang","doi":"10.1109/GLOCOM.2012.6503338","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503338","url":null,"abstract":"End-to-end reliability in Delay Tolerant Networks (DTNs) is challenging and complicated because of high delay and absence of stable end-to-end path in the intermittently-connected mobile environment. Some existing acknowledgement mechanisms use active forwarding to provide the end-to-end reliability, while incurring excessive retransmissions or replications. The other passive mechanisms aim to reduce the storage overhead but may suffer a large delay. To improve the storage-delay tradeoff, we propose a Congestion Level based end-to-end ACKnowledgement (CL-ACK) mechanism, which adaptively adjusts the spread manner of ACK packets according to the ratio of drops over replications. Simulation results show that CL-ACK effectively controls resources consumption, reduces end-to-end delay, and achieves high message delivery rate.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"44 1","pages":"1574-1579"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90491858","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}
引用次数: 7
Energy efficient scheduling for delay constrained communication in wireless body area networks 基于时延约束的无线体域网络通信节能调度
... IEEE Global Communications Conference. IEEE Global Communications Conference Pub Date : 2012-12-01 DOI: 10.1109/GLOCOM.2012.6503123
Qinghua Shen, W. Zhuang
{"title":"Energy efficient scheduling for delay constrained communication in wireless body area networks","authors":"Qinghua Shen, W. Zhuang","doi":"10.1109/GLOCOM.2012.6503123","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503123","url":null,"abstract":"Delay constraint and sensor energy consumption requirements are two core issues for e-healthcare applications in wireless body area networks. In this paper, we investigate the data transmission scheduling problem to utilize the sleep and opportunistic transmission for energy efficiency, while guaran- teeing the worst-case delay for medical data transmission. To achieve sensor energy saving by exploiting propagation channel quality with a deterministic delay requirement poses challenges in developing a scheduling policy. We address this problem using a Lyapunov optimization formulation and propose a two-step scheduling algorithm. We prove that the algorithm can provide worst-case delay guarantee under certain conditions. Theoretical analysis and simulation results are presented to demonstrate the tradeoff between the transmission delay and energy consumption.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"14 1","pages":"262-267"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74691453","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
Peer selection in P2P file sharing systems over mobile cellular networks with consideration of downlink bandwidth limitation 考虑下行带宽限制的移动蜂窝网络P2P文件共享系统的对等点选择
... IEEE Global Communications Conference. IEEE Global Communications Conference Pub Date : 2012-12-01 DOI: 10.1109/GLOCOM.2012.6503406
Yan Zhang, Xu Zhou, Xuezhen Zhang, Shuhao Liu, D. Liao
{"title":"Peer selection in P2P file sharing systems over mobile cellular networks with consideration of downlink bandwidth limitation","authors":"Yan Zhang, Xu Zhou, Xuezhen Zhang, Shuhao Liu, D. Liao","doi":"10.1109/GLOCOM.2012.6503406","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503406","url":null,"abstract":"In P2P file sharing systems over mobile cellular networks, the bottleneck of file transfer speed is usually the downlink bandwidth of the receiver rather than the uplink bandwidth of the senders. In this paper we consider the impact of downlink bandwidth limitation on file transfer speed and propose two novel peer selection algorithms named DBaT-B and DBaT-N, which are designed for two different cases of the requesting peer's demand respectively. Our algorithms take the requesting peer's downlink bandwidth as the target of the sum of the selected peers' uplink bandwidth. To ensure load balance on cells, they will first choose a cell with the lowest traffic load before choosing each peer. We also provide a Fuzzy Cognitive Map that can be used to estimate peers' service ability in P2P systems over mobile cellular networks. Simulation results show that in respective cases DBaT-B and DBaT-N can both achieve much better load balance on cells than some traditional algorithms while ensuring favorable file transfer speed.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"40 1","pages":"1981-1987"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84588451","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}
引用次数: 0
Energy-efficient scheduling for wireless communication system 无线通信系统的节能调度
... IEEE Global Communications Conference. IEEE Global Communications Conference Pub Date : 2012-12-01 DOI: 10.1109/GLOCOM.2012.6503907
Kuhn-Chang Lin, Jiun-You Lai, Y. Su
{"title":"Energy-efficient scheduling for wireless communication system","authors":"Kuhn-Chang Lin, Jiun-You Lai, Y. Su","doi":"10.1109/GLOCOM.2012.6503907","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503907","url":null,"abstract":"Energy-efficient scheduling problem in wireless communication system is investigated in this paper. We propose two near-optimal schedulers which have simple structures for the general hard delay constraint scenario. Both single-user and multiuser cases are considered. The first scheduler invokes Gaussian approximation while the second one is inspired by the inverse water-filling (IWF) approach. The scheduling policies consist of a channel-awareness term and a delay-awareness term. Numerical results show that the proposed policies achieve near optimal performance when the total required transmit bits, R, is large. For the multiuser scenario, our scheduling strategy consists of an initial resource (number of time slots) allocation and a slot-by-slot user selection and bit loading algorithm. The former depends on the rate requirement and a priori knowledge of user-dependent channel statistic while the latter use an order statistic based approach designed to minimize the expected total energy consumption.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"82 1","pages":"4969-4974"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85409703","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
Towards active measurement for DNS query behavior of botnets 僵尸网络DNS查询行为主动测量研究
... IEEE Global Communications Conference. IEEE Global Communications Conference Pub Date : 2012-12-01 DOI: 10.1109/GLOCOM.2012.6503218
Xiaobo Ma, Jianfeng Li, Jing Tao, X. Guan
{"title":"Towards active measurement for DNS query behavior of botnets","authors":"Xiaobo Ma, Jianfeng Li, Jing Tao, X. Guan","doi":"10.1109/GLOCOM.2012.6503218","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503218","url":null,"abstract":"Domain names play an increasingly important role for the botnet activities. Traditionally, DNS traces from several local DNS servers are used passively to measure the DNS query behavior. However, since botnets are a wide-scale threat and usually reside in geographically dispersed networks, the vantage point of several local DNS servers is sometimes too small to help us understand the DNS query behavior (e.g., whether queried or not, average query rate) of botnets. In this paper, we actively measure the DNS query behavior of botnets in geographically dispersed networks via the DNS cache probing technique. We first analytically characterize how multiple domain names are queried by botnets in different networks under certain circumstances. Then, we actively measure real botnet samples in the wild to gain insight into how multiple domain names are queried by botnets in 480 geographically dispersed networks globally, and show that our analytical characterization well describes the DNS query behavior of the botnet samples. The active measurement technique can help to acquire extensive DNS query information in different networks and thus potentially facilitate various DNS-related research and applications.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"12 1","pages":"845-849"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82301012","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
An optimal scheduling for file dissemination under a full binary tree of trust relationship 基于信任关系的全二叉树下的最优文件传播调度
... IEEE Global Communications Conference. IEEE Global Communications Conference Pub Date : 2012-12-01 DOI: 10.1109/GLOCOM.2012.6503203
Chin-Fu Ku, Kai-Hsiang Yang, Jan-Ming Ho
{"title":"An optimal scheduling for file dissemination under a full binary tree of trust relationship","authors":"Chin-Fu Ku, Kai-Hsiang Yang, Jan-Ming Ho","doi":"10.1109/GLOCOM.2012.6503203","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503203","url":null,"abstract":"In network applications with security constraints, it is usually desirable to disseminate a file from a server through trusted network channels to a set of peers. This is a problem seldom studied in the literature though the problems of data integrity and security have been studied by many. In this paper, we study the file dissemination problem with trust relation modeled as a rooted full binary tree. We present the OOFD algorithm to schedule dissemination of the file iteratively from each peer holding a replica of the file to one of its descendants on the binary tree. We show that, in a homogeneous network, OOFD algorithm is optimum in the sense that time it takes to disseminate the file to all nodes is minimized.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"70 1","pages":"751-757"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89106820","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书