CN105356979A - Wireless sensing network code distribution method based on double-path parallel transmission - Google Patents
Wireless sensing network code distribution method based on double-path parallel transmission Download PDFInfo
- Publication number
- CN105356979A CN105356979A CN201510922909.7A CN201510922909A CN105356979A CN 105356979 A CN105356979 A CN 105356979A CN 201510922909 A CN201510922909 A CN 201510922909A CN 105356979 A CN105356979 A CN 105356979A
- Authority
- CN
- China
- Prior art keywords
- path
- node
- message
- mirror image
- transmission
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 230000005540 biological transmission Effects 0.000 title claims abstract description 74
- 238000000034 method Methods 0.000 title claims abstract description 22
- 230000000694 effects Effects 0.000 claims abstract description 28
- 230000009191 jumping Effects 0.000 claims description 15
- 230000009977 dual effect Effects 0.000 claims description 10
- 230000000977 initiatory effect Effects 0.000 claims description 7
- 238000004891 communication Methods 0.000 claims description 3
- 238000001514 detection method Methods 0.000 claims description 3
- 230000008878 coupling Effects 0.000 abstract description 4
- 238000010168 coupling process Methods 0.000 abstract description 4
- 238000005859 coupling reaction Methods 0.000 abstract description 4
- 230000002035 prolonged effect Effects 0.000 abstract 1
- 230000008569 process Effects 0.000 description 3
- 238000011084 recovery Methods 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000003993 interaction Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 239000006185 dispersion Substances 0.000 description 1
- 238000005265 energy consumption Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000005192 partition Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/24—Multipath
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/08—Arrangements for detecting or preventing errors in the information received by repeating transmission, e.g. Verdan system
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/20—Hop count for routing purposes, e.g. TTL
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/28—Routing or path finding of packets in data switching networks using route fault recovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/32—Flow control; Congestion control by discarding or delaying data units, e.g. packets or frames
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a wireless sensing network code distribution method based on double-path parallel transmission. The method provides a data transmission strategy aiming at code updating of specific codes in a wireless sensing network, two paths can perform parallel transmission, code updating time is shortened, the average message amount borne by the nodes is reduced, and the service life of the network is prolonged. In order to reduce the packet loss problem, caused by the fact that a terminal is hidden in the parallel transmission process, of the two paths, the method further provides a new path establishment strategy to reduce the coupling degree between the two paths. And a lost-package retransmission strategy of the method also has good effects on the aspects of the rapid fracture path repair and transmission lost-package rate reduction, and reliability of code distribution is guaranteed.
Description
Technical field
The present invention relates to radio sensing network reprogrammed technical field, refer more particularly to a kind of radio sensing network code distribution method based on dual path parallel transmission.
Background technology
In order to conform or the change of demand, after the application deployment of wireless network sensing network node, node inevitably needs the renewal carrying out code.In the renewal of existing application, be generally all manual recovery node, then come by flashburn tools.But when real network bad environments, network size are large, node dispersion time, adopt the mode of artificial wired burning will become very loaded down with trivial details with difficulty.Under this background, radio sensing network reprogrammed technology is arisen at the historic moment, and uses generation to send out distribution protocol and wirelessly carries out effective solution route that code update is the problems referred to above.
Current classical code distribution mode both domestic and external has Deluge, MNP etc., and they are devoted to carry out code update to nodes all in network.But in radio sensing network, different node can play the part of different roles usually, use classical code distribution mode to carry out code update to the node of specific role and will cause a large amount of energy ezpenditure.So having occurred the research specific node being carried out to code update in recent years, is wherein representative with MDeluge.
MDeluge establishes a transmission paths between source node and destination node, only has node on path to participate in the forwarding of packet, saves other energy without artis.But just because of the unicity that path is chosen, the transmission of packet between source node and destination node is also firmly tied up dead on current path, cannot carry out multiplexing to space, cause larger time delay; On the other hand, the node energy consumption on path is than other nodes especially large, and cause the uneven consumption of network node energy, serious meeting causes network partition, highly shortened network life.
Summary of the invention
In order to solve the problems referred to above that prior art exists, the invention provides a kind of radio sensing network code distribution method based on dual path parallel transmission.The method sets up two transmission paths between a source node and a destination node, and two paths can parallel transmission, reduces the average message amount of node assumes.Source node simultaneously in this method by the jumping figure difference Dynamic Selection transmission opportunity according to two paths, the collision problem produced when destination node can be avoided to receive the packet of two paths at the same time.
To achieve these goals, technical scheme of the present invention is as follows:
Based on a radio sensing network code distribution method for dual path parallel transmission, comprising three phases strategy, is path establishment stage strategy respectively, data transfer phase strategy, and packet loss retransmission phase strategy.
Path establishment stage strategy comprises following steps: source node inquiry own path table judges whether the routing information arriving destination node, if having, and performing data transmission stage policy, otherwise broadcast RREQ message initiates path finding, after destination node receives this RREQ message, RREP message will be replied along reverse path hop-by-hop, to set up the Article 1 forward path arriving destination node from source node, intermediate node outside path is safeguarded one " first path effects degree " (belonging to the number of node on Article 1 path in the neighbor node within the scope of this node communication), when replying RREP message to form Article 1 path along reverse path, intermediate node often listens to the RREP message in an Article 1 path, and the value just upgrading " first path effects degree " is increased by 1, Article 1, after path is formed, source node is again broadcasted RREQ message and is initiated Article 2 path finding, with set up Article 1 path unlike, we add " first path effects degree " on this section of reverse path that a field C represents from destination node to present node and exceed the node number of setting threshold in RREP message, when RREP message is delivered to source node along reverse path, exceed the node number (i.e. field C size) of threshold value collideValue by obtaining " first path effects degree " on this paths and make field C become the node address of non-zero first, such source node just can learn that this paths opposite direction (in the other direction namely from destination node to source node direction), " first path effects degree " exceedes upper hop node (being referred to as " non-collision the node ") address of first node of threshold value, so that source node is to this " non-collision node " initiation " secondary route ", when in the RREP message that source node receives, the value of field C is greater than setting threshold collideNum, source node will broadcast " special RREQ " message, to this " non-collision node " initiation " secondary route ", the intermediate node receiving " special RREQ " message will determine to forward the time of delay of " special RREQ " message according to the size of self " first path effects degree ", " first path effects degree " is larger, and time delay will be longer, " non-collision node " replys special RREP message by along new reverse path after receiving " special RREQ " message, to complete the foundation of Article 2 transmission path.
Data transfer phase strategy comprises following steps: the mirror image page request message that source node sends according to destination node, by ready for the mirror image page of correspondence, carry out and sends preparation, definition mirror image block is definite value in the transmission time that each is jumped, the difference of source node to long path and short path jumping figure calculates, if the difference of this jumping figure is larger, then source node is at two paths each transmission mirror image block simultaneously, and setting transmission is spaced apart the transmission time of mirror image block in longer path, continue send until in this mirror image page all mirror image Bulk transport complete, if this jumping figure difference is little, then source node first sends a mirror image block on comparatively short path, set this mirror image block after comparatively short path has walked 1/3 distance, next mirror image block is sent from longer path, the transmission interval of two paths is all set to the transmission time of mirror image block in longer path, the initial transmitting time in longer path compares short path and will postpone a mirror image block and carrying out transmitting about 1/3 of the time used compared with short path.
Packet loss retransmission phase strategy comprises following steps: after destination node sends mirror image page request message to source node, with regard to opening timing task, the mirror image page of timing requested following expiration does not also receive completely, just sent the repeat requests of current mirror image page to source node by the last reverse path receiving mirror image block, and opening timing task again, if transmission is still failed, then use another paths application to retransmit, if failure again, then switch back the application re-transmission of Article 1 path; If the number of retransmissions that source node receives is greater than set point, and when number of retransmissions and the current mirror image number of pages ratio having completed transmission are greater than set point, current parallel transmission is switched to the transmission of timesharing single path; When source node receives retransmission request message, the request bitmap of source node meeting retransmission detection request message, judge whether that node falls net, if there is node to fall net, source node can suspend the transmission of current mirror image page, and initiate " rebuilding RREQ " message immediately, after receiving " rebuilding RREQ " message, the behavior of node will be divided into following 3 kinds according to node type, node on intact path abandons this message, message that node on path to be reconstructed preferentially forwards " rebuilding RREQ ", general node can random forwarding " reconstruction RREQ " message.
The method has used for reference the way that network layer AOMDV Routing Protocol sets up routed path, sets up two transmission paths between a source node and a destination node.Make a paths as transmission main path with AOMDV Routing Protocol way unlike, AOMDV agreement, another paths is used as backup path, just enables backup path when transmitting main path and occurring fracture, and when backup path rupture, stopping is transmitted.And this method propose a kind of data transmission policies, make two paths can parallel transmission, about the average message amount of node assumes has dropped to the half of MDeluge agreement way, the collision problem simultaneously produced when destination node receives the packet of two paths at the same time, source node is by the jumping figure difference Dynamic Selection transmission opportunity according to two paths.
In addition, in order to reduce by two paths in parallel transmission process due to packet loss problem that concealed terminal causes, the method also been proposed a kind of new path Establishment strategy to reduce the degree of coupling between two paths, when forming Article 2 path, by the initiation time that delay path is found by the node that Article 1 path effects is larger, those are made to have more the possibility participating in path and set up by the node that Article 1 path effects is less.Finally, the method achieve " path recovery and Reconstruction of The Function " that AOMDV agreement does not possess, its packet loss re-transmission policy also takes full advantage of the advantage of two parallel transmission paths, the data request information that source node can pass over according to certain paths, judge whether an other paths has node to fall net, to carry out path recovery in time; Also can judge whether present parallel transmission exists larger packet loss, will change dual path time sharing transmissions into if desired simultaneously.
Compared with prior art, the beneficial effect of technical solution of the present invention is:
This method adopts the strategy of dual path parallel transmission, shortens the time that specific node carries out code update, greatly reduces node average message amount, extend network life.This method, by introducing " secondary route ", is set up two minimum transmission paths that influence each other, is greatly alleviated the packet loss problem that concealed terminal causes.In addition, for ensureing the packet loss re-transmission policy that parallel transmission reliability proposes, ensure that the mirror image that destination node receives is complete available on the one hand, net node can be detected rapidly on the other hand, and path breaking part is repaired.
Accompanying drawing explanation
Fig. 1 is the message interaction process figure of path establishment stage source node and destination node.
Fig. 2 is the Logic judgment flow chart that source node receives RREP message.
When Fig. 3 is " secondary route ", each node receives the behavior flow chart of " special RREQ " message.
Fig. 4 is the flow chart that destination node is initiated to retransmit.
Fig. 5 is the flow chart judged retransmission type after source node receives mirror image page request message.
Embodiment
Accompanying drawing, only for exemplary illustration, can not be interpreted as the restriction to this patent; In order to better the present embodiment is described, some parts of accompanying drawing have omission, zoom in or out, and do not represent the size of actual product;
To those skilled in the art, in accompanying drawing, some known features and explanation thereof may be omitted is understandable.Below in conjunction with drawings and Examples, technical scheme of the present invention is described further.
Technical scheme of the present invention is: adopting a kind of radio sensing network code distribution method based on dual path parallel transmission, comprise three phases strategy, is path establishment stage strategy respectively, data transfer phase strategy, and packet loss retransmission phase strategy.Elaboration will be made respectively below to it.
1. path establishment stage strategy
Fig. 1 is the message interaction process figure of path establishment stage source node and destination node, finally sets up the transmission path of two weak couplings.Concrete steps are as follows.
1) when source node will carry out the renewal of code to specific destination node, source node inquiry own path table judges whether the routing information arriving destination node, if having, and performing data transmission stage policy, otherwise broadcast RREQ message initiates path finding.
2), after the neighbor node of source node receives this RREQ message, will fill " first jumps address " field in RREQ message with node Self address, node can be considered as common intermediate node by process afterwards, decision logic and 3) described consistent.
3) after common intermediate node receives RREQ message, search the routing information that own path table judges whether to arrive destination node, if have this routing information and the sequence number of this routing information is more than or equal to the sequence number of RREQ message, then reply a RREP message along reverse path, and no longer forward this RREQ message; Otherwise generate a reverse path information record sheet, record current reverse path, and broadcast forwards the RREQ message received for the first time, no longer forwarding is broadcasted for the RREQ message again received, if when the RREQ message again received represents that it has the jumping figure less than the reverse path recorded, then upgrading reverse path information record sheet is current reverse path.
4) after destination node receives this RREQ message, the respective paths of the arrival source node whether having this field corresponding in own path table will be checked according to " first jumps address " field in RREQ message, if, do not store this path, and reply RREP message along reverse path hop-by-hop, to set up the Article 1 forward path arriving destination node from source node.It should be noted that in RREP message and have also been introduced " first jumps address " field, when receiving RREQ message, this field in RREP message will be filled with " first jumps address " in RREQ message.
5) intermediate node outside path is safeguarded one " first path effects degree " (belonging to the number of node on Article 1 path in the neighbor node within the scope of this node communication), and these intermediate nodes need introducing one " address is jumped in first path first " to indicate that this " first path effects degree " corresponds to Article 1 path simultaneously in addition.When replying RREP message to form Article 1 path along reverse path, when intermediate node listens to RREP message first, to " address is jumped in first path first " assignment, and the value upgrading " first path effects degree " is increased by 1.Often listen to a RREP message afterwards, just judge in RREP message, whether " first jumps address " be identical with " address is jumped in first path first ", if identical, the value upgrading " first path effects degree " is increased by 1.
6) after Article 1 path is formed, source node is again broadcasted RREQ message and is initiated Article 2 path finding, with set up Article 1 path unlike, we add " first path effects degree " on this section of reverse path that a field C represents from destination node to present node and exceed the node number of setting threshold collideValue in RREP message, when destination node replys RREP message along reverse path, node on path will judge in RREP message, whether this field C is 0, and judge whether " the first path effects degree " of this node is less than or equal to setting threshold collideValue, if meet these two judgements simultaneously, the jumping figure of this node address and this node distance sources node is just write RREP message corresponding field by present node, otherwise the value upgrading field C in RREP message is increased by 1, like this when RREP Message Transmission is to source node, source node just can learn that this paths opposite direction (in the other direction namely from destination node to source node direction), " first path effects degree " exceedes upper hop node (being referred to as " non-collision the node ") address of first node of threshold value, so that source node is to this " non-collision node " initiation " secondary route ".
7) Fig. 2 is the Logic judgment flow chart that source node receives RREP message.When in the RREP message that source node receives, the value of field C is greater than setting threshold collideNum, source node will broadcast " special RREQ " message, to this " non-collision node " initiation " secondary route ", after message that source node sends " special RREQ ", the node division in network is following Four types: node i) on Article 1 path and the node between Article 2 path " non-collision node " to destination node; Ii) " non-collision node "; Iii) the node on Article 2 path between source node to " non-collision node ", but do not comprise " non-collision node "; Iv) the node not on two paths, namely except front i) class ii) class and iii) all residue nodes except category node.Each node makes different responses by according to own node type after receiving " special RREQ " message.When Fig. 3 is " secondary route ", each node receives the behavior flow chart of " special RREQ " message.I) category node receives " special RREQ " message and directly abandons, to retain original route information; Ii) category node not only can be set up after receiving " special RREQ " message and upgrade routing information, also can respond " special RREP " message along reverse path; Iii) after category node receives " special RREQ " message, need to delete their original routing informations, again participate in when " secondary route " generating new route, and random forwarding " special RREQ " message, forward delay time is directly proportional to " first path effects degree "; Iv), after category node receives " special RREQ " message, random forwarding " special RREQ " message, forward delay time is directly proportional to " first path effects degree ".Iii) the way of class and iv) category node more likely participates in setting up new Article 2 path by the node that Article 1 path effects is less by making.
8) after " non-collision node " receives " special RREQ " message, special RREP message is replied by along new reverse path, to complete the foundation of Article 2 transmission path.
9) source node receives " special RREP " message, completes the foundation of weak coupling dual path.
2. data transfer phase strategy
First defining mirror image block is definite value in the transmission time that each is jumped.
Data transfer phase strategy concrete steps are as follows.
1) all mirror image blocks in a mirror image page are divided into even mirror image block and strange mirror image block by its mirror image block sequence number.Source node will according to mirror image block sequence number alternately from two paths transmission mirror image blocks, and every paths is responsible for the transmission of wherein a kind of mirror image block respectively.Setting mirror image block is that mirror image block is in the transmission time in longer path in the transmission time compared with short path.It is the transmission time T of mirror image block in longer path that setting sends interval T
l.In the parallel dual path of setting, longer path jumping figure is a, and comparatively short path jumping figure is b.
2) destination node sends mirror image page request message to source node, and source node receives ready for corresponding mirror image page after this message.
3) source node calculates the jumping figure difference a-b of long path and short path, if jumping figure difference is larger, as a>b+2, then source node sends a mirror image block in t=nT (n the gets positive integer) moment from two paths are simultaneously each, continue to send until in this mirror image page all mirror image Bulk transport complete; If jumping figure difference is little, as a≤b+2, then source node sends an even mirror image block, when this even mirror image block is when comparatively short path has walked 1/3 distance, namely at t=nT+1/3T in t=nT (n the gets positive integer) moment from comparatively short path
sin (n the gets positive integer) moment, source node sends a strange mirror image block from longer path.It is still T that two paths send the cycle, but the initial transmitting time in longer path always will compare short path delay 1/3T
sleft and right.
3. packet loss retransmission phase strategy
Different according to the reason causing retransmitting, re-transmission can be divided into following three kinds: generally retransmit, the re-transmission that parallel transmission random collision causes, and node falls the re-transmission that net causes.Packet loss retransmission phase strategy concrete steps are as follows.
1) Fig. 4 is the flow chart that destination node is initiated to retransmit.After destination node sends mirror image page request message to source node, with regard to opening timing task, the mirror image page of timing requested following expiration does not also receive completely, just sent the repeat requests of current mirror image page to source node by the last reverse path receiving mirror image block, and opening timing task again, if transmission is still failed, then use another paths application to retransmit, if failure again, then switch back the application re-transmission of Article 1 path.
2) Fig. 5 is the flow chart judged retransmission type after source node receives mirror image page request message.After source node receives mirror image page request message, judge to ask whether all positions of bitmap are 1 entirely, if then think to ask under normal circumstances a new mirror image page, all mirror image blocks of this mirror image page of source node parallel transmission.If all positions of bitmap are not be 1 entirely, then judge that this is a repeat requests: whether following basis has random collision feature judges the re-transmission whether this re-transmission causes as random collision, describes in detail and sees 3); Judge that whether this re-transmission is the re-transmission that node falls net and causes according to bitmap details, describe in detail and see 4); If below neither, then this re-transmission is general re-transmission, describes in detail and sees 5).
3) if the number of retransmissions that source node receives is greater than set point, and when number of retransmissions and the current mirror image number of pages ratio having completed transmission are greater than set point, then judge the re-transmission that current re-transmission causes as parallel transmission random collision, now current parallel transmission is switched to the transmission of timesharing single path by source node.
4) when source node receives retransmission request message, the request bitmap of source node meeting retransmission detection request message, if request bitmap is not for 0xFFFF and the situation of packet loss has appearred in four or more packet that certain paths sends recently, so then judge that this re-transmission falls as node the re-transmission that net causes, now source node can suspend the transmission of current mirror image page, and initiates " rebuilding RREQ " message immediately.After receiving " rebuilding RREQ " message, the behavior of node will be divided into following 3 kinds according to node type, node on intact path abandons this message, message that the node on path to be reconstructed preferentially forwards " rebuilding RREQ ", and general node can random forwarding " reconstruction RREQ " message.When after source node reconstruction path, just again data can be transmitted by parallel transmission.
5) if the mirror image page request message that source node receives is general repeat requests, so required mirror image block according to the mirror image page label of request and request bitmap, can be issued destination node along the path receiving this repeat requests by source node one by one.
Obviously, the above embodiment of the present invention is only for example of the present invention is clearly described, and is not the restriction to embodiments of the present invention.For those of ordinary skill in the field, can also make other changes in different forms on the basis of the above description.Here exhaustive without the need to also giving all execution modes.All any amendments done within the spirit and principles in the present invention, equivalent to replace and improvement etc., within the protection range that all should be included in the claims in the present invention.
Claims (1)
1. based on a radio sensing network code distribution method for dual path parallel transmission, it is characterized in that, comprise three phases strategy, is path establishment stage strategy respectively, data transfer phase strategy, and packet loss retransmission phase strategy;
The specific implementation of path establishment stage strategy is: source node inquiry own path table judges whether the routing information arriving destination node;
If have, performing data transmission stage policy;
Otherwise broadcast RREQ message initiates path finding, after destination node receives this RREQ message, RREP message will be replied along reverse path hop-by-hop, to set up the Article 1 forward path arriving destination node from source node, intermediate node outside path is safeguarded one " first path effects degree ", " first path effects degree " refers to the number belonging to node on Article 1 path in the neighbor node within the scope of this node communication, when replying RREP message to form Article 1 path along reverse path, intermediate node often listens to the RREP message in an Article 1 path, just upgrade " first path effects degree ", and its value is increased by 1, Article 1, after path is formed, source node is again broadcasted RREQ message and is initiated Article 2 path finding, with set up Article 1 path unlike, in RREP message, add " first path effects degree " on this section of reverse path that field C represents from destination node to present node exceed the node number of setting threshold, when RREP message is delivered to source node along reverse path, " first path effects degree " on this paths will be obtained and exceed the node number of threshold value collideValue, i.e. field C size and make field C become the node address of non-zero first, such source node just can learn that this paths opposite direction upper " first path effects degree " exceedes the upper hop node address of first node of threshold value, i.e. " non-collision node ", so that source node is to this " non-collision node " initiation " secondary route ", when in the RREP message that source node receives, the value of field C is greater than setting threshold collideNum, source node will broadcast " special RREQ " message, to this " non-collision node " initiation " secondary route ", the intermediate node receiving " special RREQ " message will determine to forward the time of delay of " special RREQ " message according to the size of self " first path effects degree ", " first path effects degree " is larger, and time delay will be longer, " non-collision node " replys special RREP message by along new reverse path after receiving " special RREQ " message, to complete the foundation of Article 2 transmission path,
The specific implementation of data transfer phase strategy is:
The mirror image page request message that source node sends according to destination node, by ready for the mirror image page of correspondence, carry out and sends preparation, definition mirror image block is definite value in the transmission time that each is jumped, the difference of source node to long path and short path jumping figure calculates, if the difference of this jumping figure is larger, then source node is at two paths each transmission mirror image block simultaneously, and setting transmission is spaced apart the transmission time of mirror image block in longer path, continue send until in this mirror image page all mirror image Bulk transport complete, if this jumping figure difference is little, then source node first sends a mirror image block on comparatively short path, set this mirror image block after comparatively short path has walked 1/3 distance, next mirror image block is sent from longer path, the transmission interval of two paths is all set to the transmission time of mirror image block in longer path, the initial transmitting time in longer path compares short path and will postpone a mirror image block and carrying out transmitting about 1/3 of the time used compared with short path,
The specific implementation of packet loss retransmission phase strategy is: after destination node sends mirror image page request message to source node, with regard to opening timing task, the mirror image page of timing requested following expiration does not also receive completely, just sent the repeat requests of current mirror image page to source node by the last reverse path receiving mirror image block, and opening timing task again, if transmission is still failed, then use another paths application to retransmit, if failure again, then switch back the application re-transmission of Article 1 path; If the number of retransmissions that source node receives is greater than set point, and when number of retransmissions and the current mirror image number of pages ratio having completed transmission are greater than set point, current parallel transmission is switched to the transmission of timesharing single path; When source node receives retransmission request message, the request bitmap of source node meeting retransmission detection request message, judge whether that node falls net, if there is node to fall net, source node can suspend the transmission of current mirror image page, and initiate " rebuilding RREQ " message immediately, after receiving " rebuilding RREQ " message, the behavior of node will be divided into following 3 kinds according to node type, node on intact path abandons this message, message that node on path to be reconstructed preferentially forwards " rebuilding RREQ ", general node can random forwarding " reconstruction RREQ " message.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510922909.7A CN105356979A (en) | 2015-12-11 | 2015-12-11 | Wireless sensing network code distribution method based on double-path parallel transmission |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510922909.7A CN105356979A (en) | 2015-12-11 | 2015-12-11 | Wireless sensing network code distribution method based on double-path parallel transmission |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105356979A true CN105356979A (en) | 2016-02-24 |
Family
ID=55332862
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510922909.7A Pending CN105356979A (en) | 2015-12-11 | 2015-12-11 | Wireless sensing network code distribution method based on double-path parallel transmission |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105356979A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106610898A (en) * | 2016-12-28 | 2017-05-03 | 南京大学 | JPF-based Java code SSA single path generation method |
| CN106649118A (en) * | 2016-12-28 | 2017-05-10 | 南京大学 | Generating method of SSA single path of Java code based on AST |
| CN107820225A (en) * | 2017-11-02 | 2018-03-20 | 中山大学 | A kind of radio sensing network node code distribution method of balancing energy |
| CN116150702A (en) * | 2023-02-10 | 2023-05-23 | 北京国信华源科技有限公司 | Data integration method and device for master-slave communication fusion |
| CN117241337A (en) * | 2023-11-14 | 2023-12-15 | 苏州元脑智能科技有限公司 | Routing method, device, equipment and storage medium of dual-path wireless mesh network |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100265874A1 (en) * | 2009-04-21 | 2010-10-21 | Qualcomm Incorporated | Pre-communication for relay base stations in wireless communication |
| CN102405681A (en) * | 2009-04-21 | 2012-04-04 | 高通股份有限公司 | Enabling support for transparent relays in wireless communication |
| CN103238360A (en) * | 2010-12-08 | 2013-08-07 | 诺基亚公司 | Device-to-device communication scenario |
| US20140023018A1 (en) * | 2010-06-22 | 2014-01-23 | Blackberry Limited | Information Selection in a Wireless Communication System |
-
2015
- 2015-12-11 CN CN201510922909.7A patent/CN105356979A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100265874A1 (en) * | 2009-04-21 | 2010-10-21 | Qualcomm Incorporated | Pre-communication for relay base stations in wireless communication |
| CN102405681A (en) * | 2009-04-21 | 2012-04-04 | 高通股份有限公司 | Enabling support for transparent relays in wireless communication |
| US20140023018A1 (en) * | 2010-06-22 | 2014-01-23 | Blackberry Limited | Information Selection in a Wireless Communication System |
| CN103238360A (en) * | 2010-12-08 | 2013-08-07 | 诺基亚公司 | Device-to-device communication scenario |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106610898A (en) * | 2016-12-28 | 2017-05-03 | 南京大学 | JPF-based Java code SSA single path generation method |
| CN106649118A (en) * | 2016-12-28 | 2017-05-10 | 南京大学 | Generating method of SSA single path of Java code based on AST |
| CN106610898B (en) * | 2016-12-28 | 2019-01-04 | 南京大学 | A kind of generation method of the Java code SSA single path based on JPF |
| CN106649118B (en) * | 2016-12-28 | 2019-02-19 | 南京大学 | A kind of generation method of the Java code SSA single path based on AST |
| CN107820225A (en) * | 2017-11-02 | 2018-03-20 | 中山大学 | A kind of radio sensing network node code distribution method of balancing energy |
| CN107820225B (en) * | 2017-11-02 | 2020-04-24 | 中山大学 | Energy-balanced wireless sensor network node code distribution method |
| CN116150702A (en) * | 2023-02-10 | 2023-05-23 | 北京国信华源科技有限公司 | Data integration method and device for master-slave communication fusion |
| CN116150702B (en) * | 2023-02-10 | 2023-11-10 | 北京国信华源科技有限公司 | Data integration method and device for master-slave communication fusion |
| CN117241337A (en) * | 2023-11-14 | 2023-12-15 | 苏州元脑智能科技有限公司 | Routing method, device, equipment and storage medium of dual-path wireless mesh network |
| CN117241337B (en) * | 2023-11-14 | 2024-02-23 | 苏州元脑智能科技有限公司 | Routing method, device, equipment and storage medium of dual-path wireless mesh network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105356979A (en) | Wireless sensing network code distribution method based on double-path parallel transmission | |
| CN103475524B (en) | Based on the layering network-building method of master-slave node communication network | |
| JP5550792B2 (en) | Method for finding a set of routes in a network | |
| CN100440853C (en) | Processing broadcast data in a mobile ac-hoc network | |
| CN102291448B (en) | Automatic IP (Internet protocol) address allocation method based on geographical position in mobile ad hoc network | |
| JP3947370B2 (en) | Wireless communication system | |
| CN106034322A (en) | Routing switching method based on chain quality in mobile ad hoc network | |
| CN106612231B (en) | Method for routing are repaired in more strategy mixing under a kind of mine based on WMN | |
| CN107087032B (en) | Realize the method and apparatus that cluster is set up | |
| CN103974365A (en) | Ad Hoc mobile network route restoring method | |
| CN106454997A (en) | Wireless sensor network topology improving method | |
| CN104469877A (en) | 433M wireless automatic networking method and system | |
| JP2005204016A (en) | Address-assigning method in sensor network | |
| CN113727415B (en) | Method for improving AODV routing protocol by dynamically perceived unmanned aerial vehicle ad hoc network | |
| CN107659497A (en) | Method for repairing route and device | |
| CN105337801B (en) | A kind of method for test examples design based on state machine suitable for switch protocol | |
| CN102333023B (en) | Communication method and equipment in multilink transparent internet | |
| CN108616380A (en) | The tree network restoration methods and controller of software defined network | |
| CN102083164A (en) | Method for opportunistic routing of wireless sensor network (WSN) based on energy perception | |
| CN106685822A (en) | Route determination method and device | |
| Ito et al. | A novel routing method for improving message delivery delay in hybrid DTN-MANET networks | |
| CN115884304A (en) | Route repairing method based on wireless Mesh network and related equipment | |
| CN101478836B (en) | Adaptive route constructing method for wireless Ad Hoc network | |
| KR20070083027A (en) | Method for multicast routing using mpr set information | |
| CN103702370B (en) | ZigBee mesh topology route method |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20160224 |