An Improved Routing Method for Electric Power Communication Networks

Fan Bing; Wang Yujie

doi:doi:10.11648/j.ajnc.20160505.15

| Peer-Reviewed

An Improved Routing Method for Electric Power Communication Networks

Fan Bing, Wang Yujie

Published in American Journal of Networks and Communications (Volume 5, Issue 5)

Received: 18 October 2016 Accepted: Published: 19 October 2016

Views: Downloads:

Download PDF

Share This Article

Twitter
Linked In
Facebook

Abstract

An improved routing method to reduce the risk of electric power communication networks (EPCN), called low risk routing method (LRRM), is proposed based on the fact that different types of traffic with different service importance levels in EPCN. In order to calculate the vulnerability of EPCN under artificial attacks, deliberate attack and betweenness first attack models are created. Based on the attack models, a routing model considering service importance distribution, edge betweenness distribution and path length is presented. Taking into account both network risk and service delay requirements, optimized routing is calculated using Dijkstra algorithm and chaotic clonal genetic algorithm (CCGA). Under different artificial attacks, the vulnerability of an EPCN applying LRRM and Shortest Path First method (SPFM) are compared by numerical simulation. The results show that LRRM can effectively reduce the network risk.

Published in	American Journal of Networks and Communications (Volume 5, Issue 5)
DOI	10.11648/j.ajnc.20160505.15
Page(s)	115-120
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), 2024. Published by Science Publishing Group

Keywords

Electric Power Communication Networks, Network Vulnerability, Routing Method, Attack Model, Genetic Algorithm

References

[1]	X. Deng, X. Wang and X. Chen et al., “Reliability of power telecom network based on the efficient energy model,” Journal of Chongqing University of Posts and Telecommunications (Natural Science Edition), vol. 24(3), 2012, pp. 378–382.
[2]	C. H. Hauser, D. E. Bakken and A. Bose, “A failure to communicatepp. next generation communication requirements, technologies, and architecture for the electric power grid,” IEEE Power & Energy Magazine, vol. 3(2), 2005, pp. 47–55.
[3]	X. Zhaoxia, G. Manimaran and V. Vittal, “An information architecture for future power systems and its reliability analysis,” IEEE Transactions on Power Systems, vol. 17(3), 2002, pp. 857–863.
[4]	P. Chołda, “Risk-aware design and management of resilient networks,” The 9th International Conference on Availability, Reliability and Security (ARES), pp. 468–475, September, 2014.
[5]	F. Dikbiyik, M. Tornatore and B. Mukherjee, “Minimizing the risk from disaster failures in optical backbone networks,” Journal of Lightwave Technology, vol. 32(18), 2014, pp. 3175–3183.
[6]	S. Yuan and B. Wang, “Highly available path routing in mesh networks under multiple link failures,” IEEE Transactions on Reliability, vol. 60(4), 2011, pp. 823–832.
[7]	X. Ming, M. Tornatore and C. U. Martel et al., “Risk–aware provisioning for optical WDM mesh networks,” IEEE/ACM Transactions on Networking, vol. 19(3), 2011, pp. 921–931.
[8]	S. W. Jeon, K. Jung and H. Chang, “Fully distributed algorithms for minimum delay routing under heavy traffic,” IEEE Transactions on Mobile Computing, vol. 13(5), 2014, pp. 1048–1060.
[9]	B. Vidalenc, L. Noirie and L. Ciavaglia et al., “Dynamic risk–aware routing for OSFP networks,” The 13th IFIP/IEEE International Symposium on Integrated Network Management (IM2013), pp. 226–234, May, 2013.
[10]	W. Cai, H. Yang, and F. Xiong et al., “An optimized service routing allocation method for electric power communication network considering reliability,” Power System Technology, vol. 37(12), 2013, pp. 3541–3545.
[11]	Q. Zeng, X. Qiu, and S. Guo et al., “Risk balancing based routing mechanism for power communications service,” Journal of Electronics & Information Technology, vol. 35(6), 2013, pp. 1318–1324.
[12]	K. Deb, A. Pratap and S. Agarwal et al., “A fast and elitist multiobjective genetic algorithm: NSGA–II,” IEEE Transactions on Evolutionary Computation, vol. 6(2), 2002, pp. 182–197.
[13]	P. Wright, M. C. Parker and A. Lord, “Minimum- and maximum-entropy routing and spectrum assignment for flexgrid elastic optical networking,” IEEE/OSA Journal of Optical Communications and Networking, vol. 7(1), 2015, pp. A66–A72.
[14]	S. C. Huang, M. K. Jiau and C. H. Lin, “Optimization of the carpool service problem via a fuzzy-controlled genetic algorithm,” IEEE Transactions on Fuzzy Systems, vol. 23(5), 2015, pp. 1698–1712.
[15]	Z. Cai, L. Zheng, and S. Zhu, “Chaotic immune optimization based resource allocation in cognitive radio network,” Acta Phys. Sin., vol. 61(11), 2012, pp. 118801.
[16]	H. Yetgin, K. T. K. Cheung, L. Hanzo, “Multi–objective routing optimization using evolutionary algorithms,” 2012 IEEE Wireless Communications and Networking Conference (WCNC), pp. 3030–3034, April, 2012.
[17]	B. Fan, L. Tang, “Vulnerability analysis of power communication network,” Proceedings of CSEE, vol. 34(7), 2014, pp. 1191–1197.
[18]	M. Igor, B. Mario and K. Ljupco, “Vulnerability of complex networks,” Communications in Nonlinear Science and Numerical Simulation, vol. 16, 2011, pp. 341–349.
[19]	L. Hanzo, R. Maunder and J. Wang et al., “Near-capacity variable-length coding: regular and exit-chart-aided irregular designs,” Wiley-IEEE Press, 2011, pp. 36–37.
[20]	J. Ou, “Theory of portfolio and risk based on incremental entropy,” The Journal of Risk Finance, vol. 6(1), 2005, pp. 31–39.
[21]	Y. Jiang, S. He and X. Li, “A maximum entropy model for large-scale portfolio optimization,” International Conference on Risk Management & Engineering Management 2008, pp. 610–615, Nov, 2008.
[22]	B. Fan, Y. Zeng and L. Tang, “Chaotic clonal genetic algorithm for routing optimization,” Advanced Materials Research, vol. 1046, 2014, pp. 371–374.
[23]	S. Fang, E. Zou and J. Xin et al., “New chaos genetic algorithm applied in multi–constrained QoS routing,” Application Research of Computers, vol. 29(8), 2012, pp. 3078–3080.

