klingler2019bloom
Florian Klingler, Reuven Cohen, Christoph Sommer and Falko Dressler, "Bloom Hopping: Bloom filter based 2-Hop Neighbor Management in VANETs," IEEE Transactions on Mobile Computing, vol. 18 (3), pp. 534–545, March 2019.
Abstract
Recent works have shown that it would be beneficial for nodes in wireless networks with very dynamic topology to maintain a list of 2-hop neighbors, namely, the neighbors of its neighbors. This is important, for example, for routing, clustering, and message dissemination to all the nodes in a given geographic vicinity. In this paper, we propose a scheme that uses Bloom filters for maintaining 2-hop neighborship information. Furthermore, we developed a novel 2-hop broadcast algorithm making use of the specific nature of our Bloom filter encoded neighbor information. We particularly focus on the Vehicular Ad Hoc Networks (VANETs) application scenario. Here, beaconing is a periodic broadcast of awareness messages by each vehicle to its immediate neighbors. A näive approach would be to include all 2-hop neighbors in each beacon message, which, however, would work only for small or sparse scenarios. We show that our approach significantly reduces the length of the beacon messages, thereby keeping channel load and collision probability considerably lower than in the naïve scheme. We further demonstrate the application of our Bloom filter based 2-hop neighbor table for developing higher layer protocols and introduce a multi-hop broadcast protocol called Bloom Hopping.
Quick access
- Original Version
(at publishers web site) - Authors' Version
(PDF on this web site) - BibTeX
Contact
- Florian Klingler
- Reuven Cohen
- Christoph Sommer
- Falko Dressler
BibTeX reference
@article{klingler2019bloom,
author = {Klingler, Florian and Cohen, Reuven and Sommer, Christoph and Dressler, Falko},
title = {{Bloom Hopping: Bloom filter based 2-Hop Neighbor Management in VANETs}},
journal = {IEEE Transactions on Mobile Computing},
doi = {10.1109/TMC.2018.2840123},
issn = {1536-1233},
month = {March},
number = {3},
pages = {534--545},
publisher = {IEEE},
volume = {18},
year = {2019},
}
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.