CN107786660B - Wireless sensor network code distribution method based on umbrella-shaped multipath - Google Patents

Wireless sensor network code distribution method based on umbrella-shaped multipath Download PDF

Info

Publication number
CN107786660B
CN107786660B CN201711034222.5A CN201711034222A CN107786660B CN 107786660 B CN107786660 B CN 107786660B CN 201711034222 A CN201711034222 A CN 201711034222A CN 107786660 B CN107786660 B CN 107786660B
Authority
CN
China
Prior art keywords
node
message
grey
nodes
path
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201711034222.5A
Other languages
Chinese (zh)
Other versions
CN107786660A (en
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.)
National Sun Yat Sen University
Original Assignee
National Sun Yat Sen University
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 National Sun Yat Sen University filed Critical National Sun Yat Sen University
Priority to CN201711034222.5A priority Critical patent/CN107786660B/en
Publication of CN107786660A publication Critical patent/CN107786660A/en
Application granted granted Critical
Publication of CN107786660B publication Critical patent/CN107786660B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/06—Protocols specially adapted for file transfer, e.g. file transfer protocol [FTP]
    • 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/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1867—Arrangements specially adapted for the transmitter end
    • H04L1/188—Time-out mechanisms
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1095—Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

The invention provides a wireless sensor network code distribution method based on umbrella-shaped multipath, which has the following advantages: firstly, an umbrella-shaped multi-routing path is constructed, so that the space reuse rate is improved, the rapid mirror image distribution in the subsequent stage is facilitated, and the distribution efficiency is improved; secondly, a multi-receiving single-forwarding pseudo-route transmission mode with a retransmission mechanism expands the mirror image receiving range and ensures the reliability of the path; and a local transmission relation which is not influenced by a hidden terminal is formed based on the ideas of neighbor exploration and competitive subscription, so that the occurrence of message collision is avoided, and the code distribution time is effectively shortened.

Description

