CN105933946A - Wireless routing data processing method, forwarding method, wireless routing data processing system, forwarding system and wireless sensor - Google Patents

Wireless routing data processing method, forwarding method, wireless routing data processing system, forwarding system and wireless sensor Download PDF

Info

Publication number
CN105933946A
CN105933946A CN201610207991.XA CN201610207991A CN105933946A CN 105933946 A CN105933946 A CN 105933946A CN 201610207991 A CN201610207991 A CN 201610207991A CN 105933946 A CN105933946 A CN 105933946A
Authority
CN
China
Prior art keywords
node
data
neighbor node
wireless routing
forwarding
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201610207991.XA
Other languages
Chinese (zh)
Inventor
陈晓东
高成虎
宋梁
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shanghai Advanced Research Institute of CAS
Original Assignee
Shanghai Advanced Research Institute of CAS
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shanghai Advanced Research Institute of CAS filed Critical Shanghai Advanced Research Institute of CAS
Priority to CN201610207991.XA priority Critical patent/CN105933946A/en
Publication of CN105933946A publication Critical patent/CN105933946A/en
Pending legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/02Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/20Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/02Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/22Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/24Connectivity information management, e.g. connectivity discovery or connectivity update
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/02Communication route or path selection, e.g. power-based or shortest path routing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/02Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/12Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W84/00Network topologies
    • H04W84/18Self-organising networks, e.g. ad-hoc networks or sensor networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention provides a wireless routing data processing method, a wireless routing data forwarding method, a wireless routing data processing system, a wireless routing data forwarding system and a wireless sensor. The processing method includes the following steps that: broadcast request-to-send information from a source node is received, wherein the broadcast request-to-send information contains a target distance between the source node and a destination node of data sending; after the broadcast request to send is received, a distance between a neighbor node and the destination node is calculated, and the distance is compared with the target distance, if the distance between the neighbor node and the destination node is smaller than the target distance, the neighbor node is defined as a candidate forwarding node; a timing value for representing the forwarding priority of the neighbor node is calculated; and clear to send information is sent to the source node. According to the invention, the method according to which a timing mechanism is adopted to select the forwarding node is adopted, so that the method can further quantify measurement factors in forwarding node selection and is conductive to the improvement of the selection efficiency of the forwarding node.

Description

