Skip to main content
SpringerLink
Log in

Topology control routing strategy based on message forwarding in apron opportunistic networks

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

Abstract

With node mobility characteristics and the harsh network environment of opportunistic networks, apron opportunistic networks have some problems. In this paper, with message forwarding a topology control routing strategy (MFATCR) is proposed to handle the issues mentioned above. To improve the overall delivery ratio of the network, in the early stage, the forwarding priority is determined in line with the urgency of the message. The messages that can be transmitted at the same time are determined by the characteristics of the apron network, and the transmission priority of such messages is determined to be the same level. To control the topology, some key nodes are set following the proposed method. In this stage, due to the uneven distribution of network nodes, different situations need to be discussed. According to the maximum communication radius of the starting and ending nodes (Riniand Raimand the distance between the two nodes Lia there are three situations: 1. Rini ≥ Lia2; Rini < Lia and Rini + Raim ≥ Lia and 3. Rini < Lia and Rini + Raim < Lia. The number of nodes required to form the topology is determined for the different situations. Then, the relay nodes are selected from those key nodes for further routing and message transmission to render the transmission more reliable. After comparing with the ER, SAWR, and PR algorithms in the opportunistic networks, the simulation results prove that the proposed algorithm has obvious improvements in the delivery ratio and network overhead. In the external data set, MFATCR also showed relatively excellent performance.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

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

Similar content being viewed by others

References

  1. Agiwal M, Roy A, Saxena N (2016) Next generation 5G wireless networks: a comprehensive survey[J]. IEEE Communications Surveys & Tutorials 18(3):1617–1655

    Article  Google Scholar 

  2. Luo JW, Wu J, Wu YZH (2020) Advanced data delivery strategy based on multiperceived community with IoT in social complex networks[J]. Complexity 2020:1–15

    Google Scholar 

  3. Ghaffari A (2019) Hybrid opportunistic and position-based routing protocol in vehicular ad hoc networks[J]. J Ambient Intell Humaniz Comput 2019(11):1593–1603

    Google Scholar 

  4. Cheng JJ, Yuan GY, Zhou MC, Gao SC, Huang ZH, Liu C (2020) A connectivity prediction-based dynamic clustering model for VANET in an urban scene[J] IEEE Internet of Things Journal 2020 1-1 https://doi.org/10.1109/JIOT.2020.2990935

  5. Chen WX, Su JF, Meng MH (2020) Access mechanism and protocol of. WSN-ON in apron sensing scene[J] Journal of Jiangsu University (Natural Science Edition) 2020 41(03):359–365

    Google Scholar 

  6. Damgacioglu H, Celik N, Guller A (2018) A route-based network simulation framework for airport ground system disruptions[J]. Comput Ind Eng 124:449–461

    Article  Google Scholar 

  7. Jain S, Chawla M (2014) Survey of buffer management policies for delay tolerant networks[J]. The Journal of Engineering 3:17–123

    Google Scholar 

  8. Ezife F, Li W, Yang S (2017) A survey of buffer management strategies in delay tolerant networks[C]//2017 IEEE 14th International Conference on Mobile Ad Hoc and Sensor Systems (MASS), Orlando, FL, 2017 599–603

  9. So J, Byun H (2017) Load-balanced opportunistic routing for duty-cycled wireless sensor networks[J]. IEEE Trans Mob Comput 16(7):1940–1955

    Article  Google Scholar 

  10. Song L, Song Q, Ye J, Chen Y (2019) A hierarchical topology control algorithm for WSN, considering node residual energy and lightening cluster head burden based on affinity propagation[J]. Sensors (Basel) 19(13):2925

    Article  Google Scholar 

  11. Sharma A, Awasthi LK (2020) AdPS: adaptive priority scheduling for data services in heterogeneous vehicular networks[J]. Comput Commun 159:71–82

    Article  Google Scholar 

  12. Huang C, Wang H, Guo D, Zhang GK, Xu GW, Zhou W, Cheng YQ, Peng YH, Xia KJ, Lin F (2020) A dynamic priority strategy for IoV data scheduling towards key data[J]. J Supercomput 2020

  13. Xu GX, Song Q, Qiu L, Tian CHM, Yang L (2013) A priority scheduling algorithm for improving emergent data transmission rate in the body area networks[C]//PROCEEDINGS OF 2013 international conference on sensor network security technology and privacy communication system. Nangang 2013:48–52

  14. Yuan PY, Zhang H (2019) Energy efficient routing algorithm in mobile opportunistic networks[J]. Comput Sci 46(S2):387–392

    Google Scholar 

  15. Mahendran N, Shankar S, Mekala T (2020) LSAPSP: load distribution-based slot allocation and path establishment using optimized substance particle selection in sensor networks[J]. Int J Commun Syst 33:e4343

    Article  Google Scholar 

  16. Wu J, Chen Z (2018) Sensor communication area and node extend routing algorithm in opportunistic networks[J]. Peer-To-Peer Networking and Applications 11:90–100

    Article  Google Scholar 

  17. Zhao RN, Zhang LCH, Wang XM (2018) A novel energy-efficient probabilistic routing method for mobile opportunistic networks[J] EURASIP J Wirel Commun Netw. 2018 263

  18. Stavroulaki V, Tsagkaris K, Logothetis M, Georgakopoulos A, Demestichas P, Gebert J, Marcin F (2011) Opportunistic networks, an approach for exploiting cognitive radio networking technologies in the future internet[J]. IEEE Vehicular Technology Magazine 2011 6(3):52–59

    Article  Google Scholar 

  19. Chakchouk N (2015) A survey on opportunistic routing in wireless communication networks[J]. IEEE Communications Surveys & Tutorials 2015 17(4):2214–2241

    Article  Google Scholar 

  20. Haque ME, Baroudi U (2020) Dynamic energy efficient routing protocol in wireless sensor networks. Wirel Netw 26:3715–3733

    Article  Google Scholar 

  21. Tsugawa S, Ohsaki H (2020) Benefits of bias in crawl-based network sampling for identifying key node set[J]. IEEE Access 8:75370–75380

    Article  Google Scholar 

  22. Li JW, Wen XX, Wu MG, Liu F, Li SHF (2019) Identification of key nodes and vital edges in aviation network based on minimum connected dominating set[J] Physica A: Statistical Mechanics and its Applications 2020 541 123340

  23. Liao H, Mariani MS, Medo M, Zhang YCH, Zhou MY (2017) Ranking in evolving complex networks[J]. Phys Rep 689:1–54

    Article  MathSciNet  Google Scholar 

  24. Lü LY, Chen DB, Ren XL, Zhang QM, Zhang YCH, Zhou T (2016) Vital nodes identification in complex networks[J]. Phys Rep 650:1–63

    Article  MathSciNet  Google Scholar 

  25. Chaintreau A, Hui P, Crowcroft J, Diot C, Gass R, Scott J (2007) Impact of human mobility on opportunistic forwarding algorithms[J]. IEEE Transactions on Mobile Computing 2007 6(6):606–620

    Article  Google Scholar 

  26. Eagle N, Pentland A (2006) Reality mining: sensing complex social systems[J]. Pers Ubiquit Comput 4:255–268

    Article  Google Scholar 

Download references

Acknowledgments

This work was supported by the Natural Science Research Fund Project of Tianjin Education Commission (2018KJ237); Joint Fund Project of National Natural Science Foundation of China and Civil Aviation Administration of China (U1433107, U1933107); Basic Research Business of Central Universities Special Project of Civil Aviation University of China (3122017002); and The Ninth Boeing Fund Project of Civil Aviation University of China (20190621014)

Author information

Authors and Affiliations

  1. College of Electronic Information and Automation, Civil Aviation University of China, Tianjin, China

    Weixing Chen, Jingfang Su, Chaochen Cui & Bin Chen

Authors
  1. Weixing Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jingfang Su
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chaochen Cui
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Bin Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Weixing Chen or Jingfang Su.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chen, W., Su, J., Cui, C. et al. Topology control routing strategy based on message forwarding in apron opportunistic networks. Peer-to-Peer Netw. Appl. 14, 3605–3618 (2021). https://doi.org/10.1007/s12083-021-01209-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-021-01209-z

Keywords

Search

Navigation