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

2008 IEEE Globecom Workshops最新文献

筛选
英文 中文
A Standard-Compliant Scheduler for WiMAX Networks 一种符合标准的WiMAX网络调度程序
2008 IEEE Globecom Workshops Pub Date : 2008-11-01 DOI: 10.1109/GLOCOMW.2008.ECP.74
J. Borin, N. D. da Fonseca
{"title":"A Standard-Compliant Scheduler for WiMAX Networks","authors":"J. Borin, N. D. da Fonseca","doi":"10.1109/GLOCOMW.2008.ECP.74","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2008.ECP.74","url":null,"abstract":"In order to support real-time and bandwidth demanding applications, the IEEE 802.16 standard is expected to provide quality of service (QoS). Although the standard defines a QoS signaling framework and five service levels, scheduling mechanisms for this network are unspecified. In this paper, we propose a scheduling scheme for the uplink traffic which is fully standard-compliant and can be easily implemented in the base station. Simulation results show that this scheme is able to meet the QoS requirements of the service flows.","PeriodicalId":410930,"journal":{"name":"2008 IEEE Globecom Workshops","volume":"34 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":"126759953","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}
引用次数: 5
Improvement on Flexibility of Fixed Multiplexing Radio Networks by Employing Cognitive Relay 利用认知中继提高固定复用无线网络的灵活性
2008 IEEE Globecom Workshops Pub Date : 2008-11-01 DOI: 10.1109/GLOCOMW.2008.ECP.88
Chunyi Song, Shaobo Qi, S. Shimamoto
{"title":"Improvement on Flexibility of Fixed Multiplexing Radio Networks by Employing Cognitive Relay","authors":"Chunyi Song, Shaobo Qi, S. Shimamoto","doi":"10.1109/GLOCOMW.2008.ECP.88","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2008.ECP.88","url":null,"abstract":"Fixed multiplexed access radio networks can realize collision-free transmission while suffering low flexibility, especially in ad hoc communication. This paper demonstrates that a dynamic spectrum access based cooperative relay technology, defined as cognitive relay, contributes toward improving the flexibility of fixed radio networks to bursty heavy traffic, unbalanced traffic loads and terminal mobility.","PeriodicalId":410930,"journal":{"name":"2008 IEEE Globecom Workshops","volume":"7 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":"115495257","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
Service Discovery and Service Access in Wireless Vehicular Networks 无线车载网络中的服务发现和服务访问
2008 IEEE Globecom Workshops Pub Date : 2008-11-01 DOI: 10.1109/GLOCOMW.2008.ECP.54
E. S. Coronado, S. Cherkaoui
{"title":"Service Discovery and Service Access in Wireless Vehicular Networks","authors":"E. S. Coronado, S. Cherkaoui","doi":"10.1109/GLOCOMW.2008.ECP.54","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2008.ECP.54","url":null,"abstract":"Robust and reliable service architectures must be designed to guarantee the success of future vehicular networks. This paper addresses service provisioning elements such as communication service models, service discovery and service access intended for vehicular environments. We propose a secure service access architecture based on the concept of district domains which are entities responsible for dispatching session parameters to on-demand users. The service architecture comprises the presence of public and private certificate authorities, session managers, policy entities, accounting and banking modules. The purpose of this architecture is to facilitate the delivery of secured information services offered at the roadside infrastructure.","PeriodicalId":410930,"journal":{"name":"2008 IEEE Globecom Workshops","volume":"53 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":"114602705","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}
引用次数: 14
Cluster Tree Based Self Organization of Virtual Sensor Networks 基于聚类树的虚拟传感器网络自组织
2008 IEEE Globecom Workshops Pub Date : 2008-11-01 DOI: 10.1109/GLOCOMW.2008.ECP.40
H. Bandara, A. Jayasumana, T. Illangasekare
{"title":"Cluster Tree Based Self Organization of Virtual Sensor Networks","authors":"H. Bandara, A. Jayasumana, T. Illangasekare","doi":"10.1109/GLOCOMW.2008.ECP.40","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2008.ECP.40","url":null,"abstract":"With recent advances enabling the deployment of large-scale collaborative Wireless Sensor Networks, numerous factors point to the need for sensor network deployments where subsets of nodes cooperate on specific tasks or networks supporting multiple applications. Virtual Sensor Networks (VSNs) is a concept to provide such support for the formation, usage, adaptation, and maintenance of subsets of sensors collaborating on a specific task(s). We describe a cluster tree based mechanism to form VSNs, facilitate inter-VSN and intra-VSN communication, and perform other VSN support functions. Simulation based results are used to evaluate its performance. The results indicate that cluster-tree based approach is significantly more efficient and reliable compared to random-routing based protocols.","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":"130305468","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}
引用次数: 41
An Efficient Protocol for Service Discovery in Wireless Sensor Networks 无线传感器网络中一种高效的服务发现协议
2008 IEEE Globecom Workshops Pub Date : 2008-11-01 DOI: 10.1109/GLOCOMW.2008.ECP.49
M. Kaur, S. Bhatt, L. Schwiebert, G. Richard
{"title":"An Efficient Protocol for Service Discovery in Wireless Sensor Networks","authors":"M. Kaur, S. Bhatt, L. Schwiebert, G. Richard","doi":"10.1109/GLOCOMW.2008.ECP.49","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2008.ECP.49","url":null,"abstract":"Service discovery is a widely researched topic in wireless networks. Existing protocols have significant overhead for service advertisement as well as service discovery, with many messages being transmitted in the network. This high overhead is not practical in resource-constrained wireless environments. We propose a simple service discovery protocol that aims at reducing the number of messages in the network while at the same time, keeping the waiting time for services to a minimum. We evaluate the performance of the protocol for a stationary wireless sensor network. We use remote procedure calls to request a service once it is discovered, which allows for richer and parameterized interaction with the sensor.","PeriodicalId":410930,"journal":{"name":"2008 IEEE Globecom Workshops","volume":"81 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":"124075971","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}
引用次数: 11
Connectivity Analysis of a Mobile Vehicular Ad Hoc Network with Dynamic Node Population 具有动态节点群的移动车辆自组织网络连通性分析
2008 IEEE Globecom Workshops Pub Date : 2008-11-01 DOI: 10.1109/GLOCOMW.2008.ECP.60
Jingxian Wu
{"title":"Connectivity Analysis of a Mobile Vehicular Ad Hoc Network with Dynamic Node Population","authors":"Jingxian Wu","doi":"10.1109/GLOCOMW.2008.ECP.60","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2008.ECP.60","url":null,"abstract":"Network connectivity is a critical metric for the planning, design, and evaluation of ad hoc networks. In this paper, the connectivity properties of a linear vehicular ad hoc network (VANET) with high speed mobile nodes and dynamic node populations are investigated. The nodes are assumed to be arriving at the network following a Poisson distribution, and the speed of each node is modeled as a wide sense stationary ergodic random process. Based on these assumptions, a new mobility model is developed to represent the steady state node distributions in terms of random node locations and random node populations. The mobility model accurately captures the statistical properties of a mobile network with rapidly changing network topologies and network densities. Exact closed-form connectivity probability expressions are developed with the assistance of the volume of an n-dimensional hypercube intersected by an n-dimensional hyperplane. The impacts of key network parameters, such as node arrival rate, random node speed, and node transmission range, are incorporated in the analytical expressions. The results can be used to determine the transmission power that can ensure network connectivity while minimizing interference in a VANET.","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":"131118647","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}
引用次数: 37
Passive Analysis of Web Traffic Characteristics for Estimating Quality of Experience 被动分析网络流量特征，评估体验质量
2008 IEEE Globecom Workshops Pub Date : 2008-11-01 DOI: 10.1109/GLOCOMW.2008.ECP.28
Imadud Din, N. Saqib, Adeel Baig
{"title":"Passive Analysis of Web Traffic Characteristics for Estimating Quality of Experience","authors":"Imadud Din, N. Saqib, Adeel Baig","doi":"10.1109/GLOCOMW.2008.ECP.28","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2008.ECP.28","url":null,"abstract":"Detecting user's quality of experience is a method which deals with estimating how a user perceives the network performance. Although user's behavior is very complex, only analyzing a large amount of operational network data enables us to effectively detect the users satisfaction from the network. One important parameter to detect user's behavior is user's interruption of the TCP connections in case of bad performance. In this paper we take passive network traffic measurements at the TCP flow level to monitor the effect of packet loss on Web traffic characteristics, such as TCP connection duration, size, and inter-arrival time of connections. From these traffic characteristics correlation with end user behavior (interruptions) is analyzed. Different trends are identified in the duration and size of connections with increasing loss rates. We explain and confirm the reasons for the different trends with different parameters. We discuss whether the end user behavior, such as interrupting connections, be identified from these traffic characteristics. We also want to know whether it provides us reasons for a connection being small or large, both in duration and size, due to user's behavior. A precise way of estimating packet losses for passive measurements is devised, giving a lower bound on the total packet losses in a TCP connection.","PeriodicalId":410930,"journal":{"name":"2008 IEEE Globecom Workshops","volume":"30 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":"115905162","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}
引用次数: 11
Large-Scale Peer-to-Peer Autonomic Monitoring 大规模点对点自主监控
2008 IEEE Globecom Workshops Pub Date : 2008-11-01 DOI: 10.1109/GLOCOMW.2008.ECP.18
J. Leitao, L. Rosa, L. Rodrigues
{"title":"Large-Scale Peer-to-Peer Autonomic Monitoring","authors":"J. Leitao, L. Rosa, L. Rodrigues","doi":"10.1109/GLOCOMW.2008.ECP.18","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2008.ECP.18","url":null,"abstract":"The increasing scale and complexity of distributed system motivates the need for autonomous management. One of the key aspects in the management of distributed systems is the issue of component monitoring. Component monitoring is particularly challenging in large-scale dynamic systems, given the need to ensure that each component is monitored by at least one non-faulty component, despite joins, leaves, and failures, both at node and at network level. This paper proposes that components self-organize in an unstructured overlay network of constant degree in order to ensure that each component is always monitored by a threshold of other components.","PeriodicalId":410930,"journal":{"name":"2008 IEEE Globecom Workshops","volume":"18 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":"115910455","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}
引用次数: 13
Reliable Broadcast Mechanism for the IEEE 802.16 Mesh Extension IEEE 802.16 Mesh扩展的可靠广播机制
2008 IEEE Globecom Workshops Pub Date : 2008-11-01 DOI: 10.1109/GLOCOMW.2008.ECP.94
A. Ziller, P. Mogre, M. Hollick, C. Schwingenschlogl
{"title":"Reliable Broadcast Mechanism for the IEEE 802.16 Mesh Extension","authors":"A. Ziller, P. Mogre, M. Hollick, C. Schwingenschlogl","doi":"10.1109/GLOCOMW.2008.ECP.94","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2008.ECP.94","url":null,"abstract":"The simultaneous transmission of data messages to a group of neighbors forms the basis for many essential services in wireless ad hoc and mesh networks, for example to communicate link status information or to assist route discovery. Despite the fact that communication on a wireless medium is inherently of broadcast nature, there exist situations, where data broadcasting is non-trivial. In particular, reservation-based medium access control (MAC) schemes such as employed in the optional mesh mode of the IEEE 802.16 standard are optimized with respect to maximizing the number of concurrent unicast transmissions. While broadcast control messages are supported in the standard, no mechanisms are specified to efficiently and reliably schedule broadcast data messages. We present an extension to the IEEE 802.16 standard, which enables a reliable, reservation-based broadcast method for usage within the mesh mode. We thoroughly analyze the performance of our mechanism vs. broadcast as unicast - currently the only feasible method to deliver broadcast data according to the standard. Our results indicate the superior performance of our scheme, i.e. a significant gain in broadcast efficiency as well as in broadcast reliability.","PeriodicalId":410930,"journal":{"name":"2008 IEEE Globecom Workshops","volume":"19 12 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":"115932484","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
Routing in Low Earth Orbit Satellite Systems Based on the Optimization 基于优化的近地轨道卫星系统路由
2008 IEEE Globecom Workshops Pub Date : 2008-11-01 DOI: 10.1109/GLOCOMW.2008.ECP.102
D. Yiltas, A. Halim Zaim
{"title":"Routing in Low Earth Orbit Satellite Systems Based on the Optimization","authors":"D. Yiltas, A. Halim Zaim","doi":"10.1109/GLOCOMW.2008.ECP.102","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2008.ECP.102","url":null,"abstract":"Since the satellites become more common for today's communication area, the process and the improvements in the satellite networks are gaining importance. One of the challenges in satellite networks is the routing operation between two end nodes, because, these networks have dynamic changing satellite movements. During these movements, a satellite can give its coverage area service order to one of its neighboring satellites. Also some calls can be blocked when the call densities exceed the communication link's capacities or the signals interfere with each other. All of these situations make the routing operation quite complicated. In this study, we design a new routing algorithm for low-earth orbit (LEO) satellite systems. We use dynamic satellite topologies containing different number of nodes. We apply the genetic algorithms during the optimization steps. We introduce a new objective function including the delay and the aging factor as the characteristic properties of the paths. Finally, we compare the paths with each other and select the optimal path having the best fitness value.","PeriodicalId":410930,"journal":{"name":"2008 IEEE Globecom Workshops","volume":"41 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":"127329546","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学术官方微信