Wireless sensor network code distribution method based on umbrella-shaped multipath
Technical Field
The invention relates to the technical field of wireless sensor networks, in particular to a wireless sensor network code distribution method based on umbrella-shaped multipath.
Background
In a wireless sensor network, node deployment has the characteristics of large quantity and wide spatial position dispersion, partial application scene environments are severe, after the node deployment, a user needs to update a software code mirror image after proposing a new network function requirement, and a traditional manual wired burning mode is adopted, so that the wireless sensor network has the defects of high labor cost and difficulty in realizing meeting the requirement. Under the background, a wireless channel is used as a medium, and a code image is distributed and upgraded in a single-hop and multi-hop mode, namely, a code distribution protocol for updating by using the image can effectively solve the problems.
The traditional code distribution protocol is divided into a pure broadcast routing protocol and a protocol of a routing and broadcasting framework; the pure broadcast routing protocol mainly carries out mirror image updating on all nodes in the WSN in a multi-hop mode, a source node can complete mirror image distribution of surrounding nodes through one-time broadcasting without sequentially carrying out interactive updating on the source node and the surrounding nodes, so that the time is saved, but the nodes need to be subjected to interception management before forwarding, and a large amount of time delay is caused by accumulation; the routing and broadcasting frame protocol greatly shortens the code distribution time by utilizing the characteristic of rapid routing transmission on one hand, and the broadcasting can cover all corners of the whole network on the other hand.
Whether the pure broadcast routing protocol or the protocol of the routing and broadcast framework exists, the aliasing of the control message and the mirror image data message in space and time exists, so that the message collision is generated, and the reliability of the mirror image transmission is influenced. The traditional method for suppressing the problems is to add a certain time delay before sending the message to avoid the generation of message collision, but the accumulated time delay is larger for the whole code distribution, thereby influencing the mirror image transmission efficiency.
Disclosure of Invention
The invention provides a wireless sensor network code distribution method based on umbrella-shaped multipath, aiming at solving the technical defect of low mirror image transmission efficiency in the prior art.
In order to realize the purpose, the technical scheme is as follows:
a wireless sensor network code distribution method based on umbrella-shaped multipath comprises the following steps:
s1, determining nodes positioned at source node corners in a network edge as first-level seed nodes, and respectively determining two nodes positioned at two adjacent corners of the source node in the network edge as second-level seed nodes and third-level seed nodes;
s2, broadcasting the RREQ message by the source node through the whole network, reversely replying the RREQ message to the source node after the first-stage seed node receives the RREQ message, and constructing a main path after the source node receives the RREQ message;
s3, enabling a node at the midpoint of a main path between the source node and the primary seed node to be a super node, and constructing the main path; the source node broadcasts a notifyTarget message to the main path, after receiving the notifyTarget message, the super node confirms that the identity is the super node and broadcasts an RREQ message, and initiates path search to the secondary seed node, after receiving the RREQ message, the secondary node replies the RREP message along a reverse path, and after receiving the RREP message, the super node successfully establishes a path between the super node and the secondary seed node; the super node broadcasts the RREQ message again, initiates path search for the third-level seed node, the third-level seed node receives the RREQ message and then replies the RREP message by delaying a reverse path, and after the super node receives the RREP message, the path between the super node and the third-level seed node is successfully established; after the path between the super node and the secondary seed node and the path between the super node and the tertiary seed node are established, the super node reversely sends a notifyTarget message along the main path to inform the source node of the completion of the establishment of the umbrella-shaped multi-path;
s4, after receiving the notifyTarget message, the source node circularly sends all mirror image pages of the code mirror image file to the super node through the main path, and the super node respectively transmits the received mirror image pages to the primary seed node, the secondary seed node and the tertiary seed node through the established paths; in the transmission process of the mirror image page, the path nodes between the source node and the super node, the super node and the first-level seed node, and the path nodes between the second-level seed node and the third-level seed node are stored after receiving the mirror image page, and then the mirror image page is transmitted to the next hop node; after receiving and storing all the mirror image pages, the nodes carry out code distribution updating of the steps S5-S9 on the nodes to be updated around the mirror image pages;
s5, enabling the nodes which store all the image pages and have nodes to be updated around the image pages to be GREY nodes, enabling the nodes to be updated to be WHITE nodes, enabling the GREY nodes to enter a MAINTAIN state after all the image pages are received by the GREY nodes, starting a random timer TM, broadcasting an adv message and transitioning to an HALFLINKING state when the timing time is up; when the WHITE node receives the adv message in a default state of SILENT, the state is transited to HALFLINKING, and the ID number of the GREY node which enables the GREY node to enter HALFLINKING state is recorded;
s6, after the WHITE node enters HALFLINKING state, starting a half-connection timer THalf2And at the timer THalf2Before expiryAn advReply message is replied to the GREY node at a random time, and a timer THalf2The duration of (d) is λ × neighbours count; after the GREY node enters HALFLINKING state, the half-connection timer T is startedHalf1，THalf1With a duration of λ x NWhiteNeighboursWhere λ is a constant, GREY node is at timer THalf1Counting the ID numbers of the WHITE nodes replying the advRely message before expiration, and recording the ID numbers in a local receiving set; wherein the neighbor count is the number of WHITE neighbor nodes of the GREY node, NWhiteNeighboursThe number of WHITE neighbor nodes to be updated for the GREY node;
s7. GREY node in HALFINKING state is in timer THalf1After the period expires, judging whether the local neighbor set and the local receiving set are the same, if so, immediately broadcasting the sub message; if not, the GREY node returns to MAINTAIN state, and executes step S5 again;
s8, after receiving the sub message, the WHITE node sends a sub reply message to the GREY node within a short random time, and simultaneously enters an RX stable state; the GREY node receiving the sub reply message judges whether the message is sent to the GREY node, if so, the GREY node transitions to a TX stable state; if not, the stable state of SILENT is transited;
and S9, after the WHITE node enters an RX stable state and the GREY node enters a TX stable state, carrying out code distribution.
Compared with the prior art, the invention has the beneficial effects that:
firstly, an umbrella-shaped multi-routing path is constructed, so that the space reuse rate is improved, the rapid mirror image distribution in the subsequent stage is facilitated, and the distribution efficiency is improved; secondly, a multi-receiving single-forwarding pseudo-route transmission mode with a retransmission mechanism expands the mirror image receiving range and ensures the reliability of the path; and a local transmission relation which is not influenced by a hidden terminal is formed based on the ideas of neighbor exploration and subscription signing, so that the occurrence of message collision is avoided, and the code distribution time is effectively shortened.
Drawings
Fig. 1 a Umbrella protocol code distribution framework
FIG. 2 example of the selection of seed nodes by the Umbrella protocol under different network architectures
FIG. 3 the Umbrella protocol builds a message interaction diagram (routing phase) of Umbrella-like multipaths
FIG. 4 Umbrella-shaped multi-path effect diagram of the Umbrella protocol
FIG. 5 is a comparison between the conventional pure route transmission mode and the dummy route transmission mode of the Umbrella protocol
FIG. 6 message interactive process of the UMBRELLA PROTOCOL MULTI-PAGE TRANSMISSION MECHANISM
Fig. 7 example of retransmission opportunity of node packet loss in routing phase of urea protocol
FIG. 8 Special handling of last mirror page by the Umbrella protocol
FIG. 9 is a flow chart of the timing control of the source node of the Umbrella protocol to the whole network (broadcast phase)
FIG. 10 is a table of states associated with different node types
FIG. 11 state machine of a contention subscription period GREY node
Figure 12 competes for the state machine of the subscription period WHITE node.
Detailed Description
The drawings are for illustrative purposes only and are not to be construed as limiting the patent;
the invention is further illustrated below with reference to the figures and examples.
Example 1
The technical scheme of the invention is as follows: the wireless sensor network code distribution method based on umbrella-shaped multipath interference-free multi-local transmission comprises two stage strategies, namely an umbrella-shaped multipath establishment stage strategy and an interference-free multi-local transmission mechanism strategy, which are shown in figure 1 and are explained below.
One-umbrella-shaped multi-path establishment stage strategy
1. An umbrella-shaped multi-path establishment phase strategy, comprising: and selecting seed nodes, and establishing paths through information interaction.
In the stage, seed nodes are selected firstly according to the principle: a certain network edge node at a source node diagonal in the network is selected as a first-level seed node, and second-level and third-level seed nodes should be selected from network edge nodes at two neighboring corners of the source node, respectively, and fig. 2(a), (b), and (c) are examples of seed node selection for a circular network, a lattice network, and an irregular network, respectively.
After the node is selected, a path is established through interaction of three types of messages, namely an RREQ message, an RREP message and a notifyTarget, as shown in fig. 3, a specific interaction process is described as follows:
1) and the source node broadcasts the RREQ message in the whole network and initiates path search for the first-level seed node.
2) After receiving the RREQ message, the first-level seed node replies the RREP message to the source node along the reverse path.
3) Once the RREP message sent by the primary seed node is forwarded to the source node, the primary path setup is complete.
And then, the source node sends a notifyTarget message to the super node at the midpoint of the main path, so as to inform the super node to initiate path finding to the secondary seed node.
4) And the super node broadcasts the RREQ message and initiates path search for the secondary seed node.
5) And after receiving the RREQ message trying to find the secondary seed node, the secondary seed node immediately replies the RREP message along a reverse path leading to the super node.
6) And when the super node receives the RREP message replied by the secondary seed node, successfully establishing a second bidirectional path between the source node and the secondary seed node. And then the super node initiates a third RREQ path search to the third-level seed node.
7) And after receiving the third RREQ message, the third-level seed node replies a RREP message to the super node along a reverse path to form a forward path from the super node to the third-level seed node.
8) And at the moment that the super node receives the RREP message sent by the third-level seed node, all three bidirectional paths of the network are established. And finally, the super node reversely sends a notifyTarget message along the main path to inform the source node that the umbrella-shaped multi-path is established. As shown in fig. 4.
After receiving the notifyTarget message, the source node circularly sends all mirror image pages of the code mirror image file to the super node through the main path, and the super node respectively transmits the received mirror image pages to the primary seed node, the secondary seed node and the tertiary seed node through the established paths; in the transmission process of the mirror image page, the path nodes between the source node and the super node, the super node and the first-level seed node, and the path nodes between the second-level seed node and the third-level seed node are stored after receiving the mirror image page, and then the mirror image page is transmitted to the next hop node; after receiving and storing all the mirror image pages, the node performs code distribution and update on the nodes to be updated around the node, and a non-interference multi-local transmission mechanism policy in the second part of the specific distribution process will be described in detail, as shown in fig. 5.
2. Information interaction for successive multi-page transfers is shown in fig. 6, and its pseudo-code can be described as follows:
while(currentPage<PAGE_SUM){
if (currentPage and mirror block not sent out) front page
Starting a timer with the timing duration of T _ Block, and sending the next mirror when the timer is up
A block;
}else{
currentPage++；
starting a timer, wherein the timing duration is T _ Page, and sending the next mirror image Page when the timing is up
// the next mirror page is also the currentPage;
}
}
when constructing the second and third transmission paths, the super node records the ID numbers of the next hop nodes in the forward path to the second and third seed nodes, and knows the ID number of the next hop node in the forward main path, so that the super node has three next hop nodes in the forward path. After receiving the mirror image data, the ordinary path node firstly inquires the ID number of the next hop node in the forward routing table, and then forwards the mirror image data to the next hop node. And before the super node forwards the data message, three forward path next hop nodes are arranged in the message, and after the three next hop nodes receive the data message, the three next hop nodes continue to forward the message along respective forward paths until the data message is transmitted to the seed nodes of the respective paths.
As shown in fig. 7, Tc is the duration of the retransmission timer, and when the path node and the path one-hop node receive discontinuous mirror pages, the retransmission timer is started, and the duration of Tc can ensure that retransmission is always initiated between page and page intervals, thereby avoiding collision with mirror page messages. Because the nodes receive the mirror pages in order, the mirror page can be used only after all the mirror blocks in the mirror page are received. The path node and the path one-hop node can only receive the adjacent next mirror image page data which is 1 more than the current mirror image page number of the node, but cannot receive the data across the page numbers. When a path node or a path hop node receives a cross-page mirror image block, a retransmission timer is started, and after the timing time is up, the path node or the path hop node sends a retransmission request message, namely a speciarreq message, to a source node along a reverse path. After receiving the retransmission request message, the source node sequentially transmits each mirror block of the requested mirror page at the next transmission time.
Because packet loss detection is based on continuous mirror pages and cannot ensure correct reception of the last page, special processing of the last mirror page is required to be introduced to ensure correct transmission, and the method carries out verification by introducing srcdata complete messages. As shown in fig. 8, the protocol causes the source node to forward the srcdata completed message once again along the umbrella multipath after completing the consecutive multi-page transmission. And the source node immediately starts a timer after sending the srcDataCompleted message, the timing duration is the size of the transmission time interval Tpage of the mirror image page, and if no retransmission application message is received before the timer expires, the last page of the path node and the path one-hop node is considered to be correctly received. At this time, the routing transmission phase task is completed, and the source node can inform the whole network to enter the broadcast transmission phase. If a retransmission request message requesting the last page is received before the timer expires, the source node retransmits the last mirror page and repeats the above process.
Two, non-interference multi-local transmission mechanism strategy
In order to implement the strategy of the interference-free multi-local transmission mechanism, a mechanism for exploring neighbors and competing subscriptions is mainly adopted, and the specific flow is shown in fig. 9. The three states of a node are referred to herein as GREY, WHITE, and BLACK, respectively, where the WHITE node represents the node to be updated and the BLACK and GREY nodes are the nodes with the new images. The difference is that the BLACK node has no WHITE node, and GREY nodes are surrounded by WHITE nodes, namely potential sending nodes of the GREY nodes.
And in the neighbor exploration stage, the GREY node ascertains whether a WHITE node exists around the GREY node, if no WHITE node exists, the GREY node becomes a BLACK node, if the WHITE node exists, the total number of the WHITE nodes is recorded, and then the GREY node enters a competition subscription stage. In a competitive subscription period, a BLACK node does not operate, a GREY node communicates with a WHITE node, the WHITE node possibly receives subscription signals of a plurality of GREY nodes at the stage, a GREY node is selected to perform subscription response by adopting a node optimization selection strategy, after the GREY node sends a subscription request, the subscription response signals are continuously collected and the total number is counted, if the total number is equal to the total number of the WHITE explored by a neighbor, namely, all the peripheral WHITE nodes subscribe with the GREY node, namely, under a collision-free transmission condition, the subscription is successful; if the total numbers are different, the collision-free transmission relation is not satisfied, the subscription fails, and the neighbor exploration stage needs to be entered again.
In order to ensure that the messages in the neighbor exploration and competition subscription stages do not lose the subscription messages due to message collision, the method adopts a random delay message sending technology, and the time magnitude of random delay is very small. The random time delay for sending the information can greatly reduce the phenomenon of collision and packet loss caused by the fact that the nodes receive the information at the same time.
Meanwhile, each node starts a timer with fixed time in a competition stage, the use of the timer can ensure that the node can receive messages in the stage, and simultaneously, the problem of small probability message collision and packet loss still generated by a random delay message sending technology can be solved, and the timer does not wait for a subscription response and reenters a neighbor exploration and competition subscription stage if the subscription fails.
In the competitive subscription phase, the three types of nodes respectively go through various intermediate states from respective default states and finally are converted into stable states. The situation is shown in fig. 10.
1. The behavior state of a GREY node for a contention subscription period can be described as follows, as shown in fig. 11:
the g.1grey node enters the MAINTAIN state and starts a random timer TM, which broadcasts an adv message as soon as it is timed out and transitions to the HALFLINKING state.
G.2 if the GREY node in MAINTAIN state monitors that there is an adv message to send, it shows that there is a GREY neighbor around trying to initiate a request for establishing a relationship. Then defer sending of its adv message and defer μ x NWhiteNeighbours+τrandWhere μ is a constant, τrandIs a short random delay time. The goal is to provide a quieter environment for GREY neighbor nodes that attempt to initiate an establishment relationship.
After the G.3GREY node enters the HALFLINKING state, a half-connection timer T is startedHalf1，THalf1With a duration of λ x NWhiteNeighboursWhere λ is a constant. T isHalf1Before the timer expires, the WHTIE node ID number of the advRely message of the current GREY node is counted and recorded in the local receiving set.
GREY node in G.4HALFINKING state at THalf1①, if they are the same, it indicates that all the WHITE neighbors of it have recovered to it, then immediately broadcasts subscription message (sub message) in order to immediately initiate the subscription request to all the WHITE nodes, ②, if they are not the same, it indicates that there is some node in the current node WHITE neighbor node which has priority to participate in the transmission relationship of other GREY nodes, the current node itself gives up being the sending node of the transmission relationship, GREY node returns to MAINTAIN state, and executes G.1 step again.
G.5, whether in MAINTAIN or HALFLINKING state, will not have an opportunity to participate in this transmission as long as the GREY node has heard the sub message indicating that its surrounding GREY neighbors have established a transmission relationship. All timers are immediately turned off and the steady state of SILENT is entered.
G.6 the GREY node receiving the sub reply message will judge whether the message is sent to itself. If yes, transition is made to a TX stable state; ② if not, then transition to SILENT stable state.
2. The behavior state of the contention subscription period WHITE node can be described as the following points, as shown in fig. 12:
w.1 when the WHITE node receives an adv message in a default state of SILENT, the state is transited to HALFLINKING, and the GREY node ID number for leading the current WHITE node to enter HALFLINKING state, namely the sender ID number of the adv message, is recorded. HALFLINKING state is entered and a half-connection timer T is startedHalf2，THalf2The duration of (c) is λ × neighbours count. Since the neighbors count field is from the received adv message (the neighbors count field is the number of WHITE neighbors of the GREY node), T is actually THalf1And THalf2Are equal in duration.
After the W.2WHITE node enters HALFLINKING state, a timer T is startedHalf2An advReply message is returned at a random time prior to expiration. And after entering HALFLINKING state, the WHITE node does not reply to the received adv message.
W.3WHITE node is at timer THalf2Upon expiration, the previously recorded GREY node ID number in the HALFLINKING state is cleared and the SILENT default state is restored, so that the WHITE node has an opportunity to participate in the establishment of other transmission relationships.
After receiving the sub message, the W.4WHITE node sends a sub reply message after a short random time, and simultaneously enters an RX stable state.
3. The optimization selection strategy of the sending node is to enable the GREY node to start a random timer TM in the MAINTAIN state, and the following formula is followed:
Figure GDA0002502659400000081
wherein T islowAnd ThighIs the lower and upper limit of the expected value range of TM, NAverageNeighboursIs a network nodeAverage number of neighbors, NWhiteNeighboursIs the number of WHITE neighbor nodes to be updated, tau, of the GREY noderandIs a short delay. The goal is to allow more WHITE neighbor GREY nodes to have a larger sending node that is likely to be a transmitting relationship.
It should be understood that the above-described embodiments of the present invention are merely examples for clearly illustrating the present invention, and are not intended to limit the embodiments of the present invention. Other variations and modifications will be apparent to persons skilled in the art in light of the above description. And are neither required nor exhaustive of all embodiments. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the claims of the present invention.

