Data Forwarding with Selectively Partial Flooding in Opportunistic Networks

  • Lijun Tang
  • Wei Wu
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 348)


Opportunistic network is an evolution of the Mobile Ad hoc Network, which is composed of many mobile nodes. In opportunistic networks, there exist intermittent connecting communication paths between any two nodes and nodes try to realize communication with each other relying on the mobility of nodes. Furthermore, the frequent movements of nodes in networks lead to dynamic change of the network topology, and nodes have not any prior information and knowledge about the changeable network topology. However, the traditional data forwarding approaches do not solve the above issues, therefore they are unusable for opportunistic networks. In this work, a novel data forwarding approach is proposed to apply to opportunistic networks, which is called as selective probability-based flooding data forwarding scheme (SPF). It is a advanced approaches based on the conventional flood forwarding, and it chooses fewer neighboring nodes to forward data with contrast to conventional flooding scheme. These chosen nodes have more communication chances with the destination node than other neighboring nodes. With the traditional flooding method, data is forwarded to all neighboring nodes, which let data reaches the destination as fast as possible, so it has the minimum end-to-end delays and maximum delivery ratio. However, its disadvantage is that the large amount of forwarding data excessively uses the network resources. With SPF, the goal is to decrease the network traffic by selecting partial neighboring nodes based on the connecting likelihood with the destinations. Finally, the network performance is evaluated through simulations among the SPF, flooding, and partial flooding. The simulation results show our SPF can provide better performance than other two forwarding schemes while decreasing the network traffic.


Opportunistic networks Data forwarding Flood forwarding Selective probability-based flooding 



This work is supported by the National Natural Science Foundation of China (61203321) and the Science and Tech. Research Fund Project of Chongqing Education Commission (KJ1403208).


  1. 1.
    Akyildiz, I.F., Su, W., Sankarasubramania, Y., Cayirci, E.: Wireless Sensor Networks: A Survey. IEEE Comput. 38(4), 393–422 (2002)Google Scholar
  2. 2.
    Pelusi, L., Passarella, A., Conti, M.: Opportunistic networking: data forwarding in disconnected mobile ad hoc networks. IEEE Commun. Mag. (2006)Google Scholar
  3. 3.
    Lilien, L., Kamal, Z.H., Bhuse, V., Gupta, A.: Opportunistic networks: the concept and research challenges in privacy and security. In: International Workshop on Research Challenges in Security and Privacy for Mobile and Wireless Networks (2006)Google Scholar
  4. 4.
    Juang, P., Oki, H., Wang, Y., et al.: Energy-efficient computing for wildlife racking: design trade-offs and early experiences with zebra net. ACM SIGPLAN Notices 37, 96–107 (2002)CrossRefGoogle Scholar
  5. 5.
    Pentland, R., Fletcher, R., Hasson, A.: DakNet: rethinking connectivity in developing nations. IEEE Comput. 37(1), 78–83 (2004)CrossRefGoogle Scholar
  6. 6.
    Vahdat, A., Becker, D.: Epidemic routing for partially-connected ad hoc networks. Technical Report CS-2000-06, Duke University (2000)Google Scholar
  7. 7.
    Roenevelt, R.G., Naim, P., Koole, G.: The message delay in mobile ad hoc networks performance evaluation 62(1–4), 210–228 (2005)Google Scholar
  8. 8.
    Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Single-copy routing in intermittently connected mobile networks. In: First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, pp. 235–244 (2004)Google Scholar
  9. 9.
    Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In: Proceeding of 2005 ACM DIGCOMM Workshop on Delay-tolerant Networking, pp. 252–259 (2005)Google Scholar
  10. 10.
    Grossglauser, M., Tse, D.N.: Mobility increases the capacity of ad hoc wireless networks. IEEE/ACM Trans. Netw. 10(4), 477–486 (2002)CrossRefGoogle Scholar
  11. 11.
    Lindgren, Doria, A., Schelen, O.: Probabilistic routing in intermittently connected networks. ACMSIG Mob. CCR 7(3), 19–20 (2003)Google Scholar
  12. 12.
    Erdogan, M., Gunel, K., Koc, T., et al.: Routing with (p-percent) Partial Flooding for Opportunistic Networks. In: Proceedings of Future Network & Mobile Summit 2010 Conference, pp. 1–8 (2010)Google Scholar
  13. 13.
    Keränen, A., Ott, J., Kärkkäinen, T.: The ONE simulator for DTN protocol evaluation. In: SIMUTools ’09: Proceedings of the 2nd International Conference on Simulation Tools and Techniques (2009)Google Scholar
  14. 14.
    Hyytiä, E., Koskinen, H., et al.: Random waypoint model in wireless networks. Networks and Algorithms: Complexity in Physics and Computer Science (2005)Google Scholar

Copyright information

© Springer India 2016

Authors and Affiliations

  1. 1.Chongqing Vocational Institute of EngineeringChongqingChina
  2. 2.Chongqing City Management CollegeChongqingChina

Personalised recommendations