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

2013 IEEE Global Communications Conference (GLOBECOM)最新文献

筛选
英文 中文
AAF: Analog superposition assisted forwarding node selection and density estimation in vehicular networks 模拟叠加辅助车辆网络转发节点选择与密度估计
2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831132
P. Sahu, A. Hafid
{"title":"AAF: Analog superposition assisted forwarding node selection and density estimation in vehicular networks","authors":"P. Sahu, A. Hafid","doi":"10.1109/GLOCOM.2013.6831132","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831132","url":null,"abstract":"In this paper, we propose an efficient forwarding node selection and density estimation mechanisms for vehicular networks (VANETs). Density estimation is performed without using beacons. Basically, the transmission range is divided into segments. Then, we apply a superposition based analog signal transmission and exploit multi-user capability of OFDM to collect density in each lane and in each segment. With such fine-grained information, a farthest node can be successfully located and selected as the forwarder. The one hop delay is substantially reduced by reducing the contention time and relying mostly on signals instead of control packets to assist the forwarder node selection process. In the simulations, it is observed that the proposed protocol accurately estimates the node density. Also, it outperforms existing multi-hop broadcast protocols in terms of end-to-end delay.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124974873","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
A framework for reliable reception of wireless metering data using protocol side information 一个使用协议侧信息可靠接收无线计量数据的框架
2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831468
R. M. Jacobsen, P. Popovski
{"title":"A framework for reliable reception of wireless metering data using protocol side information","authors":"R. M. Jacobsen, P. Popovski","doi":"10.1109/GLOCOM.2013.6831468","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831468","url":null,"abstract":"Stationary collectors reading wireless, battery powered smart meters, often operate in harsh channel conditions to cut network installation cost to a minimum, challenging the individual link to each meter. The desired performance measure is reliable reception of at least some data from as many as possible meters, rather than maximizing the number of received packets from one meter. We consider a method for improving the reliable reception in a metering system that operates under the constraints of the popular Wireless M-Bus protocol. We develop a framework for reliable reception in which we use the deterministic protocol structure to obtain side information and group the packets from the same meter. We derive the probability of falsely pairing packets from different senders in the simple case of no channel errors, and show through simulation and data from an experimental deployment the probability of false pairing with channel errors. The pairing is an essential step towards recovery of metering data from as many as possible meters under harsh channel conditions. From the experiment we find that more than 15% of all conducted pairings are between two erroneous packets, which sets an upper bound on the number of additional meters that can be reliably recovered.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124981788","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
Contention based multi-channel MAC protocol for distributed cognitive radio networks 分布式认知无线网络中基于争用的多通道MAC协议
2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831241
S. Debroy, S. De, M. Chatterjee
{"title":"Contention based multi-channel MAC protocol for distributed cognitive radio networks","authors":"S. Debroy, S. De, M. Chatterjee","doi":"10.1109/GLOCOM.2013.6831241","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831241","url":null,"abstract":"Design of an efficient medium access control protocol is critical for proper functioning of a distributed cognitive radio network and better utilization of the available channels not being used by primary users. In this paper, we design a contention based distributed medium access control (MAC) protocol for the secondary users' channel access. The proposed MAC protocol allows collision-free access of the available channels and eventual utilization by secondary users, with spectrum sensing part being handled by exclusive sensing nodes. The effectiveness of the proposed MAC protocol is evaluated analytically and also through empirical simulations. We show how the protocol performs with respect to blocking probability, channel grabbing, and channel utilization.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"16 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123450003","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
An incentive scheme based on heterogeneous belief values for crowd sensing in mobile social networks 基于异质信念值的移动社交网络人群感知激励方案
2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831321
Jiajun Sun
{"title":"An incentive scheme based on heterogeneous belief values for crowd sensing in mobile social networks","authors":"Jiajun Sun","doi":"10.1109/GLOCOM.2013.6831321","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831321","url":null,"abstract":"Crowd sensing is a new paradigm which exploits pervasive mobile devices to provide complex sensing services in mobile social networks (MSNs). To achieve good service quality for crowd sensing applications, incentive mechanisms are indispensable to attract more participants. Most of existing research apply only for the offline sensing data collections, where all participants' information are known a priori. In contrast, we focus on a more real scenario requiring a continuous crowd sensing. We model the problem as a restless multi-armed bandit process rather than a regular auction, where users submit their bids to the server over time, and the server choose a subset of users to collect sensing data. In this paper, to maximize the social welfare for the infinite horizonal continuous sensing, we design an incentive scheme based on heterogeneous belief values for joint social states and realtime throughput. Analysis results indicate that our algorithm is not only near optimal and stable, but truthful, individually rational, profitable, and computationally efficient.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125397816","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}
引用次数: 25
CaSRA: An algorithm for cognitive tethering in dense wireless areas CaSRA:一种密集无线区域的认知捆绑算法
2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831674
Haleh Tabrizi, G. Farhadi, J. Cioffi
{"title":"CaSRA: An algorithm for cognitive tethering in dense wireless areas","authors":"Haleh Tabrizi, G. Farhadi, J. Cioffi","doi":"10.1109/GLOCOM.2013.6831674","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831674","url":null,"abstract":"This paper investigates the performance gain obtained by creating a hotspot-slave configuration of nodes in densely populated areas. In doing so, a semi-distributed algorithm, referred to as CaSRA (Clustering and Spectrum assignment and Resource Allocation), that allows the hotspots to tether over locally available white-spaces is proposed. CaSRA, performs in three-steps: 1) clusters the nodes based on the K-means clustering algorithm, 2) assigns white-space spectrum to each cluster based on a distributed graph-coloring approach to maximize spectrum reuse, and 3) allocates physical layer resources to individual users based on local channel information. Unlike small cells (femtocells, relays, and WiFi networks), this approach does not require any additions to the existing infrastructure, but allows the nodes, themselves, to act as hotspots. Simulation results show that given fixed amount of network resources, the proposed algorithm can significantly improve the overall performance of network users.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125531337","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
4-way handshaking protection for wireless mesh network security in smart grid 智能电网无线网状网络安全的四向握手保护
2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831169
H. Gharavi, Bin Hu
{"title":"4-way handshaking protection for wireless mesh network security in smart grid","authors":"H. Gharavi, Bin Hu","doi":"10.1109/GLOCOM.2013.6831169","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831169","url":null,"abstract":"Wireless mesh/sensor networks offer various unique features such as self-configuration, ease of installation, scalability, and self-healing, which make them very attractive for deployment in various smart grid domains, such as Home Area Networks (HAN), Neighborhood Area Networks (NAN), and substation/plant-generation local area networks for real-time monitoring and control. Their main drawback is that they are more exposed to cyber-attack as data packets have to be relayed on a hop-by-hop basis. This paper presents a dynamically updating key distribution strategy, together with a message protection scheme in support of 4-way handshaking. For the 4-way handshaking, we propose a hash based encryption scheme to secure the unprotected message exchanges during the handshaking process. This is aimed at improving the resiliency of the network in the situation where an intruder carries a denial of service attack. We then evaluate the security of the proposed scheme against cyber-attack, as well as network performance in terms of delay and overhead.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"175 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126939254","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
Fingerprinting data fusion for NTRIP streaming availability 指纹数据融合的NTRIP流可用性
2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831329
Filippo Basso, J. Rodrigues, Jaime Lloret
{"title":"Fingerprinting data fusion for NTRIP streaming availability","authors":"Filippo Basso, J. Rodrigues, Jaime Lloret","doi":"10.1109/GLOCOM.2013.6831329","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831329","url":null,"abstract":"Combining evaluations of different kinds, like of user feedback origin, is often a necessary optimization step in communications software and in several applied areas that require personalized or statistical customization. This paper is introducing a fingerprinting fusion approach to identify the optimal operator inside a family of well known and identified as suitable information retrieval data-fusion methods; even if the approach was identified to address an issue related to the identification of the optimal streaming server for differential positional data from satellite systems, the model presented and the methodology followed define a multidisciplinary approach that can be utilized in several experimental areas utilizing information retrieval data-fusion methods. A mobile prototype was developed and simulation data was utilized to experiment and evaluate the proposal, with good results, identifying that for the specific representation a linear operator that outperforms weighted CombSUM and CombMAX.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114945107","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
A comparative study of Content-Centric and Content-Distribution Networks: Performance and bounds 内容中心网络与内容分发网络的比较研究:性能与界限
2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831270
M. Mangili, F. Martignon, A. Capone
{"title":"A comparative study of Content-Centric and Content-Distribution Networks: Performance and bounds","authors":"M. Mangili, F. Martignon, A. Capone","doi":"10.1109/GLOCOM.2013.6831270","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831270","url":null,"abstract":"The Content-Centric Networking paradigm aims at improving the Quality of Service of the Internet by providing innovative features to better handle digital content distribution. A major step towards the success of this novel paradigm is to analyze and compare its performance with respect to the most popular ways in which content is disseminated in today's IP Internet. In this paper we give clear answers to this critical issue by proposing a methodology to assess how the innovative design of Content-Centric Networking behaves as opposed to the solution proposed by Content-Distribution Networks. We develop a novel optimization model to study the performance bounds of a Content-Centric Network, by addressing the joint object placement and routing problem. We further introduce three comparative models that well describe 1) a Content-Distribution Network, 2) a traditional IP-based network, and 3) a Content-Centric Network whose caches are pre-populated with given contents. To the best of our knowledge, our proposal is the first that studies the performance bounds of Content-Centric Networks by means of an optimization model. Finally, we discuss the numerical results showing the performance bounds of this revolutionary paradigm. We discover that: 1) a Content-Centric Network with small caches can provide significant performance gains compared to a traditional IP-based network; 2) for large amounts of caching storage, the benefits of using sophisticated cache replacement policies are dramatically reduced and 3) in some scenarios, a Content-Distribution Network with few replica servers can perform better than a Content-Centric Network, even when the total amount of available caching storage is exactly the same.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115333336","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
Relay selection and discrete power control in cognitive relay networks using learning automata 基于学习自动机的认知中继网络中继选择与离散功率控制
2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831712
Wei Zhong, Gang Chen, Shi Jin
{"title":"Relay selection and discrete power control in cognitive relay networks using learning automata","authors":"Wei Zhong, Gang Chen, Shi Jin","doi":"10.1109/GLOCOM.2013.6831712","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831712","url":null,"abstract":"This paper investigates the joint relay selection and discrete power control in cognitive relay networks through a game theoretic approach. Using the rate of cognitive relay network as the common utility, we firstly formulate the problem of the joint relay selection and discrete power control as a noncooperative game. Then, we prove that the proposed game is a potential game which possess at least one pure strategy Nash equilibrium (NE) and the optimal strategy profile which maximizes the rate of the cognitive relay network constitutes a pure strategy NE of our proposed game. We prove that, under mild conditions, our proposed game can guarantee the feasibility of the pure strategy NE without the advance knowledge of the infeasible strategy profiles. Then we design a decentralized stochastic learning algorithm based on learning automata and prove that the proposed algorithm can converge to a pure strategy NE. Numerical results show that our proposed algorithm has good convergence and promising performance.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122314110","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
The Stanford UltraFlow access: Architecture and hierarchical scheduling 斯坦福超低接入:架构和分层调度
2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831479
T. Shen, A. R. Dhaini, Shuang Yin, Benjamin A. Detwiler, M. D. Leenheer, L. Kazovsky
{"title":"The Stanford UltraFlow access: Architecture and hierarchical scheduling","authors":"T. Shen, A. R. Dhaini, Shuang Yin, Benjamin A. Detwiler, M. D. Leenheer, L. Kazovsky","doi":"10.1109/GLOCOM.2013.6831479","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831479","url":null,"abstract":"UltraFlow - also known as Optical Flow Switching (OFS) has been recently presented as an effective technology for large Internet data transfer. In this paper, we propose a novel scheduling mechanism for the Stanford UltraFlow access network, a novel optical access network architecture that offers dual-mode service to the end-users: legacy IP and OFS. The proposed scheme is a hybrid mechanism that combines the batch scheduling technique with existing methods so as to increase the average Flow throughput, while maintaining relatively low traffic latency. Extensive simulations highlight the advantages of the proposed solution and demonstrate its merits.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122584181","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学术官方微信