A kind of wireless routing data process/retransmission method, system and wireless senser
Technical field
The invention belongs to wireless communication field, particularly relate to a kind of wireless routing data process/retransmission method, system and Wireless senser.
Background technology
In recent years, the research to opportunistic routing protocol has been risen in wireless sensor network field.The association of traditional route View is to rely on a previously selected path and forwards packet from source node to destination node, and network transmission efficiency is low, uncomfortable For the wireless sensor network that link is unstable.Opportunistic routing protocol is different from traditional Routing Protocol, and it takes full advantage of The broadcast characteristic of wireless channel, uses several pre-forward node of electing to carry out opportunistic forwarding, can increase substantially network The success rate that middle data forward.But also faced some problems as a kind of Novel road by, chance route, wherein forward node Selection is one of the major issue that have to consider.
At present, the chance of strategy based on geographical position route when selecting forward node, the geography of Main Basis node Positional information, i.e. after neighbor node receives RTS, can calculate the distance of own node and destination node, if this distance is less than Sending node is to the distance of destination node, then this neighbor node enters candidate's forward node collection, simultaneously at candidate's forward node collection The middle distance according to each neighbor node to destination node arranges priority, the node that distance is the least, and priority is the highest, the most likely Become the down hop forward node of this packet.
This selection mechanism is specific as follows:
If wireless sensor network interior joint integrates as V, V=(v1,v2,v3…).All neighbours of a certain intermediate forwarding nodes S Occupying set of node is Ns, total nodes is n, Ns=(v1,…,vi,…vn), wherein 1 < i < n, n >=3, s >=3,Purpose Node is D.The distance assuming S to D is Ds→d, NsIn node be D to the distance of Di→d.As 1 < i < n, Di→d< Ds→d, then Node i is selected into candidate's forward node and concentrates.
Although the system of selection of this forward node is simple, but carry out measuring excessively simple, no with euclidean distance between node pair It is applicable to the wireless sensor network environment of reality, poor universality.
Therefore, how to provide a kind of wireless routing data process/retransmission method, system and wireless senser, existing to solve The selective mechanism having the forward node employed in technology carries out measuring by euclidean distance between node pair and excessively simply, is not suitable for reality The wireless sensor network environment on border, the defect such as poor universality, the real technical problem the most urgently to be resolved hurrily to become practitioner in the art.
Summary of the invention
The shortcoming of prior art in view of the above, it is an object of the invention to provide a kind of wireless routing data process/ Retransmission method, system and wireless senser, for solving the selective mechanism of forward node used in the prior art by joint Dot spacing, from carrying out measuring and excessively simple, is not suitable for the wireless sensor network environment of reality, the problem of poor universality.
For achieving the above object and other relevant purposes, one aspect of the present invention provides a kind of wireless routing data process side Method, described wireless routing data forwarding method comprises the following steps: receives and comes from source node broadcast data request transmission information;Institute State request of data transmission information and include the target range between the destination node that source node and data send;Waiting receive described extensively After multicast data sends request, the distance calculated between neighbor node and destination node compares with described target range, if little In described target range, this neighbor node is defined as candidate's forward node;Calculating is used for representing neighbor node forwarding priority Timing value;The information that sent by data dump sends to source node.
In one embodiment of the invention, described request of data sends information and includes the geographical position of source node and destination node Confidence ceases, and according to the geographical location information of source node Yu destination node, obtains between the destination node of source node and data transmission Target range.
In one embodiment of the invention, described wireless routing data processing method also include waiting receive described data please After seeking transmission information, according to geographical location information and the geographical location information of described destination node of neighbor node self, calculate Distance between this neighbor node and destination node.
In one embodiment of the invention, attribute information and the interFrameGap transmitted in data according to neighbor node calculate For representing the timing value of neighbor node forwarding priority;The described timing value for representing neighbor node forwarding priority is more Little, illustrate that this neighbor node more has the priority forwarding data.
At neighbor node after represent that the timing of priority terminates, send described data dump and send information to source joint Point.
One aspect of the present invention also provides for a kind of wireless routing data forwarding method, described wireless routing data forwarding method bag Include following step: receive and come from the data dump transmission information that neighbor node sends;First is selected to send described data The neighbor node of clear to send information as down hop forward node to forward data.
In one embodiment of the invention, send the neighbor node work of information selecting first to send described data dump After the down hop forward node step with forwarding data, described wireless routing data forwarding method also includes: judge whether In the request of source node sends timing, receive this data dump send information, the most then stop receiving other neighbor node The data dump forwarded sends information, and sends data to first neighbours' joint sending described data dump transmission information Point;First neighbor node sending described data dump transmission information is these neighbours of neighbor node joint with minimum timing value Point feeds back a confirmation after receiving the data to source node;Judge whether to receive in timing is fed back in the confirmation of source node Come from the confirmation of described neighbor node, if so, represent that data successfully forward;If it is not, the most again transmit data.
Another aspect of the present invention provides a kind of wireless routing data handling system, described wireless routing data handling system bag Include: first communication module, come from source node broadcast data request transmission information for reception;In described request of data transmission information Including the target range between the destination node that source node and data send;First processing module, receives described broadcast for waiting After data sending request, the distance calculated between neighbor node and destination node compares with described target range, if being less than Described target range, is defined as candidate's forward node by this neighbor node, and calculating is used for representing neighbor node forwarding priority Timing value;The information that sent by data dump is sent to source node by described first communication module.
In one embodiment of the invention, described first processing module is additionally operable to the attribute information according to neighbor node and biography InterFrameGap in transmission of data calculates the timing value for representing neighbor node forwarding priority;Described for representing neighbor node The timing value of forwarding priority is the least, illustrates that this neighbor node more has the priority forwarding data.
Another aspect of the present invention also provides for a kind of wireless routing data forwarding system, described wireless routing data forwarding system Including: second communication module, come from, for receiving, the data dump transmission information that neighbor node sends;Second processing module, uses The neighbor node of information is sent as down hop forward node to forward data in selecting first to send described data dump.
In one embodiment of the invention, select first send described data dump send information neighbor node it After, described second processing module is additionally operable to: judge whether that receiving this data dump in the request of source node sends timing sends out Deliver letters breath, the most then data dump that other neighbor node forwards sends information to make described second communication module stop receiving, and Send data to first neighbor node sending described data dump transmission information;First sends data dump and sends letter The neighbor node of breath is the neighbor node with minimum timing value;This neighbor node feeds back a confirmation after receiving the data To source node;Judge whether in the confirmation feedback timing of source node, receive the confirmation coming from described neighbor node, if It is to represent that data successfully forward;If it is not, then make described second communication module again transmit data.
Last aspect of the present invention provides a kind of wireless senser, including described wireless routing data handling system and/ Or described wireless routing data forwarding system.
As it has been described above, wireless routing data process/retransmission method, system and the wireless senser of the present invention, have following Beneficial effect:
Wireless routing data process/retransmission method of the present invention, system and wireless senser utilize timing mechanism to enter The method of row forwarder selection, the method quantifies the measurement factor in forwarder selection further, is conducive to improving forwarding The efficiency of selection of node, more adapts to wireless sensor network environment in reality application.
Accompanying drawing explanation
Fig. 1 is shown as the wireless communication network architecture schematic diagram of the present invention.
Fig. 2 is shown as the wireless routing data processing method of present invention schematic flow sheet in an embodiment.
Fig. 3 is shown as the wireless routing data handling system of present invention theory structure schematic diagram in an embodiment.
Fig. 4 is shown as the wireless routing data forwarding method of present invention schematic flow sheet in an embodiment.
Fig. 5 is shown as the wireless routing data forwarding system of present invention theory structure schematic diagram in an embodiment.
Fig. 6 A is shown as a kind of theory structure schematic diagram of the wireless senser of the present invention.
Fig. 6 B is shown as the another kind of theory structure schematic diagram of the wireless senser of the present invention.
Fig. 6 C is shown as another theory structure schematic diagram of the wireless senser of the present invention.
Element numbers explanation
10 cordless communication networks
1 source node
2 neighbor nodes
3 destination nodes
4 wireless routing data handling systems
41 first communication modules
42 first processing modules
5 wireless routing data forwarding systems
51 second communication modules
52 second processing modules
6 wireless sensers
S1~S6 step
S1 '~S6 ' step
Detailed description of the invention
Below by way of specific instantiation, embodiments of the present invention being described, those skilled in the art can be by this specification Disclosed content understands other advantages and effect of the present invention easily.The present invention can also be by the most different concrete realities The mode of executing is carried out or applies, the every details in this specification can also based on different viewpoints and application, without departing from Various modification or change is carried out under the spirit of the present invention.It should be noted that, in the case of not conflicting, following example and enforcement Feature in example can be mutually combined.
It should be noted that the diagram provided in following example illustrates the basic structure of the present invention the most in a schematic way Think, the most graphic in component count, shape and size time only display with relevant assembly in the present invention rather than is implemented according to reality Drawing, during its actual enforcement, the kenel of each assembly, quantity and ratio can be a kind of random change, and its assembly layout kenel is also It is likely more complexity.
Embodiment one
The present embodiment provides a kind of wireless routing data processing method, and described wireless routing data forwarding method includes following Step:
Reception comes from source node broadcast data request transmission information;Described request of data transmission information include source node with Target range between the destination node that data send;
Waiting receive after described broadcast data sends request, calculate the distance between neighbor node and destination node with described Target range compares, if less than described target range, this neighbor node being defined as candidate's forward node;
Calculate the timing value for representing neighbor node forwarding priority;
The information that sent by data dump sends to source node.
Below with reference to diagram, the wireless routing data processing method described in the present embodiment is described in detail.This enforcement Wireless routing data processing method described in example is applied in cordless communication network as shown in Figure 1, this cordless communication network 10 Including source node 1, multiple neighbor nodes 2, and destination node 3.Each node can use wireless senser in the present embodiment.
Assume that a wireless sensor network interior joint integrates as V, V=(v1,v2,v3...), the time of a certain intermediate forwarding nodes S Forward node is selected to integrate as Ns, wherein there is n node, Ns=(vi+1,…,vi+n), wherein, 1 < i < n, n >=3, s >=3,To NsMiddle arbitrary node vi,vj(j ≠ i), if there being TBackoff(vi) < TBackoff(vj), then at candidate's forward node collection In, viPriority ratio vjHeight, node viIt it is the down hop forward node of node S.TBackoffFor being used for representing that neighbor node forwards The timing value of priority.
Refer to Fig. 2, be shown as wireless routing data processing method theory structure schematic diagram in an embodiment.Such as figure Shown in 2, described wireless routing data processing method specifically includes following step:
S1, receives and comes from source node broadcast data request transmission information, i.e. broadcast RTS (Request To Send).Its In, described request of data transmission information includes the geographical location information of source node and destination node.According to source node and purpose The geographical location information of node, obtains the target range between the destination node of source node and data transmission.
S2, waiting receives after described broadcast data sends request, calculates the distance between neighbor node and destination node.This In embodiment, calculate between self and destination node according to the geographical location information of self and the geographical location information of destination node Distance
S3, receives calculating described broadcast data and sends the distance between neighbor node and the destination node asked and institute State target range, i.e. distance between source node and destination node compares to judge that described calculating receives described broadcast number According to the distance sent between neighbor node and the destination node asked whether less than target range, the most then perform next step, If it is not, then terminate process.
S4, if less than described target range, being defined as candidate's forward node by this neighbor node.
S5, calculates the timing value for representing neighbor node forwarding priority.In the present embodiment, described for representing adjacent Occupy the timing value T of node forwarding priorityBackoff。TBackoffExpression can be defined by below equation:
Wherein, dsrc,cndFor the attribute information of this neighbor node, the attribute information of described neighbor node includes and source node Distance, node energy etc., Csrc,cndBeing a constant, SIFS is the interFrameGap of transmission data.
S6, sends information by data dump, i.e. CTS information sends to source node.
Wireless routing data processing method described in the present embodiment utilizes the method that timing mechanism carries out forwarder selection, The method quantifies the measurement factor in forwarder selection further, is conducive to improving the efficiency of selection of forward node.
Embodiment two
The present embodiment provides a kind of wireless routing data handling system, and described wireless routing data handling system includes:
First communication module, comes from source node broadcast data request transmission information for reception;Described request of data sends Information includes the target range between the destination node that source node and data send;
First processing module, receives after described broadcast data sends request for waiting, calculates neighbor node and purpose and save Distance between point compares with described target range, if less than described target range, this neighbor node being defined as candidate Forward node, and calculate the timing value for representing neighbor node forwarding priority;The information that sent by data dump is by described First communication module sends to source node.
Below with reference to diagram, the wireless routing data handling system 4 described in the present embodiment is described in detail.Please join Read Fig. 2, be shown as wireless routing data handling system theory structure schematic diagram in an embodiment.As it is shown on figure 3, described nothing Circuit is included by data handling system 4:
First communication module 41 comes from source node broadcast data request transmission information for reception, i.e. broadcasts RTS (Request To Send).Its kind, described request of data transmission information includes the geographical position letter of source node and destination node Breath.According to the geographical location information of source node Yu destination node, obtain the target between the destination node of source node and data transmission Distance.
The first processing module 42 being connected with described first communication module 41 is used for performing following function:
Waiting receive after described broadcast data sends request, calculate the distance between neighbor node and destination node.This reality Execute in example, calculate between self and destination node according to the geographical location information of self and the geographical location information of destination node Distance
Calculating is received described broadcast data and sends the distance between neighbor node and the destination node asked with described Target range, i.e. distance between source node and destination node compare to judge that described calculating receives described broadcast data Send whether the distance between neighbor node and the destination node of request is less than target range, if less than described target range, will This neighbor node is defined as candidate's forward node, if it is not, described wireless routing data handling system 4 the most out of service.
After being defined as candidate's forward node, calculate the timing value for representing neighbor node forwarding priority.In this reality Execute in example, the described timing value T for representing neighbor node forwarding priorityBackoff。TBackoffExpression can be fixed by below equation Justice.
Wherein, dsrc,cndFor the attribute information of this neighbor node, the attribute information of described neighbor node includes and source node Distance, node energy etc., Csrc,cndBeing a constant, SIFS is the interFrameGap of transmission data.
Make described first communication module that data dump is sent information, i.e. CTS information sends to source node.
Embodiment three
The present embodiment provides a kind of wireless routing data forwarding method, and described wireless routing data forwarding method includes following Several steps:
Receive and come from the data dump transmission information that neighbor node sends;
Select first to send data dump and send the neighbor node of information as down hop forward node to forward data.
Below with reference to diagram, the wireless routing data forwarding method described in the present embodiment is described in detail.Refer to Fig. 4, is shown as wireless routing data forwarding method schematic flow sheet in an embodiment.As shown in Figure 4, described wireless routing number Following step is specifically included according to retransmission method:
S1 ', broadcast data request transmission information, i.e. broadcast RTS information.The request that simultaneously produces sends timing, i.e. TRTS
S2 ', receives and comes from data dump transmission information (CTS information) that neighbor node sends, and judges whether to save in source The request of point receives data dump and sends information in sending timing.If it is not, then return step S1 ', re-broadcast request of data Transmission information.
S3 ', if the request at source node sends timing (TRTSReceive this data dump in) and send information, stop receiving The data dump that other neighbor node forwards sends information.
S4 ', selects first to send described data dump and sends the neighbor node of information as down hop forward node.Institute Stating first neighbor node sending described data dump transmission information is the neighbor node with minimum timing value.
S5 ', by data (DATA controls bag) transmission to the neighbor node with minimum timing value;This neighbor node is receiving A confirmation is fed back to source node after data,.
S6 ', it may be judged whether timing (T is fed back in the confirmation at source nodeACKThe confirmation coming from described neighbor node is received in) Information, if so, represents that data successfully forward;If it is not, the most again transmit data, return step S5 '.
Embodiment four
The present embodiment provides a kind of wireless routing data forwarding system 5, refers to Fig. 5, is shown as wireless routing data and turns Send out system theory structure schematic diagram in an embodiment.As it is shown in figure 5, described wireless routing data forwarding system 5 includes
Second communication module 51 asks transmission information, i.e. broadcast RTS information for broadcast data.The request that simultaneously produces is sent out Send timing, i.e. TRTS
Described second communication module 51 is additionally operable to receive and comes from data dump transmission information (the CTS letter that neighbor node sends Breath).
The second processing module 52 being connected with described second communication module 51 is for judging whether that the request at source node is sent out Receive this data dump in sending timing and send information.If not existing, then making described second communication module 51 re-broadcast data please Seek transmission information.If the request at source node sends timing (TRTSIn), described second processing module 52 specifically performs following merit Can:
Make described second communication module 51 receive this data dump and send information, stop receiving other neighbor node and forward Data dump send information, and be the information of candidate's forward node defined in data dump transmission information, establishment candidate Forward node collection.
Select first to send described data dump and send the neighbor node of information as down hop forward node.Described One neighbor node sending described data dump transmission information is the neighbor node with minimum timing value.Described second is made to lead to Data (DATA controls bag) are transmitted to the neighbor node with minimum timing value by letter module 51;This neighbor node is receiving number According to rear feedback one confirmation to source node,.
After having sent DATA control bag, it may be judged whether timing (T is fed back in the confirmation at source nodeACKReceive in) and come from The confirmation of described neighbor node, if so, represents that data successfully forward;If it is not, then make described second communication module 52 again Transmission data (DATA controls bag).
Embodiment five
The present embodiment provides a kind of wireless senser 6, refers to Fig. 6 A, 6B, and 6C, shows the one of wireless senser respectively Plant theory structure schematic diagram, another kind of theory structure schematic diagram, another theory structure schematic diagram.As shown in Figure 6A, described nothing Line sensor 6 includes the wireless routing data handling system 4 in above-described embodiment two.As shown in Figure 6B, described wireless senser 6 Including the wireless routing data forwarding system 5 in above-described embodiment.As shown in Figure 6 C, described wireless senser 6 includes without circuit By data handling system 4 and the wireless routing data forwarding system 5 that is connected with described wireless routing data handling system 4.
In sum, wireless routing data process/retransmission method of the present invention, system and wireless senser utilize and determine Time the mechanism method that carries out forwarder selection, the method quantifies the measurement factor in forwarder selection further, is conducive to Improve the efficiency of selection of forward node, more adapt to wireless sensor network environment in reality application.So, effective gram of the present invention Take various shortcoming of the prior art and have high industrial utilization.
The principle of above-described embodiment only illustrative present invention and effect thereof, not for limiting the present invention.Any ripe Above-described embodiment all can be modified under the spirit and the scope of the present invention or change by the personage knowing this technology.Cause This, have usually intellectual such as complete with institute under technological thought without departing from disclosed spirit in art All equivalences become are modified or change, and must be contained by the claim of the present invention.