Cite This Article

Plain Text BibTeX RIS

APA Style

Fan Bing, Wang Yujie. (2016). An Improved Routing Method for Electric Power Communication Networks. American Journal of Networks and Communications, 5(5), 115-120. https://doi.org/10.11648/j.ajnc.20160505.15

Copy | Download

ACS Style

Fan Bing; Wang Yujie. An Improved Routing Method for Electric Power Communication Networks. Am. J. Netw. Commun. 2016, 5(5), 115-120. doi: 10.11648/j.ajnc.20160505.15

Copy | Download

AMA Style

Fan Bing, Wang Yujie. An Improved Routing Method for Electric Power Communication Networks. Am J Netw Commun. 2016;5(5):115-120. doi: 10.11648/j.ajnc.20160505.15

Copy | Download

@article{10.11648/j.ajnc.20160505.15,
  author = {Fan Bing and Wang Yujie},
  title = {An Improved Routing Method for Electric Power Communication Networks},
  journal = {American Journal of Networks and Communications},
  volume = {5},
  number = {5},
  pages = {115-120},
  doi = {10.11648/j.ajnc.20160505.15},
  url = {https://doi.org/10.11648/j.ajnc.20160505.15},
  eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.ajnc.20160505.15},
  abstract = {An improved routing method to reduce the risk of electric power communication networks (EPCN), called low risk routing method (LRRM), is proposed based on the fact that different types of traffic with different service importance levels in EPCN. In order to calculate the vulnerability of EPCN under artificial attacks, deliberate attack and betweenness first attack models are created. Based on the attack models, a routing model considering service importance distribution, edge betweenness distribution and path length is presented. Taking into account both network risk and service delay requirements, optimized routing is calculated using Dijkstra algorithm and chaotic clonal genetic algorithm (CCGA). Under different artificial attacks, the vulnerability of an EPCN applying LRRM and Shortest Path First method (SPFM) are compared by numerical simulation. The results show that LRRM can effectively reduce the network risk.},
 year = {2016}
}

Copy | Download