Claims (7)

1. A wireless sensor network code distribution method based on umbrella-shaped multipath is characterized in that: the method comprises the following steps:
s1, determining nodes positioned at source node corners in a network edge as first-level seed nodes, and respectively determining two nodes positioned at two adjacent corners of the source node in the network edge as second-level seed nodes and third-level seed nodes;
s2, broadcasting the RREQ message by the source node through the whole network, reversely replying the RREQ message to the source node after the first-stage seed node receives the RREQ message, and constructing a main path after the source node receives the RREQ message;
s3, enabling a node at the midpoint of a main path between the source node and the primary seed node to be a super node, and constructing the main path; the source node broadcasts a notifyTarget message to the main path, after receiving the notifyTarget message, the super node confirms that the identity is the super node and broadcasts an RREQ message, and initiates path search to the secondary seed node, after receiving the RREQ message, the secondary node replies the RREP message along a reverse path, and after receiving the RREP message, the super node successfully establishes a path between the super node and the secondary seed node; the super node broadcasts the RREQ message again, initiates path search for the third-level seed node, the third-level seed node receives the RREQ message and then replies the RREP message by delaying a reverse path, and after the super node receives the RREP message, the path between the super node and the third-level seed node is successfully established; after the path between the super node and the secondary seed node and the path between the super node and the tertiary seed node are established, the super node reversely sends a notifyTarget message along the main path to inform the source node of the completion of the establishment of the umbrella-shaped multi-path;
s4, after receiving the notifyTarget message, the source node circularly sends all mirror image pages of the code mirror image file to the super node through the main path, and the super node respectively transmits the received mirror image pages to the primary seed node, the secondary seed node and the tertiary seed node through the established paths; in the transmission process of the mirror image page, the path nodes between the source node and the super node, the super node and the first-level seed node, and the path nodes between the second-level seed node and the third-level seed node are stored after receiving the mirror image page, and then the mirror image page is transmitted to the next hop node; after receiving and storing all the mirror image pages, the nodes carry out code distribution updating of the steps S5-S9 on the nodes to be updated around the mirror image pages;
s5, enabling the nodes which store all the image pages and have nodes to be updated around the image pages to be GREY nodes, enabling the nodes to be updated to be WHITE nodes, enabling the GREY nodes to enter a MAINTAIN state after all the image pages are received by the GREY nodes, starting a random timer TM, broadcasting an adv message and transitioning to an HALFLINKING state when the timing time is up; when the WHITE node receives the adv message in a default state of SILENT, the state is transited to HALFLINKING, and the ID number of the GREY node which enables the GREY node to enter HALFLINKING state is recorded;
s6, after the WHITE node enters HALFLINKING state, starting a half-connection timer THalf2And at the timer THalf2Replying an advReply message to the GREY node at a random time before expiration, timer THalf2The duration of (d) is λ × neighbours count; after the GREY node enters HALFLINKING state, the half-connection timer T is startedHalf1，THalf1With a duration of λ x NWhiteNeighboursWhere λ is a constant, GREY node is at timer THalf1Counting the ID numbers of the WHITE nodes replying the advRely message before expiration, and recording the ID numbers in a local receiving set; wherein neighboursCount is a GREY nodeNumber of WHITE neighbor nodes, NWhiteNeighboursThe number of WHITE neighbor nodes to be updated for the GREY node;
s7. GREY node in HALFINKING state is in timer THalf1After the period expires, judging whether the local neighbor set and the local receiving set are the same, if so, immediately broadcasting the sub message; if not, the GREY node returns to MAINTAIN state, and executes step S5 again;
s8, after receiving the sub message, the WHITE node sends a sub reply message to the GREY node within a short random time, and simultaneously enters an RX stable state; the GREY node receiving the sub reply message judges whether the message is sent to the GREY node, if so, the GREY node transitions to a TX stable state; if not, the stable state of SILENT is transited;
and S9, after the WHITE node enters an RX stable state and the GREY node enters a TX stable state, carrying out code distribution.
2. The umbrella multipath-based wireless sensor network code distribution method of claim 1, wherein: in step S5, if the GREY node in MAINTAIN state monitors that there is an adv message sent around, the GREY node defers sending the adv message, and the deferring time is μ × NWhiteNeighbours+τrandWhere μ is a constant, τrandIs a short random delay time.
3. The umbrella multipath-based wireless sensor network code distribution method of claim 1, wherein: in step S5, if the GREY node in MAINTAIN state or HALFLINKING state monitors the sub message, the GREY node enters a stable state of SILENT.
4. The umbrella multipath-based wireless sensor network code distribution method of claim 1, wherein: in the step S6, the WHITE node is in the timer THalf2After expiration, the ID number of the GREY node in the semi-connected HALFLINKING state recorded before is cleared and the SILENT stable state is resumed.
5. The umbrella multipath-based wireless sensor network code distribution method of claim 1, wherein: the random timer TMThe timing duration of (a) is:
Figure FDA0002502659390000031
wherein T islowAnd ThighIs the lower and upper limit of the expected value range of TM, NAverageNeighboursIs the average number of neighbors, τ, of a network noderandIs a short delay.
6. The umbrella multipath-based wireless sensor network code distribution method according to any one of claims 1 to 5, wherein: in step S4, when the first-level seed node, the second-level seed node, the third-level seed node, the super node, or the node on the path receives the discontinuous mirror image page, the retransmission timer is started, and a retransmission application message is sent to the source node after the time of the retransmission timer expires, and after the source node receives the retransmission application message, each mirror image block of the requested mirror image page is sequentially sent at the next sending time.
7. The umbrella multipath-based wireless sensor network code distribution method of claim 6, wherein: in step S4, after the source node finishes sending all the mirror pages, it sends the srcdata completed message to the first-level seed node, the second-level seed node, the third-level seed node, and the super node along the path, the source node immediately starts a timer after sending the srcdata completed message, the timing duration is the mirror page transmission time interval Tpage, and if no retransmission request message is received before the timer expires, it is determined that the last mirror page is correctly received.
CN201711034222.5A 2017-10-30 2017-10-30 Wireless sensor network code distribution method based on umbrella-shaped multipath Active CN107786660B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201711034222.5A CN107786660B (en) 2017-10-30 2017-10-30 Wireless sensor network code distribution method based on umbrella-shaped multipath

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201711034222.5A CN107786660B (en) 2017-10-30 2017-10-30 Wireless sensor network code distribution method based on umbrella-shaped multipath