Claims (12)

1. a wireless routing data processing method, it is characterised in that described wireless routing data forwarding method includes following step Rapid:
Reception comes from source node broadcast data request transmission information;Described request of data transmission information includes source node and data Target range between the destination node sent;
Waiting receive after described broadcast data sends request, calculate the distance between neighbor node and destination node and described target Distance compares, if less than described target range, this neighbor node being defined as candidate's forward node;
Calculate the timing value for representing neighbor node forwarding priority;
The information that sent by data dump sends to source node.
Wireless routing data processing method the most according to claim 1, it is characterised in that: described request of data sends information Including the geographical location information of source node Yu destination node, according to the geographical location information of source node Yu destination node, obtain source Target range between the destination node that node and data send.
Wireless routing data processing method the most according to claim 1, it is characterised in that: described wireless routing data process Method also include waiting receive described request of data transmission information after, according to the geographical location information of neighbor node self and described The geographical location information of destination node, calculates the distance between this neighbor node and destination node.
Wireless routing data processing method the most according to claim 1, it is characterised in that: believe according to the attribute of neighbor node InterFrameGap in breath and transmission data calculates the timing value for representing neighbor node forwarding priority;Described for representing adjacent The timing value occupying node forwarding priority is the least, illustrates that this neighbor node more has the priority forwarding data.
Wireless routing data processing method the most according to claim 1, it is characterised in that: neighbor node be used for represent After the timing of priority terminates, send described data dump and send information to source node.
6. a wireless routing data forwarding method, it is characterised in that described wireless routing data forwarding method includes following several Individual step:
Receive and come from the data dump transmission information that neighbor node sends;
Select first to send described data dump and send the neighbor node of information as down hop forward node to forward data.
Wireless routing data forwarding method the most according to claim 6, it is characterised in that: send described selecting first Data dump send information neighbor node as down hop forward node with forward data step after, described wireless routing Data forwarding method also includes:
Judge whether that receiving this data dump in the request of source node sends timing sends information, the most then stop receiving The data dump that other neighbor node forwards sends information, and sends data to first transmission data dump transmission information Neighbor node;This neighbor node feeds back a confirmation after receiving the data to source node;First sends data dump and sends out The neighbor node of breath of delivering letters is the neighbor node with minimum timing value;
Judge whether in the confirmation feedback timing of source node, receive the confirmation coming from described neighbor node, if so, table Registration is according to successfully forwarding;If it is not, the most again transmit data.
8. a wireless routing data handling system, it is characterised in that described wireless routing data handling system includes:
First communication module, comes from source node broadcast data request transmission information for reception;Described request of data sends information Include the target range between the destination node that source node and data send;
First processing module, receives after described broadcast data sends request for waiting, calculate neighbor node and destination node it Between distance compare with described target range, if less than described target range, this neighbor node is defined as candidate and forwards Node, and calculate the timing value for representing neighbor node forwarding priority;The information that sent by data dump is by described first Communication module sends to source node.
Wireless routing processing system the most according to claim 8, it is characterised in that: described first processing module is additionally operable to root Attribute information and the interFrameGap transmitted in data according to neighbor node calculate for representing determining of neighbor node forwarding priority Duration;The described timing value for representing neighbor node forwarding priority is the least, illustrates that this neighbor node more has and forwards data Priority.
10. a wireless routing data forwarding system, it is characterised in that described wireless routing data forwarding system includes:
Second communication module, comes from, for receiving, the data dump transmission information that neighbor node sends;
Second processing module, for selecting first neighbor node sending described data dump transmission information to redirect as next Send out node to forward data.
11. wireless routing processing systems according to claim 10, it is characterised in that: send described number selecting first After neighbor node according to clear to send information,
Described second processing module is additionally operable to: judge whether that receiving this data dump in the request of source node sends timing sends out Deliver letters breath, the most then data dump that other neighbor node forwards sends information to make described second communication module stop receiving, and Send data to first neighbor node sending described data dump transmission information;First sends data dump and sends letter The neighbor node of breath is the neighbor node with minimum timing value;This neighbor node feeds back a confirmation after receiving the data To source node;Judge whether in the confirmation feedback timing of source node, receive the confirmation coming from described neighbor node, if It is to represent that data successfully forward;If it is not, then make described second communication module again transmit data.
12. 1 kinds of wireless sensers, it is characterised in that include the wireless routing data as according to any one of claim 8-9 Processing system and/or the wireless routing data forwarding system as according to any one of claim 10-11.
CN201610207991.XA 2016-04-05 2016-04-05 Wireless routing data processing method, forwarding method, wireless routing data processing system, forwarding system and wireless sensor Pending CN105933946A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610207991.XA CN105933946A (en) 2016-04-05 2016-04-05 Wireless routing data processing method, forwarding method, wireless routing data processing system, forwarding system and wireless sensor

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610207991.XA CN105933946A (en) 2016-04-05 2016-04-05 Wireless routing data processing method, forwarding method, wireless routing data processing system, forwarding system and wireless sensor