TY  - JOUR
T1  - An Improved Routing Method for Electric Power Communication Networks
AU  - Fan Bing
AU  - Wang Yujie
Y1  - 2016/10/19
PY  - 2016
N1  - https://doi.org/10.11648/j.ajnc.20160505.15
DO  - 10.11648/j.ajnc.20160505.15
T2  - American Journal of Networks and Communications
JF  - American Journal of Networks and Communications
JO  - American Journal of Networks and Communications
SP  - 115
EP  - 120
PB  - Science Publishing Group
SN  - 2326-8964
UR  - https://doi.org/10.11648/j.ajnc.20160505.15
AB  - An improved routing method to reduce the risk of electric power communication networks (EPCN), called low risk routing method (LRRM), is proposed based on the fact that different types of traffic with different service importance levels in EPCN. In order to calculate the vulnerability of EPCN under artificial attacks, deliberate attack and betweenness first attack models are created. Based on the attack models, a routing model considering service importance distribution, edge betweenness distribution and path length is presented. Taking into account both network risk and service delay requirements, optimized routing is calculated using Dijkstra algorithm and chaotic clonal genetic algorithm (CCGA). Under different artificial attacks, the vulnerability of an EPCN applying LRRM and Shortest Path First method (SPFM) are compared by numerical simulation. The results show that LRRM can effectively reduce the network risk.
VL  - 5
IS  - 5
ER  -

Copy | Download

Author Information

Fan Bing

State Key Laboratory of Alternate Electrical Power System with Renewable Energy Sources (North China Electric Power University), Beijing, China
Wang Yujie

School of Electrical & Electronic Engineering, North China Electric Power University, Beijing, China

Download PDF

Sections

Plain Text BibTeX RIS

APA Style

Fan Bing, Wang Yujie. (2016). An Improved Routing Method for Electric Power Communication Networks. American Journal of Networks and Communications, 5(5), 115-120. https://doi.org/10.11648/j.ajnc.20160505.15

Copy | Download

ACS Style

Fan Bing; Wang Yujie. An Improved Routing Method for Electric Power Communication Networks. Am. J. Netw. Commun. 2016, 5(5), 115-120. doi: 10.11648/j.ajnc.20160505.15

Copy | Download

AMA Style

Fan Bing, Wang Yujie. An Improved Routing Method for Electric Power Communication Networks. Am J Netw Commun. 2016;5(5):115-120. doi: 10.11648/j.ajnc.20160505.15

Copy | Download

@article{10.11648/j.ajnc.20160505.15,
  author = {Fan Bing and Wang Yujie},
  title = {An Improved Routing Method for Electric Power Communication Networks},
  journal = {American Journal of Networks and Communications},
  volume = {5},
  number = {5},
  pages = {115-120},
  doi = {10.11648/j.ajnc.20160505.15},
  url = {https://doi.org/10.11648/j.ajnc.20160505.15},
  eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.ajnc.20160505.15},
  abstract = {An improved routing method to reduce the risk of electric power communication networks (EPCN), called low risk routing method (LRRM), is proposed based on the fact that different types of traffic with different service importance levels in EPCN. In order to calculate the vulnerability of EPCN under artificial attacks, deliberate attack and betweenness first attack models are created. Based on the attack models, a routing model considering service importance distribution, edge betweenness distribution and path length is presented. Taking into account both network risk and service delay requirements, optimized routing is calculated using Dijkstra algorithm and chaotic clonal genetic algorithm (CCGA). Under different artificial attacks, the vulnerability of an EPCN applying LRRM and Shortest Path First method (SPFM) are compared by numerical simulation. The results show that LRRM can effectively reduce the network risk.},
 year = {2016}
}

Copy | Download

TY  - JOUR
T1  - An Improved Routing Method for Electric Power Communication Networks
AU  - Fan Bing
AU  - Wang Yujie
Y1  - 2016/10/19
PY  - 2016
N1  - https://doi.org/10.11648/j.ajnc.20160505.15
DO  - 10.11648/j.ajnc.20160505.15
T2  - American Journal of Networks and Communications
JF  - American Journal of Networks and Communications
JO  - American Journal of Networks and Communications
SP  - 115
EP  - 120
PB  - Science Publishing Group
SN  - 2326-8964
UR  - https://doi.org/10.11648/j.ajnc.20160505.15
AB  - An improved routing method to reduce the risk of electric power communication networks (EPCN), called low risk routing method (LRRM), is proposed based on the fact that different types of traffic with different service importance levels in EPCN. In order to calculate the vulnerability of EPCN under artificial attacks, deliberate attack and betweenness first attack models are created. Based on the attack models, a routing model considering service importance distribution, edge betweenness distribution and path length is presented. Taking into account both network risk and service delay requirements, optimized routing is calculated using Dijkstra algorithm and chaotic clonal genetic algorithm (CCGA). Under different artificial attacks, the vulnerability of an EPCN applying LRRM and Shortest Path First method (SPFM) are compared by numerical simulation. The results show that LRRM can effectively reduce the network risk.
VL  - 5
IS  - 5
ER  -

Copy | Download