Skip to main content
SpringerLink
Log in

Approximating geographic routing using coverage tree heuristics for wireless network

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

Geographic routing scheme (such as Greedy perimeter stateless routing) makes use of location information to forward packets greedily. Nodes need to keep only this location information in stateless routing. When the greedy forwarding fails, routing switches to perimeter forwarding based on either planar graph (GG and RNG) or cross link detection protocol approaches. However, it has drawback in terms of cost and computational overheads. We propose a coverage-tree heuristic based routing instead of face routing in geographic routing schemes when greedy forwarding fails. We prove that the coverage tree based routing problem is NP hard by reduction using minimum rooted spanning tree of depth 2 (RST 2). We also show that coverage-tree based geographic routing problem is APX hard and not approximable with a factor of \(1/2(1-\in ) \ln n\) for any fixed \(\in > 0\) unless \(NP\subseteq DTIME(n^{\log \log n})\). Our proposed scheme of coverage-tree heuristics based geographic routing is \((1+\ln m)\)-approximation algorithm, a polynomial time algorithm using minimum distance topology knowledge. On performance comparison using simulation, our proposed scheme outperforms with the competitive schemes in term of success rate, network overhead and success rate against varying node density.

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.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. Cadger, F., Curran, K., Santos, J., & Moffett, S. (2012). A survey of geographical routing in wireless ad-hoc networks. IEEE Communications Surveys and Tutorials, 1–33.

  2. Maghsoudlou, A., St-Hilaire, M., & Kunz, T. (2011). A survey on geographic routing protocols for mobile ad hoc networks, Technical Report SCE-11-03 (pp. 1–52). Carleton University, Systems and Computer Engineering.

  3. Sanchez, J. A., Ruiz, P. M., & Perez, R. M. (2009). Beacon less geographic routing made practical: Challenges design guidelines and protocols. IEEE Communication Magazine, 47(8), 85–90.

    Article  Google Scholar 

  4. Lee, K. C., Cheng, P. C., & Gerla, M. (2010). GeoCross: A geographic routing protocol in the presence of loops in urban scenarios. Ad Hoc Networks, 1–15.

  5. Chen, D., & Varshney, P. K. (2007). A survey of void handling techniques for geographic routing in wireless networks. IEEE Communications Surveys and Tutorials, 9(1), 50–67.

    Article  Google Scholar 

  6. Akyildiz, I. F., Su, W., Sankarasubramaniam, Y., & Cayirci, E. (2002). Wireless sensor network: A survey. The International Journal of Computer and Telecommunications Networking, 40(8), 102–114.

    Google Scholar 

  7. Sun, Y., jiang, Q., & Singhal, M. (2011). A pre-processed cross link detection protocol for geographic routing in mobile ad-hoc and networks under realistic environments with obstacles. Journal of Parallel and Distributed Computing, 71(7), 1047–1054.

    Article  MATH  Google Scholar 

  8. Li, X. Y. (2003). Algorithmic, geometric & graphs issues in wireless networks. Wireless Communications and Mobile Computing, 3(2), 119–140. doi:10.1002/wcm.107.

    Article  Google Scholar 

  9. Finn, G. G. (1987). Routing and addressing problems in large metropolitan scale inter networks. Information Sciences Institute, 1987, Tech. Res. ISI/RR-87-180.

  10. Karp, B., & Kung, H. T. (2000). GPSR: Greedy perimeter stateless routing for wireless networks. In 6th Annual ACM/IEEE international conference on mobile computing and networking (pp. 243–254).

  11. Vasilakos, A. V. (2008). Special issue: Ambient intelligence. Information Sciences, 178(3), 585–587.

    Article  Google Scholar 

  12. Sheng, Z., Yang, S., Yu, Y., Vasilakos, A. V., McCann, J. A., & Leung, K. K. (2014). A survey on the ietf protocol suite for the internet of things: Standards, challenges, and opportunities. IEEE Wireless Communications, 20(6), 91–98.

    Article  Google Scholar 

  13. Karp, B. N. (2000). Geographic routing for wireless networks. Ph.D thesis, Harvard University.

  14. Leong, B. W. L. (2006). New techniques for geographic routing. Ph.D Thesis, MIT, 2006.

  15. Frey, H., & Stojmenovic, I. (2006). On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks. In 12th annual international conference on mobile computing and networking (pp. 390–401).

  16. Leong, B., Liskov, B., & Morris, R. (2006). Geographic routing without planarization. In 3rd Conference on networked systems design and implementation.

  17. Chen, C. S., Li, Y., & Song, Y. Q. (2008). An exploration of geographic routing with k-hop based searching in wireless sensor networks. In Third international conference on communications and networking in China—ChinaCom-2008.

  18. Kim, Y. J., Govindan, R., Karp, B., & Shenker, S. (2005). Geographical routing made practical. In 2nd Symposium on networked systems design and implementation (Vol. 2, pp. 317–230).

  19. Kim, Y. J., Govindan, R., Karp, B., & Shenker, S. (2004). Practical and robust geographic routing in wireless network. In 2nd international conference on embedded networked sensor systems (pp. 295–296).

  20. Bandara, H. M. N. D., Jayasumana, A. P., & Illangasekare, T. H. (2011). A top-down clustering and cluster-tree-based routing scheme for wireless sensor networks. International Journal of Distributed Sensor Networks, 1–17.

  21. Lee, S., Bhattacharjee, B., Banerjee, S. (2005). Efficient geographic routing in multihop wireless networks. In ACM MobiHoc-2005.

  22. Das, D., & Misra, R. (2013). Improvised k-hop neighbourhood knowledge based routing in wireless sensor networks. In ADCONS 2013 (pp. 136–141).

  23. Yang, S., Wu, J., & Cao, J. (2005). Connected k-Hop clustering in ad hoc networks. In International conference on parallel processing, ICPP-2005 (pp. 373–380).

  24. Ta, X., Mao, G., & Anderson, Brian D. O. (2007). Evaluation of the probability of K-hop connection in homogeneous wireless sensor networks, In IEEE Globecom-2007 (pp. 1278–1284).

  25. Ta, X., Mao, G., & Anderson, Brian D. O. (2007). On the probability of K-hop connection in wireless sensor networks. IEEE Communications Letters, 11(9), 662–664.

    Article  Google Scholar 

  26. Chilamkurti, N., Zeadally, S., Vasilakos, A., Sharma, V. (2009) Cross-layer support for energy efficient routing in wireless sensor networks. Journal of Sensors. doi:10.1155/2009/134165

  27. Liu, Y., Xiong, N., Zhao, Y., Vasilakos, A. V., Gao, J., & Jia, Y. (2010). Multi-layer clustering routing algorithm for wireless vehicular sensor networks. IET Communications, 4(7), 810–816.

    Article  Google Scholar 

  28. Zeng, Y., Xiang, K., Li, D., & Vasilakos, A. V. (2013). Directional routing and scheduling for green vehicular delay tolerant networks. Wireless Networks, 19(2), 161–173.

    Article  Google Scholar 

  29. Li, M., Li, Z., & Vasilakos, A. V. (2013). A survey on topology control in wireless sensor networks: Taxonomy, Comparative study, and open issues. Proceedings of IEEE, 101(12), 2538–2557.

    Article  Google Scholar 

  30. Zhou, J., Chen, Y., Leong, B., & Sundar, P. (2010). Practical 3D geographic routing for wireless sensor networks. In 8th ACM conference on embedded networked sensor systems (pp. 337–350).

  31. Shang, W., Wan, P., & Hu, H. (2010). Approximation algorithm for minimal convergecast time problem in wireless sensor networks. Journal of Wireless Networks, 16(5), 1345–1353.

    Article  Google Scholar 

  32. Chang, G. J., Panda, B. S., & Pradhan, D. (2012). Complexity of distance paired-dominations problems in graphs. Theoretical Computer Science, 459, 89–99.

    Article  MATH  MathSciNet  Google Scholar 

  33. Nossack, J., & Pesch, E. (2014). A branch-and-bound algorithm for the acyclic partitioning problem. Journal of Computers and Operation Research, 174–184.

  34. Yao, Y., Cao, Q., & Vasilakos, A. V. (2014). EDAL: An energy-efficient, delay-aware, and lifetime-balancing data collection protocol for heterogeneous wireless sensor networks. IEEE/ACM Transaction on Networking, 1–14. doi:10.1109/TNET.2014.2306592.

  35. Gorain, B., & Mandal, P. S. (2014). Approximation algorithm for sweep coverage in wireless sensor networks. Journal of Parallel and Distributed Computing.

  36. Han, K., Luo, J., Liu, Y., & Vasilakos, A. V. (2013). Algorithm design for data communications in duty-cycled wireless sensor networks: A survey. IEEE Communications Magazine, 51(7), 107–113.

    Article  Google Scholar 

  37. Yao, Y., Cao, Q., & Vasilakos, A. V. (2013). EDAL: An energy-efficient, delay-aware, and lifetime-balancing data collection protocol for heterogeneous wireless sensor networks. MASS 182–190.

  38. Panda, B. S., & Shetty, D. P. (2013). Strong minimum energy 2-hop rooted topology for hierarchical wireless sensor networks. Journal of Combinatorial Optimization.

  39. Chang, X., Narahari, B., Simha, R., & Cheng, M. X. (2003). Strong minimum energy topology in wireless sensor networks: NP completeness and heuristics. IEEE Transactions on Mobile Computing, 2(3), 248–255.

    Article  Google Scholar 

  40. Wang, X., Vasilakos, A. V., Chen, M., Liu, Y., & Kwon, T. T. (2012). A survey of green mobile networks: Opportunities and challenges. Journal, Mobile Networks and Applications, 17(1), 4–20.

    Article  Google Scholar 

  41. Chen, M., Gonzalez, S., Vasilakos, A., Cao, H., & Leung, V. C. M. (2010). Body area networks: A survey. Mobile Networks and Applications, 16(2), 171–193.

    Article  Google Scholar 

  42. Liu, X. Y., Zhu, Y., Kong, L., Liu, C., Gu, Y., Vasilakos, A. V., & Wu, M. Y. (2014). CDC: Compressive data collection for wireless sensor networks. IEEE Transactions on Parallel and Distributed Systems. doi:10.1109/TPDS.2014.2345257.

  43. Bredin, J. L., Demaine, E. D., Hajiaghayi, M., & Rus, D. (2005). Deploying sensor networks with guaranteed capacity and fault tolerance. In MobiHoc-2005 (pp. 309–319).

  44. Wei, G., Ling, Y., Guo, B., Xiao, B., & Vasilakos, A. V. (2011). Prediction-based data aggregation in wireless sensor networks: Combining grey model and Kalman Filter. Computer Communications, 32(6), 793–802.

    Article  Google Scholar 

  45. Cagalj, M., Hubaus, J. P., & Enz, C. (2002). Minimum-energy broadcast in all wireless networks: NP completeness and distribution issues. In Mobicom-2002 (pp. xxx-xxx).

  46. Xiang, L., Luo, J., & Vasilakos, A. V. (2011). Compressed data aggregation for energy efficient wireless sensor networks. In 8th Annual IEEE communications society conference on sensor, mesh and ad hoc communications and networks (SECON) (pp. 46–54).

  47. Zhang, J., Deng, P., Wan, J., Yan, B., Rong, X., & Chen, F. (2013). A novel multimedia device ability matching technique for ubiquitous computing environments. EURASIP Journal on Wireless Communications and Networking. doi:10.1186/1687-1499-2013-181.

  48. Chen, M., Wan, J., Gonzalez, S., Liao, X., & Leung, V. C. M. (2014). A survey of recent developments in home M2M networks. IEEE Communications Surveys and Tutorials, 16(1), 98–114.

    Article  Google Scholar 

  49. Zhang, Y., Li, X., Yang, J., Liu, Y., Xiong, N., & Vasilakos, A. V. (2013). A real-time dynamic key management for hierarchical wireless multimedia sensor network. Multimedia Tools and Applications, 67(1), 97–117.

    Article  Google Scholar 

  50. Ayaida, M., Barhoumi, M., Fouchal, H., Doudane, Y. G., & Afilal, L. (2014). Joint routing and location-based service in VANETs. Journal of Parallel and Distributed Computing, 74, 2077–2087.

    Article  Google Scholar 

  51. Spyropoulos, T., Rais, R. N. B., Turletti, T., Obraczka, K., & Vasilakos, A. V. (2010). Routing for disruption tolerant networks: Taxonomy and design. Wireless Networks, 16(8), 2349–2370.

    Article  Google Scholar 

  52. Youssef, M., Ibrahim, M., Abdelatif, M., Chen, L., & Vasilakos, A. V. (2014). Routing metrics of cognitive radio networks: A survey. IEEE Communications Surveys and Tutorials, 16(1), 92–109.

    Article  Google Scholar 

  53. Vasilakos, A. V., Zhang, Y., & Spyropoulos, T. (2011). Delay tolerant networks: Protocols and applications. Boca Raton: CRC Press.

    Google Scholar 

  54. Penga, M., Chen, H., Xiao, Y., Ozdemir, S., Vasilakos, A. V., & Wu, J. (2011). Impacts of sensor node distributions on coverage in sensor networks. Journal of Parallel and Distributed Computing, 71(12), 15781591.

    Google Scholar 

  55. Cardei, M., Cheng, X., Cheng, X., & Du, D.-Z. (2002) Connected domination in multihop ad hoc wireless networks. Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN 55455, USA.

  56. Bandyopadhyay, S., & Coyle, E. J. (2003). An energy efficient hierarchical clustering algorithm for wireless sensor networks. In Twenty-second annual joint conference of the IEEE computer and communications, INFOCOM 2003 (pp. 1713–1723).

  57. Cheng, H., Xiong, N., Vasilakos, A. V., Yang, L. T., Chen, G., & Zhuang, X. (2012). Nodes organization for channel assignment with topology preservation in multi-radio wireless mesh networks. Ad Hoc Networks, 10(5), 760773.

    Article  Google Scholar 

  58. Cianfrani, A., Eramo, V., Listanti, M., Polverini, M., & Vasilakos, A. V. (2012). An OSPF-integrated routing strategy for QoS-aware energy saving in IP backbone networks. IEEE Transactions on Network and Service Management, 9(3), 254–267.

    Article  Google Scholar 

  59. Li, P., Guo, S., Yuy, S., & Vasilakos, A. V. (2012). CodePipe: An opportunistic feeding and routing protocol for reliable multicast with pipelined network coding. IEEE Transactions on Network and Service Management, 9(3), 254–267.

    Article  Google Scholar 

  60. Alfandari, L., & Paschos, V. T. (1999). Approximating minimum spanning tree of depth 2. International Transactions in Operational Research, 6(6), 607–622.

    Article  MathSciNet  Google Scholar 

  61. Thai, M. T., Tiwari, R., & Du, D.-Z. (2008). On construction of virtual backbone in wireless ad hoc networks with unidirectional links. IEEE Transactions on Mobile Computing, 7(9), 1098–1109.

    Article  Google Scholar 

  62. Li, Y., Thai, My T., Wang, Feng, Yi, Chih-Wei, Wan, Peng-Jun, & Ding-Zhu, Du. (2005). On greedy construction of connected dominating sets in wireless networks. Wireless Communications and Mobile Computing, 5, 927932.

    Google Scholar 

  63. Garey, M. R., & Johnson, D. S. (1990). Computers and intractability; A guide to the theory of NP-completeness. New York, NY: W. H. Freeman and Co.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology Patna, Patna, 800013, Bihar, India

    Debasis Das, Rajiv Misra & Anurag Raj

  2. Department of Computer Science and Engineering, NIIT University, Neemrana, Alwar, 301705, Rajasthan, India

    Debasis Das

Authors
  1. Debasis Das
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rajiv Misra
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Anurag Raj
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Debasis Das.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Das, D., Misra, R. & Raj, A. Approximating geographic routing using coverage tree heuristics for wireless network. Wireless Netw 21, 1109–1118 (2015). https://doi.org/10.1007/s11276-014-0837-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-014-0837-4

Keywords

Search

Navigation