Publications (1)

Publication Number Publication Date
CN105933946A true CN105933946A (en) 2016-09-07

Family

ID=56840561

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610207991.XA Pending CN105933946A (en) 2016-04-05 2016-04-05 Wireless routing data processing method, forwarding method, wireless routing data processing system, forwarding system and wireless sensor

Country Status (1)

Country Link
CN (1) CN105933946A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106658662A (en) * 2016-12-30 2017-05-10 国网能源研究院 Wireless power supply communication method and system
CN107733730A (en) * 2017-12-01 2018-02-23 湖南智领通信科技有限公司 Network topology self-healing method based on dynamic priority

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101304384A (en) * 2008-06-06 2008-11-12 南京邮电大学 Safety routing method for amalgamation network of honeycomb network and self-organization network with enhanced security
CN101771941A (en) * 2008-12-31 2010-07-07 财团法人工业技术研究院 Multicast communication method, relay node and wireless network system using same
CN101827421A (en) * 2010-03-09 2010-09-08 北京交通大学 DSR cooperative routing method based on channel state information and router
CN101945432A (en) * 2010-09-16 2011-01-12 北京邮电大学 Multi-rate opportunistic routing method for wireless mesh network
CN102271377A (en) * 2011-09-13 2011-12-07 河海大学常州校区 Double-bounce multi-path route method of wireless sensor network based on energy collection technology
CN103491596A (en) * 2013-09-29 2014-01-01 天公(山东)信息科技有限公司 Micro-power wireless communication method
CN103607743A (en) * 2013-12-03 2014-02-26 无锡儒安科技有限公司 Opportunistic routing method, sending end wireless sensor network node and receiving end wireless sensor network node
CN104038965A (en) * 2014-06-10 2014-09-10 南京邮电大学 Opportunistic routing method capable of efficiently utilizing energy, for mobile wireless sensor network

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101304384A (en) * 2008-06-06 2008-11-12 南京邮电大学 Safety routing method for amalgamation network of honeycomb network and self-organization network with enhanced security
CN101771941A (en) * 2008-12-31 2010-07-07 财团法人工业技术研究院 Multicast communication method, relay node and wireless network system using same
CN101827421A (en) * 2010-03-09 2010-09-08 北京交通大学 DSR cooperative routing method based on channel state information and router
CN101945432A (en) * 2010-09-16 2011-01-12 北京邮电大学 Multi-rate opportunistic routing method for wireless mesh network
CN102271377A (en) * 2011-09-13 2011-12-07 河海大学常州校区 Double-bounce multi-path route method of wireless sensor network based on energy collection technology
CN103491596A (en) * 2013-09-29 2014-01-01 天公(山东)信息科技有限公司 Micro-power wireless communication method
CN103607743A (en) * 2013-12-03 2014-02-26 无锡儒安科技有限公司 Opportunistic routing method, sending end wireless sensor network node and receiving end wireless sensor network node
CN104038965A (en) * 2014-06-10 2014-09-10 南京邮电大学 Opportunistic routing method capable of efficiently utilizing energy, for mobile wireless sensor network

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
PETROS SPACHOS, LIANG SONG AND DIMITRIOS HATZINAKOS: "Comparison of traditional and opportunistic multihop routing in wireless networking scalability", 《2012 26TH BIENNIAL SYMPOSIUM ON COMMUNICATIONS (QBSC)》 *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106658662A (en) * 2016-12-30 2017-05-10 国网能源研究院 Wireless power supply communication method and system
CN107733730A (en) * 2017-12-01 2018-02-23 湖南智领通信科技有限公司 Network topology self-healing method based on dynamic priority
CN107733730B (en) * 2017-12-01 2021-06-15 湖南智领通信科技有限公司 Network topology self-healing method based on dynamic priority

