Premium
Epidemic routing based on adaptive compression of vectors: efficient low‐delay routing for opportunistic networks based on adaptive compression of vectors
Author(s) -
Ren Zhi,
Peng Shuang,
Chen Hong,
Fang Jun,
Chen Qianbin
Publication year - 2015
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.2688
Subject(s) - computer science , overhead (engineering) , network packet , routing (electronic design automation) , computer network , distance vector routing protocol , routing algorithm , destination sequenced distance vector routing , transmission (telecommunications) , static routing , dynamic source routing , routing protocol , telecommunications , operating system
Summary In the study of routing in opportunistic networks, we find that there are some redundant overhead when the existing epidemic‐based routing algorithms exchange summary vectors (SVs) and request vectors (RVs), and store SVs. To address this issue, we propose an efficient low‐delay routing algorithm, epidemic routing based on adaptive compression of vectors (ERACV). Our proposed algorithm adaptively shortens the length of SVs and RVs by compressing the same bit sequences, optimizes the mechanism of exchanging SVs and RVs, and improves the order of transmitting data packets. Theoretical analysis verifies the effectiveness of ERACV in decreasing redundant overhead and packet delay. Simulation results show that ERACV reduces SVs’ storage and control overheads by at least 18.0% and 35.8%, respectively, as well as decreases the average end‐to‐end delay of data packets by more than 2.5%, as compared with epidemic routing algorithm and message transmission control scheme. Copyright © 2013 John Wiley & Sons, Ltd.