CN103124427A - Backbone structure constructing method of wireless sensor network based on communication supporting tree - Google Patents
Backbone structure constructing method of wireless sensor network based on communication supporting tree Download PDFInfo
- Publication number
- CN103124427A CN103124427A CN2012105644896A CN201210564489A CN103124427A CN 103124427 A CN103124427 A CN 103124427A CN 2012105644896 A CN2012105644896 A CN 2012105644896A CN 201210564489 A CN201210564489 A CN 201210564489A CN 103124427 A CN103124427 A CN 103124427A
- Authority
- CN
- China
- Prior art keywords
- node
- nodes
- network
- recharging
- grey
- 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
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 relates to a backbone structure constructing method of a wireless sensor network based on a communication supporting tree and belongs to the technical field of a wireless sensor network protocol. The method is mainly used in a wireless sensor network which is formed by chargeable nodes and non-chargeable nodes, a low-cost network backbone structure is constructed, during construction, chargeable nodes are selected preferentially, nodes of which residual energy is high are selected preferentially when at least one non-chargeable node is selected, the number of non-chargeable nodes is reduced, the working capacity and the energy consumption of non-chargeable nodes are reduced, and the network service life is prolonged.
Description
Technical field
The invention belongs to radio sensing network protocol technology field, be specifically related to the network configuration computational methods in a kind of wireless sense network.The method is mainly used in being communicated with the method for support set by structure, structure backbone network structure by in chargeable node and the wireless sensor network that can not charge node forms.In the construction process of this structure, the chargeable node of preferential selection is served as the backbone structure node, when needs are selected can not charge node to serve as backbone node, with select quantity as far as possible less, the dump energy high node of trying one's best, to reach the purpose that extends network lifetime.
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.
In many research directions in this field, the working life of prolonging wireless sensor network becomes one of key issue in Design of Wireless Sensor Network as much as possible.Due to the restriction that is subject to the factors such as cost and volume, the battery capacity of most of common wireless sensor network nodes is all very limited and can't be replenished.For improving the life-span of wireless sensor network, by lay a part of chargeable node network node of solar cell (as possess) in network, and design energy heavy duty detergent procotol is to utilize these nodes to share more communication task, received good effect in many applied environments, become a kind of by the generally accepted raising network life of people solution.
The tectonic network backbone structure is to optimize a kind of important method of wireless sense network performance, prolong network lifetime.Here, network backbone infrastructure also referred to as the connection support set of network, refers to the node in network or belongs to this set or have at least a neighbor node to belong to this set.Existing achievement in research demonstration, in wireless sense network, building minimum connection support set is np complete problem.In polynomial time, construct targetedly the low-cost spanning tree of network according to network actual conditions and application demand, fit simultaneously network and application demand are conducive to complete better the task of network.For having simultaneously chargeable node and wireless sensor network that can not charge node, for the different energy situation of node, set up low-cost and be communicated with and support set in network, can greatly improve the energy utilization efficiency of network, thereby promote network lifetime.
Summary of the invention
The present invention relates to a kind of backbone structure building method based on being communicated with spanning tree.The method is mainly used in wireless sense network, but for the recharging node with can not the different energy situation of recharging node, when structure is communicated with support set, but the preferential recharging node of selecting, reduction can not the selected chance of recharging node, in the time must selecting one or some can not the recharging node could form to be communicated with support set, preferential select the high node of dump energy to join to be communicated with to support to concentrate, thus reduce as far as possible can not the recharging node workload with and energy consumption, prolong network lifetime.
Make G that (V, E) represents network diagram, wherein the set of V (G) representation node, E (G) represent the set on limit in network; Two node x ∈ V (G) and y ∈ V (G) in figure-{ the distance note between x} is d
xyIf satisfy d
xy≤ R claims limit (x, y) ∈ E (G), and the subtraction of "-" representative set, each node are equipped with a cover omnidirectional antenna, the maximum transmitted radius of R representation node; For a node x in network, the hop neighbor node set of N (x) representation node x, wherein x ∈ V (G), for y ∈ N (x), have (x, y) ∈ E (G); But the node in 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, but recharging node set note is A, can not the recharging node battery-powered, this node set note is B, A+B=V (G)
Wherein "+" represents the add operation of set or claims union operation; E
uThe dump energy of representation node u, u ∈ B is for v ∈ N (u), link cost c (u, v)=1/E
uFor u ∈ A, the cost of its each trip link all is made as 0.
The target of this method is to set up the low-cost high energy efficiency to be communicated with the support set; If G (V, E) is disconnected, there is not connection support set in network, and mission failure returns.
Wherein the concrete building method based on the backbone structure that is communicated with spanning tree is:
Set W represents the white nodes set, and when initial, all nodes belong to the white nodes set, namely not yet set up any relation with the set that has built; Set GREY represents the grey node set, represent this category node with the set that has built in one or some nodes set up neighbouring relations, but its correlation computations is not yet complete; Set P represents complete as calculated node set, and it comprises the following steps:
1) but first all recharging nodes are made as and calculate complete node, and all other nodes in network are made as white nodes, the grey set of node is
2) the arbitrary node x in P is if adularescent node u ∈ N (x) changes to the grey node with this white nodes;
3) if W is not empty, select the maximum node x of white neighbours in set GREY, if not unique, select at random node x from the maximum node of white neighbours; The grey node of this selection is changed to the complete node of calculating; If adularescent node u ∈ N (x) changes to the grey node with this white nodes; Repeat this step, until W is empty;
4) if the node of set in P disconnected words still, choose a node x wantonly as information source from set P, the minimum cost of other node and path thereof in finding the solution from x to the network, when finding first node y, and x to the minimum cost of y greater than 0, when having set up the shortest path between two original disconnected support set subset nodes, make on this path white nodes change to and calculate complete node, and will newly add the cost of all trip links of the node of P to be made as 0; If node disconnected words still in set P repeat this step, until form the support set that is communicated with.
Embodiment
Concrete building method based on the backbone structure that is communicated with spanning tree is:
Set W represents the white nodes set, and when initial, all nodes belong to the white nodes set, namely not yet set up any relation with the set that has built; Set GREY represents the grey node set, represent this category node with the set that has built in one or some nodes set up neighbouring relations, but its correlation computations is not yet complete; Set P represents complete as calculated node set;
1)
2)P=A;?W=W-A;
3) for any x ∈ P, for each u ∈ N (x), if u ∈ is W, GREY=GREY+{u} so, W=W-{u};
4) if W is not empty, select the maximum node of white neighbours in set GREY, if not unique, select at random from the maximum node of white neighbours, selected node note is x; P=P+{x}, GREY=GREY-{x}; For each u ∈ N (x), if u ∈ is W, GREY=GREY+{u} so, W=W-{u}; Repeat this step, until W is empty;
5) if the node of set in P disconnected words still, choose a node x wantonly as information source from set P, adopt the Dijkstra shortest path algorithm, the minimum cost of other node and path thereof in finding the solution from x to the network, when finding first node y, and x to the minimum cost of y greater than 0, when having set up the shortest path between two original disconnected support set subset nodes, make the node of gathering W that belongs on this path belong to set P, and from the set W the deletion these nodes, and will newly add node all the trip links cost be made as 0; If node disconnected words still in set P repeat this step, until form the support set that is communicated with;
Node in set P is exactly the node that is communicated with on support set.
Claims (3)
- in a wireless sense network based on the backbone structure building method that is communicated with spanning tree, it is characterized in that: in wireless sense network, but for the recharging node with can not the different energy situation of recharging node, when structure is communicated with support set, but the preferential recharging node of selecting, reduction can not the selected chance of recharging node, in the time must selecting one or some can not the recharging node could form to be communicated with support set, the high node of preferential selection dump energy joins to be communicated with to support and concentrates, thereby reduce as far as possible can not the recharging node workload with and energy consumption, prolong network lifetime.
- 2. described building method according to claim 1, it is characterized in that: G (V, E) represents network diagram, the set of V (G) representation node, E (G) represent the set on limit in network; Two node x ∈ V (G) and y ∈ V (G) in network diagram-between x} apart from d xyLess than or equal to the maximum transmitted radius of node, claim limit (x, y) ∈ E (G); For a node x in network, the hop neighbor node set of N (x) representation node x, wherein x ∈ V (G), for y ∈ N (x), have (x, y) ∈ E (G); In network, but recharging node set note is A, can not recharging node set note be B, A+B=V (G),E uThe dump energy of representation node u, u ∈ B is for v ∈ N (u), link cost c (u, v)=1/E uIf u ∈ is A, the cost of its each trip link all is made as 0.
- 3. described building method according to claim 1 is characterized in that based on the concrete building method of the backbone structure that is communicated with spanning tree being:Set W represents the white nodes set, and when initial, all nodes belong to the white nodes set, namely not yet set up any relation with the set that has built; Set GREY represents the grey node set, represent this category node with the set that has built in one or some nodes set up neighbouring relations, but its correlation computations is not yet complete; Set P represents complete as calculated node set, and it comprises the following steps:1) but first all recharging nodes are made as and calculate complete node, and all other nodes in network are made as white nodes, the grey set of node is
2) the arbitrary node x in P is if adularescent node u ∈ N (x) changes to the grey node with this white nodes;3) if W is not empty, select the maximum node x of white neighbours in set GREY, if not unique, select at random node x from the maximum node of white neighbours; The grey node of this selection is changed to the complete node of calculating; If adularescent node u ∈ N (x) changes to the grey node with this white nodes; Repeat this step, until W is empty;4) if the node of set in P disconnected words still, choose a node x wantonly as information source from set P, the minimum cost of other node and path thereof in finding the solution from x to the network, when finding first node y, and x to the minimum cost of y greater than 0, when having set up the shortest path between two original disconnected support set subset nodes, make on this path white nodes change to and calculate complete node, and will newly add the cost of all trip links of the node of P to be made as 0; If node disconnected words still in set P repeat this step, until form the support set that is communicated with.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012105644896A CN103124427A (en) | 2012-12-23 | 2012-12-23 | Backbone structure constructing method of wireless sensor network based on communication supporting tree |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012105644896A CN103124427A (en) | 2012-12-23 | 2012-12-23 | Backbone structure constructing method of wireless sensor network based on communication supporting tree |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103124427A true CN103124427A (en) | 2013-05-29 |
Family
ID=48455241
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2012105644896A Pending CN103124427A (en) | 2012-12-23 | 2012-12-23 | Backbone structure constructing method of wireless sensor network based on communication supporting tree |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103124427A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105682114A (en) * | 2016-01-05 | 2016-06-15 | 南昌航空大学 | Method for evaluating connectivity of partitioned opportunistic sensor network |
| CN105792250A (en) * | 2016-01-14 | 2016-07-20 | 南昌航空大学 | Method for expressing opportunistic sensor network connectivity by whole network connectivity |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2007125462A2 (en) * | 2006-04-29 | 2007-11-08 | Koninklijke Philips Electronics N.V. | Method and apparatus for controlling energy consumption of sensor network nodes |
| CN101860874A (en) * | 2010-06-01 | 2010-10-13 | 财团法人交大思源基金会 | Backbone guide structure in wireless sensor network, establishment method and repairing method |
-
2012
- 2012-12-23 CN CN2012105644896A patent/CN103124427A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2007125462A2 (en) * | 2006-04-29 | 2007-11-08 | Koninklijke Philips Electronics N.V. | Method and apparatus for controlling energy consumption of sensor network nodes |
| CN101860874A (en) * | 2010-06-01 | 2010-10-13 | 财团法人交大思源基金会 | Backbone guide structure in wireless sensor network, establishment method and repairing method |
Non-Patent Citations (1)
| Title |
|---|
| 李玉华: "《中国优秀硕士学位论文全文数据库》", 15 March 2010 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105682114A (en) * | 2016-01-05 | 2016-06-15 | 南昌航空大学 | Method for evaluating connectivity of partitioned opportunistic sensor network |
| CN105792250A (en) * | 2016-01-14 | 2016-07-20 | 南昌航空大学 | Method for expressing opportunistic sensor network connectivity by whole network connectivity |
| CN105792250B (en) * | 2016-01-14 | 2019-06-21 | 南昌航空大学 | A method of chance sensing network connectivity is indicated using whole net degree of communication |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102264114B (en) | ZigBee sensor network tree route low-expense optimization method | |
| Zhu et al. | Energy-efficient tree-based message ferrying routing schemes for wireless sensor networks | |
| KR101658736B1 (en) | Wsn clustering mehtod using of cluster tree structure with low energy loss | |
| CN102711206A (en) | Simulated annealing-based wireless sensor network (WSN) hierarchical routing method | |
| Aissa et al. | New strategies and extensions in weighted clustering algorithms for mobile ad hoc networks | |
| Ahn et al. | Balanced chain-based routing protocol (BCBRP) for energy efficient wireless sensor networks | |
| CN105898764A (en) | Multi-stage energy heterogeneous wireless sensor network deployment method | |
| CN108541039B (en) | Low-power-consumption wireless sensor network static node routing method | |
| Ali | Energy efficieny in routing protocol and data collection approaches for WSN: A survey | |
| Chen et al. | Single sink node placement strategy in wireless sensor networks | |
| CN103002538A (en) | Wireless sensor network topology control method based on localization shortest path tree | |
| Anees et al. | Harvested energy scavenging and transfer capabilities in opportunistic ring routing | |
| CN103124427A (en) | Backbone structure constructing method of wireless sensor network based on communication supporting tree | |
| Wang et al. | Traffic-aware relay node deployment for data collection in wireless sensor networks | |
| CN103826282B (en) | Set based on dump energy divides multi-hop routing method | |
| Leu et al. | Adaptive power-aware clustering and multicasting protocol for mobile ad hoc networks | |
| CN103067873A (en) | Energy-saving multicast scheme for wireless sensor network (WSN) provided with rechargeable nodes and multiple sink nodes | |
| CN103037317A (en) | Energy-conservation multicasting method based on relay group in wireless self-organized and sensor network | |
| CN103068023A (en) | Wireless sensor network topology control method based on localization minimum spanning tree | |
| Baranidharan et al. | A new graph theory based routing protocol for wireless sensor networks | |
| Bhattacharjee et al. | Energy efficient multiple sink placement in wireless sensor networks | |
| Gautam et al. | Data dissemination in wireless sensor networks: A state-of-the art survey | |
| Feng et al. | Energy saving geographic routing in ad hoc wireless networks | |
| CN103037468A (en) | Construction method of directed shortest path spanning tree in wireless sensor network | |
| CN103068071A (en) | Construction method of deviation-type low-cost spanning tree in wireless sensor network |
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: 20160720 |
|
| C20 | Patent right or utility model deemed to be abandoned or is abandoned |