Publications (2)

Publication Number Publication Date
CN107786660A CN107786660A (en) 2018-03-09
CN107786660B true CN107786660B (en) 2020-10-02

Family

ID=61432396

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201711034222.5A Active CN107786660B (en) 2017-10-30 2017-10-30 Wireless sensor network code distribution method based on umbrella-shaped multipath

Country Status (1)

Country Link
CN (1) CN107786660B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116614517B (en) * 2023-04-26 2023-09-29 江苏博云科技股份有限公司 Container mirror image preheating and distributing method for edge computing scene

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101159689A (en) * 2007-11-08 2008-04-09 北京科技大学 Mobile sensor network routing method based on region gradient updating
US9467925B1 (en) * 2016-02-23 2016-10-11 King Fahd University Of Petroleum And Minerals Systems and methods for efficient routing during energy harvesting of wireless sensor networks
CN106131154A (en) * 2016-06-30 2016-11-16 福州大学 Compression method of data capture based on kernel function in mobile wireless sensor network
CN107197495A (en) * 2017-01-17 2017-09-22 燕山大学 A kind of Secure Routing Algorithm for Wireless Sensor Networks based on multiple attribute decision making (MADM)

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8874477B2 (en) * 2005-10-04 2014-10-28 Steven Mark Hoffberg Multifactorial optimization system and method
CN102291795B (en) * 2010-06-21 2014-02-19 富士通株式会社 Wireless communication device, wireless communication network and control router selection method

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101159689A (en) * 2007-11-08 2008-04-09 北京科技大学 Mobile sensor network routing method based on region gradient updating
US9467925B1 (en) * 2016-02-23 2016-10-11 King Fahd University Of Petroleum And Minerals Systems and methods for efficient routing during energy harvesting of wireless sensor networks
CN106131154A (en) * 2016-06-30 2016-11-16 福州大学 Compression method of data capture based on kernel function in mobile wireless sensor network
CN107197495A (en) * 2017-01-17 2017-09-22 燕山大学 A kind of Secure Routing Algorithm for Wireless Sensor Networks based on multiple attribute decision making (MADM)

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
A distributed self-healing algorithm for virtual backbone construction and maintenance in Wireless Sensor Networks;Najla Al-Nabhan et al;《IEEE International Conference on Wireless for Space and Extreme Environments 》;20131109;全文 *
适用于WSN的数据融合隐私保护算法研究;王安琪;《中国优秀硕士论文全文数据库 信息科技辑》;20120715;全文 *

