Advertisement

Multimedia Tools and Applications

, Volume 77, Issue 13, pp 16927–16946 | Cite as

Enhanced reliable reactive routing (ER3) protocol for multimedia applications in 3D wireless sensor networks

  • Niharika Anand
  • Shirshu Varma
  • Gaurav Sharma
  • Stilianos Vidalis
Article

Abstract

Sensor networks designed especially for the multimedia applications require high data rate and better Quality of Service (QoS). Offering a reliable and energy efficient routing technique in a harsh and complex three-dimensional (3-D) environment for multimedia applications is a challenging job. Geo-routing and geometric routing have been efficient routing schemes for two-dimensional (2-D), but are unable to work properly for 3-D sensor networks. In order to enhance the resilience to link the dynamics in the 3-D sensor network, in this research an Enhanced Reliable Reactive Routing (ER3) is proposed. ER3 is an advancement to the existing reactive routing schemes, to provide energy efficient and reliable routing of data packets in the complex 3-D sensor networks for multimedia applications. The major attraction of ER3 is its backoff scheme, which occurs in the route discovery phase. In backoff scheme robust pilot paths formed between the source and destination are calculated to enable cooperative forwarding of the data packets. The data packets in ER3 are forwarded greedily to the destination from the source and doesn’t require any prior location information of the nodes. The encompassing simulations suggest that the ER3 outperforms the existing routing protocols on the basis of energy efficiency, low latency and high packet delivery ratio.

Keywords

3-D sensor networks Multimedia applications Reactive routing Opportunistic routing Greedy forwarding 

