Chunbo Luo, Paul Ward, S. Cameron, G. Parr, S. McClean
{"title":"Communication provision for a team of remotely searching UAVs: A mobile relay approach","authors":"Chunbo Luo, Paul Ward, S. Cameron, G. Parr, S. McClean","doi":"10.1109/GLOCOMW.2012.6477815","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2012.6477815","url":null,"abstract":"In many applications it is desirable to deploy unmanned autonomous vehicles to remote real-world locations, at considerable distance from any fixed infrastructure, rendering direct communication impossible; for example in the Wilderness Search and Rescue (WiSaR) scenario. However, data transfer between such vehicles and other participants is required for control, safety, monitoring progress and sharing of acquired information. This paper proposes a method of using an Unmanned Aerial Vehicle (UAV) as a highly mobile relay, providing a delay tolerant link between a fixed base-station and a team of searching UAVs to meet this vital communication need. A communication model is described that permits a single relay to simultaneously collect data from multiple operational UAVs at pre-arranged meetings, both theoretical and experimental simulation results demonstrate the characteristics and effectiveness of this approach in a realistic cooperative sensing scenario.","PeriodicalId":290330,"journal":{"name":"2012 IEEE Globecom Workshops","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130955576","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":"Optimal relay deployment for multihop multicast scheduling in cellular wireless networks","authors":"I. Rubin, Hung-Bin Chang, R. Cohen","doi":"10.1109/GLOCOMW.2012.6477744","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2012.6477744","url":null,"abstract":"Efficient multicasting of critical messages is of essential importance in public safety and commercial multimedia cellular networks. We study the effectiveness of using relay station nodes to enhance the spectral efficiency of multicast distribution under full coverage in a mobile wireless networks. Coloring oriented adaptive rate scheduling algorithms are considered, including such that temporally employ TDMA schedules with reuse levels of 1, 3, 4 and 7 over a cellular arrangement. These schemes are used to regulate multicast transmissions executed by base station and (when employed) relay station nodes. We examine the utility of using, in each cell, a single layer of placed three and six relay station (RS) nodes. We examine the optimal locations at which such RS nodes should be placed under symmetric deployment in each cell. Base stations coordinate the scheduling of base station (BS) and RS nodal transmissions by employing two-phase reuse schemes. We show that when the inter-site distance (ISD), identifying the range between BSs, is lower than certain threshold levels, it is most effective to employ a reuse-3 scheduling scheme that is based on direct (1-hop) multicast transmissions by base station (BS) nodes to associated mobile station (MS) clients. In turn, under longer ISD ranges (e.g., as employed in less dense cellular layouts), the spectral efficiency of the system can be significantly enhanced by using a joint scheduling and routing scheme that makes use of a relay aided two-hop coverage operation. We also show that it is then more effective to deploy in each cell 3 rather than 6 RS nodes.","PeriodicalId":290330,"journal":{"name":"2012 IEEE Globecom Workshops","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114668228","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":"A naturally-inspired algorithm for Routing, Wavelength assignment, and Spectrum Allocation in flexible grid WDM networks","authors":"A. Patel, P. Ji, J. Jue, Ting Wang","doi":"10.1109/GLOCOMW.2012.6477594","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2012.6477594","url":null,"abstract":"Flexible grid networks enable elastic bandwidth transmission with higher spectral efficiency. In this paper, we address the Routing, Wavelength assignment, and Spectrum Allocation (RWSA) problem in flexible grid networks with the goal of maximizing spectral efficiency. We design a novel algorithm using a hybrid application of naturally-inspired procedures such as genetic evolution and simulated annealing. The performance of the proposed sequential meta-heuristic algorithm is evaluated with existing solutions and a lower bound. Simulation results demonstrate that the proposed algorithm outperforms the existing solutions and performs very close to the lower bound. Furthermore, the algorithm converges to the optimization in a limited number of evolution and annealing iterations.","PeriodicalId":290330,"journal":{"name":"2012 IEEE Globecom Workshops","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116791192","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":"DSMIP and PMIP for mobility management of heterogeneous access networks: Evaluation of authentication delay","authors":"P. Gondim, Jose B. M. Trineto","doi":"10.1109/GLOCOMW.2012.6477588","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2012.6477588","url":null,"abstract":"The evolution of wireless networks involves the development of several standards, considering different radio access technologies. In a scenario of integration of heterogeneous access technologies, the optimization of vertical handover involves the need of reduction of authentication delays. In this paper, the authentication latency is evaluated by the utilization of an analytical model, considering the use of Proxy Mobile IPv6 (PMIPv6) and Dual Stack Mobile IPv6 (DSMIPv6) protocols for providing mobility management.","PeriodicalId":290330,"journal":{"name":"2012 IEEE Globecom Workshops","volume":"102 30","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120824164","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":"SAR automatic target recognition using a hierarchical multi-feature fusion strategy","authors":"Z. Cao, Z. Cui, Yong Fan, Qi Zhang","doi":"10.1109/GLOCOMW.2012.6477798","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2012.6477798","url":null,"abstract":"A hierarchical feature fusion strategy based on Support Vector Machine (SVM) and Dempster-Shafer Evidence Theory is proposed for SAR image automatic target recognition in this paper. This strategy has three fusion hierarchies corresponding to three features. Principle Component Analysis (PCA), Local Discriminant Embedding (LDE) and Non-negative Matrix Factor (NMF) features are extracted from images without preprocessing, and are fed to SVM classifier. However, not all features are used in each fusion process. At each fusion process, an empirical threshold T is used to determine the used features and hierarchy depth. Experiments on MSTAR public data set demonstrate that the proposed strategy outperforms the system combining the outputs of three features directly.","PeriodicalId":290330,"journal":{"name":"2012 IEEE Globecom Workshops","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121147199","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":"Goodies for data: Game-based data propagation in DTNs","authors":"S. Schildt, L. Wolf","doi":"10.1109/GLOCOMW.2012.6477590","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2012.6477590","url":null,"abstract":"Many research projects from the areas of ubiquitous computing or public sensing propose using modern smartphones to build a data distribution network. Most ignore the question, why users should participate in such networks. In this paper we propose a cost-effective advertising network that is superior to classical non-electronic means of distributing ads, that will motivate users to participate and transport data due to its ability to provide various interesting location-based games and rewards. The proposed system has such low investment and operation costs, that deployment as advertisement platform even by very small businesses is a realistic option. We will show that the system, once deployed, is able to support and influence data propagation for novel kinds of Smart City applications such as public sensing.","PeriodicalId":290330,"journal":{"name":"2012 IEEE Globecom Workshops","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125933294","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":"Energy Aware Opportunistic Routing in Wireless Sensor Networks","authors":"P. Spachos, P. Chatzimisios, D. Hatzinakos","doi":"10.1109/GLOCOMW.2012.6477606","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2012.6477606","url":null,"abstract":"Wireless Sensor Networks (WSNs) have been increasingly considered an attractive solution for a plethora of applications, such as unattended event monitoring and tracking. Energy consumption is one of the looming challenges that threaten the successful deployment of these networks, especially when they are designed to operate unattended for long periods of time. In this paper, we are introducing an Energy-Aware Opportunistic Routing protocol (EAOR), for Wireless Sensor Networks, which keeps a balance between the Quality of Service (QoS) and the energy efficiency. The main objective is to maximize network lifespan without increasing the packet delay. We conduct experiments by simulations to evaluate the performance of the proposed protocol against existing ones, in terms of throughput and energy consumption. The experimental results demonstrated that the proposed protocol can deliver better energy distribution, extends the network lifetime up to 25% compared to simple opportunistic routing protocols and decreases the total energy consumption by 35% compared to traditional routing.","PeriodicalId":290330,"journal":{"name":"2012 IEEE Globecom Workshops","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125573417","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":"Cloud base stations and fixed mobile convergence for the next mobile network","authors":"W. Kiess, Changsoon Choi, Ashiq Khan, K. Kozu","doi":"10.1109/GLOCOMW.2012.6477576","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2012.6477576","url":null,"abstract":"In order to provide the best customer service, mobile operators continuously evolve their network with the next big challenge being a massive increase in transmission speed. In this paper, we combine the concepts of cloud base stations and fixed mobile convergence to deal with this challenge. We examine how the remote radio heads of such a distributed base station architecture can be interconnected over existing in-service fiber-to-the-home networks and present two architectures for this.","PeriodicalId":290330,"journal":{"name":"2012 IEEE Globecom Workshops","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125585527","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":"Design challenges in transmitting scalable video over multi-radio networks","authors":"Vivek Gupta, Srinivasa Somayazulu, N. Himayat, Harsh Verma, Mohan Bisht, Vikram Nandwani","doi":"10.1109/GLOCOMW.2012.6477542","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2012.6477542","url":null,"abstract":"A prototype system for simultaneously transmitting realtime video over multiple networks, such as cellular and WiFi, is developed and analyzed. This system uses scalable encoded video to split video resolution into base and enhancement layers. The base layer is always transmitted over reliable networks such as cellular, whereas the enhancement layers are opportunistically transmitted when additional capacity is available through WiFi. The challenges associated with designing such system are highlighted and the tradeoffs associated with the simultaneous use of multiple networks for real-time video transmission are described.","PeriodicalId":290330,"journal":{"name":"2012 IEEE Globecom Workshops","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126632258","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":"Antenna and user selection for a cloud base station with (Reverse) Compute and Forward","authors":"Songnam Hong, G. Caire","doi":"10.1109/GLOCOMW.2012.6477580","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2012.6477580","url":null,"abstract":"We consider a distributed antenna system where L antenna terminals (ATs) are connected to a Central Processor (CP) via digital error-free links of finite capacity R0, and serve K user terminals (UTs). The uplink is a special case of a multi-source, single destination relay network. The downlink is a special case of a broadcast relay network. Recently, novel uplink and downlink schemes called Compute-and-Forward and Reverse Compute-and-Forward were proposed, showing attractive performance-complexity tradeoff in certain regimes. In this work we focus on the ATs (uplink) or UTs (downlink) selection problem. For the uplink, for a given set of active UTs, we wish to select a subset of the ATs such that the resulting system matrix is full-rank and the sum rate is maximum. For the downlink, for a given set of transmitting ATs, we wish to select a subset of UTs such that the resulting system matrix is full-rank and the sum rate is maximum. We present antenna and user terminal selection algorithms suited for the proposed cloud base station architecture and demonstrate by simulation, in a realistic environment with fading and pathloss, that selection essentially eliminates the problem of rank deficiency of the system matrix, which represents the main performance impairment effect for a naive assignment of the active terminals.","PeriodicalId":290330,"journal":{"name":"2012 IEEE Globecom Workshops","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116580157","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}