Also Published As

Publication number Publication date
CN107786660A (en) 2018-03-09

Similar Documents

Publication Publication Date Title
TWI309522B (en) A method and a system for proceeding data communication in wireless mesh networks
US7916666B2 (en) Reliable broadcast protocol and apparatus for sensor networks
EP2115965B1 (en) Low-power wireless multi-hop networks
EP2280517B1 (en) Method and apparatus for controlling packet transmissions within wireless networks to enhance network formation
US20060045065A1 (en) Optimal direction-based flooding method for mobile ad-hoc networks
US7492726B2 (en) Method and apparatus for optimizing convergecast operations in a wireless sensor network
JP3947370B2 (en) Wireless communication system
Acharya et al. Design and analysis of a cooperative medium access scheme for wireless mesh networks
AU2296901A (en) A protocol for neighborhood-established transmission scheduling
KR20080021764A (en) Avoiding hidden terminals in wireless local area networks
JP5867411B2 (en) Information collection system, terminal, sink node, and communication method using wireless multi-hop network
Bhatia et al. A distributed TDMA slot scheduling algorithm for spatially correlated contention in WSNs
CN104936249A (en) Route self-healing method suitable for wireless network
CN110691371B (en) MAC (media Access control) scheduling method of mesh underwater acoustic network
CN107786660B (en) Wireless sensor network code distribution method based on umbrella-shaped multipath
KR101200792B1 (en) An network broadcast method using mac unicast and multipoint relays
CN105072586A (en) Management method for forwarding of broadcast message in embedded wireless ad hoc network
Jain et al. A cross layer MAC with explicit synchronization through intelligent feedback for multiple beam antennas
EP2198658B1 (en) A method of reducing occurrence of masked nodes, a node and a computer program product therefor
JP2008312059A (en) Ad hoc network configuration method, and node device
KR20070083027A (en) Method for multicast routing using mpr set information
KR20110068405A (en) Method for medium access control in wireless sensor network and communication terminal therefor
Lu et al. A dynamic token passing MAC protocol for mobile ad hoc networks
CN115103411A (en) Time division multiple access time slot allocation method of wireless self-organizing network
JP2005086570A (en) Communication controlling method and communication terminal

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant