Selfish Task-Driven Routing in Hybrid Networks

Li, Yupeng1; Tan, Haisheng2; Wang, Yongcai3; Han, Zhenhua2,4; Lau, Francis C. M.1

10.1109/WIOPT.2015.7151097

2015

2015 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)

387-394

Mumbai, India

345 E 47TH ST, NEW YORK, NY 10017 USA

IEEE

In Hybrid networks, which synergistically mix together wired and wireless links to achieve flexible and reliable communication, it is particularly challenging to routing selfish tasks since each task wish to finish transmission as early as possible and its decision could have impacts on the others. In this paper, we investigate the problem to route a given set of selfish tasks in hybrid networks. Under a unified cost model, the competitive behaviors of selfish players are modeled as a noncooperative game. We show the game is ordinal potential, and the existence of a pure-Nash Equilibrium (pure-NE) is therefore guaranteed. We also design a routing scheme, called Selfish Task-Driven Routing (STaR), to achieve a pure-NE. Extensive simulations show that our scheme can not only efficiently converge to an equilibrium but also outperform other source routing protocols regarding the completion time and load balancing.

其他

英语

CPCI-S ; EI

National Natural Science Foundation of China[61202360]

Computer Science

Computer Science, Theory & Methods

WOS:000380573700053

20153701264861

Game theory ; Network routing ; Routing protocols

Computer Software, Data Handling and Applications:723 ; Probability Theory:922.1

Web of Science

1.Univ Hong Kong, Dept Comp Sci, Pokfulam, Hong Kong, Peoples R China
2.Jinan Univ, Dept Comp Sci, Guangzhou, Guangdong, Peoples R China
3.Tsinghua Univ, Inst Interdisciplinary Informat Sci, Beijing, Peoples R China
4.South Univ Sci & Technol China, Dept EEE, Shenzhen, Peoples R China

Li, Yupeng,Tan, Haisheng,Wang, Yongcai,et al. Selfish Task-Driven Routing in Hybrid Networks[C]. 345 E 47TH ST, NEW YORK, NY 10017 USA:IEEE,2015:387-394.