Skip to main content
Log in

Intelligent Dynamical Buffer Scheduling Mechanism for Intermittently Connected Mobile Network

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

According to the store-carry-forward packet transmission method, nodes can communicate with each other in intermittently connected mobile network flexibly. As can be seen, the successful transmission of packets is assisted by multiple copies injected into the network. Therefore, the limited buffer should be utilized reasonably in this situation. In this paper, an adaptive buffer scheduling mechanism is proposed with the aid of packet transmission status estimation. According to the activity degree of node and the number of packet copies, the status of packet transmission in the network can be evaluated. Furthermore, with the estimated outcome of packet redundancy, the packets in the buffer are scheduled dynamically. Numerical results show that the activity degree can be estimated accurately, especially when the networks become larger. The number of packet copies can be proved that it follows normal distribution. Compared with other buffer scheduling mechanisms, our mechanism displays better performance, e.g., the packet delivery probability is enhanced by 21–50 %, and the latency is reduced by 15–23 %.

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

Access this article

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

Similar content being viewed by others

References

  1. Wu, D., Wang, R., & Zhen, Y. (2012). Link stability aware reliable packet transmitting mechanism in MANET. International Journal of Communication Systems, 25(12), 1568–1584.

    Article  Google Scholar 

  2. Elizabeth, D., & Mads, H. (2010). The challenges of disconnected delay-tolerant MANETs. Ad Hoc Networks, 8(2), 241–250.

    Article  Google Scholar 

  3. Abdrabou, A., & Weihua, Z. (2009). Statistical QoS routing for IEEE 802.11 multihop ad hoc networks. IEEE Transactions on Wireless Communications, 8(3), 1542–1552.

    Article  Google Scholar 

  4. Yongping, X., Limin, S., Jianwei, N., et al. (2009). Opportunistic networks. Journal of Software, 20(1), 124–137.

    Article  Google Scholar 

  5. Luciana, P., Andrea, P., & Marco, C. (2006). Opportunistic networking: Data forwarding in disconnected mobile ad hoc networks. IEEE Communications Magazine, 44(11), 134–141.

    Article  Google Scholar 

  6. Zhen, S. (2006). Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges. IEEE Communications Surveys and Tutorials, 8(1), 24–37.

    Article  MathSciNet  Google Scholar 

  7. Marco, C., Silvia, G., Martin, M., & Andrea, P. (2010). From opportunistic networks to opportunistic computing. IEEE Communications Magazine, 48(9), 126–139.

    Article  Google Scholar 

  8. Hyytia, E., Lassila, P., & Virtama, J. (2006). Spatial node distribution of the random waypoint mobility model with applications. IEEE Transactions on Mobile Computing, 5(6), 680–694.

    Article  Google Scholar 

  9. Zhang, Z. S. (2006). Routing in intermittently connected mobile ad hoc networks and delay tolerant networks overview and challenges. IEEE Communications Surveys and Tutorials, 8(1), 24–37.

    Article  Google Scholar 

  10. Juang, P. (2002). Energy-efficient computing for wildlife tracking: Design trade-offs and early experiences with ZebraNet. ACM SIGPLAM Notices, 37, 96–107.

    Article  Google Scholar 

  11. Pentland, A., Fletcher, R., & Hasson, A. (2004). DakNet: Rethinking connectivity in developing nations. IEEE Computer, 37(1), 78–83.

    Article  Google Scholar 

  12. Yongping, X., Limin, S., & Jian, M. (2008). Adaptive data gathering mechanism in opportunistic mobile sensor networks. Journal on Communications, 29(11), 186–193.

    Google Scholar 

  13. Jinqi, Z., Ming, L., & Haigang, G. (2009). Selective replication-based data delivery for delay tolerant mobile sensor networks. Journal of Software, 20(8), 2227–2240.

    Article  Google Scholar 

  14. Yinliang, Z., & Caoguo, H. (2006). Supporting cooperative caching in ad hoc networks. IEEE Transactions on Mobile Computing, 5(1), 77–89.

    Article  Google Scholar 

  15. Krifa, A., Barakat, C., & Spyropoulos, T. (2008). Optimal buffer management policies for delay tolerant networks. In The 5th annual IEEE communications society conference on sensor, mesh and ad hoc communications and networks (pp. 260–268). San Francisco, CA.

  16. Wang, Y. L., Chan, E., & Li, W. Z. (2008). Location dependent cooperative caching in MANET. In: The 37th international conference on parallel processing (pp. 470–477).

  17. Hui, Y., Zhigang, C., & Ming, Z. (2010). ON-CRP: Cache replacement policy for opportunistic networks. Journal on Communications, 31(5), 98–107.

    Google Scholar 

  18. Yao, L., Jianxin, W., Shigeng, Z., et al. (2011). A buffer management scheme based on message transmission status in delay tolerant networks. In IEEE globecom proceedings (pp. 1–5). Houston, USA.

  19. Shin, K., & Kim, S. (2011). Enhanced buffer management policy that utilises message properties for delay-tolerant networks. IET Communications, 5(6), 753–759.

    Article  MathSciNet  Google Scholar 

  20. Krifa, A., Barakat, C., & Spyropoulos, T. (2012). Message drop and scheduling in DTNs: Theory and practice. IEEE Transactions on Mobile Computing, 11(9), 1470–1483.

    Article  Google Scholar 

  21. Bettstetter, C., Resta, G., & Santi, P. (2003). The node distribution of the random waypoint mobility model for wireless ad hoc networks. IEEE Transactions on Mobile Computing, 2(3), 257–269.

    Article  Google Scholar 

  22. Spyropoulos, T., Psounis, K., & Raghavendra, C. (2006). Performance analysis of mobility assisted routing. In: The 7th ACM international symposium on mobile ad hoc networking and computing (pp. 49–60). Florence, Italy.

  23. Spyropoulos, T., Psounis, K., & Raghave endra, C. (2008). Efficient routing in intermittently connected mobile networks: The multiple-copy case. IEEE Transactions on Networking, 16(1), 77–81.

    Article  Google Scholar 

  24. Mahmoud, M., & Al-Nagar, H. (2009). On generalized order statistics form linear exponential distribution and its characterization. Statistical Papers, 50(2), 407–418.

    Article  MathSciNet  MATH  Google Scholar 

  25. Keränen, A., Ott, J., & Kärkkäinen, T. (2009). The ONE simulator for DTN protocol evaluation. In The 2nd international conference on simulation tools and techniques (pp. 1–10). Rome, Italy.

  26. Mundur, P., Seligman, M., & Lee, G. (2008). Epidemic routing with immunity in delay tolerant networks. In The IEEE military communications conference (pp. 1–7). San Diego, CA.

  27. Sally, F., & Kevin, H. (1999). Promoting the use of end-to-end congestion control in the internet. IEEE/ACM Transactions on Networking, 7(4), 458–473.

    Article  Google Scholar 

  28. Srisankar, S. K., & Srikant, R. (2004). An adaptive virtual queue (AVQ) algorithm for active queue management. IEEE/ACM Transactions on Networking, 12(2), 286–300.

    Article  Google Scholar 

  29. Tang, S. S., & Li, W. (2006). QoS provisioning and queue management in mobile ad hoc networks. The IEEE wireless communications and networking conference (pp. 400–405). LasVegas, NV.

  30. Guanglei, C., & Hengjian, C. (2004). The testing for normality based on PP-Skewness and PP-Kurtosis in EV model. Acta Mathematicae Applicatae Sinica, 17(1), 16–21.

    MATH  Google Scholar 

