Research on 3D Wireless Sensor Networks ISC-EAR Routing Algorithm

Zhanguo Li; Donghong Shan

doi:doi:10.11648/j.net.20200802.11

| Peer-Reviewed

Research on 3D Wireless Sensor Networks ISC-EAR Routing Algorithm

Zhanguo Li, Donghong Shan

Published in Advances in Networks (Volume 8, Issue 2)

Received: 16 October 2020 Accepted: 30 October 2020 Published: 16 November 2020

Views: Downloads:

Download PDF

Share This Article

Twitter
Linked In
Facebook

Abstract

In order to improve the performance of 3D wireless sensor networks, an Iterative Split Clustering Energy Angle Routing (ISC-EAR) Algorithm is proposed. The design idea is discussed theoretically, and the design idea is as follows: on the basis of the link bandwidth and other meeting user QoS requirements, all nodes within the node perception radius or communication radius are regarded as next hop candidates. Select the next hop node according to the total energy consumption of the node (including sending and receiving energy consumption), and try to ensure that the farthest transmission distance consumes the least energy. Select the current node, the destination node and the next hop node, the space vector with the current node as the vertex has the smallest angle, that is, the candidate node closest to the destination node as the next hop node. In order to verify the performance of the algorithm, use C/C++ for programming simulation. Through three different topological structures of mine topology, average topology and random topology, the performance evaluation is carried out using four indicators: the number of alive nodes, network lifetime, network energy consumption and average energy of node. Through simulation calculation, the ISC-EAR routing algorithm has good technical performance advantages compared with the benchmark routing algorithm IGreedy, which can increase the survival time of nodes, reduce network energy consumption, and prolong the survival time of the network. It has better advancement.

Published in	Advances in Networks (Volume 8, Issue 2)
DOI	10.11648/j.net.20200802.11
Page(s)	16-21
Creative Commons	This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited.
Copyright	Copyright © The Author(s), 2020. Published by Science Publishing Group

Keywords

3D WSN, ISC-EAR, Routing Algorithm, Clustering, Energy Saving

References

