CN103607747B - A kind of based on the cluster of Power Control between virtual backbone Routing Protocol method - Google Patents
A kind of based on the cluster of Power Control between virtual backbone Routing Protocol method Download PDFInfo
- Publication number
- CN103607747B CN103607747B CN201310666860.4A CN201310666860A CN103607747B CN 103607747 B CN103607747 B CN 103607747B CN 201310666860 A CN201310666860 A CN 201310666860A CN 103607747 B CN103607747 B CN 103607747B
- Authority
- CN
- China
- Prior art keywords
- node
- packet
- power
- route
- routing table
- 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.)
- Expired - Fee Related
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
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
A kind of based on the cluster of Power Control between virtual backbone Routing Protocol method it is adaptable to field of underwater acoustic communication.The method is improved on the basis of CLUSTERPOW agreement, choose suitable power grade number in conjunction with power control techniques, each backbone nodes use Handshake Protocol sets up each power grade routing table of respective number, backbone node is adaptive selected power consumption optimal path when forwarding data according to destination node, and carry out route querying work in the transmission process of a packet only at source node, and by the routed encapsulation searched in packet, effectively prevent the appearance of route loop, and other forward node need not execute the route querying agreement of complexity.
Description
Technical field
The present invention relates to the Routing Protocol of underwater sound communication network Internet, more particularly, to a kind of based on the cluster of Power Control between
Virtual backbone Routing Protocol method, belongs to Underwater acoustic signal processing technical field.
Background technology
After the completion of election of cluster head and cluster build, the transmission of data relies solely on leader cluster node and passes through list a lot of Clustering protocols
Jump communication pattern and data is sent directly to base station, if base station is away from area to be monitored, this will consume more energy, separately
Outward, this also requires that leader cluster node has sufficiently large power of communications, can directly and base station communication, and this is for underwater sensor section
Very unrealistic for point, therefore many research institutions and individual are for the multi-hop communication pattern i.e. multi-hop road based on clustering architecture between cluster
Research is expanded by agreement.
In the network based on clustering architecture, communicate between cluster usual combined with virtual backbone technology and power control techniques, bone
Main line by lookup require backbone node to connect another backbone node with minimum power (shortest path) method as far as possible.
The CLUSTERPOW agreement that Vikas Kawadia and P.R.Kumar proposes finds backbone network using the method consulting routing table
Optimization route in network.
CLUSTERPOW agreement is a kind of to be adaptively adjusted for different destination nodes based on power control techniques
The Routing Protocol of proper emission power.This agreement sets up local power grade routing table by Handshake Protocol, each backbone's section
After point has set up the routing table of oneself each local power grade, the routing table information of oneself is passed through bag wide in the whole network
Broadcast, the backbone node in such network has been known that the local routing table information of other backbone nodes.In order to find power optimized
The route changed, each backbone node is when forwarding packet it is necessary to set up a kernel route table, the work(of kernel route table
The shortest route reaching destination node can be there is provided.Kernel route table is after having consulted local routing table, selects
Small-power route and handle is copied in kernel route table.Kernel route table has more one than normal routing table and " sends out
Penetrate power " domain, this domain indicates the emitting power grade reaching needed for next-hop node.Backbone node will according to kernel route table
Transmission power is adjusted to respective level, then forwards the data to next-hop node.Similarly, next-hop node is forwarding data
The kernel route table of Shi Jianli oneself simultaneously forwards data.Each via node is set up the kernel route table of oneself and is forwarded data simultaneously
Bag, until delivering a packet to destination node.In addition, being the appearance avoiding route loop, that is, prevent the information between node
Transmission is absorbed in endless loop, and CLUSTERPOW specifies that the transmission power that the transmitting procedure interior joint in single packet is used is necessary
It is dull nonincremental.But CLUSTERPOW agreement is to avoid producing route loop, in a transmission process of packet
Using nonincremental transmission power, this causes the waste of transmission power to a certain extent.
The definition of backbone node is：One wireless sensor network is divided into the little network of multiple self-government, and each is little
Network is exactly a cluster, chooses, according to cluster head, the cluster head node that agreement chooses each cluster, and leader cluster node serves as virtual backbone between cluster
(virtual backbone network is generally collectively formed it is also possible to only stronger by function the backbone node of net by cluster head and some ordinary nodes
Cluster head forms virtual backbone network；Backbone node can be served as by the leader cluster node being elected by Clustering protocol) enter line number
According to forwarding work；In conjunction with power control techniques choose specific power grade number (through-put power is relevant with euclidean distance between node pair,
Increase power grade number and can more accurately adjust transmission power, thus speculate and continue when power grade number exceedes certain value
Energy no longer will be substantially saved in increase, but little power grade number is then more easily implemented, and the selection of power grade number needs root
To set according to different network applications), and local power grade routing table and the overall situation of respective number is set up using Handshake Protocol
(backbone node is with each discrete power grade p for power grade routing tableiSend a probe bag, go to detect in reception model
Other backbone nodes within enclosing, other backbone nodes once receive probe bag, will reply a prack bag, backbone node
Confirm that the node serial number of bag is stored in the p of oneself by sending to oneselfiIn the routing table of grade.So each backbone node is just every
Individual power grade safeguards a route list, and finally each backbone node forms local power grade routing table, in conjunction with network
The local power grade routing table of other backbone nodes forms global power grade routing table)；When backbone node has packet to need
When to be sent, this backbone node is referred to as source node.
Content of the invention
Present invention solves the technical problem that：It is to avoid producing route loop for CLUSTERPOW agreement, in packet
The phenomenon being caused transmission power to waste in transmission process using nonincremental transmission power, is entered to CLUSTERPOW agreement
Row improves, and improved CLUSTERPOW agreement effectively prevent the appearance of route loop, reduces transmission power consumption simultaneously.
The technical solution used in the present invention：A kind of based on the cluster of Power Control between virtual backbone Routing Protocol method, foundation
CLUSTERPOW protocol method, finds the Optimization route in backbone network, in conjunction with power control using the method consulting routing table
Technology processed is chosen power grade number and is set up the local power grade routing table of respective number and overall work(using Handshake Protocol
Rate grade routing table, is adjusted to proper emission power realization route for different number of node self-adapting, in order to find work(
The optimized route of rate, each backbone node must set up a kernel route table when forwarding packet, and kernel route table carries
Supply to reach the shortest route of destination node, kernel route table, after having consulted local routing table, selects minimum power road
By and being copied in kernel route table, transmission power is adjusted to corresponding etc. by backbone node according to kernel route table
Level, then forwards the data to next-hop via node, and next-hop via node sets up the core road of oneself when forwarding data
By table and forward data, each via node is set up the kernel route table of oneself and is forwarded packet simultaneously, until sending out packet
Deliver to destination node, the backbone node sending packet is source node, the section of experience on source node to destination node shortest path
Point for via node it is characterised in that：Improve CLUSTERPOW protocol method, only in source in the transmission process of a packet
At node, a dijkstra's algorithm is executed according to power grade routing table and search the power consumption minimal path reaching destination node simultaneously
Node ID number on this path is saved in kernel route table, to avoid the appearance of route loop, reduces transmission power simultaneously and disappear
Consumption, comprises the following steps：
1) it is based on CLUSTERPOW agreement, the power grade number chosen in conjunction with power control techniques, in each region
Backbone nodes use Handshake Protocol sets up local power grade routing table and the global power grade routing table of respective number；
2) when backbone node has packets need to send, this backbone node is according to each power grade route being previously saved
Table executes dijkstra's algorithm and searches the power consumption minimal path reaching destination node and be saved in the node ID number on this path
Kernel route table；
3) according to DSR agreement, kernel route table is encapsulated into the head of packet by the source node of packet, and will launch work(
Rate is adjusted to corresponding power grade, then delivers a packet to next-hop via node；
4) next-hop via node upper hop via node first when receiving packet sends reply confirmation bag, then
The packet receiving is decapsulated, judges whether oneself is destination node, if destination node, then go to step 6), if
It is not destination node, then goes to step 5)；
5) take out packet core routing table in first via node id number as the next-hop via node of oneself
No. ID, and the remaining routing iinformation in kernel route table is stored the kernel route table of oneself, similarly by the core of oneself
Routing table is encapsulated into the head of packet, finally according to the power grade routing table of oneself by transmission power adjustment to corresponding power
Grade, and this packet is transmitted to the next-hop via node of oneself；
6) each via node is set up the kernel route table of oneself and is forwarded packet simultaneously, if via node receives reply
Bag, then explanation data forwarding success, confirm bag without receiving to reply, show previous route break, this via node needs
Dijkstra's algorithm is executed according to each power grade routing table of oneself and to search the power consumption minimal path reaching destination node simultaneously
Update the kernel route table of oneself, the routing table after updating is encapsulated into data packet header and is sent to next-hop via node；
7) next-hop node repeated execution of steps 4), until packet reaches purpose node；
8) packet sends and terminates.
The advantage of the inventive method and significant effect：
1) during route querying, in conjunction with dijkstra's algorithm, power consumption is adaptively chosen according to destination node
Little path.
2) optimal path found is encapsulated in packet, effectively prevent the appearance of route loop.
3) in the transmission process of a packet, agreement is only performed at source node, and other forward node need not be held
The complicated route querying agreement of row, this reduces the expenses such as the data processing of node to a certain extent.
Brief description
Fig. 1 is backbone node X1To XNOptimal path；
Fig. 2 is the data packet format of CLUSTERPOW agreement；
Fig. 3 is the data packet format of improved CLUSTERPOW agreement；
Fig. 4 is that two agreement single packet energy expenditure differences are bent with the change of interstitial content on power grade number and path
Line；
Fig. 5 is the topology diagram that network simulation adopts；
Fig. 6 is the contrast of two agreements single packet average energy consumption under different capacity number of levels；
Fig. 7 is the contrast that single packet energy expenditure changes with load under high data rate of two agreements；
Fig. 8 is the contrast that single packet energy expenditure changes with load under low data rate of two agreements；
Fig. 9 is that two agreements single packet average energy consumption when packet information bit length takes different value becomes with load
The contrast changed；
Figure 10 is tank experiments monitoring interface；
Figure 11 is that the average energy consumption of two agreement single packets in tank experiments compares.
Specific embodiment
For further illustrating that the present invention is to reach the method that predetermined goal of the invention is taken, with reference to embodiments, right
The inventive method is described in detail.
Embodiment 1：
1st, in order to accurately estimate the energy consumption and performance of improved CLUSTERPOW agreement, theoretically calculate below and improve
CLUSTERPOW agreement and CLUSTERPOW agreement Energy Expenditure Levels.
As shown in Figure 1 it is assumed that X1Will be to XNSend packet it is assumed that finding power consumption minimal path with dijkstra's algorithm
For X1-X2-X3-X4……XN-1-XN.In view of CLUSTERPOW agreement and changing under the transmitting power consumption difference minimum of two agreements
The CLUSTERPOW agreement entered is X only in the first jump1-X2When there is emitting power grade difference, it is assumed that other on path
Penetrate power grade as shown in fig. 1, wherein P1And P2For two adjacent power grades, and there is P1≤P2, then in X1-X2This
On path, the transmission power of CLUSTERPOW agreement is P2, the transmission power of improved CLUSTERPOW agreement is P1.
CLUSTERPOW agreement and improved CLUSTERPOW protocol data packet format are as shown in Figures 2 and 3, then two agreements send one
Total power consumption E of individual packet1And E2(ignore confirmation bag as shown in formula (1) and formula (2)) herein.
Wherein, D is a data package size of CLUSTERPOW agreement, RbFor transmitted data rate, PrcvFor sensor node
Receiving power, NbBy No. ID bit number being occupied of packet interior joint.So CLUSTERPOW agreement and improved
The energy differences E that CLUSTERPOW agreement sends that packet consumed altogether is：
E=E1-E2(3)
Formula (1) and formula (2) are brought into formula (3) can obtain
CLUSTERPOW agreement and improved CLUSTERPOW agreement send the energy difference that a packet is consumed altogether
Value E and D, power grade P1And P2, nodes N, R on pathb、PrcvAnd NbRelevant.
It is readily apparent to by formula (4), for underwater sound communication network, under most application scenarios, have E ＞ 0, that is, improved
The energy expenditure of CLUSTERPOW agreement can be less than CLUSTERPOW agreement.This is because：For underwater sound communication network, water
The scale that the hardware cost of the particularity of Acoustic channel and underwater sensor node costliness determines normal conditions lower network will not
Very big, especially in clustering network, the number of cluster head will not be a lot, in communication process between cluster, data forwarding jumping figure one
As less, so the value of N typically also will not be very big；The presence of data packet head routing control information makes the difference of D and N relatively
Greatly；Also will not very big and usual transmission power ratio connect in view of the power grade number in the complexity underwater sound communication network realized
Receive power much bigger, therefore P2With P1Gap comparatively will not very little.
2nd, as D=512bit, Rb=320bit/s, Prcv=0.9W, NbLong distance between adjacent node in=8bit, network
From during for 50km, beeline for 18km, E is as shown in Figure 4 with the situation of change of power grade number GradeNum and N.By in figure
As can be seen that power grade number is less, energy differences are bigger, and the less i.e. hop count of N is fewer, and energy differences are also bigger.And
And under different power grade numbers, always have E ＞ 0 when N value is less.Value due to N in clustering network generally will not be very
Greatly, therefore improved CLUSTERPOW agreement can show on virtual backbone Routing Protocol between the cluster of clustering network certain
Superior function.
Embodiment 2：
OPNET Modeler 14.5 platform is carried out to CLUSTERPOW agreement and improved CLUSTERPOW agreement
Emulation is compared.
Referring to Fig. 5, it is the topology diagram that network simulation adopts, lays at random in the simulating scenes of 100km × 100km
50 nodes, wherein 10 leader cluster nodes and 40 ordinary nodes.In emulation, backbone node is only come by all of leader cluster node
Take on.In emulation, each node produces the packet of oneself, if node is ordinary node, first delivers a packet to oneself
Leader cluster node, forwards through leader cluster node.If destination node is ordinary node, first delivers a packet to its leader cluster node and enter
Row forwards.MAC layer adopts simple carrier wave to detect (intercepting) multiple access CSMA (Carrier Sense Multiple
Access) agreement.Main simulation parameter is as follows：Spread speed is 1500m/s；Mid frequency is 10kHz；Packet interior joint ID
Number bit number being occupied is 8bit；In node data speed data bag, information bit length all sets in simulations on demand.Imitative
The raw time interval of contracting for fixed output quotas of true transaction flow is obeyed and is uniformly distributed, and packet interarrival times average also sets in simulations on demand.Section
The load of point includes the data flow of input load and relaying.CLUSTERPOW agreement and improved has been respectively obtained by emulation
The single packet average energy consumption of CLUSTERPOW agreement is with power grade number, network average load and packet
The change of information bit length contrasts Fig. 6～9.
Referring to Fig. 6, it is the contrast of two agreements single packet average energy consumption under different capacity number of levels.From figure
In it can be seen that CLUSTERPOW agreement and improved CLUSTERPOW agreement single packet average energy consumption all with
The increase of power grade number and be gradually reduced.When power grade number is more than or equal to 2, the list of improved CLUSTERPOW agreement
Individual packet energy expenditure is significantly lower than CLUSTERPOW agreement.This is because communication system can be made using more power grades
More effectively, more accurately adjust the distribution of power, such node just can need to send number from suitable power according to transmission
According to, thus reducing total energy expenditure and node interference, but unactual using too many power grade, this can increase system
The complexity of design.And it can be seen that when number of degrees is more than 3, two kinds of agreements are all not significantly improve system
Performance, in addition combined with Fig. 2 and by considering single packet average energy consumption and realizing complexity, power grade number is adopted
It is all proper with 3 and 4.
Referring to Fig. 7, it is the contrast that single packet energy expenditure changes with load under high data rate of two agreements, now
In emulation, setting data speed is 320bit/s, the packet interarrival times average of emulation transaction flow 0.2 second respectively, 0.5 second,
0.9 second, 20 seconds, 90 seconds, 150 seconds, 200 seconds, 300 seconds.The time of every group of emulation is set to 2 hours, every group of simulation run 5 times, takes
Averagely obtain simulation result.The increase all with load for the single packet average energy consumption of two kinds of agreements as seen from the figure
It is gradually increased, finally tend to be steady.CLUSTERPOW agreement is to avoid producing route loop, in a transmission process of packet
It is middle that using nonincremental transmission power, the waste that this causes transmission power to a certain extent causes the waste of energy,
And improved CLUSTERPOW agreement solves this defect, using power consumption optimum path, therefore single packet average energy disappears
Consumption substantially reduces much than CLUSTERPOW agreement.
Referring to Fig. 8, it is the contrast that single packet energy expenditure changes with load under low data rate of two agreements, now
In emulation, setting data speed is 80bit/s, the packet interarrival times average of emulation transaction flow 6 seconds respectively, 7 seconds, 8 seconds, 9
Second, 10 seconds, 13 seconds, 15 seconds, 30 seconds, 45 seconds, 60 seconds, 75 seconds, 90 seconds, 105 seconds, 120 seconds.As seen from the figure, low data rate
Under, the single packet average energy consumption still increase with load of two kinds of agreements is all gradually increased, and finally tends to be steady,
But the single packet energy expenditure of improved CLUSTERPOW agreement still is below CLUSTERPOW agreement.Compared with Fig. 7, low
Under data transfer rate, away from increasing, this is because launch time increases, emitted energy consumption increases the energy difference of two kinds of agreements
Referring to Fig. 9, be two agreements when packet information bit length takes different value single packet average energy consumption with
The contrast of load change, in now emulating, set information bit length is respectively 256bit, 512bit and 1024bit.(improve from figure
Front expression CLUTERPOW agreement, represents improved CLUTERPOW agreement after improvement) in it can be seen that packet information bit length
Under three kinds of values, the single packet energy expenditure of improved CLUTERPOW agreement is respectively less than CLUTERPOW agreement, and with
Both differences that increases data message bit length are also gradually increased.
Referring to Figure 10, it is tank experiments monitoring interface, use only four modem in experiment as leader cluster node, and cluster
Member node to simulate true modem using dummy node, and each cluster is having three member node, in figure cluster head 0 and cluster head 3
Communicated.
Referring to Figure 11, it is that the average energy consumption of two agreement single packets in tank experiments compares.As seen from the figure, exist
Some specific energy expenditures taking turns upper improved CLUSTERPOW agreement are less than CLUSTERPOW agreement, this is because
CLUSTERPOW agreement is to avoid route loop to use nonincremental power grade, and this causes the wave of the energy to a certain extent
Take, and improved CLUSTERPOW agreement chooses suitable emitting power grade, saves energy.
Comprehensive above all of analysis of simulation result is it can be deduced that compared with CLUSTERPOW agreement, improved
CLUSTERPOW agreement reduces the energy expenditure of network, and and then extends Network morals.
Claims (1)
1. a kind of based on the cluster of Power Control between virtual backbone Routing Protocol method, according to CLUSTERPOW protocol method, use
The method consulting routing table, to find the Optimization route in backbone network, chooses power grade number simultaneously in conjunction with power control techniques
Set up local power grade routing table and the global power grade routing table of respective number using Handshake Protocol, for different numbers
Node self-adapting be adjusted to proper emission power and realize route, in order to find the route of power optimized, each is key
Node must set up a kernel route table when forwarding packet, and kernel route table provides the shortest path reaching destination node
By kernel route table, after having consulted local routing table, selects minimum power to route and is copied into core route
In table, transmission power is adjusted to respective level according to kernel route table by backbone node, then forwards the data in next-hop
Continue node, and next-hop via node is set up the kernel route table of oneself and forwarded data when forwarding data, each via node
Set up the kernel route table of oneself and forward packet simultaneously, until delivering a packet to destination node, send the bone of packet
Dry contact be source node, on source node to destination node shortest path experience node be via node it is characterised in that：Improve
CLUSTERPOW protocol method, executes according to power grade routing table in the transmission process of a packet only at source node
One time dijkstra's algorithm is searched the power consumption minimal path reaching destination node and the node ID number on this path is saved in core
Heart routing table, to avoid the appearance of route loop, reduces transmission power consumption simultaneously, comprises the following steps：
1）Based on CLUSTERPOW agreement, the power grade number chosen in conjunction with power control techniques, the backbone in each region
Node sets up local power grade routing table and the global power grade routing table of respective number using Handshake Protocol；
2）When backbone node has packets need to send, this backbone node is held according to each power grade routing table being previously saved
Row dijkstra's algorithm is searched the power consumption minimal path reaching destination node and the node ID number on this path is saved in core
Routing table；
3）According to DSR agreement, kernel route table is encapsulated into the head of packet by the source node of packet, and transmission power is adjusted
Whole to corresponding power grade, then deliver a packet to next-hop via node；
4）Next-hop via node upper hop via node first when receiving packet sends reply confirmation bag, then to receipts
To packet decapsulated, judge whether oneself is destination node, if destination node, then go to step 8）, if not
Destination node, then go to step 5）；
5）Take out in packet core routing table first via node id number as the next-hop via node of oneself ID,
And the remaining routing iinformation in kernel route table is stored the kernel route table of oneself, similarly by the kernel route table of oneself
It is encapsulated into the head of packet, finally according to the power grade routing table of oneself by transmission power adjustment to corresponding power grade,
And this packet is transmitted to the next-hop via node of oneself；
6）Each via node is set up the kernel route table of oneself and is forwarded packet simultaneously, if via node receives reply bag,
Then explanation data forwarding success, confirms bag without receiving to reply, shows previous route break, this via node needs root
Execute dijkstra's algorithm according to each power grade routing table of oneself to search the power consumption minimal path of arrival destination node and update
The kernel route table of oneself, the routing table after updating is encapsulated into data packet header and is sent to next-hop via node；
7）Next-hop node repeated execution of steps 4）, until packet reaches purpose node；
8）Packet sends and terminates.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310666860.4A CN103607747B (en) | 2013-12-10 | 2013-12-10 | A kind of based on the cluster of Power Control between virtual backbone Routing Protocol method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310666860.4A CN103607747B (en) | 2013-12-10 | 2013-12-10 | A kind of based on the cluster of Power Control between virtual backbone Routing Protocol method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103607747A CN103607747A (en) | 2014-02-26 |
| CN103607747B true CN103607747B (en) | 2017-03-08 |
Family
ID=50125940
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310666860.4A Expired - Fee Related CN103607747B (en) | 2013-12-10 | 2013-12-10 | A kind of based on the cluster of Power Control between virtual backbone Routing Protocol method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103607747B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105333902A (en) * | 2014-08-12 | 2016-02-17 | 湖北泽捷电子科技有限公司 | Pipeline fluid monitor |
| CN108712772A (en) * | 2018-04-18 | 2018-10-26 | 佛山市龙生光启科技有限公司 | A kind of zigbee network network-building method |
| GB2594402B (en) * | 2018-12-24 | 2023-09-06 | Schlumberger Technology Bv | Adaptive routing system and method for a downhole wireless communications system |
| CN110445713B (en) * | 2019-07-29 | 2020-12-22 | 华南理工大学 | Flooding routing method based on standby path |
| CN114846903A (en) * | 2019-12-31 | 2022-08-02 | 华为技术有限公司 | Data transmission method and device of multi-hop path |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102223644A (en) * | 2011-05-05 | 2011-10-19 | 北京邮电大学 | System and method for combining relay selection and power distribution |
| CN102769886A (en) * | 2011-05-05 | 2012-11-07 | 中国移动通信集团河南有限公司 | Routing method, device and sensor nodes of wireless sensor network |
-
2013
- 2013-12-10 CN CN201310666860.4A patent/CN103607747B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102223644A (en) * | 2011-05-05 | 2011-10-19 | 北京邮电大学 | System and method for combining relay selection and power distribution |
| CN102769886A (en) * | 2011-05-05 | 2012-11-07 | 中国移动通信集团河南有限公司 | Routing method, device and sensor nodes of wireless sensor network |
Non-Patent Citations (2)
| Title |
|---|
| Power Control and Clustering in Ad Hoc Networks;Vikas Kawadia等;《IEEE》;20031231;全文 * |
| 改进的路由协议BLOCKING-COMPOW;张文彬等;《计算机工程与应用》;20111231(第16期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103607747A (en) | 2014-02-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103607747B (en) | A kind of based on the cluster of Power Control between virtual backbone Routing Protocol method | |
| Yu et al. | A dynamic clustering and energy efficient routing technique for sensor networks | |
| Chen et al. | Mobicast routing protocol for underwater sensor networks | |
| CN106900025A (en) | A kind of wireless sensor network clustering routing based on double cluster heads | |
| Liu et al. | A new multi-path routing protocol based on cluster for underwater acoustic sensor networks | |
| CN103974367B (en) | Fault tolerant and multi-path optimization method based on HEED algorithms in wireless sensor network | |
| CN102131269A (en) | Geographical-position-based routing method in wireless mesh network | |
| US10103913B2 (en) | Systems and methods for network routing in small-world network-on-chip devices | |
| CN101267391A (en) | Wireless sensor network topology control method based on non-uniform sections | |
| CN101442787B (en) | Energy-saving routing method for wireless sensor network based on power control | |
| Chao et al. | DRP: An energy‐efficient routing protocol for underwater sensor networks | |
| CN103052129A (en) | Energy-saving route setup and power distribution method in wireless multi-hop relay network | |
| CN104883285B (en) | The network-building method and multi-mode radio communication equipment of a kind of network | |
| Ali et al. | An on-demand power and load-aware multi-path node-disjoint source routing scheme implementation using NS-2 for mobile ad-hoc networks | |
| CN103200643A (en) | Distributed fault-tolerant topology control method based on dump energy sensing | |
| CN104883676A (en) | Cooperative safety communication method in multi-UAV environment | |
| Meghanathan | A comprehensive review and performance analysis of data gathering algorithms for wireless sensor networks | |
| CN108123873A (en) | Data forwarding paths selection method and device, storage medium, server-side | |
| CN110493797A (en) | Wireless sensor network topology control algolithm based on sub-clustering optimization | |
| CN107172678A (en) | Wireless sensor network geography information opportunistic routing protocol | |
| CN111132236B (en) | Multi-unmanned aerial vehicle self-organizing network MPR node selection method based on improved OLSR protocol | |
| CN110740487B (en) | Underwater routing method with effective energy and obstacle avoidance | |
| Chen et al. | An underwater layered protocol based on cooperative communication for underwater sensor network | |
| CN103096411B (en) | Based on the Internet of Things communication means of reverse power restriction route protocol | |
| CN102781059A (en) | Intelligent wireless sensor network routing method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20170308 Termination date: 20191210 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |