Advertisement

Eccentricity-Based Data Gathering and Diameter-Based Data Forwarding in 3D Wireless Sensor Networks

  • A. S. M. Sanwar HosenEmail author
  • Gi-hwan Cho
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 274)

Abstract

This paper proposes an efficient method of constructing three dimensional (3D) wireless sensor networks (WSNs) with aiming to minimization of the overall routing cost. It tries to divide the network into subspaces, and elects a routing centroid node in the eccentricity region from any node in a subspace in terms of minimizing communication cost of that space. The node in an eccentricity region is naturally close to the distance of the radius of that subspace. As a result, the centroid node can forward the gathered data to the node on the diameter. The minimization of the path cost in data gathering and forwarding towards the sink is an efficient approach to design a cost effective 3D WSNs.

Keywords

Wireless Sensor Network 3D space Routing Cost Eccentricity Diameter Radius 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Akyildiz, I., Pompili, D., Melodia, T.: Underwater Acoustic Sensor Networks: Research Challenges. Ad Hoc Networks Journal (2005)Google Scholar
  2. 2.
    Li, J., Yu, M.: Sensor Coverage in Wireless Ad Hoc Sensor Networks. International Journal of Sensor Networks 2, 218–229 (2007)CrossRefGoogle Scholar
  3. 3.
    Bai, X., Zhang, C., Xuan, D., Jia, W.: Full-Coverage and Connectivity,Three Dimensional Networks. In: IEEE INFOCOM, pp. 388–396 (2009)Google Scholar
  4. 4.
    Abdallah, A., Fevens, T., Opatrny, J.: Hybrid Position-Based 3D Routing Algorithms with Partial Flooding. In: ECE, pp. 227–230 (2006)Google Scholar
  5. 5.
    Zhou, J., Chen, Y., Leong, B., Sundaramoorthy, P.: Practical 3D Geographic Routing for Wireless Sensor Networks. In: 18th ACM ENSS, pp. 337–350 (2010)Google Scholar
  6. 6.
    Huang, M., Li, F., Wang, Y.: Energy-Efficient Restricted Greedy Routing for Three Dimensional Random Wireless Networks. In: Pandurangan, G., Anil Kumar, V.S., Ming, G., Liu, Y., Li, Y. (eds.) WASA 2010. LNCS, vol. 6221, pp. 95–104. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  7. 7.
    Wang, Y., Yi, C., Huang, M., Li, F.: Three-Dimensional Greedy Routing in Large-Scale Random Wireless Sensor Networks. Ad Hoc Networks 11(4) (2013)Google Scholar
  8. 8.
    Wu, B., Chao, K.: Spanning Trees and Optimization Problems. Chapman&Hall (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  1. 1.Div. of CSE (Cloud Open R&D Center)Chonbuk UniversityJeonjuS. Korea

Personalised recommendations