CN103079251A - Method and system for avoiding data collision in wireless sensor network - Google Patents
Method and system for avoiding data collision in wireless sensor network Download PDFInfo
- Publication number
- CN103079251A CN103079251A CN2013100408745A CN201310040874A CN103079251A CN 103079251 A CN103079251 A CN 103079251A CN 2013100408745 A CN2013100408745 A CN 2013100408745A CN 201310040874 A CN201310040874 A CN 201310040874A CN 103079251 A CN103079251 A CN 103079251A
- Authority
- CN
- China
- Prior art keywords
- data
- node
- msg
- concealed nodes
- expression
- 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
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
- Small-Scale Networks (AREA)
Abstract
The invention provides a method and a system for avoiding data collision in a wireless sensor network. The method comprises the following steps of: building routing tables for all route nodes in the wireless sensor network; obtaining a neighbor table of each route node according to the routing table; obtaining a route node set on a data transmission path; obtaining a hidden node of a sending node in the route node set according to the neighbor table; judging the state of the hidden node; if the hidden node is in a sending state, then carrying out data sending by the sending node after the hidden node sends the data; and if the hidden node is in an idle state, then carrying out the data sending by the sending node immediately. According to the method provided by the embodiment of the invention, the collision problem in the data sending process is effectively solved by controlling the data sending of the hidden node, and meanwhile, the reliability and the efficiency of data transmission are improved.
Description
Technical field
The present invention relates to the technical field of data transmission of wireless transmission net, particularly avoid the method and system of data collision in a kind of wireless sense network.
Background technology
Wireless sensor network WSN (Wireless Sensor Network) is a kind of network that is made of sensor node, and in real time monitoring, perception and acquisition node are disposed the various information of the perceptive object in district.Node consists of network with the self-organizing form, will detect data by the multi-hop relay mode and pass to aggregation node.Yet, be to carry out transfer of data in the mode of multi-hop just because of wireless sense network, caused the existence of concealed nodes in the wireless sensor network, also caused the collision of packet simultaneously, reduced transmission reliability and efficiency of transmission.
Summary of the invention
Purpose of the present invention is intended to solve at least one of above-mentioned technological deficiency.
For achieving the above object, the embodiment of one aspect of the present invention proposes to avoid in a kind of wireless sense network the method for data collision, may further comprise the steps: S1: all routing nodes to the wireless transmission net are set up routing table; S2: the neighbor table that obtains each routing node according to described routing table; S3: obtain on the data transfer path the routing node set of process; S4: the concealed nodes that in described routing node set, obtains sending node according to described neighbor table; S5: the state of judging described concealed nodes; S6: if described concealed nodes is the transmission state, wait for that then described concealed nodes sends after the data described sending node and carries out data and send; And S7: if described concealed nodes is in idle condition, then described sending node carries out the data transmission immediately.
According to the method for the embodiment of the invention, by being controlled, the data transmission of concealed nodes effectively avoided the collision problem in the data transmission procedure, improved simultaneously data transmission credibility and efficient.
In an example of the present invention, the neighbor table of described each routing node comprises the nodal information that carries out the routing node of communication with it.
In an example of the present invention, comprise the data transmitting time of concealed nodes in the nodal information in the described neighbor table.
In an example of the present invention, the data transmitting time T of described concealed nodes
S, calculate T by following formula
S=Q* (N+1) * (t
MSG+t
ACK), wherein, T
SThe data transmitting time of expression concealed nodes, Q represents to dispatch the inverse that the factor is specially the Packet Generation success rate, and N represents natural number, t
MSGThe expression node sends the time that message consumes, t
ACKExpression sends the time that ACK message consumes.
In an example of the present invention, described node sends the time t that message consumes
MSG, calculate t by following formula
MSG=(L
MSG+ L
HEAD+ L
FOOT)/V, wherein, L
MSGExpression message part length, L
HEADExpression head part length, L
FOOTThe length of expression portion, V represents that node sends the speed of data.
For achieving the above object, embodiments of the invention propose to avoid in a kind of wireless sense network the system of data collision on the other hand, comprising: set up module, be used for all routing nodes of wireless transmission net are set up routing table; The first acquisition module is for the neighbor table that obtains each routing node according to described routing table; The second acquisition module, be used for obtaining on the data transfer path the routing node set of process; Search module, be used for obtaining in described routing node set according to described neighbor table the concealed nodes of sending node; Judge module is used for judging whether described concealed nodes sends state for data; Wait for module, be used for waiting for that described concealed nodes sends data; And sending module, be used for that described sending node is carried out data immediately and send.
According to the system of the embodiment of the invention, by being controlled, the data transmission of concealed nodes effectively avoided the collision problem in the data transmission procedure, improved simultaneously data transmission credibility and efficient.
In an example of the present invention, the neighbor table of described each routing node comprises the nodal information that carries out the routing node of communication with it.
In an example of the present invention, comprise the data transmitting time of concealed nodes in the nodal information in the described neighbor table.
In an example of the present invention, the data transmitting time T of described concealed nodes
S, calculate T by following formula
S=Q* (N+1) * (t
MSG+ t
ACK), wherein, T
SThe data transmitting time of expression concealed nodes, Q represents to dispatch the inverse that the factor is specially the Packet Generation success rate, and N represents natural number, t
MSGThe expression node sends the time that message consumes, t
ACKExpression sends the time that ACK message consumes.
In an example of the present invention, described node sends the time t that message consumes
MSG, calculate t by following formula
MSG=(L
MSG+ L
HEAD+ L
FOOT)/V, wherein, L
MSGExpression message part length, L
HEADExpression head part length, L
FOOTThe length of expression portion, V represents that node sends the speed of data.
The aspect that the present invention adds and advantage in the following description part provide, and part will become obviously from the following description, or recognize by practice of the present invention.
Description of drawings
Above-mentioned and/or the additional aspect of the present invention and advantage are from obviously and easily understanding becoming the description of embodiment below in conjunction with accompanying drawing, wherein:
Fig. 1 is for avoiding the flow chart of the method for data collision in the wireless sense network according to an embodiment of the invention;
Fig. 2 is the schematic diagram of concealed nodes according to an embodiment of the invention;
Fig. 3 sends schematic diagram for data according to an embodiment of the invention;
Fig. 4 is transfer of data schematic diagram according to an embodiment of the invention; And
Fig. 5 is for avoiding the frame diagram of the system of data collision in the wireless sense network according to an embodiment of the invention.
Embodiment
The below describes embodiments of the invention in detail, and the example of embodiment is shown in the drawings, and wherein same or similar label represents same or similar element or the element with identical or similar functions from start to finish.Be exemplary below by the embodiment that is described with reference to the drawings, only be used for explaining the present invention, and can not be interpreted as limitation of the present invention.
Fig. 1 is for avoiding the flow chart of the method for data collision in the wireless sense network according to an embodiment of the invention.As shown in Figure 1, avoid the method for data collision in the wireless sense network according to the embodiment of the invention, may further comprise the steps:
Step S101 sets up routing table to all routing nodes of wireless transmission net.
Fig. 2 is the schematic diagram of concealed nodes according to an embodiment of the invention.As shown in Figure 2, among three node A, B, the C, A and B, B and C can intercom respectively mutually, and node A can not communicate by letter with node C.So just having caused node A is the concealed nodes of node C, and same node C also is node A concealed nodes.When carrying out transfer of data, node A and node C perception then when the two carries out transfer of data simultaneously, will cause the collision of data less than the other side's existence.
Step S102 obtains the neighbor table of each routing node according to routing table.
In one embodiment of the invention, the neighbor table of each routing node comprises the nodal information that carries out the routing node of communication with it, and comprises the data transmitting time of concealed nodes in the nodal information in this neighbor table.
Step S103, obtain on the data transfer path the routing node set of process.
In one embodiment of the invention, obtain to the target that transmits according to routing table and data transfer of data the set of routing node of process.
Step S104 obtains the concealed nodes of sending node in routing node set according to neighbor table.
Fig. 3 sends schematic diagram for data according to an embodiment of the invention.As shown in Figure 3, suppose that route direction is A-〉B-〉C-〉D, and only have B in the neighbor table of A, and A, C, D are arranged in the neighbor table of B, B, D are arranged in the neighbor table of C, B, C are arranged in the neighbor table of D.Because Route establishment mechanism, although B can communicate by letter with D, the father node of B has still been selected C, rather than D.The father node of C is D.Thereby just causing C and D all is concealed nodes of A.
Step S105, the state of judgement concealed nodes.This state is whether the concealed nodes on the data transfer path is in data transmission state.
Step S106, if concealed nodes is the transmission state, sending node carried out the data transmission after then the latency hiding node sent data.
Particularly, node A has obtained neighbor table C, the D of B as shown in Figure 3; And the route of A is A-〉B-〉C-〉D-〉.By more as can be known, C, D are on its path that must pass through, and then A must latency hiding node C and D end of transmission if transmit next packet.(2) B is transferred to C, and in like manner B also has the neighbor table of C and the routing table of B, the then B wait of also must delaying time.(3) time determines.
Step S107, if concealed nodes is in idle condition, then sending node carries out the data transmission immediately.Each data reception node is transmitted the data that receive by the way, reaches the destination until will send data to.
In one embodiment of the invention, packet sends to the other side and receives elapsed time and approximately be: t=t
MSG+ t
ACKAs shown in Figure 4, if need to avoid collision, then A must wait until that all can be sent with the point of its generation collision, could send next packet, and this time is T=3t in Fig. 4, because D also can impact A.Hence one can see that, and when a node need to send packet, it need to check in the neighbor table of its child node, which node must through the path on, suppose that quantity is N, after then it distributed a packet, T=(N+1) * (t at least delayed time
MSG+ t
ACK).And t
MSGCan estimate t according to the speed V of node transmission and the length of a complete packet
MSG=(L
MSG+ L
HEAD+ L
FOOT)/V, wherein, L
MSGExpression message part length, L
HEADExpression head part length, L
FOOTThe length of expression portion, V represents that node sends the speed of data.General message part and portion are fixed values, calculate than being easier to, and head part will comprise the bytes such as lead code (preamble) and synchronization character, are only like this header of real wireless transmission.In like manner, can calculate t
ACK=L
ACK/ V, wherein, L
ACKThe length of expression ACK message.Owing to the time of omiting at the beginning of the above-mentioned data transmitting time of calculating is one, therefore adjusting the data transmitting time T that obtains final concealed nodes by adjusting factor Q
S, T
S=Q* (N+1) * (t
MSG+ t
ACK), wherein, T
SThe data transmitting time of expression concealed nodes, Q represents to dispatch the inverse that the factor is specially the Packet Generation success rate, and N represents natural number, t
MSGThe expression node sends the time that message consumes, t
ACKExpression sends the time that ACK message consumes.Success rate is higher like this, and Q is less; Otherwise, increase Q, time expand.
According to the method for the embodiment of the invention, by being controlled, the data transmission of concealed nodes effectively avoided the collision problem in the data transmission procedure, improved simultaneously data transmission credibility and efficient.
Fig. 5 is for avoiding the frame diagram of the system of data collision in the wireless sense network according to an embodiment of the invention.As shown in Figure 5, avoid the system of data collision to comprise in the wireless sense network according to the embodiment of the invention setting up module 100, the first acquisition module 200, the second acquisition module 300, search module 400, judge module 500, wait for module 600 and sending module 700.
Setting up module 100 is used for all routing nodes of wireless transmission net are set up routing table.
Fig. 2 is the schematic diagram of concealed nodes according to an embodiment of the invention.As shown in Figure 2, among three node A, B, the C, A and B, B and C can intercom respectively mutually, and node A can not communicate by letter with node C.So just having caused node A is the concealed nodes of node C, and same node C also is node A concealed nodes.When carrying out transfer of data, node A and node C perception then when the two carries out transfer of data simultaneously, will cause the collision of data less than the other side's existence.
The first acquisition module 200 is used for obtaining according to routing table the neighbor table of each routing node.
In one embodiment of the invention, the neighbor table of each routing node comprises the nodal information that carries out the routing node of communication with it, and comprises the data transmitting time of concealed nodes in the nodal information in this neighbor table.
The second acquisition module 300 be used for obtaining on the data transfer path the routing node set of process.In one embodiment of the invention, obtain to the target that transmits according to routing table and data transfer of data the set of routing node of process.
Search the concealed nodes that module 400 is used for obtaining in the routing node set according to neighbor table sending node.
Fig. 3 sends schematic diagram for data according to an embodiment of the invention.As shown in Figure 3, suppose that route direction is A-〉B-〉C-〉D, and only have B in the neighbor table of A, and A, C, D are arranged in the neighbor table of B, B, D are arranged in the neighbor table of C, B, C are arranged in the neighbor table of D.Because Route establishment mechanism, although B can communicate by letter with D, the father node of B has still been selected C, rather than D.The father node of C is D.Thereby just causing C and D all is concealed nodes of A.
Judge module 500 is used for judging whether concealed nodes sends state for data.This state is whether the concealed nodes on the data transfer path is in data transmission state.
Wait for that module 600 is used for the latency hiding node and sends data.
Particularly, node A has obtained neighbor table C, the D of B as shown in Figure 3; And the route of A is A-〉B-〉C-〉D-〉.By more as can be known, C, D are on its path that must pass through, and then A must latency hiding node C and D end of transmission if transmit next packet.(2) B is transferred to C, and in like manner B also has the neighbor table of C and the routing table of B, the then B wait of also must delaying time.(3) time determines.
Sending module 700 is used for that sending node is carried out data immediately and sends.Each data reception node is transmitted the data that receive by the way, reaches the destination until will send data to.
In one embodiment of the invention, packet sends to the other side and receives elapsed time and approximately be: t=t
MSG+ t
ACKAs shown in Figure 4, if need to avoid collision, then A must wait until that all can be sent with the point of its generation collision, could send next packet, and this time is T=3t in Fig. 4, because D also can impact A.Hence one can see that, and when a node need to send packet, it need to check in the neighbor table of its child node, which node must through the path on, suppose that quantity is N, after then it distributed a packet, T=(N+1) * (t at least delayed time
MSG+ t
ACK).And t
MSGCan estimate t according to the speed V of node transmission and the length of a complete packet
MSG=(L
MSG+ L
HEAD+ L
FOOT)/V, wherein, L
MSGExpression message part length, L
HEADExpression head part length, L
FOOTThe length of expression portion, V represents that node sends the speed of data.General message part and portion are fixed values, calculate than being easier to, and head part will comprise the bytes such as lead code (preamble) and synchronization character, are only like this header of real wireless transmission.In like manner, can calculate t
ACK=L
ACK/ V, wherein, L
ACKThe length of expression ACK message.Owing to the time of omiting at the beginning of the above-mentioned data transmitting time of calculating is one, therefore adjusting the data transmitting time T that obtains final concealed nodes by adjusting factor Q
S, T
S=Q* (N+1) * (t
MSG+ t
ACK), wherein, T
SThe data transmitting time of expression concealed nodes, Q represents to dispatch the inverse that the factor is specially the Packet Generation success rate, and N represents natural number, t
MSGThe expression node sends the time that message consumes, t
ACKExpression sends the time that ACK message consumes.Success rate is higher like this, and Q is less; Otherwise, increase Q, time expand.
According to the system of the embodiment of the invention, by being controlled, the data transmission of concealed nodes effectively avoided the collision problem in the data transmission procedure, improved simultaneously data transmission credibility and efficient.
Although the above has illustrated and has described embodiments of the invention, be understandable that, above-described embodiment is exemplary, can not be interpreted as limitation of the present invention, those of ordinary skill in the art is not in the situation that break away from principle of the present invention and aim can change above-described embodiment within the scope of the invention, modification, replacement and modification.
Claims (10)
1. avoid the method for data collision in the wireless sense network, it is characterized in that, may further comprise the steps:
S1: all routing nodes to the wireless transmission net are set up routing table;
S2: the neighbor table that obtains each routing node according to described routing table;
S3: obtain on the data transfer path the routing node set of process;
S4: the concealed nodes that in described routing node set, obtains sending node according to described neighbor table;
S5: the state of judging described concealed nodes;
S6: if described concealed nodes is the transmission state, wait for that then described concealed nodes sends after the data described sending node and carries out data and send; And
S7: if described concealed nodes is in idle condition, then described sending node carries out the data transmission immediately.
2. avoid the method for data collision in the wireless sense network according to claim 1, it is characterized in that, the neighbor table of described each routing node comprises the nodal information that carries out the routing node of communication with it.
3. avoid the method for data collision in the wireless sense network according to claim 1 and 2, it is characterized in that, comprise the data transmitting time of concealed nodes in the nodal information in the described neighbor table.
4. avoid the method for data collision in the wireless sense network according to claim 3, it is characterized in that, the data transmitting time T of described concealed nodes
S, calculate by following formula,
T
S=Q*(N+1)*(t
MSG+t
ACK)，
Wherein, T
SThe data transmitting time of expression concealed nodes, Q represents to dispatch the inverse that the factor is specially the Packet Generation success rate, and N represents natural number, t
MSGThe expression node sends the time that message consumes, t
ACKExpression sends the time that ACK message consumes.
5. avoid the method for data collision in the wireless sense network according to claim 4, it is characterized in that, described node sends the time t that message consumes
MSG, calculate by following formula,
t
MSG=(L
MSG+L
HEAD+L
FOOT)/V，
Wherein, L
MSGExpression message part length, L
HEADExpression head part length, L
FOOTThe length of expression portion, V represents that node sends the speed of data.
6. avoid the system of data collision in the wireless sense network, it is characterized in that, comprising:
Set up module, be used for all routing nodes of wireless transmission net are set up routing table;
The first acquisition module is for the neighbor table that obtains each routing node according to described routing table;
The second acquisition module, be used for obtaining on the data transfer path the routing node set of process;
Search module, be used for obtaining in described routing node set according to described neighbor table the concealed nodes of sending node;
Judge module is used for judging whether described concealed nodes sends state for data;
Wait for module, be used for waiting for that described concealed nodes sends data; And
Sending module is used for that described sending node is carried out data immediately and sends.
7. avoid the system of data collision in the wireless sense network according to claim 6, it is characterized in that, the neighbor table of described each routing node comprises the nodal information that carries out the routing node of communication with it.
8. according to claim 6 or avoid the system of data collision in the 7 described wireless sense networks, it is characterized in that, comprise the data transmitting time of concealed nodes in the nodal information in the described neighbor table.
9. avoid the system of data collision in the wireless sense network according to claim 6, it is characterized in that, the data transmitting time T of described concealed nodes
S, calculate by following formula,
T
S=Q*(N+1)*(t
MSG+t
ACK)，
Wherein, T
SThe data transmitting time of expression concealed nodes, Q represents to dispatch the inverse that the factor is specially the Packet Generation success rate, and N represents natural number, t
MSGThe expression node sends the time that message consumes, t
ACKExpression sends the time that ACK message consumes.
10. avoid the system of data collision in the wireless sense network according to claim 9, it is characterized in that, described node sends the time t that message consumes
MSG, calculate by following formula,
t
MSG=(L
MSG+L
HEAD+L
FOOT)/V，
Wherein, L
MSGExpression message part length, L
HEADExpression head part length, L
FOOTThe length of expression portion, V represents that node sends the speed of data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310040874.5A CN103079251B (en) | 2013-01-31 | 2013-01-31 | The method and system of data collision are avoided in wireless sense network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310040874.5A CN103079251B (en) | 2013-01-31 | 2013-01-31 | The method and system of data collision are avoided in wireless sense network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103079251A true CN103079251A (en) | 2013-05-01 |
| CN103079251B CN103079251B (en) | 2015-10-28 |
Family
ID=48155632
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310040874.5A Active CN103079251B (en) | 2013-01-31 | 2013-01-31 | The method and system of data collision are avoided in wireless sense network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103079251B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104980255A (en) * | 2015-06-12 | 2015-10-14 | 厦门大学 | Physical layer network coding package synchronizing method |
| CN108632795A (en) * | 2018-04-10 | 2018-10-09 | 华南理工大学 | A kind of wireless sense network concealed nodes conflict dissemination method |
| CN115002019A (en) * | 2022-06-22 | 2022-09-02 | 中国电信股份有限公司 | Hidden node determination method and device, nonvolatile storage medium and electronic equipment |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070025288A1 (en) * | 2003-05-15 | 2007-02-01 | Yukimasa Nagai | Communication method, radio terminal and base station |
| CN101197826A (en) * | 2007-11-30 | 2008-06-11 | 华南理工大学 | Method for solving problems of multi-jumping wireless self-network grouping concealed terminal and exposed terminal |
| CN102571675A (en) * | 2012-02-07 | 2012-07-11 | 广州市香港科大霍英东研究院 | Method for optimizing hidden terminal based on physical layer interference information |
-
2013
- 2013-01-31 CN CN201310040874.5A patent/CN103079251B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070025288A1 (en) * | 2003-05-15 | 2007-02-01 | Yukimasa Nagai | Communication method, radio terminal and base station |
| CN101197826A (en) * | 2007-11-30 | 2008-06-11 | 华南理工大学 | Method for solving problems of multi-jumping wireless self-network grouping concealed terminal and exposed terminal |
| CN102571675A (en) * | 2012-02-07 | 2012-07-11 | 广州市香港科大霍英东研究院 | Method for optimizing hidden terminal based on physical layer interference information |
Non-Patent Citations (2)
| Title |
|---|
| SABRIEH CHOOBKAR,ET.AL.: "Enhancement of Packetised-Preamble Based MAC Protocols: A Solution to Hidden-Node Problem in WSNs", 《2011 IEEE 22ND INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS》 * |
| 张伟 等: "无线Ad Hoc网络中MAC协议改进策略的研究", 《合肥工业大学学报(自然科学版)》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104980255A (en) * | 2015-06-12 | 2015-10-14 | 厦门大学 | Physical layer network coding package synchronizing method |
| CN104980255B (en) * | 2015-06-12 | 2018-07-24 | 厦门大学 | A kind of method that physical-layer network coding packet synchronizes |
| CN108632795A (en) * | 2018-04-10 | 2018-10-09 | 华南理工大学 | A kind of wireless sense network concealed nodes conflict dissemination method |
| CN115002019A (en) * | 2022-06-22 | 2022-09-02 | 中国电信股份有限公司 | Hidden node determination method and device, nonvolatile storage medium and electronic equipment |
| CN115002019B (en) * | 2022-06-22 | 2024-05-14 | 中国电信股份有限公司 | Hidden node determining method and device, nonvolatile storage medium and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103079251B (en) | 2015-10-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102761931B (en) | Method for carrying out dynamic data transmission in asynchronous duty ratio wireless sensor network | |
| US8203981B2 (en) | Wireless sensor network with linear structure being capable of bidirectional communication and method thereof | |
| CN101801114B (en) | Rapid clustering data transmission method for chain multi-hop wireless sensor network | |
| JP4535380B2 (en) | Data transmission method in wireless sensor network | |
| CN101253781A (en) | Media access control architecture | |
| EP2866395B1 (en) | Maximum transmission unit negotiation method and data terminal | |
| JP2009260911A5 (en) | ||
| CN103906207A (en) | Wireless sensor network data transmission method based on self-adaptation required awakening technology | |
| CN102065575A (en) | Method for constructing mesh and star hybrid topological wireless sensor network based on IEEE 802.15.4 | |
| KR20060096375A (en) | Communication terminal, communication system, communication method and program | |
| CN101674220B (en) | Forwarding history-based asynchronous rooting algorithm | |
| CN106686680B (en) | A kind of route optimization system and method for car networking | |
| CN103079251B (en) | The method and system of data collision are avoided in wireless sense network | |
| US8300756B2 (en) | Intermittent operative communication apparatus adaptively controlling the timing of waiting data reception and a method therefor | |
| CN105050077B (en) | A kind of sub-clustering chain type wireless sensing network data transmission method | |
| CN102083164A (en) | Method for opportunistic routing of wireless sensor network (WSN) based on energy perception | |
| CN104703296A (en) | Link dormancy method for wireless communication multi-hop network link and tree topology structure | |
| CN105227457B (en) | Towards the protocol Data Unit cross-layer optimizing method under DTN dynamic links | |
| KR101638425B1 (en) | A method for signal transmission in the downlink of multi-hop wireless communication systems | |
| CN103702362A (en) | Multichannel operation method in WAVE (wireless access in vehicular environments) system | |
| CN102868507A (en) | Segmented ARQ (Automatic Repeat Request) method based on transmission reliability | |
| CN102595552B (en) | Packet radio network on-demand routing maintenance method based on adaptive dynamic mechanism | |
| KR101104585B1 (en) | Method for Cross-Layered Routing and Transmitting Data in Wireless Sensor Network | |
| KR20090129633A (en) | Data communication method using intelligent mac protocol | |
| Zheng et al. | Cooperative data delivery in sparse cellular-VANET 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 | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |