CN103945413B - Multi-hop data transmission method that cavity is avoided, apparatus and system - Google Patents
Multi-hop data transmission method that cavity is avoided, apparatus and system Download PDFInfo
- Publication number
- CN103945413B CN103945413B CN201410155497.4A CN201410155497A CN103945413B CN 103945413 B CN103945413 B CN 103945413B CN 201410155497 A CN201410155497 A CN 201410155497A CN 103945413 B CN103945413 B CN 103945413B
- Authority
- CN
- China
- Prior art keywords
- node
- neighbor
- hop
- probability
- cavity
- 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.)
- Expired - Fee Related
Links
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
For the wireless sensor network of random placement, broken down due to part of nodes, energy depletion and fail, covering " cavity " can be formed, and the empty presence of covering will cause route break.Therefore avoided the invention provides a kind of cavity multi-hop data transmission method, apparatus and system, this method first deletes the failure node around forward node from neighboring node list, neighbor node set is constituted by communicating good node, the node for selecting empty probability minimum wherein is used as next-hop node.There is the minimum node of empty probability as next-hop node due to have chosen neighbor node, also just as much as possible protect via node not run into route cavity, and then improve the packet of source node to the arrival rate of destination node.
Description
Technical field
The present invention relates to wireless sensor network field, more particularly to a kind of cavity avoid multi-hop data transmission method,
Apparatus and system.
Background technology
Mobile Ad Hoc networks are the distributed wireless multihop networks that a kind of many mobile nodes with routing function are constituted
Network.It is set up temporarily independent of default infrastructure, and mobile node is handed over using the wireless transmitting-receiving equipments of itself in network
Change information, when mobile node each other not in mutual communication context when, can be realized by other intermediate nodes many
Jump communication.One of key issue that mobile Ad Hoc networks face is exactly routing issue, i.e., how rationally high in numerous nodes
Effect ground distributing radio resource, and stable effective route is set up between a source node and a destination node, realize that packet is saved by source
Point is sent to the purpose of destination node.
With the development of location technology, node can easily obtain the geographical location information of oneself, geographical using these
Positional information, can improve the routing performance of mobile Ad Hoc networks, therefore go out class utilization derived from mobile Ad Hoc networks
The method for routing of geographical location information, such as greedy forwarding method for routing.This method refers to node when forwarding packet, from it
A node nearest from destination node is selected in neighbor node, the node is forwarded the packet to.Ideally, this is repeated
Individual process, you can send data packets to destination node.
But in actual application of higher wireless sensor network, because uneven deployment, the part of nodes of node are because event
Barrier, energy depletion and the reason such as fail, can cause a certain intermediate node for receiving packet to can not find in its neighbor node
Than the intermediate node from destination node closer to node as next-hop when, the intermediate node by select oneself be used as packet
Next-hop, such packet can not reach destination node.This node is referred to as void node, the part area of the coverage
Domain forms route cavity.
Therefore hole region can be avoided by needing a kind of method now, packet is sent by source node to purpose section
Point.
The content of the invention
The invention provides the multi-hop data transmission method that a kind of cavity is avoided, hole area can be avoided using this method
Domain, enables data to be sent by source node to destination node.
To achieve these goals, the invention provides following technological means：
The multi-hop data transmission method that a kind of cavity is avoided, including：
To multiple neighbor node broadcast HELLO bags around；
If not receiving the HELLO bags from neighbor node in preset time, by the neighbor node from target base
Deleted in node listing；
According to neighboring node list formation neighbor node set；
Calculate the empty probability that each node in the neighbor node set is void node；
The minimum node of the empty probability of selection is used as next-hop node.
The calculation of empty probability includes：
Using formulaCalculate the mesh
Marking each node in neighbor node set turns into the probability P of void nodei, wherein, liBe between node i and destination node away from
From i=1,2,3 ... M, M<N, R are the communication radius of node, and a is the radius of detection zone.
It is preferred that, also include：
The distance between each node and destination node in the neighbor node set are calculated, the distance and empty probability is taken
Associated value it is minimum when corresponding node be used as next-hop node.
It is preferred that, the combination of the distance between node and empty probability includes：
The product value of the distance between described node and the empty probability.
It is preferred that, the position coordinates of each node is beforehand through GPS or LBS（Location Based service Location
Based Service, LBS）Obtain.
The neighbor node number included around each node is not known.
The multi-hop data transmitting device that a kind of cavity is avoided, including：
Radio unit, for broadcasting HELLO bags to multiple neighbor nodes around；
Processing unit, if for not receiving the HELLO bags from neighbor node in preset time, the neighbours are saved
Point is deleted from neighboring node list；
Set forms unit, for according to neighboring node list formation neighbor node set；
Probability calculation unit, for calculating the empty probability that each node in the neighbor node set is void node；
Select unit, for selecting the minimum node of empty probability as next-hop node.
It is preferred that, also include：
Metrics calculation unit, calculates the distance between each node and destination node in the neighbor node set；
Select unit, corresponding node conduct when being additionally operable to take the distance between node and the minimum associated value of empty probability
Next-hop node.
The multi-hop data Transmission system that a kind of cavity is avoided, including：
Source node, destination node and multiple intermediate nodes；
Wherein, the multi-hop data transmission method that the source node and the intermediate node are avoided according to above-mentioned cavity is selected
Next-hop node, until reaching destination node.
The multi-hop data transmission method that cavity is avoided, the source node includes the multi-hop data transmission that above-mentioned cavity is avoided
Device, the intermediate node includes the device for the multi-hop data transmission that above-mentioned cavity is avoided.
The invention provides the multi-hop data transmission method that a kind of cavity is avoided, this method is first by around via node
Failure node is deleted from its neighboring node list, neighbor node set is constituted by communicating good node, in neighbor node set
The minimum node of the middle empty probability of selection is used as next-hop node.Because there is sky in the neighbor node that have chosen object relay node
Probability minimum node in hole also just as much as possible protects via node not run into route cavity as next-hop node, and then
The packet of source node is improved to the arrival rate of destination node.
Brief description of the drawings
In order to illustrate more clearly about the embodiment of the present invention or technical scheme of the prior art, below will be to embodiment or existing
The accompanying drawing to be used needed for having technology description is briefly described, it should be apparent that, drawings in the following description are only this
Some embodiments of invention, for those of ordinary skill in the art, on the premise of not paying creative work, can be with
Other accompanying drawings are obtained according to these accompanying drawings.
Fig. 1 is the flow chart for the multi-hop data transmission method that cavity disclosed in the embodiment of the present invention is avoided；
Fig. 2 is the flow chart for the multi-hop data transmission method that another cavity disclosed in the embodiment of the present invention is avoided；
Fig. 3 is the node-node transmission schematic diagram for the multi-hop data transmission method that cavity disclosed in the embodiment of the present invention is avoided；
Fig. 4 is the flow chart for the multi-hop data transmission method that another cavity disclosed in the embodiment of the present invention is avoided；
Fig. 5 is the structural representation for the multi-hop data transmitting device that cavity disclosed in the embodiment of the present invention is avoided；
Fig. 6 is the structural representation for the multi-hop data transmitting device that another cavity disclosed in the embodiment of the present invention is avoided.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is carried out clear, complete
Site preparation is described.Based on the embodiment in the present invention, those of ordinary skill in the art institute under the premise of creative work is not made
The every other embodiment obtained, belongs to the scope of protection of the invention.
The invention provides the multi-hop data transmission method that a kind of cavity is avoided, as shown in figure 1, this method includes following step
Suddenly：
During the middle packet of sensor network is by source node to destination node, it is necessary to multiple via nodes it is auxiliary
Help, the present embodiment is exemplified by one in multiple via nodes, and the implementation procedure of other via nodes is similar.Below to relay section
The present invention is described in detail exemplified by point.
Step S101：To multiple neighbor node broadcast HELLO bags around；
There are multiple neighbor nodes around via node, the title of multiple neighbor nodes is stored in the form of neighboring node list
In node, it is necessary to send data packets to neighbor node after via node received data packet, in order to verify that neighbor node is
It is no to have failed, it is necessary to periodically send HELLO bags to neighbor node.
There are multiple neighbor nodes around via node, because the node in sensor network is random placement, therefore often
The quantity of neighbor node around individual intermediate node is uncertain.
Step S102：If not receiving the HELLO bags from neighbor node in preset time, by the neighbor node from
Deleted in neighboring node list；
When neighbor node is operated in normal condition, neighbor node is received after HELLO bags in preset time, can be to relaying
Node feeding back HELLO bags, if neighbor node does not feed back HELLO bags, show that the neighbor node has failed.Packet is affirmed
It will not send to failure node, subsequent treatment, the neighbor node of failure is deleted from neighboring node list for convenience, it is only surplus
The good neighbor node of lower communication.
Step S103：According to neighboring node list formation target base node set；
Good neighbor node will be communicated in neighboring node list and constitutes neighbor node set, in order to which subsequent treatment makes
With.
Step S104：Calculate the empty probability that each node in the neighbor node set is void node；
It is preferred that, using formulaCalculate
Each node turns into the probability P of void node in the neighbor node seti, wherein, liIt is between node i and destination node
Distance, i=1,2,3 ... M, M<N, R are the communication radius of node, and a is the radius of detection zone.
Step S105：The node for selecting empty probability minimum in the neighbor node set is used as next-hop node.
There is empty probability for each node in neighbor node set to be calculated, and obtain empty general by contrast
The minimum node of rate, using the node as via node next-hop node.Next-hop node continues to carry out according to above-mentioned steps
Processing, sends to destination node until by the packet of source node.
The invention provides the multi-hop data transmission method that a kind of cavity is avoided, this method is first by around intermediate node
Failure node is deleted, and target base node set is constituted by communicating good node, and empty probability is selected in neighbor node set
Minimum node is used as next-hop node.There is the minimum node work of empty probability due to have chosen the neighbor node of via node
For next-hop node, intermediate node is also just as much as possible protected not run into route cavity, and then improve the data of source node
Wrap to the arrival rate of destination node.
On the basis of above-described embodiment, present invention also offers another embodiment, the substantially step of the present embodiment
Suddenly it is consistent with Fig. 1, it is slightly different after step s 104, as shown in Fig. 2 for being described in detail after step S104, this
Embodiment includes：
Step S201：Calculate each purpose distance between node and destination node in the neighbor node set；
It is preferred that, using formulaPurpose between each node and destination node away from
From wherein i=1,2,3 ... M, M<N,（Xi, Yi）For the position coordinates of node i,（X0, Y0）For the position coordinates of purpose node；
Step S202：Corresponding node is as next-hop when taking the distance between node and the minimum associated value of empty probability
Node.
It is preferred that, the product value of the distance between described node and the empty probability.
If only according to foundation of the beeline as next-hop, it is possible that route cavity, if only with empty general
The minimum foundation as next-hop of rate, then can it is possible that by it is relatively remote, take a long time and carry out the forwarding of packet,
Therefore embodiment is weighed to both, takes the corresponding node of minimum value of both combinations, the node and destination node it
Between it is closer to the distance, and occur cavity empty probability it is smaller.
For clear statement the above, as shown in figure 3, the present invention is illustrated using instantiation：
As shown in figure 3, the size that the neighbours for setting each node collect is 6, the node for the failure that solid circles are represented.Node O1
" route cavity " is encountered, node O2 also encounters route cavity, when node S sends information to Sink node, three can be used
The mode of kind：
The first：Select the minimum node of nodal distance destination node distance as next-hop, then node S is to node J's
Path is S-A-O1--B-O2-E-F-G-H-I-J.
Second：The minimum node of the empty probability of selection is S-A-B-D-S1- as next-hop, then node S to J path
S2-S3-S4-S5-S6-S7-S8-J。
The third：Corresponding node is as next-hop node when taking the associated value of purpose distance and empty probability minimum, such as
Really then node S to J path is S-A--B-D-E-F-G-H-I-J.Obviously because it is contemplated that prior notice cavity message and
Empty probability and distance are combined, so path length can be shorter, energy is delayed and has saved so as to reduce.
In the present embodiment on the less basis of empty probability, the node nearer apart from destination node is have selected under
One jumps, so that packet sends packet with shorter distance, highest accuracy rate.
In order to it is clear introduce the present invention, a kind of specific embodiment is provided below, as shown in figure 4, the present embodiment include with
Lower step：
The present embodiment includes N number of node so that certain Radius is a detection zone as an example in detection zone, each node leads to
Cross location-based service and obtain the positional information of oneself, the coordinate of positional information is（X, Y）, the communication radius of each node is R, purpose
Node D is located at the center of detection zone, and destination node D coordinates are（X0, Y0）.
It is preferred that, the position coordinates of each node is beforehand through GPS or LBS（Location Based service Location
Based Service, LBS）Obtain.In addition 6 neighbor nodes are included in the present embodiment around each node.Using node I as
Include 6 neighbor nodes, I around target intermediate node, node I1、I2、I3、I4、I5、I6。
Step S301：To multiple neighbor node broadcast HELLO bags around；That is node I is broadcasted to 6 neighbor nodes around
HELLO bags.
Step S302：If not receiving the HELLO bags from neighbor node in preset time, by the neighbor node from
Deleted in target base node listing；
With I3、I4Exemplified by failure node, I3、I4HELLO bags are not fed back to node I.Remaining node all feeds back to node I
HELLO bags.Then by I3、I4Deleted in target base node listing, I is only included in the neighboring node list for deleting posterior nodal point I1、
I2、I5、I6。
Step S303：According to target base node listing formation target base node set；
According to I1、I2、I5、I6Target base node set Neighbor-Set (i) is formed, is formed after set and rearranged
Neighbor node, Neighbor-Set (i), i=1,2,3 ... M, M<M=4, N=6 in N, the present embodiment.
Step S304：Calculate each purpose distance between node and destination node in the target base node set；
Calculate the distance between each node i and destination node l in the target base node seti,Wherein i=1,2,3 ... M, M<N,（Xi, Yi）For the position coordinates of node i,（X0, Y0）For
The position coordinates of destination node；
Step S305：Calculate the empty probability that each node in the target base node set is void node；
Using formulaCalculate the neighbour
Occupying each node in node set turns into the probability P of void nodei, wherein, liIt is the distance between node i and destination node, i=
1st, 2,3 ... M, M<N, R are the communication radius of node, and a is the radius of detection zone.
Step S306：Take liPiCorresponding node i is used as next-hop node when product value is minimum.
As shown in figure 5, present invention also offers the multi-hop data transmitting device that a kind of cavity is avoided, including：
Radio unit 100, for broadcasting HELLO bags to multiple neighbor nodes around；
Processing unit 200, if for not receiving the HELLO bags from neighbor node in preset time, by the neighbour
Node is occupied to delete from target base node listing；
Set forms unit 300, for according to neighboring node list formation neighbor node set；
Probability calculation unit 400, for calculating the sky that each node in the target base node set is void node
Hole probability；
Select unit 500, for selecting the minimum node of empty probability as next-hop node.
As shown in fig. 6, invention further provides the multi-hop data transmitting device that a kind of cavity is avoided, including：
Metrics calculation unit 600, calculate in the neighbor node set each purpose between node and destination node away from
From；
Select unit 500, corresponding node is made when the distance and the minimum associated value of empty probability that are additionally operable to take between node
For next-hop node.
Present invention also offers the multi-hop data Transmission system that a kind of cavity is avoided, including：
Source node, destination node and multiple intermediate nodes；
Wherein, the source node and the intermediate node be according to the method choice next-hop node as described in Fig. 1 or Fig. 2,
Until reaching destination node.
The source node includes the device as described in Fig. 4 or Fig. 5, and the intermediate node includes the dress as described in Fig. 4 or Fig. 5
Put.
The embodiment of each in this specification is described by the way of progressive, what each embodiment was stressed be with it is other
Between the difference of embodiment, each embodiment same or similar part mutually referring to.
The foregoing description of the disclosed embodiments, enables professional and technical personnel in the field to realize or using the present invention.
A variety of modifications to these embodiments will be apparent for those skilled in the art, as defined herein
General Principle can be realized in other embodiments without departing from the spirit or scope of the present invention.Therefore, it is of the invention
The embodiments shown herein is not intended to be limited to, and is to fit to and principles disclosed herein and features of novelty phase one
The most wide scope caused.
Claims (9)
1. the multi-hop data transmission method that a kind of cavity is avoided, it is characterised in that including：
To multiple neighbor node broadcast HELLO bags around；
If not receiving the HELLO bags from neighbor node in preset time, by the neighbor node from neighboring node list
It is middle to delete；
According to neighboring node list formation neighbor node set；
Calculate the empty probability that each node in the neighbor node set is void node；
The minimum node of the empty probability of selection is used as next-hop node；
Wherein, the calculation of empty probability includes：
Using formulaCalculate neighbours' section
Each node turns into the probability P of void node in point seti, wherein, liThe distance between be node i with destination node, i=1,
2nd, 3 ... M, M<N, R are the communication radius of node, and a is the radius of detection zone；Include N number of node, Lin Jujie in detection zone
Point set includes M node.
2. the method as described in claim 1, it is characterised in that also include：
The distance between each node and destination node in the neighbor node set are calculated, by this distance and the knot of empty probability
Corresponding node is used as next-hop node when conjunction value is minimum.
3. method as claimed in claim 2, it is characterised in that distance and the associated value of empty probability include：
Distance and the product value of the empty probability.
4. method as claimed in claim 2, it is characterised in that the position coordinates of each node is beforehand through GPS or LBS (bases
Service Location Based Service, LBS in position) obtain.
5. the method as described in claim 1, it is characterised in that the neighbor node number included around each node is not known.
6. the multi-hop data transmitting device that a kind of cavity is avoided, it is characterised in that including：
Radio unit, for broadcasting HELLO bags to multiple neighbor nodes around；
Processing unit, if for not receiving the HELLO bags from neighbor node in preset time, by the neighbor node from
Deleted in target base node listing；
Set forms unit, for according to target base node listing formation neighbor node set；
Probability calculation unit, for calculating the empty probability that each node in the target base node set is void node；
Select unit, for selecting the minimum node of empty probability as next-hop node；
Wherein, the calculation of empty probability includes：
Using formulaCalculate neighbours' section
Each node turns into the probability P of void node in point seti, wherein, liThe distance between be node i with destination node, i=1,
2nd, 3 ... M, M<N, R are the communication radius of node, and a is the radius of detection zone；Include N number of node, Lin Jujie in detection zone
Point set includes M node.
7. device as claimed in claim 6, it is characterised in that also include：
Metrics calculation unit, calculates the distance between each node and destination node in the neighbor node set；
Select unit, is additionally operable to regard corresponding node when distance and the minimum associated value of empty probability as next-hop node.
8. the multi-hop data Transmission system that a kind of cavity is avoided, it is characterised in that including：
Source node, destination node and multiple intermediate nodes；
Wherein, the source node and the intermediate node select next-hop node according to the method as described in claim 1, until
Reach destination node.
9. system as claimed in claim 8, it is characterised in that the source node includes dress as claimed in claims 6 or 7
Put, the intermediate node includes device as claimed in claims 6 or 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410155497.4A CN103945413B (en) | 2014-04-17 | 2014-04-17 | Multi-hop data transmission method that cavity is avoided, apparatus and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410155497.4A CN103945413B (en) | 2014-04-17 | 2014-04-17 | Multi-hop data transmission method that cavity is avoided, apparatus and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103945413A CN103945413A (en) | 2014-07-23 |
| CN103945413B true CN103945413B (en) | 2017-07-14 |
Family
ID=51192844
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410155497.4A Expired - Fee Related CN103945413B (en) | 2014-04-17 | 2014-04-17 | Multi-hop data transmission method that cavity is avoided, apparatus and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103945413B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105722174B (en) * | 2016-02-01 | 2023-05-26 | 国网新疆电力公司电力科学研究院 | Node link scheduling method in heterogeneous fusion electricity information acquisition network |
| CN107135108A (en) * | 2017-05-25 | 2017-09-05 | 深圳市伊特利网络科技有限公司 | The update method and system of network connection list |
| WO2018214106A1 (en) * | 2017-05-25 | 2018-11-29 | 深圳市伊特利网络科技有限公司 | Update method and system for network connection list |
| CN107172615B (en) * | 2017-07-25 | 2019-11-05 | 中国信息安全测评中心 | A kind of data transmission method of network node, device, network node and system |
| CN110493841B (en) * | 2019-07-31 | 2022-09-30 | 西北工业大学 | Underwater acoustic sensor network routing implementation method |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101808384A (en) * | 2010-03-25 | 2010-08-18 | 中国电信股份有限公司 | Wireless sensor network, routing method and node equipment |
| CN102665252A (en) * | 2012-06-05 | 2012-09-12 | 重庆大学 | Routing void processing method for wireless sensing network geographical position |
| US8909392B1 (en) * | 2010-06-24 | 2014-12-09 | Rockwell Collins, Inc. | System and method to automatically preselect an aircraft radio communication frequency |
-
2014
- 2014-04-17 CN CN201410155497.4A patent/CN103945413B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101808384A (en) * | 2010-03-25 | 2010-08-18 | 中国电信股份有限公司 | Wireless sensor network, routing method and node equipment |
| US8909392B1 (en) * | 2010-06-24 | 2014-12-09 | Rockwell Collins, Inc. | System and method to automatically preselect an aircraft radio communication frequency |
| CN102665252A (en) * | 2012-06-05 | 2012-09-12 | 重庆大学 | Routing void processing method for wireless sensing network geographical position |
Non-Patent Citations (1)
| Title |
|---|
| 无线传感器网络贪婪转发策略中的路由空洞问题;田乐;《电子与信息学报》;20071231;第29卷(第12期);第2996-3000页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103945413A (en) | 2014-07-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7573858B2 (en) | Ad-hoc network for transmitting packets to plural target regions and packet transmission method thereof | |
| CN103945413B (en) | Multi-hop data transmission method that cavity is avoided, apparatus and system | |
| US8787257B2 (en) | Network communication system, node device, routing method and routing program | |
| US8064377B2 (en) | Method for enhancement of multicasting forwarding protocol in a wireless network | |
| Wang et al. | A stable weight-based on-demand routing protocol for mobile ad hoc networks | |
| CN102264114B (en) | ZigBee sensor network tree route low-expense optimization method | |
| CN106231646B (en) | A kind of wireless chain multi-hop cross-layer method of timeslot multiplex | |
| CN102413542B (en) | Wireless mesh network routing method and wireless mesh network | |
| JP5812917B2 (en) | Method for discovering multiple routes in a multi-hop network and node for searching for multiple routes | |
| JP2012095235A5 (en) | ||
| CN105744587A (en) | Data transmission method and device for linear wireless sensor network | |
| KR20160083093A (en) | Method, device and system for controlling link in cooperative communication | |
| JP5875696B2 (en) | Data distribution system, distribution device, terminal device, and data distribution method | |
| CN102378265B (en) | Control method for alleviating congestion of wireless sensor network (WSN) | |
| CN101459947B (en) | Cross-layer routing method based on position information | |
| KR102608190B1 (en) | Routing apparatus and method for a mobile ad-hoc | |
| Lee et al. | Radio-disjoint geographic multipath routing for reliable data transfer in lossy WSNs | |
| Zhang et al. | PCAR: A power controlled routing protocol for wireless ad hoc networks | |
| CN103874162B (en) | A kind of downhole wireless sensing network routing method on demand | |
| Jung et al. | Localized disjoint multipath routing protocol in irregular wireless sensor networks | |
| Gupta et al. | Anchor Based Geographical Routing in WSN | |
| Ahire et al. | ECORMAN: Extended cooperative opportunistic routing scheme (CORMAN) with efficient MAC base channel reuse technique for mobile ad hoc network (MANET) | |
| KR101061622B1 (en) | Multicasting method based on the position of node in wireless network | |
| Thongthavorn et al. | A study on overhead reduction for GPS-assisted mobile ad-hoc networks | |
| Sun et al. | A new bandwidth-efficient multicast routing scheme for mobile 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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20170714 Termination date: 20200417 |