TY - GEN
T1 - A credit-based incentive protocol for stimulating network-coded cooperative content distribution in VANET
AU - Chang, Ing Chau
AU - Lo, Jacky
PY - 2014/1/1
Y1 - 2014/1/1
N2 - As the high-speed vehicular node passes the coverage area of a road side unit in the vehicular ad hoc network, it may not be able to receive all content information broadcast by the RSU during the short contact duration with the RSU. Hence, when the vehicular node leaves the coverage area of the RSU, it has to adopt the cooperative content distribution approach to share its received content pieces, which are encoded by the network coding technology, with all neighboring nodes. However, these approaches do not consider that vehicular nodes in reality may have different degrees of selfishness and interests on various types of content information, which in turn hinders those selfish nodes from sharing their contents with others. In this paper, we will propose the SocialCode scheme, adopting the content bitmap, for each node to calculate the number of different network-coded content pieces, its corresponding re-broadcast priority and the correct number of re-encoded NC content pieces with all neighbor nodes first. SocialCode then classifies vehicular nodes into four types and further integrates corresponding credit-based incentive protocols to stimulate nodes' willingness to re-broadcast their content pieces. Finally simulation results show that SocialCode outperforms over traditional NC-based cooperative content distribution schemes, if they adopt the credit-based incentive protocols without considering node selfishness and interests.
AB - As the high-speed vehicular node passes the coverage area of a road side unit in the vehicular ad hoc network, it may not be able to receive all content information broadcast by the RSU during the short contact duration with the RSU. Hence, when the vehicular node leaves the coverage area of the RSU, it has to adopt the cooperative content distribution approach to share its received content pieces, which are encoded by the network coding technology, with all neighboring nodes. However, these approaches do not consider that vehicular nodes in reality may have different degrees of selfishness and interests on various types of content information, which in turn hinders those selfish nodes from sharing their contents with others. In this paper, we will propose the SocialCode scheme, adopting the content bitmap, for each node to calculate the number of different network-coded content pieces, its corresponding re-broadcast priority and the correct number of re-encoded NC content pieces with all neighbor nodes first. SocialCode then classifies vehicular nodes into four types and further integrates corresponding credit-based incentive protocols to stimulate nodes' willingness to re-broadcast their content pieces. Finally simulation results show that SocialCode outperforms over traditional NC-based cooperative content distribution schemes, if they adopt the credit-based incentive protocols without considering node selfishness and interests.
UR - http://www.scopus.com/inward/record.url?scp=84938692630&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84938692630&partnerID=8YFLogxK
U2 - 10.1109/IMIS.2014.65
DO - 10.1109/IMIS.2014.65
M3 - Conference contribution
AN - SCOPUS:84938692630
T3 - Proceedings - 2014 8th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2014
SP - 452
EP - 457
BT - Proceedings - 2014 8th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2014
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 8th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2014
Y2 - 2 July 2014 through 4 July 2014
ER -