TY - GEN
T1 - Social-aware data forwarding through scattered caching in disruption tolerant networks
AU - Kim, Hyunae
AU - Lee, Hyungjune
N1 - Funding Information:
Ministry of Science, ICT, and Future Planning(NRF-2013R1A1A1009854, NRF-2013R1A2A2A04014772).
Publisher Copyright:
© 2016 IEEE.
PY - 2016/9/12
Y1 - 2016/9/12
N2 - We present a social-aware data forwarding scheme from a mobile source to a mobile destination in disruption tolerant networks. By incorporating any scattered network devices as temporal data storage for forwarding into parts of forwarding path, we aim to find the most effective relay path consisting of mobile-to-stationary and stationary-to-mobile relays. We combine the 'carry-and-forward' scheme for stationary-to-mobile transmission with the 'store-and-forward' for mobile-to-stationary transmission for improving both delivery rate and packet delay performance. We formulate this relay selection problem into a mixed-integer linear program, considering two crucial QoS constraints of packet delivery rate and deadline. We find the optimal forwarding path of all relevant mobile relays as well as their corresponding stationary nodes as bridges between mobile relays. We validate our algorithm based on a real-world dataset in terms of routing cost and packet transmission time compared to a baseline counterpart.
AB - We present a social-aware data forwarding scheme from a mobile source to a mobile destination in disruption tolerant networks. By incorporating any scattered network devices as temporal data storage for forwarding into parts of forwarding path, we aim to find the most effective relay path consisting of mobile-to-stationary and stationary-to-mobile relays. We combine the 'carry-and-forward' scheme for stationary-to-mobile transmission with the 'store-and-forward' for mobile-to-stationary transmission for improving both delivery rate and packet delay performance. We formulate this relay selection problem into a mixed-integer linear program, considering two crucial QoS constraints of packet delivery rate and deadline. We find the optimal forwarding path of all relevant mobile relays as well as their corresponding stationary nodes as bridges between mobile relays. We validate our algorithm based on a real-world dataset in terms of routing cost and packet transmission time compared to a baseline counterpart.
UR - http://www.scopus.com/inward/record.url?scp=84989910298&partnerID=8YFLogxK
U2 - 10.1109/WCNC.2016.7565162
DO - 10.1109/WCNC.2016.7565162
M3 - Conference contribution
AN - SCOPUS:84989910298
T3 - IEEE Wireless Communications and Networking Conference, WCNC
BT - 2016 IEEE Wireless Communications and Networking Conference, WCNC 2016
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 3 April 2016 through 7 April 2016
ER -