Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

A Linear Programming Method for Wireless Sensor Networks

A wireless sensor and linear programming technology, applied in network planning, network topology, wireless communication, etc., can solve the problems of not forming a unified framework structure, not fully considering the deployment of sensor nodes, etc.

Inactive Publication Date: 2018-11-06
HEILONGJIANG UNIV
View PDF2 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] The purpose of the present invention is to solve the problem that researchers often only take a targeted solution to a certain aspect of wireless sensor network energy consumption, and do not fully consider the problems of sensor node deployment, node scheduling, mobile anchor nodes and data routing, There is no problem of forming a unified framework structure, while the proposed linear programming method for wireless sensor networks

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A Linear Programming Method for Wireless Sensor Networks
  • A Linear Programming Method for Wireless Sensor Networks
  • A Linear Programming Method for Wireless Sensor Networks

Examples

Experimental program
Comparison scheme
Effect test

specific Embodiment approach 1

[0046] Specific implementation mode 1: A linear programming method for a wireless sensor network in this implementation mode is specifically prepared according to the following steps:

[0047] Step 1. Assuming that there are K points in the wireless sensor network, in each time period t in the wireless sensor network lifetime T, select P nodes from K to arrange anchor nodes to obtain the number of anchor nodes as shown in formula (5) Show:

[0048]

[0049] Among them, z θt Indicates whether there is an anchor node at point θ in period t; z θt ∈ {0,1}, when z θt When it is 1, there is an anchor node deployment at point θ in period t, z θt When it is 0, there is no anchor node deployment at point θ in period t; N is the set of anchor node positions; P is the number of anchor nodes, P≤K, and the minimum value of P depends on the actual network requirements; T is the wireless sensor network length of life;

[0050] The number of sensors meets the requirements for active s...

specific Embodiment approach 2

[0082] Specific implementation mode two: the difference between this implementation mode and specific implementation mode one is: the flow balance equation in step two is specifically:

[0083]

[0084] In the formula, a irt =w t ·q irt is an auxiliary variable; x irjst The sum of the data flow from Sensor(i,r) to Sensor(j,m) in period t; Sensor(j,m) is the sensor of type m at point j; m∈R; S jm is the location of candidate sensors around Sensor(j,m); S ir , S jm ∈ S; S ir is the location of candidate sensors around Sensor(i,r); w t is the duration of period t; h r is the data generation rate of sensors of type r; y irθt is the sum of the data flow from Sensor(i,r) to sink node at point θ in period t; N ir The position of the anchor node set close to Sensor(i,r). Other steps and parameters are the same as those in Embodiment 1.

specific Embodiment approach 3

[0085] Specific embodiment three: the difference between this embodiment and specific embodiment one or two is: in step three, according to the energy consumption value f of the sensor ir Calculate the upper limit of the total energy consumption of the sensor as B, as shown in formula (7):

[0086]

[0087] Among them, E r The constraints to be met are:

[0088]

[0089] If the P nodes have no sensor deployment and satisfy the formula (4), then the P nodes cannot have sensor-to-node data flow;

[0090]

[0091] the y irθt is the sum of the data flow from Sensor(i,r) to sink node at point θ in period t if p ir with q irt Satisfy the formula (8), ensure that the sensors that are not deployed are in a dormant state;

[0092] q irt ≤p ir i∈S, r∈R, t∈T (8)

[0093] q irt is the probability that Sensor(i,r) is active in period t; the values ​​are 1 and 0, if q irt If it is 1, Sensor(i,r) is active, if q irt If it is 0, Sensor(i,r) is in a dormant state; z θt ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

This invention discloses a heuristic calculation method of a linear programming formula of a wireless sensor network, and relates to the heuristic calculation method. This invention aims to solve the problem that a sensor node placement, a node scheduling arrangement, a mobile anchor node and a data route are not completely considered so that a uniform frame structure is not formed, and thus provides the heuristic calculation method of the linear programming formula of the wireless sensor network. The method is realized by the following steps: 1, building a wireless sensor network model; 2, calculating the total amount of data transmission in the wireless sensor network model according to a flow balance equation; 3, calculating an upper limit value of the total energy consumption of the wireless sensor network as B; 4, acquiring a network lifetime as shown in the description; 5, acquiring sensor position information; 6, acquiring qirt of the sensor; 7, calculating the position of the anchor node and an information subproblem S3 of the data route; 8, calculating the network lifetimes L2 and L3; 9, acquiring the network lifetime (as shown in the description) of the S3; 10, acquiring the network lifetime as shown in the description; and so on. The method provided by this invention is applied to the field of heuristic calculation.

Description

technical field [0001] The invention relates to a network linear programming method, in particular to a wireless sensor network linear programming method. Background technique [0002] With the development of wireless sensor network technology and its wide application in various fields, all walks of life are full of expectations for the development of sensor networks, and related research in the field of wireless sensor networks has become one of the research hotspots in the world today. Since sensor nodes are usually powered by batteries with very limited energy, the battery energy of sensor nodes directly determines the network life. [0003] When the failure nodes in the network reach a certain proportion, the entire network will be paralyzed and become unusable, and the entire network may need to be redeployed. Sometimes the failure of some important key nodes may also affect the effective transmission of multiple nodes related to it, and then cause regional functional ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): H04W16/18H04W16/22H04W40/10H04W84/18
CPCH04W16/18H04W16/22H04W40/10H04W84/18Y02D30/70
Inventor 秦丹阳杨松祥贾爽王尔馥丁群马宏斌
Owner HEILONGJIANG UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com