CN103002538A - Wireless sensor network topology control method based on localization shortest path tree - Google Patents

Wireless sensor network topology control method based on localization shortest path tree Download PDF

Info

Publication number
CN103002538A
CN103002538A CN2012105647945A CN201210564794A CN103002538A CN 103002538 A CN103002538 A CN 103002538A CN 2012105647945 A CN2012105647945 A CN 2012105647945A CN 201210564794 A CN201210564794 A CN 201210564794A CN 103002538 A CN103002538 A CN 103002538A
Authority
CN
China
Prior art keywords
node
network
neighbor
power
control method
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN2012105647945A
Other languages
Chinese (zh)
Inventor
贺静
赵壮
梅武钢
尹崇禄
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
JIANGSU ZHONGKE FANLIAN INTERNET OF THINGS TECHNOLOGY Co Ltd
Original Assignee
JIANGSU ZHONGKE FANLIAN INTERNET OF THINGS TECHNOLOGY Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by JIANGSU ZHONGKE FANLIAN INTERNET OF THINGS TECHNOLOGY Co Ltd filed Critical JIANGSU ZHONGKE FANLIAN INTERNET OF THINGS TECHNOLOGY Co Ltd
Priority to CN2012105647945A priority Critical patent/CN103002538A/en
Publication of CN103002538A publication Critical patent/CN103002538A/en
Pending legal-status Critical Current

Links

Classifications

    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The invention belongs to the technical field of wireless sensor network protocols and particularly relates to a power control scheme for a wireless sensor network with chargeable nodes. The scheme is mainly used for simplifying a network structure as much as possible and simultaneously reducing node transmitting power and node degree and achieving a target of balancing and saving network energy consumption by means of an modified local shortest path tree construction method according to local topology knowledge of various nodes during generating of a simplified topology structure through power control in a wireless sensor network.

Description

Wireless sense network topology control method based on the localization shortest path tree
Technical field
The invention belongs to radio sensing network protocol technology field, be specifically related to a kind of wireless sense network power control scheme towards having chargeable node.When this scheme is mainly used in wireless sensor network generating the topological structure of simplifying by power control, local topology knowledge according to each node, by the local shortest path tree building method of revising, when network configuration is simplified as far as possible, reduce the node transmitting power, reduce the node number of degrees, thereby reach target balanced and saving network energy consumption.
Background technology
In the last few years, wireless multi-hop network (wireless sensor network, mobile Ad hoc network, the wireless mesh network etc.) correlation technique in field had obtained the extensive concern of academia and industrial quarters, and had obtained swift and violent development.
Topology control is one of important technology of wireless multi-hop network performance optimization.The Main Means of topology control is by the localized network state information of each node according to self, and self adaptation is regulated self transmitting power, on the basis that keeps network connectivty, bears sparse network configuration.Simplicity of design and the topology control method of performance optimization have become one of important directions that wireless network performance optimizes.
Topology control method comprises concentrates optimized algorithm and local formula optimized algorithm.Concentrate optimized algorithm to require the network global state information, the algorithm optimization performance is good, but complexity is high, the network information knowledge quantity of needs is large.Local formula optimized algorithm only requires that each node possesses local topology knowledge, and algorithm is simple, usually can obtain the local optimum performance.
Summary of the invention
The present invention is a kind of power control scheme of the wireless sense network for having chargeable node.During topological structure that this scheme is mainly used in simplifying by power control generation in by chargeable node and the wireless sense network that can not charge node forms, construct the local topology network information of each node, on this basis respectively for chargeable node with can not charge node find the solution its localization shortest path spanning tree, and the neighbor node that obtains each node is gathered, the through-put power that wireless sensing is online and communication radius, finally the neighbor node collection according to each node makes up the network topology of simplifying, thereby reduce the node transmitting power, reduce the node number of degrees, reach target balanced and saving network energy consumption.
In the present invention: make G that (V, E) represents network diagram, wherein the set of V (G) representation node, E (G) represent the set on limit in the network; Two node x ∈ V (G) and y ∈ V (G) among the figure-{ the distance note between the x} is d XyIf satisfy d Xy≤ R then claims limit (x, y) ∈ E (G), the subtraction of "-" representative set; Each node is equipped with a cover omnidirectional antenna, the maximum transmitted radius of R representation node; Each network node can according to and neighbor node between distance, from the main regulation through-put power, and satisfy the minimum power requirement that receiving terminal is correctly decoded; For a node x in the network, the hop neighbor node set of N (x) representation node x, wherein x ∈ V (G) for y ∈ N (x), has (x, y) E (G); But the node in the network comprises recharging node and can not the recharging node, but the recharging node can obtain energy and be converted into electric weight from nature by means such as solar energy, mechanical systems, recharging node set note is A, can not the recharging node battery-powered, this node set note is B, A+B=V (G)
Figure BDA00002644037800021
Because aggregation node has infinite energy, therefore, can make it belong to set A, wherein "+" represents the add operation of set or claims union operation; The cost of every link is set as geometrical length or the link power value of this link.
For chargeable node with can not charge node find the solution its localization shortest path spanning tree, and obtain the neighbor node set of each node:
(1) neighbor node of chargeable node set generation method: for each chargeable node v, v ∈ A, structure one hop neighbor topological diagram
Figure BDA00002644037800022
Find the solution figure
Figure BDA00002644037800023
The shortest path spanning tree take v as tree root, the weight of every link is the cost of this link in the computational process, and obtains v in this tree upper hop neighbor node set, note is done
Figure BDA00002644037800024
And with the hop neighbor node set of this neighbor node set as v;
(2) neighbor node set generation method that can not charge node:
Step 1: can not charge node u for each, u ∈ B, structure one hop neighbor topological diagram
Figure BDA00002644037800025
Find the solution
Figure BDA00002644037800026
The shortest path spanning tree take u as tree root, the weight of every link is the cost of this link in the computational process, then obtains the hop neighbor node set of u on this tree, note is done
Figure BDA00002644037800027
For any x ∈ A and x ∈ N (u), if
Figure BDA00002644037800028
But
Figure BDA00002644037800029
Then order
Figure BDA000026440378000210
Be the hop neighbor node set of node x on this tree;
Step 2: the node x that belongs to set B, arbitrary node in the neighbor node set that it obtains in previous step is y, and y also belongs to set B, if can indirectly arrive by a node that belongs to set A, then can concentrate from the neighbor node of x and leave out this node; Can not charge node u for each, u ∈ B carries out following operation: for arbitrarily
Figure BDA00002644037800031
And
Figure BDA00002644037800032
If exist node y to satisfy
Figure BDA00002644037800033
And y ∈ A and
Figure BDA00002644037800034
Then
Figure BDA00002644037800035
Then, will
Figure BDA00002644037800036
Hop neighbor node set as u.
Described wireless sense network Poewr control method, in a hop neighbor node set of arbitrary node, with arrive in this set the power of the required transmission of node farthest as this arbitrary node the through-put power on the network after the power control, will arrive this farthest the transmission range of node as this arbitrary node control communication radius on the rear network at power.
Described wireless sense network Poewr control method simplifies for what make final generation that every limit all is two-way on the topological diagram, and to each node u, u ∈ V (G) carries out following operation: for arbitrarily
Figure BDA00002644037800037
If
Figure BDA00002644037800038
Then
Figure BDA00002644037800039
Described wireless sense network Poewr control method, the network topology according to the neighbor node collection structure of each node is simplified makes up the concrete grammar of simplifying network topology G ' as follows: V (G ')=V (G);
Figure BDA000026440378000310
Figure BDA000026440378000311
Embodiment
Node single-hop scope local topology building method:
For each the node x in the network, x ∈ V (G), structure one hop neighbor topological diagram, note is done Concrete grammar is as follows: V ( G x 1 ) = N ( x ) + { x } ; E ( G x 1 ) = { ( u , v ) : u ∈ V ( G x 1 ) , v ∈ V ( G x 1 ) , ( u , v ) ∈ E ( G ) } .
The neighbor node set generation method of chargeable node:
For each chargeable node v, v ∈ A finds the solution figure
Figure BDA000026440378000314
The shortest path spanning tree take v as tree root, the weight of every link is the cost of this link in the computational process, and obtains v in this tree upper hop neighbor node set, note is done
Figure BDA000026440378000315
And with the hop neighbor node set of this neighbor node set as v, and will arrive in this set the required through-put power of node farthest as node v the through-put power on the network after the power control, will arrive this farthest the transmission range of node then should gather and announce to gathering as the communication radius of node v on network after the power control
Figure BDA000026440378000316
In each node.
Neighbor node set generation method that can not charge node:
Step 1:
This step target: the symmetry that keeps internodal limit in set A and the set B.
Can not charge node u for each, u ∈ B finds the solution
Figure BDA00002644037800041
The shortest path spanning tree take u as tree root, the weight of every link is the cost of this link in the computational process, then obtains the neighbor node set of u on this tree, note is done
Figure BDA00002644037800042
For any x ∈ A and x ∈ N (u), if
Figure BDA00002644037800043
But
Figure BDA00002644037800044
Then order
Step 2:
This step target: for the node that belongs to set B (such as x), for the arbitrary node (such as y) in its neighbor node set that in previous step, obtains, and y also belongs to set B, if can indirectly arrive by a node that belongs to set A, then can concentrate from the neighbor node of x and leave out this node.
Can not charge node u for each, u ∈ B carries out following operation: for arbitrarily And
Figure BDA00002644037800047
If exist node y to satisfy And y ∈ A and
Figure BDA00002644037800049
Then
Figure BDA000026440378000410
Then, will
Figure BDA000026440378000411
As the hop neighbor node set of u, and will arrive in this set the required through-put power of node farthest as node u the through-put power on the network after the power control, will arrive this farthest the transmission range of node as node u at the rear communication radius on the network of power control.
Unidirectional limit processing method:
So that final simplifying on the topological diagram of generating, every limit all is two-way.
For each node u, u ∈ V (G) carries out following operation: for arbitrarily
Figure BDA000026440378000412
If, Then,
Structure is simplified network topology G ':
The neighbor node collection that obtains according to above step generates the network topology G ' that simplifies, and namely the total limit of the node in all nodes and its neighborhood forms the new topology of simplifying in the network.The cost of its link can be set as geometrical length or the link power value of this link, decides according to actual conditions.
It is as follows that structure is simplified the specific algorithm of network topology G ':
Figure BDA000026440378000415
Figure BDA00002644037800051
Simplify topological diagram G ' structure complete.

Claims (7)

  1. Based on the localization shortest path tree the wireless sense network topology control method, it is characterized in that: in by chargeable node and the wireless sense network that can not charge node forms, construct the local topology network information of each node, on this basis respectively for chargeable node with can not charge node find the solution its localization shortest path spanning tree, and the neighbor node that obtains each node is gathered, online through-put power and the communication radius of wireless sensing, thereby make up the network topological diagram of simplifying.
  2. 2. wireless sense network topology control method according to claim 1, it is characterized in that: in a hop neighbor node set of arbitrary node, with arrive in this set the power of the required transmission of node farthest as this arbitrary node the through-put power on the network after the power control, will arrive this farthest the transmission range of node as this arbitrary node control communication radius on the rear network at power.
  3. 3. wireless sense network topology control method according to claim 1, the network configuration that it is characterized in that described wireless sense network is: make G (V, E) represent network diagram, wherein the set of V (G) representation node, E (G) represent the set on limit in the network; Two node x ∈ V (G) and y ∈ V (G) among the figure-{ the distance note between the x} is d XyIf satisfy d Xy≤ R then claims limit (x, y) ∈ E (G); The maximum transmitted radius of R representation node; Each network node can according to and neighbor node between distance, from the main regulation through-put power; Each node x ∈ V (G), the hop neighbor node set of N (x) representation node x for y ∈ N (x), has (x, y) ∈ E (G); Chargeable node set note in the network is A, can not charge node set note be B, A+B=V (G),
    Figure FDA00002644037700011
    Aggregation node belongs to set A; The cost of every link is set as geometrical length or the link power value of this link; Node single-hop scope local topology building method is: each node x ∈ V (G), one hop neighbor topology seal is done
    Figure FDA00002644037700012
    And
    V ( G x 1 ) = N ( x ) + { x } ; E ( G x 1 ) = { ( u , v ) : u ∈ V ( G x 1 ) , v ∈ V ( G x 1 ) , ( u , v ) ∈ E ( G ) } .
  4. 4. wireless sense network topology control method according to claim 3 is characterized in that for chargeable node and can not charge node find the solution its localization shortest path spanning tree, and obtains the neighbor node set of each node:
    (1) neighbor node of chargeable node set generation method: for each chargeable node v, v ∈ A, structure one hop neighbor topological diagram Find the solution figure The shortest path spanning tree take v as tree root, the weight of every link is the cost of this link in the computational process, and obtains v in this tree upper hop neighbor node set
    (2) neighbor node set generation method that can not charge node:
    Step 1: can not charge node u for each, u ∈ B, structure one hop neighbor topological diagram
    Figure FDA00002644037700017
    Find the solution
    Figure FDA00002644037700018
    The shortest path spanning tree take u as tree root, the weight of every link is the cost of this link in the computational process, then obtains the hop neighbor node set of u on this tree, note is done
    Figure FDA00002644037700021
    For any x ∈ A and x ∈ N (u), if
    Figure FDA00002644037700022
    But
    Figure FDA00002644037700023
    Then order
    Figure FDA00002644037700025
    Be the hop neighbor node set of node x on this tree;
    Step 2: the node x that belongs to set B, arbitrary node in the neighbor node set that it obtains in previous step is y, and y also belongs to set B, if can indirectly arrive by a node that belongs to set A, then can concentrate from the neighbor node of x and leave out this node; Can not charge node u for each, u ∈ B carries out following operation: for arbitrarily
    Figure FDA00002644037700026
    And
    Figure FDA00002644037700027
    If exist node y to satisfy And y ∈ A and
    Figure FDA00002644037700029
    Then
    Figure FDA000026440377000210
    Then, will
    Figure FDA000026440377000211
    Hop neighbor set of node as u
    Close.
  5. 5. wireless sense network topology control method according to claim 4, it is characterized in that: in a hop neighbor node set of arbitrary node, with arrive in this set the power of the required transmission of node farthest as this arbitrary node the through-put power on the network after the power control, will arrive this farthest the transmission range of node as this arbitrary node control communication radius on the rear network at power.
  6. 6. wireless sense network topology control method according to claim 4 is characterized in that simplifying for what make final generation that every limit all is two-way on the topological diagram, and to each node u, u ∈ V (G) carries out following operation: for arbitrarily
    Figure FDA000026440377000212
    If
    Figure FDA000026440377000213
    Then
    Figure FDA000026440377000214
  7. 7. according to the described wireless sense network topology control method of aforementioned arbitrary claim, it is characterized in that making up the network topology of simplifying according to the neighbor node collection of each node, make up the concrete grammar of simplifying network topology G ' as follows: V (G ')=V (G); E ( G ' ) = { ( u , v ) : u ∈ V ( G ' ) , v ∈ N u 1 } .