[1]	Dahmani, Youcef, et al. "Spiderweb strategy: application for area coverage with mobile sensor nodes in 3D wireless sensor network." International Journal of Sensor Networks 2019.29 (2): 121-133.
[2]	Ming He, Wenhui Liang, Qiuli Chen, Qingbing Zou, “Study on Architecture and Topology of Mobile Underwater Wireless Sensor Networks”, Advanced Technologies in Ad Hoc and Sensor Networks Lecture Notes in Electrical Engineering, Mar. 2014. 29 (5): 263-273.
[3]	Karthikeyan, A., V. P. Arunachalam, and S. Karthik. “Performing Data Assessment in Terms of Sensor Node Positioning over Three Dimensional Wireless Sensor Network”. Mobile networks & applications, 2019.24 (6): 1862-1871.
[4]	Althunibat, Saud, Z. Altarawneh, and R. Mesleh. "Performance analysis of free space optical–based wireless sensor networks using corner cube retroreflectors." Transactions on Emerging Telecommunications Technologies 30.12 (2019).
[5]	Qi Jing, Athanasios V. “Vasilakos, Security of the Internet of Things: perspectives and challenges”, Wireless Networks, Jun. 2014, Vol 20, Issue 8, pp 2481-2501.
[6]	D. Tignola, Saverio DeVito, Grazia attoruso, “A Wireless Sensor Network Architecture for Structural Health Monitoring”, Sensors and Microsystems Lecture Notes in Electrical Engineering, Oct 2013 Volume 268, pp. 397-400
[7]	Usman Mansoor, Habib M. Ammari, “Coverage and Connectivity in 3D Wireless Sensor Networks”, The Art of Wireless Sensor Networks, pp 273-324, Dec. 2013.
[8]	Anju Sangwan, Rishi Pal Singh. “Survey on Coverage Problems in Wireless Sensor Networks”. Wireless Personal Communications, 2015, 80 (4): 1475-1500.
[9]	Zheng, Tao, and P. Unit. "Localization Algorithm Based on Local Area Network." Communications Technology (2019).
[10]	Mehdi Aminian, Mohammad K. Akbari, Masoud Sabaei, “A Rate-Distortion Based Aggregation Method Using Spatial Correlation for Wireless Sensor Networks”, Wireless Personal Communications Vol. 71, Issue 3, pp. 1837-1877 Aug 2013.
[11]	Khriji, Sabrine, et al. "Energy-Efficient Routing Algorithm Based on Localization and Clustering Techniques for Agricultural Applications." IEEE Aerospace and Electronic Systems Magazine 34.3 (2019): 56-66.
[12]	Zhili, H. Daru. and S. Hui. "An Opportunistic Network Routing Algorithm Based on Clustering Algorithm." Journal of South China Normal University (Natural Science Edition) (2019).
[13]	Kothandaraman, D. and C. Chellappan. "Energy Efficient Node Rank-Based Routing Algorithm in Mobile Ad-Hoc Networks." International Journal of Computer Networks & Communications 11.1 (2019): 45-61.
[14]	Subir Halder, Amrita Ghosal, Aadirupa Saha, Sipra DasBit, “Energy-Balancing and Lifetime Enhancement of Wireless Sensor Network with Archimedes Spiral”, Ubiquitous Intelligence and Computing, Vol. 6905, pp. 420-434, 2011.
[15]	Jing Zhe Du, Kranakis E., “Nayak A, A hop count based greedy face greedy routing protocol on localized geometric spanners”, Mobile Ad-hoc and Sensor Networks, 2009, 9 (8): 231-236.
[16]	R. Flury, R. Wattenhofer, “Randomized 3D Geographic Routing”, The 27th Conference on Computer Communications. IEEE, pp. 834-842, 2008.
[17]	Zhixiao Wang, Deyun Zhang, Alfandi O. “Efficient Geographical 3D Routing for Wireless Sensor Network in Smart Space”. Internet Communications (BCFIC Riga), 2011 Baltic Congress on Future, 2011, 24 (8): 168-172.
[18]	Atiq Ur Rahman, Halabi Hasbullah, Najm Us Sama, “Efficient Energy Utilization Through Optimum Number of Sensor Node Distribution in Engineered Corona-Based (ONSD-EC) Wireless Sensor Network”, Wireless Personal Communications, Vol 73, Issue 3, pp. 1227-1243, Jun 2013.
[19]	Miguel Garcia, Sandra Sendra. “Saving energy and improving communications using cooperative group-based Wireless Sensor Networks”, Telecommunication Systems, Volume 52, Issue 4, pp. 2489-2502, April 2013.
[20]	A. E. Abdallah, T. Fevens. ”Power-aware semi-beaconless 3D georouting algorithms using adjustable transmission range for wireless ad hoc and sensor networks”, Ad Hoc Networks, Vol. 8, Issue 1, pp. 15-29, 2010.
[21]	Jiang, Haifeng, J. Qian, and W. Peng. "Energy efficient sensor placement for tunnel wireless sensor network in underground mine." International Conference on Power Electronics & Intelligent Transportation System IEEE, 2010.

Cite This Article

Plain Text BibTeX RIS

APA Style

Zhanguo Li, Donghong Shan. (2020). Research on 3D Wireless Sensor Networks ISC-EAR Routing Algorithm. Advances in Networks, 8(2), 16-21. https://doi.org/10.11648/j.net.20200802.11

Copy | Download

ACS Style

Zhanguo Li; Donghong Shan. Research on 3D Wireless Sensor Networks ISC-EAR Routing Algorithm. Adv. Netw. 2020, 8(2), 16-21. doi: 10.11648/j.net.20200802.11

Copy | Download

AMA Style

Zhanguo Li, Donghong Shan. Research on 3D Wireless Sensor Networks ISC-EAR Routing Algorithm. Adv Netw. 2020;8(2):16-21. doi: 10.11648/j.net.20200802.11

