CN105072586A - Management method for forwarding of broadcast message in embedded wireless ad hoc network - Google Patents
Management method for forwarding of broadcast message in embedded wireless ad hoc network Download PDFInfo
- Publication number
- CN105072586A CN105072586A CN201510426011.0A CN201510426011A CN105072586A CN 105072586 A CN105072586 A CN 105072586A CN 201510426011 A CN201510426011 A CN 201510426011A CN 105072586 A CN105072586 A CN 105072586A
- Authority
- CN
- China
- Prior art keywords
- node
- broadcast
- forwarding
- broadcast message
- dsp
- 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.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/06—Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
-
- 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
- H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
- H04W40/14—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality based on stability
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W76/00—Connection management
- H04W76/40—Connection management for selective distribution or broadcast
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Multimedia (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a management method for the forwarding of a broadcast message in an embedded wireless ad hoc network. The method comprises: extracting a neighbor list N1 of a broadcast sending node in the broadcast message when a wireless ad hoc network node receives the broadcast message; extracting a 1-hop neighbor list N2 of the wireless ad hoc network node; comparing the neighbor list N1 with the 1-hop neighbor list N2 of the wireless ad hoc network node, acquiring an intersection thereof, and sequencing nodes included in the intersection according to the serial numbers of the nodes to form a virtual sequence; enabling the wireless ad hoc network node receiving the broadcast message to determine whether the received broadcast message is sent from a source node, and if yes, successively forwarding the broadcast message according to the virtual sequence, or if not, successively forwarding the broadcast message according to the virtual sequence after a fixed time slot. The method achieves a stable and reliable broadcast communication requirement in a wireless multi-hop network.
Description
Technical field
The present invention relates to the communications field, particularly, relate to the management method to the forwarding of broadcast in a kind of embedded radio self-organizing network.
Background technology
Wireless self-organization network is a kind of adaptive network be based upon on non-stop layer framework.Its feature is internodal communication is self-management completely, and there is not central manage-ment unit.Its reason is that the distribution of each node is unordered at random, when internodal physical distance exceedes available point point to-point communication distance, also cannot directly manage even if there is centralized control unit.Therefore, the node in wireless self-organization network is self-management information transmit-receive process normally.Because wireless signal is aloft propagated, different signals likely aloft collides, and produces conflict, and time serious, receiver even cannot reduce useful signal, causes taking defeat.This situation is obvious in the communication process of broadcast.Conventional radio communication can be divided into clean culture, multicast and broadcast.Multicast is a kind of special case of broadcast.Because the object of broadcast be in order to by message propagation to each node in network, the node receiving broadcast will carry out broadcast forwarding.If effectively do not planned, broadcast storm will be formed in network, produce Severe blockage.Comparatively speaking, although clean culture also can produce conflict, the enabling communication between nodes that unicast messages is only being specified, the chance of the whole network conflict is relatively low.
Adopt different wireless technologys, mode and the probability of conflict also have difference, and situation about wherein running into the equipment adopting FDMA mode to carry out communicating is the most general.The wireless technology being often used to set up wireless self-organization network includes, but are not limited to, bluetooth, the standards such as WIFI, IEEE802.15.4.Wherein, Bluetooth technology adopts the mode (1600 jumpings/second) of frequency hopping, and in transmitting procedure, every part of data may send in the 84MHz frequency band of different relative arrowbands (1MHz).By the mode of distributing in advance, the probability that bluetooth equipment interferes with each other is reduced to very low degree, but this mode depends on the existence of main equipment, i.e. the master-slave mode that adopts of bluetooth.Therefore bluetooth is seldom used as the wireless technology of networking on a large scale.WiFi technology adopts the working method of Direct-Spread (DSS) FDMA, wireless frequency is divided into different relatively wide channels (20/22MHz).The node of intercommunication must operate on identical channel, and can not be switched to other channels in communication process.When having multiple equipment while during initiating communication, channel will produce wireless conflict (signal disturbing) not.When unicast communication carries out, WiFi technology adopts carrier sense and the algorithm kept out of the way to alleviate the impact of conflict.When there being data to send, equipment first detects the busy extent of present channel, if having other signals or energy to be detected, then adopts the mode of random back-off to wait for chance next time.IEEE802.15.4 also uses FDMA working method, and adopts and the similar algorithm of WiFi technology avoids conflict.
When completely random, this mode can allow independently node to use the mode of competition to access wireless medium when there being communication requirement, responds the most fast to obtain.And unsuccessful in communication, such as run into channel busy when carrier sense, or time communication does not receive the response of expection, node can be kept out of the way by retrogressing, or resends the successful transmission guaranteeing data busy.But in case of broadcasting, due to uncertainty too many in network, retransmission mechanism generally can not adopt.After packet is broadcast, sending node does not have reliable means whether to carry out acknowledge message by successful delivery.
Although radio broadcasting has above-described limitation, but in wireless self-organization network, in default of effective central manage-ment unit, the realization of a lot of mechanism still depends on broadcast mode, in such as route generative process, in order to orient the active path from source node to destination node from mutual disjunct node cluster, broadcast is usually used for inquiry and returns routing iinformation.In order to enable broadcast arrive at the destination smoothly, and consider that broadcast can bring a large amount of forwarding work, therefore the most effective mode is not the competing method being similar to unicast communication use, but makes the forwarding of broadcast carry out in order as much as possible.
As in the broadcast scenarios in the wireless multi-hop network of Fig. 1 demonstration, different square frames represents different nodes, which time broadcast (forwarding) of the numeral on line.After supposing that node 1 sends broadcast, the line being labeled as 1 represents that this broadcast first time transmission can arrive node 2,4,9 respectively.For node 2, after receiving broadcast, node 2 needs to forward broadcast, forwards (being labeled as the line from node 2s of 2) 2 times that form arrival node 8 and 5.Concerning node 9,2 forwardings arriving node 3 and 5 also can be formed.Other nodes can carry out the process of similar turn of broadcast, until all nodes all receive information in network.Here problem is, because node 2 and 9 receives the broadcast that node 1 sends simultaneously, if carry out 2 times to forward broadcast simultaneously, signal will be made overlapping at node 5, cause node 5 to take defeat.
Although have the algorithm that some broadcast are optimized, the selection of MPR node in such as OLSR Routing Protocol, the number of nodes forwarding broadcast can be reduced under the prerequisite reaching same effect, need carrying out smoothly based on broadcast communication equally.
Summary of the invention
The object of the invention is to, for the problems referred to above, propose the management method to the forwarding of broadcast in a kind of embedded radio self-organizing network, to realize the reliable and stable advantage of broadcast communication in wireless multi-hop network.
For achieving the above object, the technical solution used in the present invention is:
To a management method for the forwarding of broadcast in embedded radio self-organizing network, under the condition that the ordinal relation of natural formation can use between the double bounce scope neighbor list and node of radio self-organized network nodes,
Comprise the following steps:
Step 1, when radio self-organized network nodes receives broadcast message, extract the neighbor list N1 of the broadcast transmission node in broadcast message;
Step 2, extract this node 1 hop neighbor list N2, in this node i.e. above-mentioned steps 1, receive the radio self-organized network nodes of broadcast message;
Step 3, this node 1 hop neighbor list N2 in the neighbor list N1 of the broadcast transmission node in above-mentioned steps 1 and step 2 is carried out contrasting and getting common factor, the node comprised in occuring simultaneously is sorted according to the sequence number of node, forms virtual sequence;
Step 4, the radio self-organized network nodes receiving broadcast message judge whether the broadcast message received is the broadcast sent from source node, if the broadcast sent from source node then forwards broadcast successively according to above-mentioned virtual sequence, after set time gap is then waited in the broadcast sent from source node, send broadcast successively according to above-mentioned virtual sequence again.
Virtual sequence in preferred above-mentioned steps 3 arranges according to sequence node is number ascending.
Virtual sequence in preferred above-mentioned steps 3 arranges according to sequence node is number descending.
In preferred above-mentioned steps 4, send the set time in broadcast after then waiting for set time gap if not the broadcast sent from source node more successively according to above-mentioned virtual sequence, the broadcast that this set time will allow most of neighbor nodes of this node to complete present lot forwards.
Management method to the forwarding of broadcast in a kind of embedded radio self-organizing network, realize based on DSP, namely each radio self-organized network nodes all arranges DSP, the signal modulation /demodulation module of DSP, after DSP completes data decode to the broadcast message received, if being checked through this frame is broadcast frame, then enter virtual ordered algorithm at once, virtual ordered algorithm is the algorithm to the management method of the forwarding of broadcast in the embedded radio self-organizing network based on technical solution of the present invention, the broadcast message that DSP receives reports upper-layer protocol after decoding and frame reduction treatment, upper-layer protocol is after being parsed, if determine to carry out data retransmission, then directly return DSP, the time point drafted at virtual ordered algorithm forwards broadcast, because DSP itself has storage capacity, information of neighbor nodes within the scope of the double bounce of node is regularly updated to the memory space of DSP by upper-layer protocol.
Technical scheme of the present invention has following beneficial effect:
Technical scheme of the present invention, by contrasting the neighbor list N1 of sending node and node 1 hop neighbor list N2, draw common factor, and after common factor is sorted, forward broadcast message successively according to sequence, avoid conflict during node receiving broadcasting information, thus do not rely on any centre management means, the management only run on a single node, just can help node orderly management to broadcast and forward order, to realize broadcast (turning broadcast) communication reliable and stable in wireless multi-hop network.
Below by drawings and Examples, technical scheme of the present invention is described in further detail.
Accompanying drawing explanation
Fig. 1 is the schematic diagram of the broadcast in prior art in wireless multi-hop network;
Fig. 2 is double bounce scope neighbor list forming process schematic diagram;
Fig. 3 is the virtual ordered schematic diagram that the forwarding formed according to management method of the present invention is broadcasted;
Fig. 4 is the concrete enforcement schematic diagram of the management method described in invention;
Fig. 5 is the flow chart of management method of the present invention;
Fig. 6 is the theory diagram of the realization of management method of the present invention on DSP.
Embodiment
Below in conjunction with accompanying drawing, the preferred embodiments of the present invention are described, should be appreciated that preferred embodiment described herein is only for instruction and explanation of the present invention, is not intended to limit the present invention.
In the wireless multi-hop network agreement often used, the mode of meeting periodic transmission spot broadcasting message shows effective existence of node, and this message is collectively referred to as " HELLO " message.In order to control the obstruction of broadcast to network, HELLO message can not be turned broadcast.By carrying the neighbor information of node in HELLO message, and exchanging with other node, a jumping and two-hop neighbors list can be set up.Fig. 2 demonstrates wireless multi-hop network interior joint and how to set up neighbor list within the scope of double bounce.
In Fig. 2, node 5 sends HELLO message, can using node 5 as 1 hop neighbor after node 3 and node 4 receive.Equally, after node 3,4 and node 6 send HELLO message, corresponding node can using sending the node of HELLO message as 1 hop neighbor.For node 3,1 hop neighbor list can be formed, comprising 4,5,6 nodes.After HELLO message constantly exchanges, each node starts the 1 hop neighbor list improving oneself, and this neighbor list is attached in the HELLO message self sent.After other nodes receive the HELLO message of expansion, can generate with self at a distance of 2 neighbor lists of jumping.For node 4, by collecting the HELLO message within the scope of 1 jumping, the HELLO message that node 4 produces subsequently can add oneself 1 hop neighbor, comprises 1,2,7,3,5,6.After node 3 receives the expansion HELLO message of node 4, by node 1,2,7,3,5,6 compare with 1 hop neighbor of oneself, filter out duplicate node 4,5,6, just can generate 2 hop neighbor lists, 7,2,1, and sum up these 2 hop neighbors and need just can be arrived by node 4.
The neighbor list of Fig. 2 interior joint 3 is as shown in Table 1:
The neighbor list of table one, node 3:
。
The neighbor list of Fig. 2 interior joint 4 is as shown in Table 2:
The neighbor list of table two, node 4:
。
Mark due to most of radio communication interior joint uses the bit of specific length to represent, the identify label of node can be represented by numeral.With IEEE802.15.4 technology as a reference, the network address of node uses 2 bytes (16 bits) to represent, address realm is from 0 to 65,535.Therefore, the size of address must be utilized between arbitrary node to produce relativeness.Utilize Digital size, each node can make sequence for listened to neighbor node, and ordering rule can be any mode.Such as according to principle from small to large, in fig. 2, node 3 can arrange out 3,4,5 in 1 hop neighbor, the order of 6.
When these two kinds of information of the ordinal relation of natural formation when between the neighbor list and node of double bounce scope can use, broadcast forwards and method proposed by the invention just can be adopted to carry out specification.
As shown in Figure 5, the management method to the forwarding of broadcast in a kind of embedded radio self-organizing network, comprises, step 1, when radio self-organized network nodes receives broadcast message, extracts the neighbor list N1 of the broadcast transmission node in broadcast message;
Step 2, extract this node 1 hop neighbor list N2, in this node i.e. above-mentioned steps 1, receive the radio self-organized network nodes of broadcast message;
Step 3, this node 1 hop neighbor list N2 in the neighbor list N1 of the broadcast transmission node in above-mentioned steps 1 and step 2 is carried out contrasting and getting common factor, the node comprised in occuring simultaneously is sorted according to the sequence number of node, forms virtual sequence; Virtual sequence comprises present node;
Step 4, the radio self-organized network nodes receiving broadcast message judge whether the broadcast message received is the broadcast sent from source node, if the broadcast sent from source node then forwards broadcast successively according to above-mentioned virtual sequence, after set time gap is then waited in the broadcast sent from source node, send broadcast successively according to above-mentioned virtual sequence again.
Virtual sequence in preferred above-mentioned steps 3 arranges according to sequence node is number ascending.
Virtual sequence in preferred above-mentioned steps 3 arranges according to sequence node is number descending.
In preferred above-mentioned steps 4, send the set time in broadcast after then waiting for set time gap if not the broadcast sent from source node more successively according to above-mentioned virtual sequence, the broadcast that this set time will allow most of neighbor nodes of this node to complete present lot forwards.
In wireless self-organization network, when node receives broadcast, in order to prepare to forward broadcast, the node that may carry out forwarding broadcast can be inferred according to the two-hop neighbors information obtained before.Then system can sort to the potential forward node of inferring, uses node its own sequence number as sort by, infers virtual forwarding order.Virtual forwarding order represents the order that node forwards broadcast, comprising present node.When other nodes forward, present node is kept quite.When taking turns to present node, carry out turning broadcast.According to the algorithm provided afterwards, each node can infer relatively consistent virtual forwarding order, and just carries out broadcast forwarding when present node takes turns to forwarding, avoids conflict as far as possible with this.As shown in Figure 3.
Suppose node 2,3,4 sum up neighbor list.For node 2, after node 1 initiates first time broadcast, node 2 infers that neighbor node 3 and 4 also can carry out forwarding broadcast (being broadcast 2 in figure), and forms virtual forwarding order 2,3,4.Here with the sequence number of node according to rule compositor from small to large, and specify that sequence number is less, forward order of priority higher.Therefore, node 2 meeting first forwards.In like manner, identical forwarding order 2,3,4 is also generated on node 4.Because sequence number 4 is maximum in forwarding order, so node 4 active wait-for two forwarding time interval, to guarantee turning broadcast and can being received smoothly by other nodes of node 2 and node 3.When waiting for that two forwarded interval, time virtual sequence takes turns to node 4, node 4 carried out forwarding broadcast.
As shown in Figure 4, suppose that all nodes have completed the foundation of 2 hop neighbor tables, and broadcast is initiated by node 6.After first time broadcast, arrive node 5,2,4,10.
Node 5: when 2 hop neighbor lists are set up, node 5 also knows the neighbor information of node 6 simultaneously.Because broadcast sends from node 6, by contrasting the neighbor information of node 6, filter out node 10,4,2,5 is affected node.Because these nodes are neighbor nodes of node 6, they can receive broadcast, and may make the decision carrying out forwarding, and affect the forwarding of node 5 further.Consider that really can have influence on the node that node 5 forwards broadcast is a hop neighbor node of node 5, therefore, node 5 by the neighbor node of oneself, namely 6,2,1 and result before compare.Node 6 is first excluded, because this is the promoter of broadcast.Node 1, because not in the neighbor list of node 6, so can not receive the broadcast of node 6, also can be got rid of.Node 2 is the neighbours of node 6, is also the neighbours of node 5, can determine, if node 2 forwards broadcast, will likely conflict with node 5.
Node 2: similar with the analytic process of node 5, node 2 first filters out the neighbor node of node 6, and 10,4,2,5.1 hop neighbor node of node 2 comprises 1,5,6,7,8,9.Because node 1,9,7,8 is not the neighbor node of node 6, so they can not forward for the current broadcast received.Because node 10,4 is not 1 hop neighbor node of node 2, so node 2 also can ignore this two nodes.Therefore, node 2 need with respect to the interactional node of meeting be 5.
Thus, node 5 and node 2 infer the arrow for forwarding broadcast 2(numeral 2 mark respectively), there are two nodes to interact.Because the mark 5 and 2 of node self has possessed relative size relation, node 2 can start in time slot comparatively early to forward.Node 5 deliberately can postpone forwarding, to stagger taking space with node 2.
The node simultaneously receiving broadcast 1 also has 4, and according to estimating method described above, node 4 does not find the interactive forward node of meeting, therefore can at any time carry out turning broadcast.
Similar, node 1 receives after node 2 forwards broadcast, by 1 hop neighbor of the neighbours of analysis node 2 (namely by 2 hop neighbors about node 1 that node 2 obtains) and node 1 oneself, can judge node 5, and 9 can and oneself produce to forward and conflict.And node 9 can analyze, only have node 1 can produce conflict when oneself forwarding broadcast.
It should be noted that, when node 1 analyzes the broadcast received from node 2, by analyzing the hop count information of normal band in packet, can find that this is second time transmission (being labeled as the arrow of 2) of this broadcast, the node carrying out second time broadcast in order to ensure other can complete transmission smoothly, node 1 needs Active Delay a period of time to enter third time repeating process (being labeled as the arrow of 3), and in like manner, node 9 also needs to postpone a period of time.This time interval can be fixed intervals, to ensure that the third time of node 1 and node 9 forwards seeding and is in identical start time.Because node 1 and node 9 receive the broadcast of node 2 in the identical time, therefore this delay simultaneously carrying out equal length can realize.For node 1, the sending order that it is followed is 1,5,9.And for node 9, the sending order that it is followed is 1,9.Although compare from the order of arrangement, 5 and 9 can at synchronization, in actual conditions seldom or can not conflict, because:
(1) this routine interior joint 5 and 9 is in different physical locations.Same time starts to send data and can not interact.
(2) if node 5 and 9 is in close position, node 9 can be included node 5 when summing up neighbor node, thus infers the sending order the same with node 1: 1,5,9, and broadcast collision still can be avoided.
In this example, the forwarding process of node 5 forwards in broadcast in second time and completes (being labeled as the arrow of 2), and therefore node 5 really can't participate in third time forwarding.
In addition, for Fig. 4, node 9 may receive the broadcast of sending from node 1 or node 2, and enters third time or the 4th repeating process (being labeled as the arrow of 3 (4)).Node 3 and node 7 also have similar situation.In actual applications, because this is identical broadcasted content, upper-layer protocol meeting automatic fitration, once forwards broadcast so only there will be.
After node receives broadcast:
Analyze transmission (forwarding) the person information of this broadcast, and from local information, obtain the neighbor information N1 of this transmission (forwarding) person.Neighbor node N2 information within the scope of 1 jumping of this node is extracted simultaneously.
Relatively two groups of information of neighbor nodes, extract the node overlapped.
Coincidence node and this node are sorted, uses the sequence number of node self, can according to from small to large, or rule from big to small, and the node of assigned serial number less (or larger) has higher transmission priority.Sequence can be used node1, node2 ... nodeN} represents.
Judge the source of broadcast.If the broadcast sent from source node, wait for according to the virtual order be ranked at once, until present node can be broadcasted.If not the broadcast sent from source node, start to forward according to prioritized after waiting for fixed cycle Tbackoff.The length of Tbackoff can be specified by user, and the broadcast that most of neighbor node will be allowed in principle to complete present lot forwards.
After node before come present node in virtual queue is considered to complete broadcast transmission, present node starts to forward broadcast.
The virtual broadcast sort method that the present invention proposes relates to the problem of sequence and stand-by period, and namely the waiting for the start time of each virtual queue is synchronous as far as possible.For a node, the time point of most suitable beginning sort algorithm is that current broadcast receives information is when completing.General wireless system the message stores received from radio in the buffer, in suitable, when such as interrupting occurring, just can be reported to upper system, can bring certain delay thus.Consider that algorithm can need the use of some memory spaces and variable, and just start sequencer procedure after receiving data, therefore propose to realize in digital signal processing module (DSP).Namely each node all arranges dsp chip, the signal modulation /demodulation module of DSP.As shown in Figure 6, after DSP completes data decode, if being checked through this frame is broadcast frame, virtual ordered algorithm can be entered at once.Upper-layer protocol, after being parsed, if determine to carry out data retransmission, then directly returns DSP, and the time point drafted at sort algorithm carries out turning broadcast.Because DSP itself has storage capacity, upper-layer protocol only needs the memory space regularly information of neighbor nodes within the scope of 2 jumpings of node being updated to DSP, just can complete preplanned mission.
Last it is noted that the foregoing is only the preferred embodiments of the present invention, be not limited to the present invention, although with reference to previous embodiment to invention has been detailed description, for a person skilled in the art, it still can be modified to the technical scheme described in foregoing embodiments, or carries out equivalent replacement to wherein portion of techniques feature.Within the spirit and principles in the present invention all, any amendment done, equivalent replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (5)
1. the management method to the forwarding of broadcast in embedded radio self-organizing network, under the condition that the ordinal relation of natural formation can use between the double bounce scope neighbor list and node of radio self-organized network nodes,
It is characterized in that, comprise the following steps:
Step 1, when radio self-organized network nodes receives broadcast message, extract the neighbor list N1 of the broadcast transmission node in broadcast message;
Step 2, extract this node 1 hop neighbor list N2, in this node i.e. above-mentioned steps 1, receive the radio self-organized network nodes of broadcast message;
Step 3, this node 1 hop neighbor list N2 in the neighbor list N1 of the broadcast transmission node in above-mentioned steps 1 and step 2 is carried out contrasting and getting common factor, the node comprised in occuring simultaneously is sorted according to the sequence number of node, forms virtual sequence;
Step 4, the radio self-organized network nodes receiving broadcast message judge whether the broadcast message received is the broadcast sent from source node, if the broadcast sent from source node then forwards broadcast successively according to above-mentioned virtual sequence, after set time gap is then waited in the broadcast sent from source node, send broadcast successively according to above-mentioned virtual sequence again.
2. the management method to the forwarding of broadcast in embedded radio self-organizing network according to claim 1, is characterized in that, the virtual sequence in above-mentioned steps 3 arranges according to sequence node is number ascending.
3. the management method to the forwarding of broadcast in embedded radio self-organizing network according to claim 1, is characterized in that, the virtual sequence in above-mentioned steps 3 arranges according to sequence node is number descending.
4. the management method to the forwarding of broadcast in the embedded radio self-organizing network according to claim 1,2 or 3, it is characterized in that, in above-mentioned steps 4, send the set time in broadcast after then waiting for set time gap if not the broadcast sent from source node more successively according to above-mentioned virtual sequence, the broadcast that this set time will allow most of neighbor nodes of this node to complete present lot forwards.
5. the management method to the forwarding of broadcast in an embedded radio self-organizing network, it is characterized in that, realize based on DSP, namely each radio self-organized network nodes all arranges DSP, the signal modulation /demodulation module of DSP, after DSP completes data decode to the broadcast message received, if being checked through this frame is broadcast frame, then enter virtual ordered algorithm at once, virtual ordered algorithm is for based on the algorithm to the management method of the forwarding of broadcast in the embedded radio self-organizing network described in any one of Claims 1-4, the broadcast message that DSP receives reports upper-layer protocol after decoding and frame reduction treatment, upper-layer protocol is after being parsed, if determine to carry out data retransmission, then directly return DSP, the time point drafted at virtual ordered algorithm forwards broadcast, because DSP itself has storage capacity, information of neighbor nodes within the scope of the double bounce of node is regularly updated to the memory space of DSP by upper-layer protocol.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510426011.0A CN105072586B (en) | 2015-07-20 | 2015-07-20 | To the management method of the forwarding of broadcast message in embedded radio self-organizing network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510426011.0A CN105072586B (en) | 2015-07-20 | 2015-07-20 | To the management method of the forwarding of broadcast message in embedded radio self-organizing network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105072586A true CN105072586A (en) | 2015-11-18 |
| CN105072586B CN105072586B (en) | 2018-05-18 |
Family
ID=54501840
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510426011.0A Active CN105072586B (en) | 2015-07-20 | 2015-07-20 | To the management method of the forwarding of broadcast message in embedded radio self-organizing network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105072586B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105657774A (en) * | 2016-03-24 | 2016-06-08 | 无锡士康通讯技术有限公司 | Building method and system for self-adaptive core forwarding network in wireless self-organized network |
| CN107094113A (en) * | 2017-04-24 | 2017-08-25 | 江苏中科羿链通信技术有限公司 | Standard mobile terminal data forwarding system and method under a kind of wireless multi-hop topological network |
| CN110248320A (en) * | 2019-06-13 | 2019-09-17 | 无锡士康通讯技术有限公司 | Wireless self-organization network management method based on time synchronization and Frequency Synchronization |
| CN114697877A (en) * | 2020-12-30 | 2022-07-01 | 华为技术有限公司 | Communication method and device |
| CN118101360A (en) * | 2024-03-21 | 2024-05-28 | 杭州高新区(滨江)区块链与数据安全研究院 | Data interaction method, node, terminal equipment and readable medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101394410A (en) * | 2008-10-29 | 2009-03-25 | 北京邮电大学 | A communication method used in mobile Ad hoc network |
| CN101582910A (en) * | 2008-05-14 | 2009-11-18 | 华为技术有限公司 | Method and device for controlling medium access |
| CN104618245A (en) * | 2014-12-23 | 2015-05-13 | 西安电子工程研究所 | Cluster head coordination based MAC/ route integrated self-organization network design method |
-
2015
- 2015-07-20 CN CN201510426011.0A patent/CN105072586B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101582910A (en) * | 2008-05-14 | 2009-11-18 | 华为技术有限公司 | Method and device for controlling medium access |
| CN101394410A (en) * | 2008-10-29 | 2009-03-25 | 北京邮电大学 | A communication method used in mobile Ad hoc network |
| CN104618245A (en) * | 2014-12-23 | 2015-05-13 | 西安电子工程研究所 | Cluster head coordination based MAC/ route integrated self-organization network design method |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105657774A (en) * | 2016-03-24 | 2016-06-08 | 无锡士康通讯技术有限公司 | Building method and system for self-adaptive core forwarding network in wireless self-organized network |
| CN105657774B (en) * | 2016-03-24 | 2023-06-20 | 无锡士康通讯技术有限公司 | Method and system for establishing self-adaptive core forwarding network in wireless self-organizing network |
| CN107094113A (en) * | 2017-04-24 | 2017-08-25 | 江苏中科羿链通信技术有限公司 | Standard mobile terminal data forwarding system and method under a kind of wireless multi-hop topological network |
| CN107094113B (en) * | 2017-04-24 | 2020-10-30 | 江苏中科羿链通信技术有限公司 | Standard mobile terminal data forwarding system and method under wireless multi-hop topological network |
| CN110248320A (en) * | 2019-06-13 | 2019-09-17 | 无锡士康通讯技术有限公司 | Wireless self-organization network management method based on time synchronization and Frequency Synchronization |
| CN110248320B (en) * | 2019-06-13 | 2021-03-23 | 无锡士康通讯技术有限公司 | Wireless self-organizing network management method based on time synchronization and frequency synchronization |
| CN114697877A (en) * | 2020-12-30 | 2022-07-01 | 华为技术有限公司 | Communication method and device |
| CN118101360A (en) * | 2024-03-21 | 2024-05-28 | 杭州高新区(滨江)区块链与数据安全研究院 | Data interaction method, node, terminal equipment and readable medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105072586B (en) | 2018-05-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8050196B2 (en) | Method and apparatus for controlling packet transmissions within wireless networks to enhance network formation | |
| US8130654B2 (en) | Context-aware packet switching | |
| US11290942B2 (en) | System and method for independent dominating set (IDS) based routing in mobile AD hoc networks (MANET) | |
| CN110167099B (en) | Ad hoc network routing method and system suitable for narrow-band condition | |
| CN101568164B (en) | Opportunistic routing algorithm of Ad hoc network | |
| US20090161578A1 (en) | Data routing method and device thereof | |
| JP4072917B2 (en) | Packet relay method, communication path setting method, and communication path setting system | |
| Pahlevani et al. | PlayNCool: Opportunistic network coding for local optimization of routing in wireless mesh networks | |
| CN102413542B (en) | Wireless mesh network routing method and wireless mesh network | |
| CN105072586A (en) | Management method for forwarding of broadcast message in embedded wireless ad hoc network | |
| JP5868551B2 (en) | Wireless communication system and wireless communication method | |
| CN105025545A (en) | A route method based on competed forwarding and applicable to a wireless network | |
| KR100755709B1 (en) | Method for multicast routing using MPR set information | |
| CN104053208A (en) | Route method and device based on channel allocation in wireless ad hoc network | |
| KR101762696B1 (en) | Route Maintenance Protocol Using Destination-initiated Flooding in Mobile Ad Hoc Networks | |
| CN103581838B (en) | A kind of Ad Hoc network information sharing method | |
| Asgharian et al. | Adaptive and distributed TDMA scheduling protocol for mobile ad hoc networks (MANET) | |
| CN101651925B (en) | Point-to-multipoint channel booking method | |
| Mahajan et al. | Energy Efficient Routing Protocols for Mobile Ad-Hoc Networks | |
| Lipman et al. | Optimized flooding algorithms for ad hoc networks | |
| Dinesh et al. | Ultimate Video Spreading With Qos over Wireless Network Using Selective Repeat Algorithm | |
| Chakraborty | Simulation of reducing broadcasting protocol in Ad hoc wireless networks | |
| CN102307332A (en) | VANET broadcast method based on extra degree | |
| KR101883904B1 (en) | Mobile Ad-hoc Network Routing Method Based on Location | |
| Dhanush et al. | Delay and hop sensitive routing protocol for vehicular ad hoc networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |