CN102883401B - 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
- CN102883401B CN102883401B CN201210395631.9A CN201210395631A CN102883401B CN 102883401 B CN102883401 B CN 102883401B CN 201210395631 A CN201210395631 A CN 201210395631A CN 102883401 B CN102883401 B CN 102883401B
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 37
- 230000005540 biological transmission Effects 0.000 claims description 7
- 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
- 238000000605 extraction Methods 0.000 abstract 1
- 230000002035 prolonged effect Effects 0.000 abstract 1
- 238000010586 diagram Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 4
- 230000000694 effects Effects 0.000 description 3
- 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
- 230000007547 defect Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
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
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 extends the life cycle of network, particularly a kind of wireless multihop self-organizing network implementation method of life cycle that extends.
Background technology
Wireless multihop self-organizing network has very strong networking flexibility.Owing to not needing center access node, be specially adapted under scene that battlefield, rescue and relief work, large-scale activity scene etc. lack 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 defect.Because this network does not have center access node, so the transmission of data is by the network node realization that cooperates, 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 finally because node energy exhausts " death ".The node of " death " often, on the larger link of data throughout, once 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, provides a kind of wireless multihop self-organizing network implementation method of life cycle that extends.
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 extends, in multihop self-organizing network, be provided with energy threshold a, b, wherein 0≤a≤b≤100%, is encapsulated in self-energy value in data while carrying out transfer of data between node; Present node, after receiving the data that upper hop node sends, from energy value the record of extracting data upper hop node, has extracted the rear energy value with present node and has replaced; A neighbor node energy of each node maintenance list in multihop self-organizing network, this list consists of two parts: the nodename (IP address) in single-hop distance and the energy value (percent value represents) of corresponding node, the list of neighbor node energy is for recording the energy value of neighbor node, if neighbor node energy is less than a, it is deleted from routing table;
When node is received the data of upper hop node transmission, according to the energy value of self, select data retransmission mode and whether forward; When node self-energy value is greater than b, according to routing table, chooses next-hop node and directly forward; When node self-energy value is greater than a and is less than b, adopt border circular areas search method to obtain next-hop node; When node self-energy is less than a, no longer carry out data retransmission, and upper hop node sends data, inform that upper hop node deletes present node from its routing table, after this this node only sends data as source node.
In the present invention, the region of search of border circular areas search method is for take the border circular areas that the line of next-hop node is diameter in present node and former routing table.
In the present invention, threshold value a, b can be set to respectively: 10% and 30%, during certain network design, can freely get calmly according to number of nodes and termination capacity.
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, thereby reduce network node and cause because frequent data item forwards the possibility that depleted of energy causes node " death ", balance the node energy consumption in network, promote the communication quality of network, extended the life cycle of network.
Accompanying drawing explanation
Below in conjunction with the drawings and specific embodiments, the present invention is done further and illustrated, 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 of the present invention for encapsulating the Ethernet frame structure schematic diagram of energy content value IP packet.
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 extends, and in multihop self-organizing network, is provided with energy threshold a, b, and wherein 0≤a≤b≤100%, is encapsulated in self-energy value in data while carrying out transfer of data between node; Present node, after receiving the data that upper hop node sends, from energy value the record of extracting data upper hop node, has extracted the rear energy value with present node and has replaced; A neighbor node energy of each node maintenance list in multihop self-organizing network, this list consists of two parts: the nodename (IP address) in single-hop distance and the energy value (percent value represents) of corresponding node, the list of neighbor node energy is for recording the energy value of all mid-side nodes, if periphery node energy is less than a, it is deleted from routing table; When node is received the data of upper hop node transmission, according to the energy value of self, select data retransmission mode and whether forward; When node self-energy value is greater than b, according to routing table, chooses next-hop node and directly forward; When node self-energy value is greater than a and is less than b, adopt border circular areas search method to obtain next-hop node; When node self-energy is less than a, no longer carry out data retransmission, and upper hop node sends data, inform that 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 for take the border circular areas that the line of next-hop node is diameter in present node and former routing table.
Embodiment
The present embodiment provides a kind of multihop self-organizing network implementation method of life cycle that extends, and in 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 list.Once this energy value is less than 10%, upper hop node to be deleted from routing table, later data forwards and will no longer select it as next-hop node.Whether node also needs select corresponding pass-through mode and forward according to self-energy value when carrying out data retransmission, when node self-energy value is greater than 30%, adopts normal mode to forward, and according to routing table, chooses next-hop node; When node self-energy value is less than 30% but while being greater than 10%, adopt border circular areas searching method to obtain next-hop node; When node self-energy is less than 10%, no longer carry out data retransmission, and upper hop node sends data, inform that upper hop node deletes this node from its routing table, this node later stage only sends data as source node.
Shown in Fig. 1 is the implementation method data retransmission schematic flow sheet that extends the life cycle of network, and step is as follows:
Step 101: node receives the data that upper hop node sends, and therefrom extract 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 forwards.If upper hop node energy value is greater than 10%, carry out step 103; Otherwise carry out step 104.
Step 103: node updates self neighbor node energy meter.
Step 104: node updates self neighbor node energy meter, and upper hop node is deleted from its routing table.
Step 105: node is replaced upper hop node energy value in former data by self-energy value.
Step 106: node carries out pass-through mode according to self-energy value and determines.If energy value is less than 30%, enter step 107; Otherwise enter step 108.
Step 107: node carries out pass-through mode according to self-energy value and determines.If energy value is less than 10%, enter step 109; Otherwise enter step 110.
Step 108: node adopts the normal mode forwarding, and chooses next-hop node from routing table.
Step 109: node photos and sending messages is informed upper hop node, upper hop node is deleted this node from routing table.
Step 110: node adopts border circular areas searching method again to obtain next-hop node.
Step 111: this node no longer carries out data retransmission, the later stage only sends data as source node.
Shown in Fig. 2 is that its structure consists of following several parts for encapsulating the Ethernet frame structure schematic diagram of energy content value IP packet: 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.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 Fig. 3 is that border circular areas searching method next-hop node obtains schematic diagram, and tentation data is forwarded to Node B by node A.When node A energy shortage, and between 10%～30% time, unconditional forwarding will likely cause node A depleted of energy.Border circular areas searching method can continue, under the prerequisite of forwarding data, effectively to reduce energy consumption 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 jump the transmitting procedure can reaching and be decomposed into double bounce and realize between node A and 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 above conception and just need between node A and Node B, find suitable via node.According to the present invention, search node C take in the border circular areas that the line of node A and Node B is diameter.By using node C can also reduce the energy consumption of whole data transmission procedure as the next-hop node of node A when the data that reduce node A send energy consumption.
The proof of border circular areas searching method (I):
If the distance between node A and Node B is L, the angle between AC and AB is a, and the angle between AC and BC is b.Distance between node A and node C is L
1, the distance of node C and Node B is L
2.It is Pr that data reception node place meets the required minimum power of demodulation.The impact that path loss is brought is only considered in 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
By upper, provablely search node C take in the border circular areas that the line of node A and Node B is diameter, the power consumption that realizes data relay by C is less than the power consumption that is directly sent to B by A.，
Fig. 4 is the energy-saving effect figure of border circular areas searching method, and set path fissipation factor is 3, when angle a=0, compares double bounce communicate by letter and total transmitting power can be reduced to 6.02dB at most with single-hop communication.Even and at 0<a< pi/2, when double bounce path sum is greater than single-hop path, total also can reduce transmitting power, for example, at a=π/6, L
1during=0.5L, known L
2=0.62L is L
1+ L
2>L but still can make gross power reduce 4dB.
The invention provides a kind of implementation method that extends the life cycle of network, this implementation method, except being applied in wireless multihop self-organizing network, can also be applied in other network configuration (such as sensor network, Cellular Networks and wireless multi-hop ad hoc net UNE).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 extends; method and the approach of this technical scheme of specific implementation are a lot; the above is only the preferred embodiment of the present invention; should be understood that; for those skilled in the art; under the premise without departing from the principles 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 (1)
1. one kind extends the wireless multihop self-organizing network implementation method of life cycle, it is characterized in that, in multihop self-organizing network, be provided with energy threshold a, b, wherein 0≤a≤b≤100%, is encapsulated in self-energy value in data while carrying out transfer of data between node; Present node, after receiving the data that upper hop node sends, from energy value the record of extracting data upper hop node, has extracted the rear energy value with present node and has replaced; A neighbor node energy of each node maintenance list in multihop self-organizing network, energy list consists of two parts: the node IP address in single-hop distance and the energy value of corresponding node, the list of neighbor node energy is for recording the energy value of neighbor node, if neighbor node energy is less than a, it is deleted from routing table;
Whether node is received after the data of upper hop node transmission, according to the energy value of self, is selected data retransmission mode and forward; When node self-energy value is greater than b, according to routing table, chooses next-hop node and directly forward; When node self-energy value is greater than a and is less than b, adopt border circular areas search method to obtain next-hop node; When node self-energy is less than a, no longer carry out data retransmission, and upper hop node sends data, inform that 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 for take the border circular areas that the line of next-hop node is diameter in present node and former routing table.
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 CN102883401A (en) | 2013-01-16 |
| CN102883401B true 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) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109587754B (en) * | 2018-12-18 | 2021-08-31 | 深圳Tcl新技术有限公司 | Network equipment node selection method and device and computer readable storage medium |
| CN116760762B (en) * | 2023-08-14 | 2023-11-07 | 北京华云安软件有限公司 | Decentralised ad hoc network method and device |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2006015177A2 (en) * | 2004-07-28 | 2006-02-09 | University Of South Florida | A system and method to assure node connectivity in an ad hoc network |
-
2012
- 2012-10-17 CN CN201210395631.9A patent/CN102883401B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102883401A (en) | 2013-01-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105163349B (en) | A kind of multiple gateway Wireless Mesh network implementation method based on IEEE802.11s | |
| CN104320796A (en) | Wireless sensor network data transmission method based on LEACH protocol | |
| CN108966305A (en) | A kind of LORA relaying ad hoc network method | |
| CN105515972B (en) | A kind of mobilism ad hoc network wireless communication device | |
| Li et al. | Energy-efficient multipath routing in wireless sensor network considering wireless interference | |
| WO2007058136A1 (en) | Radio communication device, and ad hoc route information acquiring method | |
| CN102148756A (en) | IPv6 over low power wireless personal area network (6LoWPAN) neighbor discovery-based tree routing method | |
| CN105357731A (en) | Energy-efficient wireless sensor network (WSN) routing protocol design method for use in electromagnetic interference environment | |
| CN103796271B (en) | A kind of IPv6 router redundancy methods suitable for tree-shaped wireless sense network | |
| CN103841621B (en) | A kind of redundancy method for routing based on 6LoWPAN tree networks | |
| CN101102283A (en) | A method and device for optimizing unknown unicast forward at wireless access point | |
| WO2016150269A1 (en) | Method, device and system for optimizing paging, and storage medium | |
| CN109548112A (en) | A kind of wireless sense network distributed routing method based on the various dimensions path quality factor | |
| CN103731878A (en) | Frame specification for a wireless network communication | |
| CN104219632B (en) | Mobile phone MANET positional information collection method for emergency rescue | |
| CN101820661A (en) | Random walk routing method combining opportunistic forwarding in mobile wireless multi-hop network | |
| Aliyu et al. | DS-OLSR–disaster scenario optimized link state routing protocol | |
| 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 | |
| CN103686944B (en) | Gateway selection method for interconnection of cellular network and multi-hop wireless sensing network | |
| CN102573121B (en) | Wireless Mesh router | |
| CN104219156A (en) | Multicast routing method applicable for hierarchical air ad hoc network | |
| CN104320825A (en) | Ad hoc network route selection method based on repeated game | |
| CN104661282B (en) | A kind of access of ad hoc network, data transmission and construction method | |
| Aishwarya et al. | Relay assisted cooperative communication for wireless sensor networks |
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 for 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 |