Similar Documents

Publication Publication Date Title
US8559293B2 (en) Wireless communication apparatus, wireless communication network and method of controlling routing selection
CN105874838A (en) System and method for coordinated beamforming for overlapping basic service set in wlan
CN107646180A (en) Traffic declaration in network
CN113316091B (en) Information sending method and device applied to unmanned aerial vehicle cluster
JP2021508981A (en) Communication methods, devices, and systems
CN110505600A (en) Method for routing and device
KR101214532B1 (en) Multi-casting data transmitting system and method using situation information in wireless ad-hoc network
TWI473522B (en) Method and system for hierarchical clustering of wireless sensor networks
US10004037B2 (en) Coding-aware scheme to minimize energy consumption and time cost
CN105933946A (en) Wireless routing data processing method, forwarding method, wireless routing data processing system, forwarding system and wireless sensor
TWI650037B (en) Centralized wireless access network control method
CN106656795A (en) Wireless sensor and actor networks clustering routing method
CN107018545A (en) A kind of ad hoc network method being applied in wireless communication system
CN105072658B (en) A kind of network data acquisition control system and wireless route method
CN102883277A (en) Cooperative communication method based on reliable multicast MAC (Media Access Control) layer protocol
US20150349928A1 (en) Multi-cast Optimized Medium Access Method for Wireless Network
CN105072586A (en) Management method for forwarding of broadcast message in embedded wireless ad hoc network
CN107483560A (en) It is a kind of towards the multimode group-net communication of shared electricity consumption and system of selection
CN105898817A (en) Wireless routing data routing measure/forwarding methods and systems, and wireless sensor
CN106102119A (en) Link terminal system of selection and device and relay and control method and device
CN108832995A (en) Unmanned plane based on Dynamic Programming cooperates with method for message transmission
CN104780585B (en) A kind of opportunistic network data retransmission method based on positional information
CN106550464A (en) A kind of transmission method of ascending control information, device and system
CN114553302A (en) Real-time cooperative communication method for unmanned aerial vehicle swarm
CN107889081A (en) D2D Ad Hocs are by method and system

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication

Application publication date: 20160907

RJ01 Rejection of invention patent application after publication