CN102883401A - Realization method for prolonging life cycle of wireless multihop self-organizing network - Google Patents
Realization method for prolonging life cycle of wireless multihop self-organizing network Download PDFInfo
- Publication number
- CN102883401A CN102883401A CN2012103956319A CN201210395631A CN102883401A CN 102883401 A CN102883401 A CN 102883401A CN 2012103956319 A CN2012103956319 A CN 2012103956319A CN 201210395631 A CN201210395631 A CN 201210395631A CN 102883401 A CN102883401 A CN 102883401A
- Authority
- CN
- China
- Prior art keywords
- node
- energy
- data
- self
- energy value
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 37
- 238000000605 extraction Methods 0.000 claims abstract description 4
- 238000012546 transfer Methods 0.000 claims description 5
- 238000012423 maintenance Methods 0.000 claims description 3
- 238000005265 energy consumption Methods 0.000 abstract description 6
- 238000004891 communication Methods 0.000 abstract description 4
- 230000002035 prolonged effect Effects 0.000 abstract description 2
- 230000005540 biological transmission Effects 0.000 description 5
- 238000010586 diagram Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 4
- 230000000694 effects Effects 0.000 description 3
- 238000005538 encapsulation Methods 0.000 description 2
- 239000000284 extract Substances 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000006855 networking Effects 0.000 description 2
- 238000013459 approach Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 230000002950 deficient Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000009191 jumping Effects 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
Images
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 discloses a realization method for prolonging a life cycle of a wireless multihop self-organizing network, and the method is characterized in that the multihop self-organizing network is provided with an energy threshold value, and an energy value of each node is encapsulated in the data when data is transmitted between every two nodes; after the current node receives the data transmitted by the previous hop of node, the energy value of the previous hop of node is extracted from the data and recorded, and the energy value of the current node is used for replacement after the extraction is completed; an energy list of a neighbor node is maintained by each node in the multihop self-organizing network, and the list consists of two parts: one part is the node name in a single-hop distance and the energy value of the corresponding node, the energy list of the neighbor node is used for recording the energy value of the neighbor node, and if the energy of the neighbor node is smaller than the threshold value, the energy of the neighbor node is deleted from a route list; and when the node receives the data transmitted by the previous hop of node, the data forwarding way and whether the data is forwarded or not are elected according to the own energy value. The node energy consumption inside the network can be balanced, the communication quality of the network is improved, and the life cycle of the network is prolonged.
Description
Technical field
The present invention relates to a kind of implementation method that prolongs the life cycle of network, particularly a kind of wireless multihop self-organizing network implementation method of life cycle that prolongs.
Background technology
Wireless multihop self-organizing network has very strong networking flexibility.Owing to do not need the center access node, be specially adapted to battlefield, rescue and relief work, large-scale activity scene etc. and lack under the scene of hub facility to realize quickly networking.IEEE 802.11b technology and the IEEE 802.11a/802.11g technology of adopting are built wireless multihop self-organizing network more at present, and this network has very high data transfer bandwidth.
But this network itself has certain defective.Because this network do not have the center access node, so the transmission of data realizes by the network node cooperation, and high speed data transfers can consume a large amount of energy of node.Network node mostly is handheld terminal, uses battery as energy resource supply.Data retransmission will cause the quick consumption of network node energy frequently, shortens the life cycle of node, and final owing to node energy exhausts and " death ".The node of " death " often is on the larger link of data throughout, in case node " death " will cause the fracture of link, and finally causes the decline of network communication quality.
Summary of the invention
Goal of the invention: technical problem to be solved by this invention is for the deficiencies in the prior art, and a kind of wireless multihop self-organizing network implementation method of life cycle that prolongs is provided.
In order to solve the problems of the technologies described above, the invention discloses a kind of wireless multihop self-organizing network implementation method of life cycle that prolongs, be provided with energy threshold a in the multihop self-organizing network, b, wherein 0≤a≤b≤100% is encapsulated in the self-energy value in the data when carrying out transfer of data between the node; Present node from energy value and the record of extracting data upper hop node, is replaced with the energy value of present node after extraction is finished after receiving the data that the upper hop node sends; Neighbor node energy tabulation of each node maintenance in the multihop self-organizing network, this tabulation is made of two parts: the nodename (IP address) that the single-hop distance is interior and the energy value (percent value represents) of corresponding node, the tabulation of neighbor node energy is used for the energy value of record neighbor node, if the neighbor node energy is deleted it less than a from routing table;
When node is received the data that the upper hop node sends, select the data retransmission mode and whether transmit according to the energy value of self; When node self-energy value during greater than b, choose next-hop node according to routing table and directly transmit; When node self-energy value during greater than a and less than b, adopt the border circular areas search method to obtain next-hop node; When node self-energy during less than a, no longer carry out data retransmission, and the upper hop node sends data, inform that the upper hop node deletes present node from its routing table, after this this node only sends data as source node.
Among the present invention, the region of search of border circular areas search method is the line of next-hop node in present node and the former routing table border circular areas as diameter.
Threshold value a, b can be set to respectively among the present invention: 10% and 30%, can freely get calmly according to number of nodes and termination capacity during certain network design.
Beneficial effect: the implementation method of prolongation multihop self-organizing network provided by the invention life cycle has been formulated the data retransmission rule of node by the energy value of node, reduce network node owing to thereby the frequent data item forwarding causes the possibility that depleted of energy causes node " death ", balance the node energy consumption in the network, promote the communication quality of network, prolonged the life cycle of network.
Description of drawings
Below in conjunction with the drawings and specific embodiments the present invention is done further to specify, above-mentioned and/or otherwise advantage of the present invention will become apparent.
Fig. 1 is the implementation method data retransmission schematic flow sheet of the life cycle of prolongation network of the present invention.
Fig. 2 is the Ethernet frame structure schematic diagram for encapsulation energy content value IP packet of the present invention.
Fig. 3 is that border circular areas searching method next-hop node of the present invention obtains schematic diagram.
Fig. 4 is the energy-saving effect figure of border circular areas searching method of the present invention.
Embodiment
The present invention discloses a kind of wireless multihop self-organizing network implementation method of life cycle that prolongs, and is provided with energy threshold a in the multihop self-organizing network, b, and wherein 0≤a≤b≤100% is encapsulated in the self-energy value in the data when carrying out transfer of data between the node; Present node from energy value and the record of extracting data upper hop node, is replaced with the energy value of present node after extraction is finished after receiving the data that the upper hop node sends; Neighbor node energy tabulation of each node maintenance in the multihop self-organizing network, this tabulation is made of two parts: the nodename (IP address) that the single-hop distance is interior and the energy value (percent value represents) of corresponding node, the tabulation of neighbor node energy is used for recording the energy value of all mid-side nodes, if peripheral node energy is deleted it less than a from routing table; When node is received the data that the upper hop node sends, select the data retransmission mode and whether transmit according to the energy value of self; When node self-energy value during greater than b, choose next-hop node according to routing table and directly transmit; When node self-energy value during greater than a and less than b, adopt the border circular areas search method to obtain next-hop node; When node self-energy during less than a, no longer carry out data retransmission, and the upper hop node sends data, inform that the upper hop node deletes present node from its routing table, after this this node only sends data as source node.The region of search of border circular areas search method is the line of next-hop node in present node and the former routing table border circular areas as diameter.
Embodiment
Present embodiment provides a kind of multihop self-organizing network implementation method of life cycle that prolongs, and in the described method, the packet of network repeating should comprise the energy value information of this forward node.When the next-hop node of this forward node is received packet, therefrom extract the energy value of upper hop node, and upgrade its neighbor node energy tabulation.In case this energy value less than 10%, is then deleted the upper hop node from routing table, later data is transmitted and will no longer be selected it as next-hop node.Whether node also needs to select corresponding pass-through mode and transmit according to the self-energy value when carrying out data retransmission, when node self-energy value greater than 30% the time, adopt normal mode to transmit, choose next-hop node according to routing table; When node self-energy value less than 30% but greater than 10% the time, adopt the border circular areas searching method to obtain next-hop node; When the node self-energy less than 10% the time, no longer carry out data retransmission, and the upper hop node sends data, inform that the upper hop node deletes this node from its routing table, this node later stage only sends data as source node.
Shown in Figure 1 is the implementation method data retransmission schematic flow sheet that prolongs the life cycle of network, and step is as follows:
Step 101: node receives the data that the upper hop node sends, and therefrom extracts the energy value of upper hop node.
Step 102: node judges by the energy value of upper hop node whether it can become the next-hop node that later data is transmitted.If upper hop node energy value carry out step 103 greater than 10%; Otherwise carry out step 104.
Step 103: node updates self neighbor node energy meter.
Step 104: node updates self neighbor node energy meter, and the upper hop node deleted from its routing table.
Step 105: node is replaced upper hop node energy value in the former data with the self-energy value.
Step 106: node carries out pass-through mode according to the self-energy value and determines.If energy value less than 30%, enters step 107; Otherwise enter step 108.
Step 107: node carries out pass-through mode according to the self-energy value and determines.If energy value less than 10%, enters step 109; Otherwise enter step 110.
Step 108: node adopts the normal mode of transmitting, and chooses next-hop node from routing table.
Step 109: the node photos and sending messages is informed the upper hop node, and the upper hop node is deleted this node from routing table.
Step 110: node adopts the border circular areas searching method again to obtain next-hop node.
Step 111: this node no longer carries out data retransmission, and the later stage only sends data as source node.
Shown in Figure 2 is that its structure is made of following several parts: node energy value and the FCS check code of Ethernet frame head, IP head, IP data division (TCP/UDP head, upper layer data), 1 byte for the Ethernet frame structure schematic diagram of encapsulation energy content value IP packet.Transport layer and network layer adopt respectively the form of existing network protocol (TCP/UDP and IP) definition, and all packets that send between net all include the energy value of upper hop node, and its length is 1 byte.
Shown in Figure 3 is that border circular areas searching method next-hop node obtains schematic diagram, and tentation data is transmitted to Node B by node A.When node A energy shortage, and between 10%～30% the time, unconditional forwarding might cause node A depleted of energy.The border circular areas searching method can continue effectively to reduce energy consumption under the prerequisite of forwarding data at node A.
Border circular areas searching method (I): reduce the energy consumption of node A, a method the most direct reduces its data sending power exactly.By will original one jumping the transmission course that to reach and be decomposed into double bounce and realize between node A and the Node B, have reduced node A and will effectively reduce the data sending power of node A to the transmission range of next-hop node.Realize that above conception just need to find suitable via node between node A and Node B.In the border circular areas of diameter, search node C at the line take node A and Node B according to the present invention.By using node C when the data that reduce node A send energy consumption, can also reduce the energy consumption of whole data transmission procedure as the next-hop node of node A.
The proof of border circular areas searching method (I):
If the distance between node A and the Node B is L, the angle between AC and the AB is a, and the angle between AC and the BC is b.Distance between node A and node C is L
1, the distance of node C and Node B is L
2It is Pr that the data reception node place satisfies the required minimum power of demodulation.The impact that path loss is brought is only considered in the power loss signal propagation loss.802.11 the path loss PathLoss=46+10nlgd(d of network is the distance that data send, n is fissipation factor, n 〉=2).
Node A is to the transmitted power Pt of node C
1Be 10
4.6Pr L
1 n
Node C is to the transmitted power Pt of Node B
2Be 10
4.6Pr L
2 n
Node A directly to the transmitted power Pt of Node B be 10
4.6PrL
n
The gross power of double bounce transmission is 10
4.6(Pr L
1 n+ Pr L
2 n)
Since 90≤b≤180, L 〉=max (L
1, L
2), n 〉=2
So Pt
1+ Pt
2=10
4.6(Pr L
1 n+ Pr L
2 n)≤10
4.6Max
N-2(L
1, L
2) Pr (L
1 2+ L
2 2)
≤10
4.6L
n-2Pr(L
2+2L
1L
2cosb)
≤10
4.6L
n-2Pr?L
2＝Pt
Provablely in the border circular areas of diameter, search node C at the line take node A and Node B by upper, realize that by C the power consumption of data relay is less than the power consumption that directly is sent to B by A.，
Fig. 4 is the energy-saving effect figure of border circular areas searching method, and the set path fissipation factor is 3, when angle a=0, compares double bounce with single-hop communication and communicates by letter and total transmitting power can be reduced 6.02dB at most.Even and at 0＜a＜pi/2, double bounce path sum is during greater than the single-hop path, total also can reduce transmitting power, for example at a=π/6, L
1During=0.5L, L as can be known
2=0.62L is L then
1+ L
2L but still can make gross power reduce 4dB.
The invention provides a kind of implementation method that prolongs the life cycle of network, this implementation method can also be applied in other network configuration (such as sensor network, Cellular Networks and wireless multi-hop ad hoc net UNE) except being applied in wireless multihop self-organizing network.Via node searching algorithm in this enforcement can utilize prior art to be realized.
The invention provides a kind of wireless multihop self-organizing network implementation method of life cycle that prolongs; method and the approach of this technical scheme of specific implementation are a lot; the above only is preferred implementation of the present invention; should be understood that; for those skilled in the art; under the prerequisite that does not break away from the principle of the invention, can also make some improvements and modifications, these improvements and modifications also should be considered as protection scope of the present invention.In the present embodiment not clear and definite each part all available prior art realized.
Claims (2)
1. one kind prolongs the wireless multihop self-organizing network implementation method of life cycle, it is characterized in that, be provided with energy threshold a, b in the multihop self-organizing network, wherein 0≤a≤b≤100% is encapsulated in the self-energy value in the data when carrying out transfer of data between the node; Present node from energy value and the record of extracting data upper hop node, is replaced with the energy value of present node after extraction is finished after receiving the data that the upper hop node sends; Neighbor node energy tabulation of each node maintenance in the multihop self-organizing network, the energy tabulation is made of two parts: the node IP address that the single-hop distance is interior and the energy value of corresponding node, the tabulation of neighbor node energy is used for the energy value of record neighbor node, if the neighbor node energy is deleted it less than a from routing table;
After node is received the data that the upper hop node sends, select the data retransmission mode and whether transmit according to the energy value of self; When node self-energy value during greater than b, choose next-hop node according to routing table and directly transmit; When node self-energy value during greater than a and less than b, adopt the border circular areas search method to obtain next-hop node; When node self-energy during less than a, no longer carry out data retransmission, and the upper hop node sends data, inform that the upper hop node deletes present node from its routing table, after this this node only sends data as source node.
2. a kind of wireless multihop self-organizing network implementation method of life cycle that prolongs according to claim 1 is characterized in that, the region of search of border circular areas search method is the line of next-hop node in present node and the former routing table border circular areas as diameter.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210395631.9A CN102883401B (en) | 2012-10-17 | 2012-10-17 | Realization method for prolonging life cycle of wireless multihop self-organizing network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210395631.9A CN102883401B (en) | 2012-10-17 | 2012-10-17 | Realization method for prolonging life cycle of wireless multihop self-organizing network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102883401A true CN102883401A (en) | 2013-01-16 |
| CN102883401B CN102883401B (en) | 2014-09-10 |
Family
ID=47484495
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210395631.9A Active CN102883401B (en) | 2012-10-17 | 2012-10-17 | Realization method for prolonging life cycle of wireless multihop self-organizing network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102883401B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109587754A (en) * | 2018-12-18 | 2019-04-05 | 深圳Tcl新技术有限公司 | Network equipment node selection method, device and computer readable storage medium |
| CN116760762A (en) * | 2023-08-14 | 2023-09-15 | 北京华云安软件有限公司 | Decentralised ad hoc network method and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060023677A1 (en) * | 2004-07-28 | 2006-02-02 | University Of South Florida | A System and Method to Assure Node Connectivity in an Ad Hoc Network |
| CN101364918A (en) * | 2008-09-25 | 2009-02-11 | 东南大学 | Efficiency reliable routing method based on link quality for multi-hop wireless sensor network |
| CN101442787A (en) * | 2008-12-24 | 2009-05-27 | 北京交通大学 | Energy-saving routing method for wireless sensor network based on power control |
| CN102630086A (en) * | 2012-04-29 | 2012-08-08 | 西安电子科技大学 | Gabriel graph-based data communication method of wireless sensor network |
-
2012
- 2012-10-17 CN CN201210395631.9A patent/CN102883401B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060023677A1 (en) * | 2004-07-28 | 2006-02-02 | University Of South Florida | A System and Method to Assure Node Connectivity in an Ad Hoc Network |
| CN101364918A (en) * | 2008-09-25 | 2009-02-11 | 东南大学 | Efficiency reliable routing method based on link quality for multi-hop wireless sensor network |
| CN101442787A (en) * | 2008-12-24 | 2009-05-27 | 北京交通大学 | Energy-saving routing method for wireless sensor network based on power control |
| CN102630086A (en) * | 2012-04-29 | 2012-08-08 | 西安电子科技大学 | Gabriel graph-based data communication method of wireless sensor network |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109587754A (en) * | 2018-12-18 | 2019-04-05 | 深圳Tcl新技术有限公司 | Network equipment node selection method, device and computer readable storage medium |
| CN116760762A (en) * | 2023-08-14 | 2023-09-15 | 北京华云安软件有限公司 | Decentralised ad hoc network method and device |
| CN116760762B (en) * | 2023-08-14 | 2023-11-07 | 北京华云安软件有限公司 | Decentralised ad hoc network method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102883401B (en) | 2014-09-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100442786C (en) | Tree structure based routing method | |
| CN104320796A (en) | Wireless sensor network data transmission method based on LEACH protocol | |
| CN105163349B (en) | A kind of multiple gateway Wireless Mesh network implementation method based on IEEE802.11s | |
| CN108966305A (en) | A kind of LORA relaying ad hoc network method | |
| CN106714263B (en) | Wireless sensor network AODV routing protocol implementation system and method | |
| CN105515972B (en) | A kind of mobilism ad hoc network wireless communication device | |
| CN102148756A (en) | IPv6 over low power wireless personal area network (6LoWPAN) neighbor discovery-based tree routing method | |
| Lee et al. | IEEE 802.15. 5 WPAN mesh standard-low rate part: Meshing the wireless sensor networks | |
| CN103731878A (en) | Frame specification for a wireless network communication | |
| CN101102283A (en) | A method and device for optimizing unknown unicast forward at wireless access point | |
| CN109548112A (en) | A kind of wireless sense network distributed routing method based on the various dimensions path quality factor | |
| CN108566664A (en) | A kind of WSN clustering routing optimization methods of distribution high energy efficiency | |
| CN101820661A (en) | Random walk routing method combining opportunistic forwarding in mobile wireless multi-hop network | |
| CN104009913A (en) | Broadcasting method based on distance and energy balance in mobile Ad Hoc network | |
| WO2016150269A1 (en) | Method, device and system for optimizing paging, and storage medium | |
| CN104219632B (en) | Mobile phone MANET positional information collection method for emergency rescue | |
| Aliyu et al. | DS-OLSR–disaster scenario optimized link state routing protocol | |
| Li et al. | Energy-efficient multipath routing in wireless sensor network considering wireless interference | |
| CN103686944B (en) | Gateway selection method for interconnection of cellular network and multi-hop wireless sensing network | |
| CN103391595A (en) | Mine emergency rescue wireless mesh network routing method based on cross-layer link state feedback | |
| CN102883401B (en) | Realization method for prolonging life cycle of wireless multihop self-organizing network | |
| CN106412997B (en) | A kind of implementation method towards asynchronous sensor network HR-MM Radio Broadcasting Agreements | |
| CN105764111A (en) | Wireless-sensing-network autonomous routing method | |
| CN101466160B (en) | Method and system for saving energy of wireless netted network node | |
| CN102573121B (en) | Wireless Mesh router |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C53 | Correction of patent of invention or patent application | ||
| CB03 | Change of inventor or designer information |
Inventor after: Shao Hong Inventor after: Zhu Zheng Inventor after: Lin Ke Inventor before: Zhu Zheng Inventor before: Lin Ke |
|
| COR | Change of bibliographic data |
Free format text: CORRECT: INVENTOR; FROM: ZHU ZHENG LIN KE TO: SHAO HONG ZHU ZHENG LIN KE |
|
| CP01 | Change in the name or title of a patent holder | ||
| CP01 | Change in the name or title of a patent holder |
Address after: 210006 Zhongshan South Road, Nanjing, Nanjing, Jiangsu Patentee after: Zhong Tong clothing consulting and Design Research Institute Co., Ltd. Address before: 210006 Zhongshan South Road, Nanjing, Nanjing, Jiangsu Patentee before: Jiangsu Posts & Telecommunications Planning and Designing Institute Co., Ltd. |
|
| CP02 | Change in the address of a patent holder |
Address after: The Jianye District of Nanjing City, Jiangsu province 210000 Jiangdong Street No. 58 Patentee after: CHINA INFORMATION CONSULTING & DESIGNING INSTITUTE Co.,Ltd. Address before: 210006 No. 371 South Zhongshan Road, Jiangsu, Nanjing Patentee before: CHINA INFORMATION CONSULTING & DESIGNING INSTITUTE Co.,Ltd. |
|
| CP02 | Change in the address of a patent holder |