References

  1. 1.
    Akyildiz IF, Su W, Sankarasubramaniam Y, Cayirci E (2002) Wireless sensor networks: a survey. Comput Netw 38(4):393–422CrossRefGoogle Scholar
  2. 2.
    Biswas S, Morris R (2005) ExOR: opportunistic multi-hop routing for wireless networks. ACM SIGCOMM Computer Communication Review 35(4):133–144CrossRefGoogle Scholar
  3. 3.
    Boulis A (2011) Castalia: a simulator for wireless sensor networks and body area networks. NICTA Natl. ICT AustGoogle Scholar
  4. 4.
    Bruckner D, Picus C, Velik R, Herzner W, Zucker G (2012) Hierarchical semantic processing architecture for smart sensors in surveillance networks. Ind Informatics, IEEE Trans 8(2):291–301CrossRefGoogle Scholar
  5. 5.
    Bruno R, Nurchis M (2010) Survey on diversity-based routing in wireless mesh networks: challenges and solutions. Comput Commun 33(3):269–282CrossRefGoogle Scholar
  6. 6.
    Cao Q, Abdelzaher T, He T, Kravets R (2007) Cluster-based forwarding for reliable end-to-end delivery in wireless sensor networks. In IEEE INFOCOM 2007-26th IEEE International Conference on Computer Communications, 1928–1936Google Scholar
  7. 7.
    Chachulski S, Jennings M, Katti S, Katabi D (2007) Trading structure for randomness in wireless opportunistic routing, vol. 37, no. 4. ACMGoogle Scholar
  8. 8.
    Coronel P, Doss R, Schott W (2007) Geographic routing with cooperative relaying and leapfrogging in wireless sensor networks. In Global Telecommunications Conference, 2007. GLOBECOM’07. IEEE, 646–651Google Scholar
  9. 9.
    Dhurandher SK, Sharma DK, Woungang I, Saini A (2015) An energy-efficient history-based routing scheme for opportunistic networks. Int J Commun Syst p. n/a-n/aGoogle Scholar
  10. 10.
    Durocher S, Kirkpatrick D, Narayanan L (2008) On routing with guaranteed delivery in three-dimensional ad hoc wireless networks. In Distributed Computing and Networking, Springer, pp. 546–557Google Scholar
  11. 11.
    Fang Q, Gao J, Guibas LJ, De Silva V, Zhang L (2005) GLIDER: Gradient landmark-based distributed routing for sensor networks. In INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE 1:339–350Google Scholar
  12. 12.
    Flury R, Wattenhofer RR (2008) Randomized 3D geographic routing. In INFOCOM 2008. The 27th Conference on Computer Communications. IEEEGoogle Scholar
  13. 13.
    Fouchal H, Hunel P, Ramassamy C (2014) Towards efficient deployment of wireless sensor networks. Secur Commun Networks p. n/a-n/aGoogle Scholar
  14. 14.
    Gungor VC, Hancke GP (2009) Industrial wireless sensor networks: challenges, design principles, and technical approaches. Ind Electron IEEE Trans 56(10):4258–4265CrossRefGoogle Scholar
  15. 15.
    Huang X, Zhai H, Fang Y (2008) Robust cooperative routing protocol in mobile wireless sensor networks. Wirel Commun IEEE Trans 7(12):5278–5285CrossRefGoogle Scholar
  16. 16.
    Huang H, Hu G, Yu F (2013) Energy-aware geographic routing in wireless sensor networks with anchor nodes. Int J Commun Syst 26(1):100–113CrossRefGoogle Scholar
  17. 17.
    Karp B, Kung H.-T (2000) GPSR: Greedy perimeter stateless routing for wireless networks. In Proceedings of the 6th annual international conference on Mobile computing and networking, pp 243–254Google Scholar
  18. 18.
    Katti S, Rahul H, Hu W, Katabi D, Médard M, Crowcroft J (2006) XORs in the air: practical wireless network coding. ACM SIGCOMM Computer Communication Review 36(4):243–254CrossRefGoogle Scholar
  19. 19.
    Lam SS, Qian C (2011) Geographic routing in d-dimensional spaces with guaranteed delivery and low stretch. In Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems, 257–268Google Scholar
  20. 20.
    Mao X, Tang S, Xu X, Li X-Y, Ma H (2011) Energy-efficient opportunistic routing in wireless sensor networks. Parallel Distrib Syst IEEE Trans 22(11):1934–1942CrossRefGoogle Scholar
  21. 21.
    Marina MK, Das SR (2001) On-demand multipath distance vector routing in ad hoc networks. In Network Protocols, 2001. Ninth International Conference on, pp 14–23Google Scholar
  22. 22.
    Perkins CE, Royer EM (1999) Mobile computing systems and applications. In WMCSA’99. Second IEEE Workshop, pp. 90–100Google Scholar
  23. 23.
    Perkins C, Belding-Royer E, Das S (2003) Ad hoc on-demand distance vector (AODV) routingGoogle Scholar
  24. 24.
    Royer EM, Toh C-K (1999) A review of current routing protocols for ad hoc mobile wireless networks. Pers Commun IEEE 6(2):46–55CrossRefGoogle Scholar
  25. 25.
    Rozner E, Seshadri J, Mehta YA, Qiu L (2009) SOAR: simple opportunistic adaptive routing protocol for wireless mesh networks. Mob Comput IEEE Trans 8(12):1622–1635CrossRefGoogle Scholar
  26. 26.
    Sanchez JA, Marin-Perez R, Ruiz PM (2007) BOSS: beacon-less on demand strategy for geographic routing inwireless sensor networks. In Mobile Adhoc and Sensor Systems, 2007. MASS 2007. IEEE International Conference on, 1–10Google Scholar
  27. 27.
    Sarkar R, Yin X, Gao J, Luo F, Gu XD (2009) Greedy routing with guaranteed delivery using ricci flows. In Information Processing in Sensor Networks, 2009. IPSN 2009. International Conference on, 121–132Google Scholar
  28. 28.
    Shah RC, Wiethölter S, Wolisz A, Rabaey JM (2005) When does opportunistic routing make sense? In Pervasive Computing and Communications Workshops, 2005. PerCom 2005 Workshops. Third IEEE International Conference on, 350–356Google Scholar
  29. 29.
    Shamsan Saleh AM, Ali BM, Rasid MFA, Ismail A (2014) A survey on energy awareness mechanisms in routing protocols for wireless sensor networks using optimization methods. Trans Emerg Telecommun Technol 25(12):1184–1207CrossRefGoogle Scholar
  30. 30.
    Shu L, Zhang Y, Yang LT, Wang Y, Hauswirth M, Xiong N (2010) TPGF: geographic routing in wireless multimedia sensor networks. Telecommun Syst 44(1–2):79–95CrossRefGoogle Scholar
  31. 31.
    Singh VK, Sharma G, Kumar M (2017) Compressed sensing based acoustic event detection in protected area networks with wireless multimedia sensors. Multimed Tools Appl:1–25Google Scholar
  32. 32.
    Sun Y, Gurewitz O, Du S, Tang L, Johnson DB (2009) ADB: an efficient multihop broadcast protocol based on asynchronous duty-cycling in wireless sensor networks. In Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems, 43–56Google Scholar
  33. 33.
    Sun Z, Wu W, Wang H, Chen H, Xing X (2014) A novel coverage algorithm based on event-probability-driven mechanism in wireless sensor network. EURASIP J Wirel Commun Netw 2014(1):1–17CrossRefGoogle Scholar
  34. 34.
    Wang J, Zhai H, Liu W, Fang Y (2004) Reliable and efficient packet forwarding by utilizing path diversity in wireless ad hoc networks. MILCOM 1:258Google Scholar
  35. 35.
    Watfa M, Yaghi L (2010) An efficient online-battery aware geographic routing algorithm for wireless sensor networks. Int J Commun Syst 23(1):41–61Google Scholar
  36. 36.
    Zeng K, Lou W, Yang J, Brown DR III (2007) On throughput efficiency of geographic opportunistic routing in multihop wireless networks. Mob Networks Appl 12(5–6):347–357CrossRefGoogle Scholar
  37. 37.
    Zeng W, Sarkar R, Luo F, Gu X, Gao J (2010) Resilient routing for sensor networks using hyperbolic embedding of universal covering space. In INFOCOM, 2010 Proceedings IEEE, 1–9Google Scholar
  38. 38.
    Zorzi M, Rao RR (2003) Geographic random forwarding (GeRaF) for ad hoc and sensor networks: energy and latency performance. Mob Comput IEEE Trans 2(4):349–365CrossRefGoogle Scholar
  39. 39.
    Zorzi M, Rao RR (2003) Geographic random forwarding (GeRaF) for ad hoc and sensor networks: multihop performance. Mob Comput IEEE Trans 2(4):337–348CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2017

Authors and Affiliations

  • Niharika Anand
    • 1
  • Shirshu Varma
    • 1
  • Gaurav Sharma
    • 2
  • Stilianos Vidalis
    • 2
  1. 1.IIITAllahabadIndia
  2. 2.University of HertfordshireHatfieldUK

Personalised recommendations