Download references

Acknowledgments

This work is supported in part by the National Natural Science Foundation of China (61001105, 61102151 and 61271261), Chongqing Natural Science Foundation (Grant No. CSTC2013JJB40001, CSTC2013JJB40006), the Foundation of Chongqing University of Posts and Telecommunication (A2012-93).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dapeng Wu.

Appendix 1: Prove C\((T_{m})\) Follows Normal Distribution

Appendix 1: Prove C\((T_{m})\) Follows Normal Distribution

Let \(C\) denote the number of packet copies in intermittently connected mobile network, and \(C_1 ,C_2 ,\ldots ,C_n \) are the samples of \(C\). Based on the Skewness-Kurtosis verify method [30], \(G_1 ={H_3 }/{H_2^{3/2} },G_2 ={H_4 }/{H_2^2 }\) are the samples of skewness and kurtosis respectively. \(H_k (k=2,3,4)\) is the \(k\)-order central moment of the sample, and \(A_k =\frac{1}{n}\sum \nolimits _{i=1}^n {C_i^k (k=1,2,3,4)} \) is \(k\)-order sample moments. As can be seen, \(H_{2}, H_{3}, H_{4}\) can be calculated by the following Equations.

$$\begin{aligned}&H_2 =A_2 -A_1^2\\&H_3 =A_3 -3A_2 A_1 +2A_1^3\\&H_4 =A_4 -4A_3 A_1 +6A_2 A_1^2 -3A_1^4 ..\\ \end{aligned}$$

