CN108092894B - Routing method and routing node selection device for wireless network - Google Patents
Routing method and routing node selection device for wireless network Download PDFInfo
- Publication number
- CN108092894B CN108092894B CN201711427579.XA CN201711427579A CN108092894B CN 108092894 B CN108092894 B CN 108092894B CN 201711427579 A CN201711427579 A CN 201711427579A CN 108092894 B CN108092894 B CN 108092894B
- Authority
- CN
- China
- Prior art keywords
- node
- data
- condition parameter
- data source
- link condition
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/302—Route determination based on requested QoS
- H04L45/306—Route determination based on the nature of the carried application
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/248—Connectivity information update
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a routing method for a wireless network, which comprises the following steps: transmitting, by the data sink node, a broadcast message including information for updating the routing information; receiving, by the one or more second nodes, the broadcast message and determining a number of hops from the one or more second nodes to the data sink node based on the broadcast message; classifying, by the data source node, neighbor nodes of the data source node into a first class node, a second class node, and a third class node based on hop counts from one or more second nodes to the data sink node; calculating, by the data source node, a first link condition parameter, when the first link condition parameter is greater than a first threshold, performing the following: acquiring the priority of data to be transmitted by a data source node; when the first link condition parameter is less than the first threshold, performing the following: selecting a next hop node from the neighbor node by the data source node, and updating the first link condition parameter; and transmitting, by the data source node, data to be transmitted to the selected next hop node.
Description
Technical Field
The present invention relates to the field of wireless communications, and in particular, to a routing method and a routing node selection apparatus for a wireless network.
Background
With the rapid development and the increasing maturity of technologies such as wireless communication, integrated circuits, microelectronic systems, and the like, the mass production of low-cost, low-power consumption, multifunctional micro sensors becomes possible. These sensors typically integrate multiple functions of information acquisition, data processing, wireless communication, etc. within a small volume. The Wireless Sensor Network (WSN) is a multi-strip ad hoc Network system formed by radio communication of a large number of miniature Sensor nodes deployed in a monitoring area, and can realize data acquisition, quantization, processing, fusion and transmission. The system integrates advanced technologies such as a microelectronic technology, an embedded computing technology, a modern network and wireless communication technology, a distributed processing technology and the like, can cooperatively monitor and sense information of various environments or monitored objects in a network coverage area, processes the information, and transmits the processed information in a wireless mode and transmits the processed information to an observer in an ad hoc multi-hop network mode.
Due to the limitation of the transmitting power and the wireless communication distance of the wireless sensor network nodes, the coverage range of the cluster nodes is limited, and when the nodes communicate with the nodes in the coverage range, the single hop can realize mutual communication between the nodes; when the node needs to communicate with other nodes outside the coverage range of the cluster, multi-hop forwarding through an intermediate node is needed, so that the wireless sensor network is a multi-hop mode network, multi-hop is the basis for researching a routing protocol, and different from multi-hop routing of a fixed network, the multi-hop routing in the wireless sensor network is completed by a flexible network node instead of a special routing device.
In order to improve the QoS of the wireless sensor network, the prior art proposes many routing node selection methods, which have the following defects: when selecting the next hop node, the priority of each data packet is not considered, resulting in that all data packets get the same service, which cannot meet the requirements of some services requiring low latency.
The information disclosed in this background section is only for enhancement of understanding of the general background of the invention and should not be taken as an acknowledgement or any form of suggestion that this information forms the prior art already known to a person skilled in the art.
Disclosure of Invention
The present invention is directed to a routing method and a routing node selection apparatus for a wireless network, so as to overcome the disadvantages of the prior art.
To achieve the above object, the present invention provides a routing method for a wireless network, the routing method comprising: transmitting, by a data sink node, a broadcast message, wherein the broadcast message includes information for updating routing information; receiving, by the one or more second nodes, the broadcast message and determining a number of hops from the one or more second nodes to the data sink node based on the broadcast message; classifying, by the data source node, neighbor nodes of the data source node into a first class node, a second class node, and a third class node based on hop counts from one or more second nodes to the data sink node; calculating, by the data source node, a first link condition parameter, when the first link condition parameter is greater than a first threshold, performing the following: acquiring the priority of data to be transmitted by a data source node; when the priority of the data to be sent is greater than the second threshold, the data source node selects a next hop node from the first class of nodes and updates the first link condition parameter; when the priority of the data to be sent is smaller than a second threshold, the data source node selects a next hop node from the second class node or the third class node and updates the first link condition parameter; when the first link condition parameter is less than the first threshold, performing the following: selecting a next hop node from the neighbor node by the data source node, and updating the first link condition parameter; and transmitting, by the data source node, data to be transmitted to the selected next hop node.
Preferably, in the above technical solution, the hop count from each node in the first class of nodes to the data sink node is one less than the hop count from the data source node to the data sink node, the hop count from each node in the second class of nodes to the data sink node is the same as the hop count from the data source node to the data sink node, and the hop count from each node in the third class of nodes to the data sink node is one more than the hop count from the data source node to the data sink node.
Preferably, in the above technical solution, the first link condition parameter is calculated by the following formula:
wherein A isiIndicating the probability of a certain data packet arriving at the data sink node, esIndicates the channel error rate, hnRepresenting the number of hops to reach the data sink node.
Preferably, in the above technical solution, the updating of the first link condition parameter is implemented by the following formula:
wherein A isiIndicating the probability of a certain data packet arriving at the data sink node, esIndicates the channel error rate, hnRepresenting the number of hops to reach the data sink node.
Preferably, in the above technical solution, when the first link condition parameter is greater than the total number of neighboring nodes, the method includes: when the first link condition parameter is greater than the first threshold, performing the following: acquiring the priority of data to be transmitted by a data source node; copying data to be transmitted by a data source node to obtain a plurality of data to be transmitted; when the priority of the data to be sent is greater than the second threshold, the data source node selects a next hop node from the first class of nodes and updates the first link condition parameter; when the priority of the data to be sent is smaller than a second threshold, the data source node selects a next hop node from the second class node or the third class node and updates the first link condition parameter; when the first link condition parameter is less than the first threshold, performing the following: copying data to be transmitted by a data source node to obtain a plurality of data to be transmitted; selecting a next hop node from the neighbor node by the data source node, and updating the first link condition parameter; and transmitting, by the data source node, a plurality of data to be transmitted to the selected next hop node.
The invention also provides a routing node selection device for a wireless network, comprising: means for transmitting a broadcast message, wherein the broadcast message includes information for updating routing information; means for receiving the broadcast message and determining a hop count of the one or more second nodes to the data sink node based on the broadcast message; means for classifying neighbor nodes of the data source node as a first class node, a second class node, and a third class node based on hop counts of one or more second nodes to the data sink node; means for calculating a first link condition parameter, when the first link condition parameter is greater than a first threshold: acquiring the priority of data to be transmitted by a data source node; when the priority of the data to be sent is greater than the second threshold, the data source node selects a next hop node from the first class of nodes and updates the first link condition parameter; when the priority of the data to be sent is smaller than a second threshold, the data source node selects a next hop node from the second class node or the third class node and updates the first link condition parameter; means for performing the following when the first link condition parameter is less than a first threshold: selecting a next hop node from the neighbor node by the data source node, and updating the first link condition parameter; and means for transmitting data to be transmitted to the selected next hop node.
Preferably, in the above technical solution, the hop count from each node in the first class of nodes to the data sink node is one less than the hop count from the data source node to the data sink node, the hop count from each node in the second class of nodes to the data sink node is the same as the hop count from the data source node to the data sink node, and the hop count from each node in the third class of nodes to the data sink node is one more than the hop count from the data source node to the data sink node.
Preferably, in the above technical solution, the first link condition parameter is calculated by the following formula:
wherein A isiIndicating the probability of a certain data packet arriving at the data sink node, esIndicates the channel error rate, hnRepresenting the number of hops to reach the data sink node.
Preferably, in the above technical solution, the updating of the first link condition parameter is implemented by the following formula:
wherein A isiIndicating the probability of a certain data packet arriving at the data sink node, esIndicates the channel error rate, hnRepresenting the number of hops to reach the data sink node.
Preferably, in the above technical solution, the routing node selecting apparatus further includes: means for performing the following when the first link condition parameter is greater than the total number of neighbor nodes: when the first link condition parameter is greater than the first threshold, performing the following: acquiring the priority of data to be transmitted by a data source node; copying data to be transmitted by a data source node to obtain a plurality of data to be transmitted; when the priority of the data to be sent is greater than the second threshold, the data source node selects a next hop node from the first class of nodes and updates the first link condition parameter; when the priority of the data to be sent is smaller than a second threshold, the data source node selects a next hop node from the second class node or the third class node and updates the first link condition parameter; when the first link condition parameter is less than the first threshold, performing the following: copying data to be transmitted by a data source node to obtain a plurality of data to be transmitted; selecting a next hop node from the neighbor node by the data source node, and updating the first link condition parameter; and transmitting, by the data source node, a plurality of data to be transmitted to the selected next hop node.
Compared with the prior art, the invention has the following beneficial effects: 1. the invention takes into account the priority requirements of the data packets; 2. in the case of considering each priority packet, the channel condition is also considered in combination, and when the channel condition is poor, it is meaningless to perform different processing on different data packets based on the priority, and in this case, in order to reduce the operation burden of the system, the priority is no longer selected for each packet according to the priority.
Drawings
FIG. 1 is a schematic diagram of a method according to an embodiment of the invention.
Detailed Description
The following detailed description of the present invention is provided in conjunction with the accompanying drawings, but it should be understood that the scope of the present invention is not limited to the specific embodiments.
Throughout the specification and claims, unless explicitly stated otherwise, the word "comprise", or variations such as "comprises" or "comprising", will be understood to imply the inclusion of a stated element or component but not the exclusion of any other element or component. The concrete manufacturing method of the wall and the heat-insulating layer is a method known in the field. Each adhesive layer may be, for example, an epoxy adhesive.
Example 1
FIG. 1 is a schematic diagram of a method according to an embodiment of the invention. As shown in the figure, the method of the present invention comprises the steps of:
step 101: transmitting, by a data sink node, a broadcast message, wherein the broadcast message includes information for updating routing information;
step 102: receiving, by the one or more second nodes, the broadcast message and determining a number of hops from the one or more second nodes to the data sink node based on the broadcast message;
step 103: classifying, by the data source node, neighbor nodes of the data source node into a first class node, a second class node, and a third class node based on hop counts from one or more second nodes to the data sink node;
step 104: calculating a first link condition parameter by the data source node,
step 105: when the first link condition parameter is greater than the first threshold, performing the following: acquiring the priority of data to be transmitted by a data source node; when the priority of the data to be sent is greater than the second threshold, the data source node selects a next hop node from the first class of nodes and updates the first link condition parameter; when the priority of the data to be sent is smaller than a second threshold, the data source node selects a next hop node from the second class node or the third class node and updates the first link condition parameter;
step 106: when the first link condition parameter is less than the first threshold, performing the following: selecting a next hop node from the neighbor node by the data source node, and updating the first link condition parameter; and transmitting, by the data source node, data to be transmitted to the selected next hop node.
Of course, in order to finally select the routing path successfully, after the data source node sends the data to be sent to the selected next-hop node, the step 103 and 106 are executed again with the selected next-hop node as the source node.
Example 2
The hop count from each node in the first class of nodes to the data sink node is less than the hop count from the data source node to the data sink node by one, the hop count from each node in the second class of nodes to the data sink node is the same as the hop count from the data source node to the data sink node, and the hop count from each node in the third class of nodes to the data sink node is more than the hop count from the data source node to the data sink node by one. Specifically, under normal conditions, a high-priority data packet selects a first-class node, the first-class node is closer to the sink node, and the QoS requirement of the high-priority data packet is compounded.
Example 3
The first link condition parameter is calculated by the following formula:
wherein A isiIndicating the probability of a certain data packet arriving at the data sink node, esIndicates the channel error rate, hnRepresenting the number of hops to reach the data sink node. Specifically, AiAnd is also a parameter related to the priority of the data packet, and the higher the priority of the data packet is, the higher the probability that the data packet arrives at the sink node is.
Example 4
Updating the first link condition parameter is accomplished by the following equation:
wherein A isiIndicating the probability of a certain data packet arriving at the data sink node, esIndicates the channel error rate, hnRepresenting the number of hops to reach the data sink node.
Example 5
The invention also provides a routing node selection device for a wireless network, comprising: means for transmitting a broadcast message, wherein the broadcast message includes information for updating routing information; means for receiving the broadcast message and determining a hop count of the one or more second nodes to the data sink node based on the broadcast message; means for classifying neighbor nodes of the data source node as a first class node, a second class node, and a third class node based on hop counts of one or more second nodes to the data sink node; means for calculating a first link condition parameter, when the first link condition parameter is greater than a first threshold: acquiring the priority of data to be transmitted by a data source node; when the priority of the data to be sent is greater than the second threshold, the data source node selects a next hop node from the first class of nodes and updates the first link condition parameter; when the priority of the data to be sent is smaller than a second threshold, the data source node selects a next hop node from the second class node or the third class node and updates the first link condition parameter; means for performing the following when the first link condition parameter is less than a first threshold: selecting a next hop node from the neighbor node by the data source node, and updating the first link condition parameter; and means for transmitting data to be transmitted to the selected next hop node.
Example 6
The routing node selection apparatus further includes: means for performing the following when the first link condition parameter is greater than the total number of neighbor nodes: when the first link condition parameter is greater than the first threshold, performing the following: acquiring the priority of data to be transmitted by a data source node; copying data to be transmitted by a data source node to obtain a plurality of data to be transmitted; when the priority of the data to be sent is greater than the second threshold, the data source node selects a next hop node from the first class of nodes and updates the first link condition parameter; when the priority of the data to be sent is smaller than a second threshold, the data source node selects a next hop node from the second class node or the third class node and updates the first link condition parameter; when the first link condition parameter is less than the first threshold, performing the following: copying data to be transmitted by a data source node to obtain a plurality of data to be transmitted; selecting a next hop node from the neighbor node by the data source node, and updating the first link condition parameter; and transmitting, by the data source node, a plurality of data to be transmitted to the selected next hop node.
Example 7
The various modules and circuits described in connection with the invention may be implemented with a general purpose processor, an application specific integrated circuit, a field programmable gate array or discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general-purpose processor may be a microprocessor, which may be any commercially available processor, controller, microcontroller or state machine. The processor may be responsible for managing the bus and general processing, including the execution of software stored on a machine-readable medium. The processor may be implemented with one or more general-purpose and/or special-purpose processors. Software shall be construed broadly to mean instructions, data, or any combination thereof, whether referred to as software, firmware, middleware, microcode, hardware description language, or otherwise. By way of example, the machine-readable medium may comprise RAM, flash memory, ROM, PROM, EPROM, EEPROM, registers, magnetic disk, optical disk, or any combination thereof. In a hardware implementation, the machine-readable medium may be part of a processing system that is separate from the processor.
The foregoing descriptions of specific exemplary embodiments of the present invention have been presented for purposes of illustration and description. It is not intended to limit the invention to the precise form disclosed, and obviously many modifications and variations are possible in light of the above teaching. The exemplary embodiments were chosen and described in order to explain certain principles of the invention and its practical application to enable one skilled in the art to make and use various exemplary embodiments of the invention and various alternatives and modifications as are suited to the particular use contemplated. It is intended that the scope of the invention be defined by the claims and their equivalents.
Claims (2)
1. A routing method for a wireless network, the routing method comprising:
transmitting, by a data sink node, a broadcast message, wherein the broadcast message includes information for updating routing information;
receiving, by one or more second nodes, the broadcast message and determining a hop count of the one or more second nodes to the data sink node based on the broadcast message;
classifying, by a data source node, neighbor nodes of the data source node into a first class node, a second class node, and a third class node based on a hop count of the one or more second nodes to the data sink node;
calculating, by the data source node, a first link condition parameter, when the first link condition parameter is greater than a first threshold, performing the following:
acquiring, by the data source node, a priority of data to be transmitted;
when the priority of the data to be sent is greater than a second threshold, the data source node selects a next hop node from the first class of nodes and updates the first link condition parameter; and
when the priority of the data to be sent is smaller than a second threshold, the data source node selects a next hop node from the second class node or the third class node and updates the first link condition parameter;
when the first link condition parameter is less than a first threshold, performing the following:
selecting, by the data source node, a next hop node from the neighbor node and updating the first link condition parameter; and
transmitting, by the data source node, the data to be transmitted to the selected next-hop node, the hop count of each of the first class of nodes to the data sink node being one less than the hop count of the data source node to the data sink node, the hop count of each of the second class of nodes to the data sink node being the same as the hop count of the data source node to the data sink node, the hop count of each of the third class of nodes to the data sink node being one more than the hop count of the data source node to the data sink node, the first link condition parameter being calculated by the following formula:
wherein, A isiRepresenting the probability of a certain data packet arriving at said data sink node, said esRepresents the channel error rate, said hnRepresenting the number of hops to reach the data sink node, updating the first link condition parameter is achieved by the following formula:
wherein, A isiRepresenting the probability of a certain data packet arriving at said data sink node, said esRepresents the channel error rate, said hnRepresenting a number of hops to reach the data sink node, when the first link condition parameter is greater than the total number of neighbor nodes, the method comprising:
when the first link condition parameter is greater than a first threshold, performing the following:
acquiring, by the data source node, a priority of data to be transmitted;
copying the data to be transmitted by the data source node to obtain a plurality of data to be transmitted;
when the priority of the data to be sent is greater than a second threshold, the data source node selects a next hop node from the first class of nodes and updates the first link condition parameter; and
when the priority of the data to be sent is smaller than a second threshold, the data source node selects a next hop node from the second class node or the third class node and updates the first link condition parameter;
when the first link condition parameter is less than a first threshold, performing the following:
copying the data to be transmitted by the data source node to obtain a plurality of data to be transmitted;
selecting, by the data source node, a next hop node from the neighbor node and updating the first link condition parameter; and
transmitting, by the data source node, the plurality of data to be transmitted to the selected next hop node.
2. A routing node selection apparatus for a wireless network, the routing node selection apparatus comprising:
means for transmitting a broadcast message, wherein the broadcast message includes information for updating routing information;
means for receiving the broadcast message and determining a hop count of one or more second nodes to a data sink node based on the broadcast message;
means for classifying neighbor nodes of the data source node as a first class node, a second class node, and a third class node based on a number of hops from the one or more second nodes to the data sink node;
means for calculating a first link condition parameter, when the first link condition parameter is greater than a first threshold:
acquiring, by the data source node, a priority of data to be transmitted;
when the priority of the data to be sent is greater than a second threshold, the data source node selects a next hop node from the first class of nodes and updates the first link condition parameter; and
when the priority of the data to be sent is smaller than a second threshold, the data source node selects a next hop node from the second class node or the third class node and updates the first link condition parameter;
means for performing the following when the first link condition parameter is less than a first threshold:
selecting, by the data source node, a next hop node from the neighbor node and updating the first link condition parameter; and
means for transmitting the data to be transmitted to the selected next hop node,
the hop count from each node in the first class of nodes to the data sink node is one less than the hop count from the data source node to the data sink node, the hop count from each node in the second class of nodes to the data sink node is the same as the hop count from the data source node to the data sink node, the hop count from each node in the third class of nodes to the data sink node is one more than the hop count from the data source node to the data sink node, and the first link condition parameter is calculated by the following formula:
wherein, A isiRepresenting the probability of a certain data packet arriving at said data sink node, said esRepresents the channel error rate, said hnRepresenting the number of hops to reach the data sink node, updating the first link condition parameter is achieved by the following formula:
wherein, A isiRepresenting the probability of a certain data packet arriving at said data sink node, said esRepresents the channel error rate, said hnRepresentation arrivalThe hop count of the data sink node, the routing node selection apparatus further comprises: means for performing the following when the first link condition parameter is greater than the total number of neighbor nodes:
when the first link condition parameter is greater than a first threshold, performing the following:
acquiring, by the data source node, a priority of data to be transmitted;
copying the data to be transmitted by the data source node to obtain a plurality of data to be transmitted;
when the priority of the data to be sent is greater than a second threshold, the data source node selects a next hop node from the first class of nodes and updates the first link condition parameter; and
when the priority of the data to be sent is smaller than a second threshold, the data source node selects a next hop node from the second class node or the third class node and updates the first link condition parameter;
when the first link condition parameter is less than a first threshold, performing the following:
copying the data to be transmitted by the data source node to obtain a plurality of data to be transmitted;
selecting, by the data source node, a next hop node from the neighbor node and updating the first link condition parameter; and
transmitting, by the data source node, the plurality of data to be transmitted to the selected next hop node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711427579.XA CN108092894B (en) | 2017-12-26 | 2017-12-26 | Routing method and routing node selection device for wireless network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711427579.XA CN108092894B (en) | 2017-12-26 | 2017-12-26 | Routing method and routing node selection device for wireless network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108092894A CN108092894A (en) | 2018-05-29 |
| CN108092894B true CN108092894B (en) | 2020-05-29 |
Family
ID=62179412
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711427579.XA Active CN108092894B (en) | 2017-12-26 | 2017-12-26 | Routing method and routing node selection device for wireless network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108092894B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110719144B (en) * | 2018-07-12 | 2021-09-03 | 上海交通大学 | Wireless communication transmission method based on pre-grouping and receiving and transmitting bidirectional confirmation |
| CN112765137B (en) * | 2021-04-07 | 2021-06-22 | 暗链科技(深圳)有限公司 | Block synchronization method based on block distributed block chain and electronic equipment |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102480764A (en) * | 2010-11-30 | 2012-05-30 | 北京创毅视讯科技有限公司 | Data transmission method of wireless communication terminal and wireless communication terminal |
| CN102769886A (en) * | 2011-05-05 | 2012-11-07 | 中国移动通信集团河南有限公司 | Routing method, device and sensor nodes of wireless sensor network |
| CN103929778A (en) * | 2014-05-13 | 2014-07-16 | 南通大学 | Data grading transmission method |
| US8797867B1 (en) * | 2010-10-18 | 2014-08-05 | Juniper Networks, Inc. | Generating and enforcing a holistic quality of service policy in a network |
| CN105407516A (en) * | 2015-10-23 | 2016-03-16 | 中国人民解放军总参谋部第六十三研究所 | Multi-hop ad-hoc-network anti-interference routing method based on link quality factor |
| CN105873100A (en) * | 2016-03-30 | 2016-08-17 | 常熟理工学院 | Lightweight QoE (Quality of Experience) driven self-adaptive invulnerable wireless communication opportunity control method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160144875A1 (en) * | 2014-11-24 | 2016-05-26 | Electronics And Telecommunications Research Institute | Apparatus and method for distributed processing of train monitoring traffic based on hierarchical wireless sensor network |
-
2017
- 2017-12-26 CN CN201711427579.XA patent/CN108092894B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8797867B1 (en) * | 2010-10-18 | 2014-08-05 | Juniper Networks, Inc. | Generating and enforcing a holistic quality of service policy in a network |
| CN102480764A (en) * | 2010-11-30 | 2012-05-30 | 北京创毅视讯科技有限公司 | Data transmission method of wireless communication terminal and wireless communication terminal |
| CN102769886A (en) * | 2011-05-05 | 2012-11-07 | 中国移动通信集团河南有限公司 | Routing method, device and sensor nodes of wireless sensor network |
| CN103929778A (en) * | 2014-05-13 | 2014-07-16 | 南通大学 | Data grading transmission method |
| CN105407516A (en) * | 2015-10-23 | 2016-03-16 | 中国人民解放军总参谋部第六十三研究所 | Multi-hop ad-hoc-network anti-interference routing method based on link quality factor |
| CN105873100A (en) * | 2016-03-30 | 2016-08-17 | 常熟理工学院 | Lightweight QoE (Quality of Experience) driven self-adaptive invulnerable wireless communication opportunity control method |
Non-Patent Citations (2)
| Title |
|---|
| "Minimum Hop Routing Wireless Sensor Networks Based on Ensuring of Data Link reliability";Ming-Cai Zheng，等;《2009 Fifth International Conference on Mobile Ad-hoc and Sensor Networks》;20100129;全文 * |
| "基于业务优先级的Ad_hoc网络QoS保证策略和方法研究";张洋;《中国优秀硕士学位论文全文数据库 信息科技辑 2013年第07期》;20130715;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108092894A (en) | 2018-05-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP4682249B2 (en) | Method and system for improving the quality of a wireless communication route | |
| US10951261B2 (en) | Pseudo channel hopping in mesh networks without time synchronization | |
| CN106537988B (en) | Method and apparatus for reducing the length of packet storms in wireless mesh networks | |
| JP4535380B2 (en) | Data transmission method in wireless sensor network | |
| US20120300632A1 (en) | Sensor network information collection via mobile gateway | |
| WO2002078229A1 (en) | An access and routing protocol for ad hoc networks using synchronous collision resolution and node state dissemination | |
| US10070388B2 (en) | Coordinated duty cycle assignment in mesh networks | |
| EP3563551A1 (en) | Mechanism for efficient data reporting in iiot wsn | |
| JP6743959B2 (en) | Wireless sensor system, wireless terminal device, relay device, communication control method, and communication control program | |
| JP2018160744A (en) | Radio communication device and radio communication system | |
| CN108092894B (en) | Routing method and routing node selection device for wireless network | |
| CN105075373A (en) | Prioritized queueing in a mesh network based on age of payload data | |
| US20210258749A1 (en) | Wireless sensor system, wireless terminal device, communication control method and communication control program | |
| US10454840B2 (en) | Transmission control protocol receiver controlled interruption mitigation | |
| US20130084811A1 (en) | Zigbee device and method for management of zigbee device | |
| Diop et al. | 2-hop neighborhood information for cover set selection in mission-critical surveillance with wireless image sensor networks | |
| CN114554421B (en) | Communication method and device | |
| WO2015009138A2 (en) | A system and method for managing sleeping mode of wireless nodes in a wireless sensor network | |
| JP7489400B2 (en) | Receiver-centric communication with multiple network technologies for enhanced reliability. | |
| EP3311535B1 (en) | Reducing latency in a mesh network | |
| JPWO2014020714A1 (en) | Time synchronization method in wireless network system | |
| Kim | A TDMA-based MAC between gateway and devices in M2M networks | |
| US8031683B2 (en) | Selecting portals to service network transmissions | |
| Thomson et al. | Mobility Aware Duty Cycling Algorithm (MADCAL) in Wireless Sensor Network with Mobile Sink Node | |
| US20190059017A1 (en) | Communications resource control by a network node |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20230628 Address after: Room 302, Building 11, Sansen Science Park, No. 45, Dongliu Road, Development Zone, Dongying City, Shandong Province, 257000 Patentee after: Dongying Jinjia Intelligent Engineering Co.,Ltd. Address before: 230000 floor 1, building 2, phase I, e-commerce Park, Jinggang Road, Shushan Economic Development Zone, Hefei City, Anhui Province Patentee before: Dragon totem Technology (Hefei) Co.,Ltd. Effective date of registration: 20230628 Address after: 230000 floor 1, building 2, phase I, e-commerce Park, Jinggang Road, Shushan Economic Development Zone, Hefei City, Anhui Province Patentee after: Dragon totem Technology (Hefei) Co.,Ltd. Address before: No. 699, plain road, Xinxiang, Henan, Henan Patentee before: HENAN INSTITUTE OF TECHNOLOGY |