CN2012105647945A 2012-12-23 2012-12-23 Wireless sensor network topology control method based on localization shortest path tree Pending CN103002538A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2012105647945A CN103002538A (en) 2012-12-23 2012-12-23 Wireless sensor network topology control method based on localization shortest path tree

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2012105647945A CN103002538A (en) 2012-12-23 2012-12-23 Wireless sensor network topology control method based on localization shortest path tree

Publications (1)

Publication Number Publication Date
CN103002538A true CN103002538A (en) 2013-03-27

Family

ID=47930542

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2012105647945A Pending CN103002538A (en) 2012-12-23 2012-12-23 Wireless sensor network topology control method based on localization shortest path tree

Country Status (1)

Country Link
CN (1) CN103002538A (en)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106026292A (en) * 2016-07-19 2016-10-12 中国科学技术大学 A* algorithm-based battery equalization control method and system
CN106779169A (en) * 2016-11-25 2017-05-31 中国人民解放军63880部队 A kind of intelligent arrest method decomposed based on tree
CN107144287A (en) * 2017-04-28 2017-09-08 深圳充电网科技有限公司 A kind of trip planning method and device of electric car
CN108737191A (en) * 2018-05-31 2018-11-02 中国科学院上海微系统与信息技术研究所 The topology control method based on unsupervised learning towards super-intensive wireless sensor network
CN110324875A (en) * 2019-05-28 2019-10-11 西安空间无线电技术研究所 A kind of wireless sensor network energy consumption balance method for routing based on node center
CN113382464A (en) * 2021-06-03 2021-09-10 北京银河信通科技有限公司 Directional ad hoc network power control method based on minimum spanning tree

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060178150A1 (en) * 2005-02-04 2006-08-10 Samsung Electronics Co., Ltd. Method of transmitting data with minimum energy consumption in a wireless sensor network
CN102612080A (en) * 2012-03-09 2012-07-25 武汉理工大学 Minimum-energy-consumption self-adaption convergent routing method on basis of second-generation wavelet zero tree encoding

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060178150A1 (en) * 2005-02-04 2006-08-10 Samsung Electronics Co., Ltd. Method of transmitting data with minimum energy consumption in a wireless sensor network
CN102612080A (en) * 2012-03-09 2012-07-25 武汉理工大学 Minimum-energy-consumption self-adaption convergent routing method on basis of second-generation wavelet zero tree encoding

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
沈中，常义林，崔灿，张新: "一种基于最短路径树的无线Adhoc网络拓扑维护算法", 《电子与信息学报》 *
翟明: "《燕山大学工学硕士学位论文》", 31 December 2009 *
邓宏贵，朱芝靖，宁新鲜，王晋秀，欧阳志: "基于最短路径的异类传感器网络分布式拓扑控制", 《传感技术学报》 *

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106026292A (en) * 2016-07-19 2016-10-12 中国科学技术大学 A* algorithm-based battery equalization control method and system
CN106779169A (en) * 2016-11-25 2017-05-31 中国人民解放军63880部队 A kind of intelligent arrest method decomposed based on tree
CN107144287A (en) * 2017-04-28 2017-09-08 深圳充电网科技有限公司 A kind of trip planning method and device of electric car
CN107144287B (en) * 2017-04-28 2020-05-05 简单充(杭州)科技有限公司 Travel planning method and device for electric vehicle
CN108737191A (en) * 2018-05-31 2018-11-02 中国科学院上海微系统与信息技术研究所 The topology control method based on unsupervised learning towards super-intensive wireless sensor network
CN108737191B (en) * 2018-05-31 2021-01-19 中国科学院上海微系统与信息技术研究所 Topology control method for ultra-dense wireless sensor network based on unsupervised learning
CN110324875A (en) * 2019-05-28 2019-10-11 西安空间无线电技术研究所 A kind of wireless sensor network energy consumption balance method for routing based on node center
CN110324875B (en) * 2019-05-28 2020-09-18 西安空间无线电技术研究所 Wireless sensor network energy consumption balanced routing method based on node centrality
CN113382464A (en) * 2021-06-03 2021-09-10 北京银河信通科技有限公司 Directional ad hoc network power control method based on minimum spanning tree

