Skip to main content
Springer Nature Link
Log in

Tree-based data retrieval algorithm for multi-item request with deadline in wireless networks

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

Abstract

The data retrieval problem in wireless communication has attracted increasing attentions in many applications such as electronic information sharing and e-business. However, most existing studies do not consider how to retrieve the requested data items in their deadlines. In this paper, we discuss the so-called deadline-based multi-item data retrieval problem, which aims at finding an access pattern for retrieving requested data items in certain deadlines such that the access latency and data miss rate are minimized. We propose two algorithms, named EDFS and UR, to deal with the above problem. The EDFS algorithm gives priority to retrieve the requested data item with the least deadline, while the UR algorithm introduces the urgent rate that is computed by the broadcast time and deadline of requested data item for further reducing the access latency and data miss ratio. Moreover, we design a tree-based data retrieval algorithm that finds the longest downloading sequence of data items in one broadcast cycle and is applied to EDFS and UR for finding data retrieval sequence of requested data items. The efficiency of our proposed schemes has been validated by the extensive experiments.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17

Similar content being viewed by others

References

  1. Acharya S, Alonso R, Franklin M, Zdonik S (1995) Broadcast disks: data management for asymmetric communication environments. SIGMOD Rec 24(2):199–210. doi:10.1145/568271.223816

    Article  Google Scholar 

  2. Aksoy D, Franklin M (1999) R times;w: a scheduling approach for large-scale on-demand data broadcast. IEEE/ACM Trans Networking 7(6):846–860. doi:10.1109/90.811450

    Article  Google Scholar 

  3. Chen J, Lee VCS, Ng JY (2008) Scheduling real-time multi-item requests in on-demand broadcast. In: Embedded and Real-Time Computing Systems and Applications, 2008. RTCSA ’08. 14th IEEE International Conference on, pp. 207–216. doi:10.1109/RTCSA.2008.20

  4. Chu CH, Yang DN, Chen MS (2008) Multi-data delivery based on network coding in on-demand broadcast. In: Mobile Data Management, 2008. MDM ’08. 9th International Conference on, pp. 181–188. doi:10.1109/MDM.2008.25

  5. Gao X, Lu Z, Wu W, Fu B (2011) Algebraic data retrieval algorithms for multi-channel wireless data broadcast. Theor Comput Sci:1–8

  6. He P, Shen H, Tian H (2012) Scheduling parallel data retrievals for non-consecutive broadcast in mimo wireless networks. In: Parallel Architectures, Algorithms and Programming (PAAP), 2012 Fifth International Symposium on, pp 218–223. doi:10.1109/PAAP.2012.39

  7. He P, Shen H, Tian H (2013) Efficient approximation algorithm for data retrieval with conflicts in wireless networks. In: Proceedings of international conference on advances in mobile computing & multimedia, MoMM ’13. ACM, New York, pp 224:224–224:233. doi:10.1145/2536853.2536879

  8. Hurson AR, Muñoz Avila AM, Orchowski N, Shirazi B, Jiao Y (2006) Power-aware data retrieval protocols for indexed broadcast parallel channels. Pervasive Mob Comput 2(1):85–107. doi:10.1016/j.pmcj.2005.11.001

    Article  Google Scholar 

  9. Imielinski T, Viswanathan S, Badrinath B (1997) Data on air: organization and access. IEEE Trans Knowl Data Eng 9(3):353–372. doi:10.1109/69.599926

    Article  Google Scholar 

  10. Jung S, Lee B, Pramanik S (2005) A tree-structured index allocation method with replication over multiple broadcast channels in wireless environments. IEEE Trans Knowl Data Eng 17(3): 311–325. doi:10.1109/TKDE.2005.36

    Article  Google Scholar 

  11. Juran J, Hurson AR, Vijaykrishnan N, Kim S (2004) Data organization and retrieval on parallel air channels: performance and energy issues. Wirel Netw 10(2):183–195. doi:10.1023/B:WINE.0000013082.03518.2e

    Article  Google Scholar 

  12. Lu Z, Shi Y, Wu W, Fu B (2012) Efficient data retrieval scheduling for multi-channel wireless data broadcast. In: INFOCOM, 2012 Proceedings IEEE, pp 891–899. doi:10.1109/INF-COM.2012.6195838

  13. Lu Z, Wu W, Fu B (2012) Optimal data retrieval scheduling in the multi-channel wireless broadcast environments. IEEE Trans Comput PP(99):1. doi:10.1109/TC.2012.139

    Google Scholar 

  14. Lv J, Lee VCS, Li M, Chen E (2012) Profit-based scheduling and channel allocation for multi-item requests in real-time on-demand data broadcast systems. Data Knowl Eng pp. 23–42

  15. Saxena N, Pinottti MC (2005) On-line balanced k-channel data allocation with hybrid schedule per channel. In: Proceedings of the 6th international conference on Mobile data management, MDM ’05. ACM, New York, pp 239–246. doi:10.1145/1071246.1071283

  16. Shi Y, Gao X, Zhong J, Wu W (2010) Efficient parallel data retrieval protocols with mimo antennae for data broadcast in 4g wireless communications.. In: Proceedings of the 21st international conference on Database and expert systems applications: Part II, DEXA’10. Springer-Verlag, Berlin, pp 80–95

  17. Vaidya NH, Hameed S (1996) Data broadcast in asymmetric wireless environments. In: Proc. 1st Int. Wrkshp Sat.-based Inf. Serv.(WOSBIS). NY. Citeseer

  18. Wang S, Chen HL (2007) Tmbt: An efficient index allocation method for multi-channel data broadcast. In: Advanced information networking and applications workshops, 2007, AINAW ’07. 21st International Conference on, vol 2, pp 236–242. doi:10.1109/AINAW.2007.354

  19. Wong J (1988) Broadcast delivery. Proc IEEE 76(12):1566–1577. doi:10.1109/5.16350

    Article  Google Scholar 

  20. Wong JW, Ammar MH (1985) Analysis of broadcast delivery in a videotex system. IEEE Trans Comput 34(9):863–866. doi:10.1109/TC.1985.1676645

    Article  Google Scholar 

  21. Xu J, Lee WC, Tang X, Gao Q, Li S (2006) An error-resilient and tunable distributed indexing scheme for wireless data broadcast. IEEE Trans Knowl Data Eng 18(3):392–404. doi:10.1109/TKDE.2006.37

    Article  Google Scholar 

  22. Yao Y, Tang X, Lim EP, Sun A (2006) An energy-efficient and access latency optimized indexing scheme for wireless data broadcast. IEEE Trans Knowl Data Eng 18(8):1111–1124. doi:10.1109/TKDE.2006.118

    Article  Google Scholar 

  23. Yee WG, Navathe S, Omiecinski E, Jermaine C (2002) Efficient data allocation over multiple channels at broadcast servers. IEEE Trans Comput 51(10):1231–1236. doi:10.1109/TC.2002.1039849

    Article  MathSciNet  Google Scholar 

  24. Zhan C., Lee VCS, Wang J, Xu Y (2011) Coding-based data broadcast scheduling in on-demand broadcast. IEEE Trans Wirel Commun 10(11):3774–3783. doi:10.1109/TWC.2011.092011.101652

    Article  Google Scholar 

  25. Zheng B, Lee WC, Liu P, Lee D, Ding X (2009) Tuning on-air signatures for balancing performance and confidentiality. IEEE Trans Knowl Data Eng 21(12):1783–1797. doi:10.1109/TKDE.2009.43

    Article  Google Scholar 

  26. Zhong J, Wu W, Shi Y, Gao X (2011) Energy-efficient tree-based indexing schemes for information retrieval in wireless data broadcast. In: Proceedings of the 16th international conference on Database systems for advanced applications: Part II, DASFAA’11. Springer-Verlag, Berlin, pp 335–351. http://dl.acm.org/citation.cfm?id=1997251.1997282

Download references

Acknowledgments

This work is supported by National Science Foundation of China under its General Projects funding #61170232, State Key Laboratory of Rail Traffic Control and Safety Research Grant RS2012K011, The 985 Project funding of Sun Yat-sen University, Ministry of Education Funds for Innovative Groups #241147529.

Author information

Authors and Affiliations

  1. School of Computer and Information Technology, Beijing Jiaotong University, Beijing, China

    Ping He & Yidong Li

  2. School of Information Science and Technology, Sun Yat-sen University, Guangzhou, China

    Hong Shen

  3. School of Computer Science, University of Adelaide, Adelaide, Australia

    Hong Shen

Authors
  1. Ping He
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Hong Shen
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Yidong Li
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Ping He.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

He, P., Shen, H. & Li, Y. Tree-based data retrieval algorithm for multi-item request with deadline in wireless networks. Peer-to-Peer Netw. Appl. 9, 92–107 (2016). https://doi.org/10.1007/s12083-014-0316-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-014-0316-9

Keywords