2008 IEEE Globecom Workshops最新文献

筛选
英文 中文
CASCADE: Cluster-Based Accurate Syntactic Compression of Aggregated Data in VANETs 级联:基于聚类的VANETs中聚合数据的精确语法压缩
2008 IEEE Globecom Workshops Pub Date : 2008-11-01 DOI: 10.1109/GLOCOMW.2008.ECP.59
Khaled Ibrahim, Michele C. Weigle
{"title":"CASCADE: Cluster-Based Accurate Syntactic Compression of Aggregated Data in VANETs","authors":"Khaled Ibrahim, Michele C. Weigle","doi":"10.1109/GLOCOMW.2008.ECP.59","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2008.ECP.59","url":null,"abstract":"We present a method for accurate aggregation of highway traffic information in vehicular ad hoc networks (VANETs). Highway congestion notification applications need to disseminate information about traffic conditions to distant vehicles. In dense traffic, aggregation is needed to allow a single frame to carry information about a large number of vehicles. Our technique, CASCADE, uses compression to provide aggregation without losing accuracy. We show that CASCADE makes efficient use of the wireless channel while providing each vehicle with data that is highly accurate, represents a large area in front of the vehicle, and can be combined with aggregated data from other vehicles to further extend the covered area.","PeriodicalId":410930,"journal":{"name":"2008 IEEE Globecom Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117344314","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}
引用次数: 109
EVCCM: An Efficient VOIP Congestion Control Mechanism EVCCM:一个有效的VOIP拥塞控制机制
2008 IEEE Globecom Workshops Pub Date : 2008-11-01 DOI: 10.1109/GLOCOMW.2008.ECP.26
Ming Cao, H. Otrok, Benwen Zhu, N. Mohammed, P. Bhattacharya
{"title":"EVCCM: An Efficient VOIP Congestion Control Mechanism","authors":"Ming Cao, H. Otrok, Benwen Zhu, N. Mohammed, P. Bhattacharya","doi":"10.1109/GLOCOMW.2008.ECP.26","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2008.ECP.26","url":null,"abstract":"Voice over Internet protocol (VOIP) technology has been widely adopted in communication middleware systems that allow service providers to construct web based applications, such as Web conference systems (WebEx, Gotomeeting), IP based call centers and Web chatting. VOIP is vulnerable to network congestion if too many users access the Web service based VOIP at the same time, especially the services that coordinate with video transmission. VOIP signaling is usually implemented in User Datagram Protocol (UDP). Since UDP cannot verify the packets arrival, the congested network causes IP packets to be lost, delayed or even denial of service and greatly damages the service providers' reputation. We apply mechanism design, an application of game theory, to VOIP middleware management to defend such congested phone calls. Using the proposed model, users play their best options (ex: voice quality and price) to connect to the service. Service providers will provide users' service based on the users' options to maximize service providers' benefits, such as the number of active online users, service fee and system resource usage, to defend the congestion in the network and improve the network performance. In particular, our proposed model is a win-win solution in the way that maximizes both users and service providers' benefits. Finally, empirical results are provided to support our solution.","PeriodicalId":410930,"journal":{"name":"2008 IEEE Globecom Workshops","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125577267","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
Optimal Configuration of Mobility Agents in Broadband Wireless Access Networks 宽带无线接入网中移动代理的优化配置
2008 IEEE Globecom Workshops Pub Date : 2008-11-01 DOI: 10.1109/GLOCOMW.2008.ECP.92
A. D. Pragad, V. Friderikos, A. Aghvami
{"title":"Optimal Configuration of Mobility Agents in Broadband Wireless Access Networks","authors":"A. D. Pragad, V. Friderikos, A. Aghvami","doi":"10.1109/GLOCOMW.2008.ECP.92","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2008.ECP.92","url":null,"abstract":"The next generation broadband wireless access networks are expected to support a variety of multimedia rich applications which can lead to very high traffic demand. With the development of high speed radio access technologies the backhaul network can become the bottleneck if not upgraded and configured optimally to support the expected increase in date rates and traffic demands. To deliver high data rates, the cell sizes are expected to become smaller which would lead to an increase in handover frequency thus exemplifying the importance of micro- mobility support. This paper addresses the issue of optimizing the wireless access networks that deploy mobility agents (MA) for micro-mobility support. The novel contributions are in providing a solution for finding the optimal number and location of MAs and assignment of Access routers (AR) to MAs (MA domain) that minimize both the handover signaling and routing overheads. The location, number and the domain of MAs (number of ARs a MA serves) deployed within access networks can affect the performance of the entire network. We first analyze the significant impact that the MA location has on the routing and mobility overhead cost. We subsequently formulate the problem as a generalized facility location problem that takes into account the routing cost from the gateway to the ARs through the MA and also the local and global mobility management handover costs. The solution of the optimization problem shows that by having optimal configuration of MAs there can be considerable improvement in the network performance and overheads can be reduced considerably.","PeriodicalId":410930,"journal":{"name":"2008 IEEE Globecom Workshops","volume":"19 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125909202","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}
引用次数: 10
Opportunities, Requirements and Challenges for Storing Network Management Information in a Decentralized Way 网络管理信息分散存储的机遇、需求与挑战
2008 IEEE Globecom Workshops Pub Date : 2008-11-01 DOI: 10.1109/GLOCOMW.2008.ECP.20
M. Brunner, Frank-Uwe Andersen
{"title":"Opportunities, Requirements and Challenges for Storing Network Management Information in a Decentralized Way","authors":"M. Brunner, Frank-Uwe Andersen","doi":"10.1109/GLOCOMW.2008.ECP.20","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2008.ECP.20","url":null,"abstract":"The upcoming peer-to-peer (P2P) and other decentralized, co-operative storage mechanisms allow for decentralized storage of data as well as decentralized search, depending on the specific system. In this work, we assume these kinds of systems to store management information into it. We discuss some of the opportunities, requirements, and challenges when storing network management information decentralized. Additionally, we discuss some issue, when we assume the management plane itself being decentralized, adding the aspect of distributed processing. Distribution of storage and processing resources make the use of such systems very helpful, but still require some changes from today's known systems, which are typically targeted to store content for end-users, for example in file-sharing or content delivery networks (CDN).","PeriodicalId":410930,"journal":{"name":"2008 IEEE Globecom Workshops","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124998577","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}
引用次数: 2
ROADMs: Foundation for True Reconfigurable Optical Networking roadm:真正可重构光网络的基础
2008 IEEE Globecom Workshops Pub Date : 2008-11-01 DOI: 10.1109/GLOCOMW.2008.ECP.47
T. S. El-Bawab
{"title":"ROADMs: Foundation for True Reconfigurable Optical Networking","authors":"T. S. El-Bawab","doi":"10.1109/GLOCOMW.2008.ECP.47","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2008.ECP.47","url":null,"abstract":"The Reconfigurable Optical Add/Drop Multiplexer (ROADM) is an important building block of next-generation optical networks. Recent progress in optical device and system technologies enabled cost-effective realization of innovative agile ROADM architectures. These architectures are highly desirable today for service provider networks. Both telecommunication service providers (Telcos) and Cable Multiple Service Operators (MSOs) are utilizing ROADMs to face the increasing growth of broadband-access, video-on-demand services, and the demand for triple-play (delivery of voice, data, and video to end customers).","PeriodicalId":410930,"journal":{"name":"2008 IEEE Globecom Workshops","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128357157","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}
引用次数: 2
Efficient Link-to-System Level Model for MIMO HSDPA MIMO HSDPA的链路到系统级高效模型
2008 IEEE Globecom Workshops Pub Date : 2008-11-01 DOI: 10.1109/GLOCOMW.2008.ECP.83
M. Wrulich, S. Eder, Ingo Viering, Markus Rupp
{"title":"Efficient Link-to-System Level Model for MIMO HSDPA","authors":"M. Wrulich, S. Eder, Ingo Viering, Markus Rupp","doi":"10.1109/GLOCOMW.2008.ECP.83","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2008.ECP.83","url":null,"abstract":"To assess the performance of future mobile network technologies, system level simulations are crucial. They serve to identify whether, and to which amount, predicted link level performance gains are obtained in an entire network. In this paper, we present a computationally efficient link-to-system level model for system-level evaluations of multiple-input multiple- output (MIMO) high-speed downlink packet access (HSDPA), including double-stream transmit antenna array (D-TxAA) as a special case. The model is based on a fairly general structure which also allows for the mapping of more than two independent streams. We base the description on the post-equalization signal- to-interference-and-noise ratio (SINR) and represent it in a so- called \"fading-parameter\" structure, which leads to a nice split of the individual interference terms - which can be used e.g. for receiver optimization. These fading-parameters furthermore allow for a generation prior to the system level simulation itself, which reduces the computational burden significantly.","PeriodicalId":410930,"journal":{"name":"2008 IEEE Globecom Workshops","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115159435","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}
引用次数: 35
A User Driven Dynamic Circuit Network Implementation 一个用户驱动的动态电路网络实现
2008 IEEE Globecom Workshops Pub Date : 2008-10-01 DOI: 10.1109/GLOCOMW.2008.ECP.14
C. Guok, D. Robertson, E. Chaniotakis, M. Thompson, W. Johnston, B. Tierney
{"title":"A User Driven Dynamic Circuit Network Implementation","authors":"C. Guok, D. Robertson, E. Chaniotakis, M. Thompson, W. Johnston, B. Tierney","doi":"10.1109/GLOCOMW.2008.ECP.14","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2008.ECP.14","url":null,"abstract":"The requirements for network predictability are becoming increasingly critical to the DOE science community where resources are widely distributed and collaborations are world-wide. To accommodate these emerging requirements, the energy sciences network has established a science data network to provide user driven guaranteed bandwidth allocations. In this paper we outline the design, implementation, and secure coordinated use of such a network, as well as some lessons learned.","PeriodicalId":410930,"journal":{"name":"2008 IEEE Globecom Workshops","volume":"345 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134232911","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}
引用次数: 65
What is the Best Achievable QoS for Unicast Routing in VANETs? vanet中单播路由的最佳可实现QoS是什么?
2008 IEEE Globecom Workshops Pub Date : 1900-01-01 DOI: 10.1109/GLOCOMW.2008.ECP.69
Mate Boban, Geoff Misek, O. Tonguz
{"title":"What is the Best Achievable QoS for Unicast Routing in VANETs?","authors":"Mate Boban, Geoff Misek, O. Tonguz","doi":"10.1109/GLOCOMW.2008.ECP.69","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2008.ECP.69","url":null,"abstract":"Significant efforts and studies were recently reported for enabling active safety, traffic management, and commercial applications in Vehicular Ad Hoc Networks (VANET), since these applications are the drivers of the recent surge in VANET research and development. However, very few research efforts considered analyzing the Quality of Service (QoS) metrics that will be available to these applications in VANET. Furthermore, although there are many proposed solutions for routing in VANET, it is still unclear as to what specific characteristics VANET routing protocols should possess, since none of the proposed solutions achieves optimum performance in both urban and highway, as well as sparse and dense environment. To shed light on these issues, in this paper we analyze some of the most important QoS metrics in VANET. Namely, we determine the upper performance bound for connection duration, packet delivery ratio, end-to-end delay, and jitter for unicast communication in typical highway and urban VANET environments. According to our results, delay and jitter in VANET would be adequate for most of the envisioned unicast-based applications, whereas the packet delivery ratio and connection duration might not meet the requirements for most unicast-based applications.","PeriodicalId":410930,"journal":{"name":"2008 IEEE Globecom Workshops","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114816849","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
Simple Closed-Form Channel Capacity Formulas for the SIMO Nakagami Channel SIMO Nakagami通道的简单封闭式通道容量公式
2008 IEEE Globecom Workshops Pub Date : 1900-01-01 DOI: 10.1109/GLOCOMW.2008.ECP.97
E. Vagenas, P. Karadimas, S. Kotsopoulos
{"title":"Simple Closed-Form Channel Capacity Formulas for the SIMO Nakagami Channel","authors":"E. Vagenas, P. Karadimas, S. Kotsopoulos","doi":"10.1109/GLOCOMW.2008.ECP.97","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2008.ECP.97","url":null,"abstract":"This paper presents simple closed-form expressions for the ergodic channel capacity of SIMO (single-input and multiple output) wireless systems operating in a Nakagami fading channel. As the performance of SIMO channel is closely related to the diversity combining techniques, we present close form expressions for the capacity of maximal ratio combining (MRC), equal gain combining (EGC) and selection combining (SC) diversity systems for Nakagami fading channels. Also for the first time in international literature, the ergodic capacity of a SIMO system in a Nakagami fading channel with none diversity combining technique applied, is derived. Finally numerical results are presented for illustration.","PeriodicalId":410930,"journal":{"name":"2008 IEEE Globecom Workshops","volume":"331 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121607433","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}
引用次数: 2
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学术官方微信