Copy | Download

@article{10.11648/j.net.20200802.11,
  author = {Zhanguo Li and Donghong Shan},
  title = {Research on 3D Wireless Sensor Networks ISC-EAR Routing Algorithm},
  journal = {Advances in Networks},
  volume = {8},
  number = {2},
  pages = {16-21},
  doi = {10.11648/j.net.20200802.11},
  url = {https://doi.org/10.11648/j.net.20200802.11},
  eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.net.20200802.11},
  abstract = {In order to improve the performance of 3D wireless sensor networks, an Iterative Split Clustering Energy Angle Routing (ISC-EAR) Algorithm is proposed. The design idea is discussed theoretically, and the design idea is as follows: on the basis of the link bandwidth and other meeting user QoS requirements, all nodes within the node perception radius or communication radius are regarded as next hop candidates. Select the next hop node according to the total energy consumption of the node (including sending and receiving energy consumption), and try to ensure that the farthest transmission distance consumes the least energy. Select the current node, the destination node and the next hop node, the space vector with the current node as the vertex has the smallest angle, that is, the candidate node closest to the destination node as the next hop node. In order to verify the performance of the algorithm, use C/C++ for programming simulation. Through three different topological structures of mine topology, average topology and random topology, the performance evaluation is carried out using four indicators: the number of alive nodes, network lifetime, network energy consumption and average energy of node. Through simulation calculation, the ISC-EAR routing algorithm has good technical performance advantages compared with the benchmark routing algorithm IGreedy, which can increase the survival time of nodes, reduce network energy consumption, and prolong the survival time of the network. It has better advancement.},
 year = {2020}
}

Copy | Download

TY  - JOUR
T1  - Research on 3D Wireless Sensor Networks ISC-EAR Routing Algorithm
AU  - Zhanguo Li
AU  - Donghong Shan
Y1  - 2020/11/16
PY  - 2020
N1  - https://doi.org/10.11648/j.net.20200802.11
DO  - 10.11648/j.net.20200802.11
T2  - Advances in Networks
JF  - Advances in Networks
JO  - Advances in Networks
SP  - 16
EP  - 21
PB  - Science Publishing Group
SN  - 2326-9782
UR  - https://doi.org/10.11648/j.net.20200802.11
AB  - In order to improve the performance of 3D wireless sensor networks, an Iterative Split Clustering Energy Angle Routing (ISC-EAR) Algorithm is proposed. The design idea is discussed theoretically, and the design idea is as follows: on the basis of the link bandwidth and other meeting user QoS requirements, all nodes within the node perception radius or communication radius are regarded as next hop candidates. Select the next hop node according to the total energy consumption of the node (including sending and receiving energy consumption), and try to ensure that the farthest transmission distance consumes the least energy. Select the current node, the destination node and the next hop node, the space vector with the current node as the vertex has the smallest angle, that is, the candidate node closest to the destination node as the next hop node. In order to verify the performance of the algorithm, use C/C++ for programming simulation. Through three different topological structures of mine topology, average topology and random topology, the performance evaluation is carried out using four indicators: the number of alive nodes, network lifetime, network energy consumption and average energy of node. Through simulation calculation, the ISC-EAR routing algorithm has good technical performance advantages compared with the benchmark routing algorithm IGreedy, which can increase the survival time of nodes, reduce network energy consumption, and prolong the survival time of the network. It has better advancement.
VL  - 8
IS  - 2
ER  -

Copy | Download

Author Information

Zhanguo Li

School of Computer, Pingdingshan University, Pingdingshan, China
Donghong Shan

School of Computer, Pingdingshan University, Pingdingshan, China

Download PDF

Sections

Plain Text BibTeX RIS

APA Style

Zhanguo Li, Donghong Shan. (2020). Research on 3D Wireless Sensor Networks ISC-EAR Routing Algorithm. Advances in Networks, 8(2), 16-21. https://doi.org/10.11648/j.net.20200802.11

