The Research Of Energy-efficient Routing Algorithms In Wireless Sensor Networks

With the rapid development of chips, communication and sensing technologies, wireless sensor network (WSN) has become the key technology in the new era of sensing technologies. In WSN, the tiny sensor nodes which consist of sensing, data processing and wireless communication components, form the network in a self-organization manner and send the data to the remote sink effectively and timely. WSN can be widely used in military sensing, environmental monitoring, anti-terrorism, medical treatment and traffic surveillance, etc.Sensor nodes must be left unattended e.g., in hostile even dangerous environments, which makes it difficult or impossible to recharge or replace their batteries. So saving the batteries and prolonging the lifetime of WSN by designing effectively has become a hotspot all over the world.Based on the purpose of saving the node batteries and prolonging the network lifetime, in this article, the concept, system structure, characteristic, application, current research status and research hotspot issues of WSN are first introduced. And then representative energy efficient routing protocols, data aggregation algorithms and Energy balance algorithms are stated in detail, then advantages and disadvantages are analyzed and compared. The major contributions of this paper include:Firstly, in order to postpone network lifetime and enhance energy efficiency, an novel energy-efficient routing algorithm for WSNs, termed as an energy efficient routing algorithm based on Cluster Head Forecasting and Power Controlling (CHFPC) , is presented in this paper. In CHFPC, cluster head is forecasted based on both energy and distance parameters, and power controlling is used in cluster routing and data transmission, aim to reducing energy consumption of nodes. The simulation results in OMNeT++ indicate that the proposed scheme outperforms LEACH by 23% and 15%, respectively in the terms of the lifetime and residual energy of wireless sensor networks, and the time when a node dies for the first time in CHFPC is longer than that in LEACH, as the initial energy of each node varies.Secondly, because the transmission delay usually is long in existing data aggregation algorithms, an Chain-based Fast Data Aggregation algorithm based on a Suppositional Cell (CFDASC) is also proposed in this paper. The algorithm attaches nodes to every suppositional cell, and the nodes in one suppositional cell act as the cluster head of data aggregation inside cell, then the data along the cells chain is aggregated and sent to sink node. As a result, data aggregation course is quickened, data quantity is lessened, node energy is saved, and network lifetime is prolonged. Detailed simulations of sensor network environments in OMNeT++ demonstrate that CFDASC algorithm outperforms PEGASIS by 50.03% in average packet transmission delay, at the cost of tiny energy increment, only 6.07% than that in PEGASIS.Finally, when node energy balance or unbalance in wireless sensor network, four performance parameters, including network lifetime, average packet transmission delay, overall energy consume and network throughput, are analyzed and compared in detail. The compare results indicate that the holistic performance of node energy balance network observably precedes that in energy unbalance network. So energy balance strategy is necessary in wireless sensor network, aim to balancing the energy consume between nodes. Based on those, An energy balancing strategy (EBS) is proposed. EBS achieves energy balancing by protecting the hotspot nodes. The simulation results validate correctness of academic analyse and comparion.