Wireless sensor network coverage optimization algorithm based on Dijkstra method

A wireless sensor and optimization algorithm technology, applied in the field of communication, can solve the problems of high complexity and low search ability of high-dimensional optimization space, and achieve the effects of saving energy consumption, shortening communication distance, and prolonging the life of the network

CN108271168AInactive Publication Date: 2018-07-10LUDONG UNIVERSITY
3 Cites 5 Cited by

Patent Information

Authority / Receiving Office
CN · China
Current Assignee / Owner
Publication Date
2018-07-10
Estimated Expiration
Not applicable · inactive patent

Smart Images

  • Figure 1
    Figure 1
  • Figure 2
    Figure 2
  • Figure 3
    Figure 3
Patent Text Reader

Abstract

The invention provides a wireless network coverage optimization algorithm based on a Dijkstra method. An energy transmission model is improved through computing energy loss between nodes, and meanwhile energy constraint and channel selection of a sensor network are used as constraint conditions. The Dijkstra algorithm in a graph theory is used for converting global optimum into optimum between thenodes, an existing network layered framework problem is converted into sub-problems of corresponding problems of each layer of a network layered framework, the influence of energy and channel on thewireless sensor network design is embodied, and the optimal coverage is achieved. Analysis on availability and complexity of the optimization algorithm is also provided herein. Simulated tests and data analysis show that compared with the same kinds of algorithms, the algorithm provided by the invention can achieve larger network coverage rate, faster convergence speed and short consumed time, andthus the network performance of the wireless sensor can be effectively improved.
Need to check novelty before this filing date? Find Prior Art

Description

technical field

[0001] The invention relates to a network coverage optimization algorithm, in particular to a wireless sensor network coverage optimization algorithm based on a Dijkstra method, belonging to the technical field of communication. Background technique

[0002] Wireless Sensor Networks (WirelessSensorNetworks, WSN) is a network structure composed of wireless communication technologies. It integrates the three major technologies of sensors, single-chip computers and networks. And other fields have broad application prospects [1]-[3].

[0003] Wireless sensor network nodes are composed of multi-hop and self-organizing methods, which can perceive, process and analyze various information in the environment, and send the processed information to users, which brings a new way to obtain and process information , have a huge impact on the development of the future information age. Coverage refers to the effective monitoring range of wireless sensor networks, which is ...

Examples

Embodiment Construction

[0040] A wireless sensor network coverage optimization algorithm based on the Dijkstra method, which improves the energy transfer model by calculating the energy loss between nodes, and takes the energy constraints and channel selection of the sensor network as constraints. Using the Dijkstra algorithm (Dijkstra) in graph theory to transform the global optimum into the optimum between nodes, and transform the existing network layered architecture problem into sub-problems corresponding to each layer of the network layered architecture, Reflect the impact of energy and channel on the design of wireless sensor networks to achieve optimal coverage.

[0041] Assuming that n wireless sensor nodes are randomly generated in the target area, the set {1,2,...,n} formed is represented by graph G, and the edges formed by nodes and nodes (denoted as e ij ) with weight w ij ;

[0042] The optimization algorithm steps are as follows:

[0043] S1: Select the initial node First, determin...