Copy | Download

ACS Style

Zhanguo Li; Donghong Shan. Research on 3D Wireless Sensor Networks ISC-EAR Routing Algorithm. Adv. Netw. 2020, 8(2), 16-21. doi: 10.11648/j.net.20200802.11

Copy | Download

AMA Style

Zhanguo Li, Donghong Shan. Research on 3D Wireless Sensor Networks ISC-EAR Routing Algorithm. Adv Netw. 2020;8(2):16-21. doi: 10.11648/j.net.20200802.11

Copy | Download

@article{10.11648/j.net.20200802.11,
  author = {Zhanguo Li and Donghong Shan},
  title = {Research on 3D Wireless Sensor Networks ISC-EAR Routing Algorithm},
  journal = {Advances in Networks},
  volume = {8},
  number = {2},
  pages = {16-21},
  doi = {10.11648/j.net.20200802.11},
  url = {https://doi.org/10.11648/j.net.20200802.11},
  eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.net.20200802.11},
  abstract = {In order to improve the performance of 3D wireless sensor networks, an Iterative Split Clustering Energy Angle Routing (ISC-EAR) Algorithm is proposed. The design idea is discussed theoretically, and the design idea is as follows: on the basis of the link bandwidth and other meeting user QoS requirements, all nodes within the node perception radius or communication radius are regarded as next hop candidates. Select the next hop node according to the total energy consumption of the node (including sending and receiving energy consumption), and try to ensure that the farthest transmission distance consumes the least energy. Select the current node, the destination node and the next hop node, the space vector with the current node as the vertex has the smallest angle, that is, the candidate node closest to the destination node as the next hop node. In order to verify the performance of the algorithm, use C/C++ for programming simulation. Through three different topological structures of mine topology, average topology and random topology, the performance evaluation is carried out using four indicators: the number of alive nodes, network lifetime, network energy consumption and average energy of node. Through simulation calculation, the ISC-EAR routing algorithm has good technical performance advantages compared with the benchmark routing algorithm IGreedy, which can increase the survival time of nodes, reduce network energy consumption, and prolong the survival time of the network. It has better advancement.},
 year = {2020}
}

Copy | Download

TY  - JOUR
T1  - Research on 3D Wireless Sensor Networks ISC-EAR Routing Algorithm
AU  - Zhanguo Li
AU  - Donghong Shan
Y1  - 2020/11/16
PY  - 2020
N1  - https://doi.org/10.11648/j.net.20200802.11
DO  - 10.11648/j.net.20200802.11
T2  - Advances in Networks
JF  - Advances in Networks
JO  - Advances in Networks
SP  - 16
EP  - 21
PB  - Science Publishing Group
SN  - 2326-9782
UR  - https://doi.org/10.11648/j.net.20200802.11
AB  - In order to improve the performance of 3D wireless sensor networks, an Iterative Split Clustering Energy Angle Routing (ISC-EAR) Algorithm is proposed. The design idea is discussed theoretically, and the design idea is as follows: on the basis of the link bandwidth and other meeting user QoS requirements, all nodes within the node perception radius or communication radius are regarded as next hop candidates. Select the next hop node according to the total energy consumption of the node (including sending and receiving energy consumption), and try to ensure that the farthest transmission distance consumes the least energy. Select the current node, the destination node and the next hop node, the space vector with the current node as the vertex has the smallest angle, that is, the candidate node closest to the destination node as the next hop node. In order to verify the performance of the algorithm, use C/C++ for programming simulation. Through three different topological structures of mine topology, average topology and random topology, the performance evaluation is carried out using four indicators: the number of alive nodes, network lifetime, network energy consumption and average energy of node. Through simulation calculation, the ISC-EAR routing algorithm has good technical performance advantages compared with the benchmark routing algorithm IGreedy, which can increase the survival time of nodes, reduce network energy consumption, and prolong the survival time of the network. It has better advancement.
VL  - 8
IS  - 2
ER  -

Copy | Download