TY - GEN
T1 - A name-to-hash encoding scheme for vehicular named data networks
AU - Khelifi, Hakima
AU - Luo, Senlin
AU - Nourz, Boubakr
AU - Mounglax, Hassine
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/6
Y1 - 2019/6
N2 - In contrast to the host-centric model where the communication is directed using the destination address, Information-Centric Networking (ICN) adopts the content name as the pillar network element to provide data discovery and delivery process, as well as in other network functionalities. Named Data Networking (NDN) is an active ICN project that uses hierarchical unbounded names. These names are used in both interest and data packets and other data structures that may consume more memory with long lookup time. This paper targets the naming aspect in vehicular named data networks and proposes a Name-to-Hash Encoding scheme. The idea consists of hashing each name components separately to a fixed length, then perform a heuristic Wu-Manber-like algorithm lookup process. The former process enhances the NDN to consume less memory compared to hierarchical names, the latter process provides a fast lookup time. We have evaluated the proposed scheme against different related solutions using real domain datasets. Both theoretical analysis and experiments prove that the proposed scheme is efficient in terms of complexity, memory consumption, and lookup time.
AB - In contrast to the host-centric model where the communication is directed using the destination address, Information-Centric Networking (ICN) adopts the content name as the pillar network element to provide data discovery and delivery process, as well as in other network functionalities. Named Data Networking (NDN) is an active ICN project that uses hierarchical unbounded names. These names are used in both interest and data packets and other data structures that may consume more memory with long lookup time. This paper targets the naming aspect in vehicular named data networks and proposes a Name-to-Hash Encoding scheme. The idea consists of hashing each name components separately to a fixed length, then perform a heuristic Wu-Manber-like algorithm lookup process. The former process enhances the NDN to consume less memory compared to hierarchical names, the latter process provides a fast lookup time. We have evaluated the proposed scheme against different related solutions using real domain datasets. Both theoretical analysis and experiments prove that the proposed scheme is efficient in terms of complexity, memory consumption, and lookup time.
KW - Information-Centric Networking (ICN)
KW - Naming Scheme
KW - Vehicular Named Data Networks (VNDN)
UR - https://www.scopus.com/pages/publications/85073911059
U2 - 10.1109/IWCMC.2019.8766564
DO - 10.1109/IWCMC.2019.8766564
M3 - Conference contribution
AN - SCOPUS:85073911059
T3 - 2019 15th International Wireless Communications and Mobile Computing Conference, IWCMC 2019
SP - 603
EP - 608
BT - 2019 15th International Wireless Communications and Mobile Computing Conference, IWCMC 2019
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 15th IEEE International Wireless Communications and Mobile Computing Conference, IWCMC 2019
Y2 - 24 June 2019 through 28 June 2019
ER -