memedi2015cluster
Abstract
Heterogeneous vehicular networks combine the advantages of multiple access technologies like LTE and DSRC. Such heterogeneous networks are often combined with clustering, which helps to aggregate information locally before sharing it in a wide area, thus reducing channel load. Another mechanism to reduce channel load is to reduce transmit power, but this requires accurate information or good heuristics. Otherwise, too low transmit power may cause increased packet loss, thus wasted channel capacity and overall reduced system performance. We present an approach that combines centrally managed clustering with transmit power control in a heterogeneous vehicular network. Here, centrally available knowledge can be relied on for transmit power control decisions. Based on computer simulation, we show that such a system can free up to 50% of channel capacity with no more than a 1% drop in system performance.
Quick access
- Original Version (at publishers web site)
- Authors' Version (PDF on this web site)
- BibTeX
Contact
BibTeX reference
@inproceedings{memedi2015cluster,
author = {Memedi, Agon and Hagenauer, Florian and Dressler, Falko and Sommer, Christoph},
title = {{Cluster-based Transmit Power Control in Heterogeneous Vehicular Networks}},
booktitle = {7th IEEE Vehicular Networking Conference (VNC 2015)},
address = {Kyoto, Japan},
doi = {10.1109/VNC.2015.7385547},
isbn = {978-1-4673-9411-6},
issn = {2157-9865},
month = {December},
pages = {60--63},
publisher = {IEEE},
year = {2015},
}
Copyright notice
Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.
The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.
The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.
The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.
The following applies to all papers listed above that have IFIP copyrights: © IFIP, (YEAR). This is the author's version of the work. It is posted here by permission of IFIP for your personal use. Not for redistribution. The definitive version was published in PUBLICATION, {VOL#, ISS#, (DATE)}, http://IFIP DL URL.