In order to solve the problems of information overlap
and without consideration on node-energy utilization rate and network transmission security in Gossiping protocol of wireless sensor networks
according to idea of minimum spanning tree idea is generated
by Prim or Kruskal algorithms of graph theory
a scheme of energy-efficient secure routing(EESR)of wireless sensor networks is proposed based on improved minimum spanning tree algorithm.It not only makes full use of the energy but also prevents malicious nodes from tampering or loss of datapacket by introducing reliability and energy value as weight values of sides.The experimental result shows that the proposed EESR algorithm improves the efficiency of network energy
reduces the loss rate of network packets and extends the life cycle of wireless sensor networks.
Accurate energy model for WSN node and its optimal design [J]. Kan Baoqiang1,2, Cai Li1, Zhu Hongsong2 & Xu Yongjun2 1. School of Science, Air Force Engineering Univ., Xi’an 710051, P. R. China; 2. Lab of Wireless Sensor Networks, Inst. of Computing Technology, Chinese Academy of Sciences, Beijing 100080, P. R. China (Received December 10, 2006). Journal of Systems Engineering and Electronics . 2008(03)
Multicriteria Steiner tree with the cost of Steiner vertices [J] . M. Sh. Levin,A. A. Zamkovoy. Journal of Communications Technology and Electronics . 2011 (12)
A Survey on Wireless Sensor Network Security [J] . Sen,Jaydip. International Journal of Communication Networks and Information Security . 2009 (2)
Trust-based security for wireless ad hoc and sensor networks [J] . A. Boukerch,L. Xu,K. EL-Khatib. Computer Communications . 2007 (11)
Negotiation-Based Protocols for Disseminating Information in Wireless Sensor Networks [J] . Joanna Kulik,Wendi Heinzelman,Hari Balakrishnan. Wireless Networks . 2002 (2)