TY - JOUR
T1 - A routing protocol for socially selfish delay tolerant networks
AU - Li, Qinghua
AU - Gao, Wei
AU - Zhu, Sencun
AU - Cao, Guohong
N1 - Funding Information:
Sencun Zhu received the B.S. degree in Precision Instruments from Tsinghua University, Beijing, China, in 1996 and the M.S. degree in Signal Processing from University of Science and Technology of China, Graduate School at Beijing, in 1999. He received the PhD degree in Information Technology from George Mason University in 2004. His research interests include network and systems security, ad hoc and sensor networks, performance evaluation, peer-to-peer computing. Currently he is working on issues related to ad hoc and sensor network security, DDoS attack prevention, and Worm detection. His research is funded by NSF and ARO. He is also a member of the Networking and Security Research Center, the Systems and Internet Infrastructure Security Lab, and the Cyber Security Lab.
Funding Information:
The authors thank the anonymous reviewers whose insightful comments helped us improve the presentation of the paper. A preliminary version [1] of the paper appeared in IEEE INFOCOM’2010. This work was supported in part by Network Science CTA under Grant W911NF-09-2-0053.
PY - 2012/11
Y1 - 2012/11
N2 - Existing routing algorithms for Delay Tolerant Networks (DTNs) assume that nodes are willing to forward packets for others. In the real world, however, most people are socially selfish; i.e., they are willing to forward packets for nodes with whom they have social ties but not others, and such willingness varies with the strength of the social tie. Following the philosophy of design for user, we propose a Social Selfishness Aware Routing (SSAR) algorithm to cope with user selfishness and provide good routing performance in an efficient way. To select an effective forwarding node, SSAR considers both users' willingness to forward and their contact opportunity, and derives a metric with mathematical modeling and machine learning techniques to measure the forwarding capability of the mobile nodes. Moreover, SSAR formulates the data forwarding process as a Multiple Knapsack Problem with Assignment Restrictions (MKPAR) to satisfy user demands for selfishness and performance. Trace-driven simulations show that SSAR allows users to maintain selfishness and achieves good routing performance with low transmission cost.
AB - Existing routing algorithms for Delay Tolerant Networks (DTNs) assume that nodes are willing to forward packets for others. In the real world, however, most people are socially selfish; i.e., they are willing to forward packets for nodes with whom they have social ties but not others, and such willingness varies with the strength of the social tie. Following the philosophy of design for user, we propose a Social Selfishness Aware Routing (SSAR) algorithm to cope with user selfishness and provide good routing performance in an efficient way. To select an effective forwarding node, SSAR considers both users' willingness to forward and their contact opportunity, and derives a metric with mathematical modeling and machine learning techniques to measure the forwarding capability of the mobile nodes. Moreover, SSAR formulates the data forwarding process as a Multiple Knapsack Problem with Assignment Restrictions (MKPAR) to satisfy user demands for selfishness and performance. Trace-driven simulations show that SSAR allows users to maintain selfishness and achieves good routing performance with low transmission cost.
UR - http://www.scopus.com/inward/record.url?scp=84863369462&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84863369462&partnerID=8YFLogxK
U2 - 10.1016/j.adhoc.2011.07.007
DO - 10.1016/j.adhoc.2011.07.007
M3 - Article
AN - SCOPUS:84863369462
SN - 1570-8705
VL - 10
SP - 1619
EP - 1632
JO - Ad Hoc Networks
JF - Ad Hoc Networks
IS - 8
ER -