Similar Documents

Publication Publication Date Title
CN103916942B (en) LEACH protocol improvement method capable of lowering energy consumption
CN103002538A (en) Wireless sensor network topology control method based on localization shortest path tree
CN101895956B (en) Data transmission method of multilayer distributed wireless sensor network
Gupta et al. GAR: an energy efficient GA-based routing for wireless sensor networks
CN102256267B (en) The node clustering method of energy priority in radio sensing network
CN101394321B (en) Non-uniform clustering method for cluster wireless sensor network based on energy balance
CN104410997B (en) A kind of clustering topology construction method for wireless sensor network
CN103249108B (en) Based on the wireless sensor network energy consumption balance method for routing of Uneven Cluster
Diwakar et al. An energy-efficient level based clustering routing protocol for wireless sensor networks
CN101951655B (en) Reactive routing protocol based on geographic information in wireless sensor network
CN103200643B (en) Based on the distributed fault-tolerance topology control method of dump energy perception
CN103095577B (en) Context-sensitive Uneven Cluster routing algorithm
CN103781143A (en) Cluster tree hierarchical wireless sensor network routing method with optimized energy efficiency
CN106658641A (en) Distributed wireless sensor network clustering routing method
Wan et al. AHP based relay selection strategy for energy harvesting wireless sensor networks
Tang et al. A novel data retrieving mechanism in wireless sensor networks with path-limited mobile sink
CN103068023A (en) Wireless sensor network topology control method based on localization minimum spanning tree
Wu et al. Energy efficient chain based routing protocol for orchard wireless sensor network
CN105025528A (en) Wireless charging sensor network total utility maximization method
CN107612806A (en) Energy of wireless sensor network based on mobile sink node perceives the method for data capture with path architecture
CN103188758A (en) Energy saving method for wireless sensor network
CN108632942A (en) A kind of relay cooperation method based on information energy simultaneous transmission
CN103067873A (en) Energy-saving multicast scheme for wireless sensor network (WSN) provided with rechargeable nodes and multiple sink nodes
CN104519543A (en) Wireless sensor network Sink node selection method and system
Benakappa et al. An energy-aware node disjoint multipath routing protocol for MANETs with dynamictransmission range adjustment

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
AD01 Patent right deemed abandoned

Effective date of abandoning: 20160316

C20 Patent right or utility model deemed to be abandoned or is abandoned