While the number of packet copies \(C\) follows normal distribution and \(n\) is large enough, we can assume approximately:

$$\begin{aligned}&G_1 \sim N\left( {0,\left. {\frac{6(n-2)}{(n+1)(n+3)}} \right) } \right. , G_2 \sim N\left( {3-\frac{6}{n+1}} \right. ,\left. {\frac{24n(n-2)(n-3)}{(n+1)^{2}(n+3)(n+5)}} \right) \\&\sigma _1 =\sqrt{\frac{6(n-2)}{(n+1)(n+3)}}, \sigma _2 =\sqrt{\frac{24n(n-2)(n-3)}{(n+1)^{2}(n+3)(n+5)}}, \mu _2 =3-\frac{6}{n+1}, U_1 ={G_1 }/{\sigma _1 },\\&U_2 =(G_2 -\mu _2 )/\sigma _2 , U_1 \sim N(0,1), U_2 \sim N(0,1). \end{aligned}$$

Let \(u_{1}\) and \(u_{2}\) denote the observation value of \(U_{1 }\)and \(U_{2}\) respectively. According to the verify method, the probability that \(C\) follows normal distribution is \(\gamma \) if \({\vert }u_{1}{\vert }\le \mathrm{z}_{\gamma /4}\) or \({\vert }u_{2}{\vert }\le \mathrm{z}_{\gamma /4}\), where \(z_{\gamma }\) is the \(\gamma \) percentiles of standard normal distribution.

After a large number of measurements, the results show that the number of copies follows normal distribution. To make sure that our conclusion is reasonable, the distribution of simulation data is validated. For the case of \(\mathrm{T}_{\mathrm{m}}=75\) % TTL, the data of \(C(T_{m})\) is shown in Table 4.

According to the Skewness–Kurtosis method, \(n=145, \sigma _{1}=0.1993, \sigma _{2}=0.3864, \mu _{2}=2.9589, H_{2}=125.6014, H_{3}=272.6525, H_{4}=42941.7521, G_{1}=0.1937, G_{2}=2.722\). The observation values are \({\vert }\mathrm{u}_{1}{\vert }=0.972\) and \({\vert }\mathrm{u}_{2}{\vert }=0.613\), and \(z_{\gamma /4}=z_{0.0125}=2.24\).

For \({\vert }\mathrm{u}_{1}{\vert }=0.972<2.24,{\vert }\mathrm{u}_{2}{\vert }=0.613<2.24\), so the conclusion is that the data in Table 4 follows normal distribution, and the probability is higher than 95 % (Table 5).

Table 5 Data distribution of \(C(T_{m})\) (\(T_{m}=75\) % TTL)

Figure 10 shows the cumulative distribution function of \(C(T_{m})\) when \(\mathrm{T}_{\mathrm{m}}=75\,\%\) TTL. From the results, we can see that \(C(T_{m})\) is approximate to normal distribution. For the case of \(\mathrm{T}_{\mathrm{m}}=50\) % TTL and \(\mathrm{T}_{\mathrm{m}}=90\) % TTL, the same conclusion can be drawn as Figs. 11 and 12 show.

Fig. 10
figure 10

Cumulative distribution comparing of \(C(T_{m})\) (\(T_{m}=75\) % TTL)

Fig. 11
figure 11

Cumulative distribution comparing of \(C(T_{m})\) (\(T_{m}=50\) % TTL)

Fig. 12
figure 12

Cumulative distribution comparing of \(C(T_{m})\) (\(T_{m}=90\) % TTL)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wu, D., Zhou, J., Zhang, P. et al. Intelligent Dynamical Buffer Scheduling Mechanism for Intermittently Connected Mobile Network. Wireless Pers Commun 73, 1269–1288 (2013). https://doi.org/10.1007/s11277-013-1277-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-013-1277-7

Keywords

Navigation