{"title":"Technical and Regulatory Studies on HAPS","authors":"Jong Min Park, B. Ku, D. Oh","doi":"10.1109/GLOCOMW.2008.ECP.105","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2008.ECP.105","url":null,"abstract":"HAPS is a promising infrastructure for providing various wireless services such as mobile and fixed services in the global area with some advantages of both terrestrial and satellite networks. For implementation of HAPS, it is necessary to conduct technical studies to obtain its operational conditions and sharing criteria taking into account the impacts on other systems which might occur during its operation, and then regulatory studies to establish regulatory provisions or procedures to be applied to HAPS. This paper discusses the results of technical and regulatory studies on HAPS which have been conducted in ITU-R.","PeriodicalId":410930,"journal":{"name":"2008 IEEE Globecom Workshops","volume":"88 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":"115826836","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}
{"title":"Performance Evaluation of a Roadside-to-Vehicle Communication System Using Narrow Antenna Beam Switching Based on Traffic Flow Model","authors":"Kota Mase, Junji Inoue, Masafumi Kizu","doi":"10.1109/GLOCOMW.2008.ECP.64","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2008.ECP.64","url":null,"abstract":"High reliability and low latency are crucial requirements for vehicular safety applications. We have previously proposed a media access control (MAC) protocol for a roadside-to-vehicle communication (RVC) system using narrow antenna beam switching with multiple antenna beams to increase reliability even in a shadowing region. In this paper, we describe transmission performance evaluation of an RVC system with antenna beam switching based on a traffic flow model using computer simulation. Simulation results show that our proposed technique can reduce the packet error rate (PER) of the system with a single broad antenna beam in an environment where surrounding objects reflect waves.","PeriodicalId":410930,"journal":{"name":"2008 IEEE Globecom Workshops","volume":"26 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":"129502374","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}
{"title":"Adaptive Confidentiality Mechanism for Hierarchical Wireless Sensor Networks","authors":"M. Al, K. Yoshigoe","doi":"10.1109/GLOCOMW.2008.ECP.41","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2008.ECP.41","url":null,"abstract":"Protocol designs in wireless sensor networks (WSNs) have to consider many constraints such as limited power and computing capacity. We propose an end-to-end adaptive confidentiality mechanism (ACM), which significantly reduces the risk of adversary capturing aggregated messages leaving a cluster head while meeting these rigid resource constraints. ACM divides an encrypted message into several segments and sends them to a pre-defined super node set. The super nodes encrypt and forward the segments to a super node set leader which, then decrypts and reconstructs the original message. Analysis shows that ACM improves data confidentiality by several magnitudes without adding significant communication and processing overhead.","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":"133778013","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}
Y. Sawa, T. Kitani, N. Shibata, K. Yasumoto, M. Ito
{"title":"A Method for Pedestrian Position Estimation using Inter-Vehicle Communication","authors":"Y. Sawa, T. Kitani, N. Shibata, K. Yasumoto, M. Ito","doi":"10.1109/GLOCOMW.2008.ECP.57","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2008.ECP.57","url":null,"abstract":"In this paper, we propose a method for detecting the positions of pedestrians by cooperation of multiple cars with directional antennas to support drivers for pedestrian safety. In the method, each pedestrian carries a device which periodically transmits a beacon with a unique ID, and each car passing near the pedestrian receives the beacon by a directional antenna and measures the distance and the angle of arrival. We assume the distribution of the measurement errors to be a normal distribution, and the system calculates the existence probabilities of each pedestrian at each point. By exchanging information of the probabilities between cars, the area with high existence probability is narrowed down. In this paper, we first describe the situations where detecting positions of pedestrians greatly contribute to pedestrian safety, and then we describe the probability model used in our method, the method for calculating existence probabilities from information from multiple cars, and the protocol for exchanging the probability information between cars. We evaluated our method on QualNet simulator, and confirmed that the positions can be detected accurately enough for practical uses.","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":"115060029","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}
D. Traskov, M. Heindlmaier, Muriel Médard, Ralf Koetter, D. Lun
{"title":"Scheduling for Network Coded Multicast: A Conflict Graph Formulation","authors":"D. Traskov, M. Heindlmaier, Muriel Médard, Ralf Koetter, D. Lun","doi":"10.1109/GLOCOMW.2008.ECP.96","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2008.ECP.96","url":null,"abstract":"Consider network coded multicast traffic over a wireless network in the bandwidth limited regime. We formulate the joint medium access and subgraph optimization problem by means of a graphical conflict model. The nature of network coded flows is not captured by classical link-based scheduling and therefore requires a novel approach based on conflicting hyperarcs. By means of simulations, we evaluate the performance of our algorithm and conclude that it significantly outperforms existing scheduling techniques.","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":"124318380","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}
{"title":"Reactive Routing for Multi-Hop Dynamic Ad Hoc Networks Based on Opportunistic Large Arrays","authors":"L. Thanayankizil, M. A. Ingram","doi":"10.1109/GLOCOMW.2008.ECP.44","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2008.ECP.44","url":null,"abstract":"A mobile ad hoc network is an infrastructureless multi-hop system of wireless autonomous mobile nodes. Reactive routing protocols like ad hoc on demand distance vector routing (AODV) and dynamic source routing (DSR) are appropriate for mobile environments, because they cope quickly with topological changes. Lately cooperative-transmission-based routing protocols have been proposed to further save energy and enhance reliability. However they require an existing conventional route and individual addressing of the cooperating nodes, which involves a lot of overhead. In this paper, we propose a new opportunistic large array (OLA)-based extension to AODV, which incorporates cooperative diversity into both route discovery and data transmission without requiring any pre-existing route or any individual addressing of relay nodes. An OLA is a form of cooperative diversity in which a group of simple, inexpensive relays or forwarding nodes operate without any mutual coordination, but naturally fire together in response to energy received from a single source or another OLA. Our proposed scheme inherits from OLA lower transmit energy and low computational overhead. However, this paper highlights a newly discovered feature of OLAs, which is robustness against mobility. We show through extensive simulation that this new technique yields significantly longer route lifetimes compared to the traditional AODV scheme, assuming node mobility according to the random waypoint mobility model. We also compare the end-to-end delays of the traditional and proposed schemes. To the best knowledge of the authors, this work is the only unicast, distributed, cooperative ad hoc routing scheme that does not require a pre-existing route.","PeriodicalId":410930,"journal":{"name":"2008 IEEE Globecom Workshops","volume":"64 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":"128556465","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}
{"title":"Distributed Clustering Around Relay Nodes in Sensor Networks","authors":"A. Bari, A. Jaekel, S. Bandyopadhyay","doi":"10.1109/GLOCOMW.2008.ECP.17","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2008.ECP.17","url":null,"abstract":"Two-tiered sensor networks, where higher-powered relay nodes are used as cluster heads, have been proposed for load-balanced, scalable network design. It has been shown that, in such networks, the assignment of sensor nodes to clusters plays an important role in determining the network lifetime. In this paper we propose an energy-aware distributed clustering algorithm for organizing sensor nodes into clusters around high- powered relay nodes in two-tiered networks. The advantages of our approach are that it operates based on local information only, requires no centralized control and relatively low communication overhead. Simulations on networks with different sizes show that the solutions generated by our algorithm clearly outperform existing heuristics and lie within 10%-15% of the optimal solutions obtained using a centralized ILP formulation.","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":"126004449","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}
Valentín Alonso, M. A. Fernández, Pablo Dávila, David Gallegos, Antonio Castillo, Enrique Paniego
{"title":"New Self-* Paradigms for Managing Customer Networks","authors":"Valentín Alonso, M. A. Fernández, Pablo Dávila, David Gallegos, Antonio Castillo, Enrique Paniego","doi":"10.1109/GLOCOMW.2008.ECP.19","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2008.ECP.19","url":null,"abstract":"This paper describes Telefonica's experience in network management obtained in the EnComPAs2 CELTIC project, applied specifically to residential customer networks. The proliferation of devices in the digital home context poses a number of new challenges that makes it necessary to break with the current centralized model for the management of customer networks. We will present ongoing work in this area. The first step was the introduction of standards for the management of remote devices. But it was also necessary to incorporate new paradigms into the model, such as Autonomic Computing, with the deployment of distributed intelligence in home networks that relieves the centralized systems from most of the management tasks. A major challenge is also the encapsulation of all these device ecosystem complexities, providing the upper OSS with simpler interfaces that offer operations at the service level and hide the specificities of device configuration protocols. Moreover, fixed-mobile convergence brings new challenges for the telecommunications industry, who must define new models, systems and processes for an orchestrated configuration of the devices in the home network, regardless of whether they are fixed, mobile or dual.","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":"126321608","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}
{"title":"VANET Simulation Environment with Feedback Loop and its Application to Traffic Light Assistance","authors":"A. Wegener, H. Hellbruck, C. Wewetzer, A. Lubke","doi":"10.1109/GLOCOMW.2008.ECP.67","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2008.ECP.67","url":null,"abstract":"Traffic applications, in which vehicles are equipped with a radio interface and communicate directly with each other and the road traffic infrastructure are a promising field for ad-hoc network technology. Vehicular applications reach from entertainment to traffic information systems, including safety aspects where warning messages can inform drivers about dangerous situations in advance. As performance tests of the real system are very expensive and not comprehensive, today's evaluations are based on analysis and simulation via traffic simulators. In order to investigate the impact of traffic information systems there are two options: First, traffic simulators can be extended by application code and a simplified model for wireless communication. Second, existing network simulators can be coupled with existing traffic simulators. We favor the coupling of existing and well known simulators as we believe that the wireless communication characteristics influence the data transfer significantly and an oversimplified transmission model can lead to flawed results. In this paper we describe the feedback loop between traffic and network simulators named traffic control interface (TraCI) and outline its versatility. We explain its use to determine possible energy consumption reduction when traffic lights send their phase schedules to vehicles.","PeriodicalId":410930,"journal":{"name":"2008 IEEE Globecom Workshops","volume":"46 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":"127254098","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}
{"title":"Peer-to-Peer IPTV Services","authors":"D. Manzato, N. D. da Fonseca","doi":"10.1109/GLOCOMW.2008.ECP.29","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2008.ECP.29","url":null,"abstract":"IPTV promises to be within the spectrum of services offered in the future Internet. In cooperative IPTV, clients' resources are typically used to build a scalable system to distribute TV content. One of the major challenges of this approach is to reach the same quality of service of traditional television and commercial IPTV by employing only best effort network layer services. This paper proposes a novel architecture based on P2P networking for cooperative IPTV. Challenges are discussed and some solutions are proposed as part of the architecture. The aim is to make this type of system more competitive with traditional television and commercial IPTV.","PeriodicalId":410930,"journal":{"name":"2008 IEEE Globecom Workshops","volume":"142 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":"114143465","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}