An Information Search Algorithm Based on Query Delegation and Feedback Delegation in Delay-Tolerant Networks
详细信息 查看全文
- 作者：Jing Liu ; Qingshan Wang ; Qi Wang ; Jin Shen…
- 关键词：Data query ; Delay ; tolerant networks (DTNs) ; Semi ; Markov model ; User mobility ; Information search
- 刊名：Wireless Personal Communications
- 出版年：2015
- 出版时间：June 2015
- 年：2015
- 卷：82
- 期：4
- 页码：2623-2635
- 全文大小：789 KB
- 参考文献：1.Tang, J., & Kim, S. (2011). Theme-based mobile social network system. In Dependable, autonomic and secure computing (DASC), 2011 ninth international conference on (pp. 1089-095).
2.Pei-Kun, Z., Juan-Juan, Z., & Wu, W. (2013). Division of mobile social network based on user behavior. In Wavelet analysis and pattern recognition (ICWAPR), 2013 international conference on(pp. 148-52).
3.Li, Y. Q., Liu, Y., Liu, Z. F., Liu, C., Li, Z. N., Han, F. Y., & Chen, Z. (2011). LiveS Cube: An experiment for mobile social network. In Networking and distributed computing (ICNDC), 2011 second international conference on (pp. 311-15).
4.Cheng, N., Lu, N., Zhang, N., Shen, X. S., & Mark, J. W. (2013). Vehicle-assisted data delivery for smart grid: An optimal stopping approach. In Communications (ICC), 2013 international conference on (pp. 6184-188).
5.He, S., Chen, J., Sun, Y., Yau, D. K., & Yip, N. K. (2010). On optimal information capture by energy-constrained mobile sensors. IEEE Transactions on Vehicular Technology, 59(5), 2472-484.View Article
6.Silva, B. M., Soares, V. N., Proen?a, M. L., & Rodrigues, J. J. (2010). Impact of content storage and retrieval mechanisms on the performance of vehicular delay-tolerant networks. In Software, telecommunications and computer networks (SoftCOM), 2010 international Conference on (pp. 407-11).
7.Ruitao, Z., Yuanda, C., & Dongfeng, Z. (2011). An information retrieval scheme for delay and tolerance networks. In Electronics, communications and control (ICECC), 2011 international conference on (pp. 1868-871).
8.Yang, P., & Chuah, M. (2009). Performance evaluations of data-centric information retrieval schemes for DTNs. Computer Networks, 53(4), 541-55.View Article MATH
9.Costa, P., Mascolo, C., Musolesi, M., & Picco, G. P. (2008). Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks. IEEE Journal on Selected Areas in Communications, 26(5), 748-60.View Article
10.Pitk?nen, M., K?rkk?inen, T., Greifenberg, J., & Ott, J. (2009, March). Searching for content in mobile DTNs. In Pervasive computing and communications, PerCom 2009. International conference on (pp. 1-0).
11.Fan, J., Chen, J., Du, Y., Wang, P., & Sun, Y. (2011). Delque: A socially aware delegation query scheme in delay-tolerant networks. IEEE Transactions on Vehicular Technology, 60(5), 2181-193.View Article
12.Fan, J., Du, Y., Gao, W., Chen, J., & Sun, Y. (2010). Geography-aware active data dissemination in mobile social networks. In Mobile ad hoc and sensor systems (MASS), 2010 7th international conference on (pp. 109-18).
13.Lee, J. K., & Hou, J. C. (2006, May). Modeling steady-state and transient behaviors of user mobility: Formulation, analysis, and application. In Proceedings of the 7th ACM international symposium on mobile ad hoc networking and computing (pp. 85-6).
14.Gao, W., & Cao, G. (2010). Fine-grained mobility characterization: steady and transient state behaviors. In Proceedings of the eleventh ACM international symposium on mobile ad hoc networking and computing (pp. 61-0).
15.Scott, J., Gass, R., Crowcroft, J., Hui, P., Diot, C., & Chaintreau, A. (2009). CRAWDAD data set cambridge/haggle (v. 2009-5-29).
16.Vahdat, A., & Becker, D. (2000). Epidemic routing for partially connected ad hoc networks. Duke University, technical report CS-200006.
17.Erramilli, V., Chaintreau, A., Crovella, M., & Christophe, D. (2007). Diversity of forwarding paths in pocket switched networks. In Proceedings of the 7th ACM SIGCOMM conference on internet measurement (IMC) (pp. 161-74). - 作者单位：Jing Liu (1) (2)
Qingshan Wang (1) (2)
Qi Wang (1) (2)
Jin Shen (1) (2)
Jingming Wang (1) (2)
1. School of Mathematics, Hefei University of Technology, Hefei, People’s Republic of China
2. Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, People’s Republic of China - 刊物类别：Engineering
- 刊物主题：Electronic and Computer Engineering
Signal,Image and Speech Processing
Processor Architectures - 出版者：Springer Netherlands
- ISSN：1572-834X
文摘
In this paper, we propose a new three-hop information search algorithm in delay-tolerant networks. In this algorithm, information search is divided into two phases, query and feedback. In the query phase, the query’s source user entrusts neighbors as query nodes to reach the purpose community and obtain the relevant information. In the feedback phase, every query node entrusts his neighbors as feedback nodes to give the information feedback to the query’s source user. We apply a semi-Markov model to predict the user’s future location. In the former phase, we select the nodes with higher query probabilities as the query delegations. Then the concept of first arrival time is defined here. In the latter phase, if the feedback probability of a neighbor node is higher than that of the query node, we will select it as a feedback node. We define this algorithm as query and feedback delegation(QFD). Through simulation, the results show that QFD not only improves the information query ratio but also reduces average delay for information query compared with the existing query schemes.