CN112770340A - Method for deploying minimized multi-antenna nodes based on prior scheduling in wireless sensor network - Google Patents
Method for deploying minimized multi-antenna nodes based on prior scheduling in wireless sensor network Download PDFInfo
- Publication number
- CN112770340A CN112770340A CN202011482939.8A CN202011482939A CN112770340A CN 112770340 A CN112770340 A CN 112770340A CN 202011482939 A CN202011482939 A CN 202011482939A CN 112770340 A CN112770340 A CN 112770340A
- Authority
- CN
- China
- Prior art keywords
- network
- node
- antenna
- nodes
- antenna nodes
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
- H04W72/566—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient
- H04W72/569—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient of the traffic information
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
- H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
- H04B7/0413—MIMO systems
- H04B7/0452—Multi-user MIMO systems
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0803—Configuration setting
- H04L41/0823—Configuration setting characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability
- H04L41/0826—Configuration setting characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability for reduction of network costs
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0803—Configuration setting
- H04L41/0823—Configuration setting characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability
- H04L41/0833—Configuration setting characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability for reduction of network energy consumption
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/02—Arrangements for optimising operational condition
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0446—Resources in time domain, e.g. slots or frames
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/12—Wireless traffic scheduling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a deployment method of minimized multi-antenna nodes based on pre-scheduling in a wireless sensor network, which can introduce a multi-user multi-input multi-output technology in the wireless sensor network, solve data transmission conflicts by utilizing the characteristics of multiple antennas, but considering cost and energy consumption, the fewer the multi-antenna nodes in the network are, the better the multi-antenna nodes are. The invention carries on the pre-scheduling according to the real network produced dataflow, for the dataflow that can not be scheduled because of the transmission conflict, through redistributing the time slot, the preferential scheduling has smaller dataflow of time margin apart from its own dead time, if the dataflow at this moment is changed into the schedulable again, then this conflict node does not need to be replaced by the multi-antenna node; otherwise, the conflict node is replaced. The multi-antenna nodes are deployed in the network until the number of multi-antenna nodes in the network reaches a stable value. The method can solve the transmission conflict in the network, ensure the schedulability of the network and minimize the number of the multi-antenna nodes in the network.
Description
Technical Field
The invention relates to a data stream transmission scheduling method in a wireless sensor network, in particular to a minimized multi-antenna node deployment method based on prior scheduling in the wireless sensor network.
Background
The wireless sensor network is widely applied to various fields such as environment monitoring, medical service, traffic monitoring, industrial automation and the like, and the network consists of a plurality of wireless sensor nodes and has the characteristics of large scale, self-organization, dynamics, reliability, data center, energy limitation and the like. As an important component of the Internet of things, the data-centric characteristic enables the wireless sensor network to have high requirements on data reliability and real-time performance, and the data transmission reliability and real-time performance are important research contents of the wireless sensor network and influence the practical application value of the network to a great extent.
Considerable research has been carried out to improve the reliability of data transmission in wireless sensor networks, and in the existing methods, in order to improve the reliability of data, one part is to study how to improve the accuracy of data, and the other part is to study and improve the receiving rate of data stream. In the existing research, the reliability of data transmission is mainly improved by the following methods: (1) a retransmission mechanism is utilized to ensure the reliability of data transmission. (2) Power control techniques are utilized to ensure reliable transmission. (3) A redundancy coding scheme based on the application layer ensures reliable transmission.
The methods effectively improve the reliability of data transmission to a certain extent, but the methods are more or less at the cost of other performance indexes (such as time delay or energy consumption). The invention introduces a multi-user multiple-input and multiple-output (MU-MIMO) technology into a wireless sensing network, and has the characteristic of multiple antennas. The common sensor node can only receive or send signals at the same time, the multi-antenna node is provided with a plurality of transmitting antennas and receiving antennas, when the antennas work in different channels, the node can simultaneously receive and send data, when the communication channel quality is poor, all the antennas can work in the same channel, and the receiving rate of data packets can be improved. The multi-antenna characteristic of the MU-MIMO technology can be utilized to improve the spectrum utilization rate in multiples under the condition of not increasing the bandwidth and the antenna transmission power. However, in terms of energy consumption and cost of multi-antenna nodes, we should reduce the number of multi-antenna nodes in the network while satisfying the requirement that data streams in the network are schedulable.
Disclosure of Invention
The invention provides a deployment method of a minimized multi-antenna node based on prior scheduling in a wireless sensor network, which aims to solve the transmission conflict of data streams in the network, improve the receiving rate of data in the network and ensure the schedulability of the network by introducing a multi-input multi-output technology into the wireless sensor network and utilizing the characteristics of multiple antennas, and simultaneously, the number of the multi-antenna nodes required by the network is minimized by considering the cost and the energy consumption.
In order to solve the technical problems, the invention adopts the following technical scheme:
first, data streams are generated in advance according to a real network, and the data streams in the network are scheduled according to a fixed priority. When a data stream in a network has a transmission collision at a certain node, if the data stream cannot reach a target node within its own deadline due to queuing delay, the data stream is called as non-schedulable.
And for the non-schedulable data stream, reallocating the time slot, preferentially scheduling the data stream with smaller time margin from the deadline of the non-schedulable data stream, and if the non-schedulable data stream with the transmission conflict becomes schedulable again, replacing the conflict node with the multi-antenna node, otherwise, replacing the conflict node with the multi-antenna node. The method can reduce the number of multi-antenna nodes required by the network while ensuring the schedulability of the network.
According to the method, the common conflict nodes needing to be replaced are replaced by the multi-antenna nodes and are deployed in the network. The number of multi-antenna nodes in the network gradually increases from 0 and finally reaches a stable value, so that the number of multi-antenna nodes can cope with most of the non-scheduling situations in the network. And finally, recording the utilization rate of each deployed multi-antenna node, and replacing the multi-antenna nodes with extremely low utilization rates with common nodes to reduce the number of the multi-antenna nodes. And then deploying the multi-antenna nodes in the network by using the method, wherein the multi-antenna nodes in the network have a further increasing process, the increasing number is smaller than the previously reduced number, the multi-antenna nodes with lower utilization rate in the network are replaced by common nodes, the number of the multi-antenna nodes is further reduced, and the deploying and reducing processes are repeated until the increasing number is larger than or equal to the reduced number, so that the finally obtained number is the number of the multi-antenna nodes which are required by the network after minimization and can deal with most of non-scheduling conditions.
For two data streams with transmission collision, if the data stream FiSatisfy the following formula, then data flow FiIs not schedulable.
hi+deli＜di
Wherein h isiRepresenting a data stream FiNumber of hops, del, from source node to destination nodeiIndicating queuing delay due to transmission collisions, diRepresenting a data stream FiThe cutoff time of (d).
For data streams in which transmission collision occurs in the network, the margin from the deadline is as follows:
Δt＝di-hi
wherein, DeltatRepresenting a data stream FiThe number of data streams in the network is n, denoted as F ═ F1，F2，...，Fn}, data flow FiIs represented by<hi，ti，di，pi>1. ltoreq. i.ltoreq.n, where diRepresenting a data stream FiCutoff time of hiRepresenting a data stream FiNumber of hops from source node to destination node, tiRepresenting a data stream FiPeriod of (a), piRepresenting a data stream FiThe transmission path of (1).
Advantageous effects
The invention provides a method for minimizing multi-antenna nodes based on prior scheduling in a wireless sensor network, which introduces a multi-user multi-input multi-output technology into the wireless sensor network, utilizes the characteristics of multiple antennas thereof, solves transmission conflicts in the network, ensures the schedulability of the network and improves the receiving rate of data in the network. The number of multi-antenna nodes in the network is minimized, taking into account both energy consumption and cost.
The method of the invention generates data flow in advance according to the real network and schedules the data flow in the network according to the fixed priority. And then, allocating time slots to the non-schedulable data streams again, preferentially scheduling the data streams with smaller time margin from the self deadline, and reducing the number of the non-schedulable data streams, thereby reducing the number of common conflict nodes needing to be replaced by the multi-antenna nodes, and indirectly reducing the number of the multi-antenna nodes needing to be deployed in the network.
The method of the invention improves the schedulability and the data receiving rate of the network, considers the cost and the energy consumption of the multi-antenna node and can minimize the number of the multi-antenna nodes required by the network. Compared with the method of directly replacing all the conflict nodes with the multi-antenna nodes, theoretical analysis and experiments prove that the method can reduce the multi-antenna nodes by about 47 percent.
The number of the multi-antenna nodes obtained by the method can be used for most of non-schedulable conditions in the network, and the schedulability of data streams in the network is guaranteed. And finally, recording the utilization rate of each multi-antenna node, and replacing the multi-antenna nodes with extremely low utilization rates with common nodes, so that the number of the multi-antenna nodes can be further reduced, theoretical analysis and experiments prove that about 12% of the multi-antenna nodes can be reduced on the basis of the previous method, the aims of improving the network receiving rate and ensuring the network schedulability are achieved, meanwhile, the cost and the energy consumption are saved, and the number of the multi-antenna nodes in the network is minimized.
Drawings
FIG. 1 is a schematic diagram of a network model of the present invention;
FIG. 2 is a diagram illustrating an example of data stream transmission collision according to the present invention;
FIG. 3 is a schematic diagram of slot analysis of data flows in the present invention;
FIG. 4 is a diagram illustrating the relationship between the receiving rate in the network and the number of data streams in the network when the method of the present invention is used;
fig. 5 is a schematic diagram illustrating a relationship between the number of multi-antenna nodes in a network and the number of times of analyzing and searching the multi-antenna nodes in the conventional method.
Fig. 6 is a schematic diagram of the relationship between the number of multi-antenna nodes in a network and the number of times of analyzing and searching the multi-antenna nodes when the node replacement strategy is adopted by the method of the present invention.
Fig. 7 is a comparison diagram of the number of multi-antenna nodes in a network under three conditions of the existing method, the node replacement strategy in the present invention, and the node reduction strategy in the present invention.
Fig. 8 is a schematic diagram showing the comparison of the change of the number of multi-antenna nodes in the network with the number of times of searching for the multi-antenna nodes by analysis under three conditions of the existing method, the node replacement strategy using the present invention, and the node reduction strategy using the present invention.
Fig. 9 is a schematic diagram showing the comparison of the change of the number of multi-antenna nodes in the network with the number of data streams in the three cases of using the existing method, using the node reduction strategy of the present invention, and using the node reduction strategy of the present invention.
Detailed Description
The invention will be further described with reference to examples and figures.
A method for minimizing multi-antenna nodes based on pre-simulated scheduling in a wireless sensor network introduces a multi-user multi-input multi-output technology into the wireless sensor network, and replaces common conflict nodes with multi-antenna nodes by utilizing the characteristics of multi-antenna and capability of simultaneously sending and receiving data, thereby solving the transmission conflict of data streams in the network, improving the receiving rate of the data in the network and ensuring the schedulability of the network;
the invention generates data flow in advance according to a real network and carries out scheduling according to the prior scheduling method with fixed priority. When a data stream in a network has a transmission collision at a certain node, if the data stream cannot reach a target node within its own deadline due to queuing delay, the data stream is called as non-schedulable.
And for the non-schedulable data stream, reallocating the time slot, preferentially scheduling the data stream with smaller time margin from the deadline of the non-schedulable data stream, and if the non-schedulable data stream with the transmission conflict becomes schedulable again, replacing the conflict node with the multi-antenna node, otherwise, replacing the conflict node with the multi-antenna node. The method can reduce the number of multi-antenna nodes required by the network while ensuring the schedulability of the network.
According to the method, the common conflict nodes needing to be replaced are replaced by the multi-antenna nodes and are deployed in the network. The number of multi-antenna nodes in the network gradually increases from 0 and finally reaches a stable value, so that the number of multi-antenna nodes can cope with most of the non-scheduling situations in the network. And finally, recording the utilization rate of each deployed multi-antenna node, and replacing the multi-antenna nodes with extremely low utilization rates with common nodes to reduce the number of the multi-antenna nodes. And then deploying the multi-antenna nodes in the network by using the method, wherein the multi-antenna nodes in the network have a further increasing process, the increasing number is smaller than the previously reduced number, the multi-antenna nodes with lower utilization rate in the network are replaced by common nodes, the number of the multi-antenna nodes is further reduced, and the deploying and reducing processes are repeated until the increasing number is larger than or equal to the reduced number, so that the finally obtained number is the number of the multi-antenna nodes which are required by the network after minimization and can deal with most of non-scheduling conditions.
Fig. 1 is a network model used in the present invention, which includes a network controller (controller) and a sink node (sink) and several sensor nodes, including a common sensor node and a multi-antenna node (hereinafter, referred to as MU-MIMO node). Energy of nodes in a network is limited, the network has the characteristics of low power consumption, limited resources and the like, a TDMA-based scheduling access mechanism is adopted, N sensor nodes are arranged in the network, and a set of the nodes is defined as V ═ V1，v2，v3，...vnV, is, viThe transmitted data stream is Fi，FiSo as to make<hi，ti，di，pi>Is a periodic end-to-end data flow between a source node and a destination node characterized by hiIs a node viMinimum number of hops to destination node, tiIs FiPeriod of (d)iIs FiCutoff time of piIs FiThe number of channels in the network is recorded as c. In this network, the priority of each data flow is pre-assigned by the network controller, which we assume that the priority of each flow is the same as their sequence number, F1Highest priority in the network, and FnThe lowest priority in the network on which the data flows in the network schedule transmissions.
Fig. 2 shows an example of the period and deadline of a data flow and transmission collisions of data flows in a network, as shown, data flow F13And F15At node V20Where a transmission collision occurs, node V20Is a collision node, i.e. a candidate node of the MU-MIMO node, if F15Not schedulable, i.e. F15Cannot be at its own cutoff time d15The target node is reached internally, then the conflicting node V may need to be set at that time20And replaced with MU-MIMO nodes.
Fig. 3 shows a time slot analysis of data streams in the method according to the invention, as shown in the network of fig. 1, node V assuming that 8 data streams need to be transmitted20、V21、V25Node V appears in different data flow paths in the same time slot20、V21、V25Are all conflicting nodes. Data flow F13And F15At node V20Where a transmission conflict occurs, F is scheduled preferentially according to a fixed priority13Then F15Requiring a queue wait, a queue delay del may result15If h is15+del15＞d15I.e. F15Cannot reach the target node within its own deadline, then F is said15Is not schedulable. At this time, compare F13And F15Time margin Δ oftSize of (2)(Δt＝di-hi) If F is15Is relatively small, then the priority schedule F can be as shown in fig. 315If F is present13And F15All can be scheduled, then at this point the conflicting node V20There is no longer a need to replace it with a MU-MIMO node, otherwise, the conflicting node V needs to be replaced20And replaced with MU-MIMO nodes. By the method, the number of data streams which can not be dispatched in the network can be reduced, and the number of MU-MIMO nodes required by the network is indirectly reduced while the dispatching performance of the network is ensured.
Fig. 4 shows a comparison of the reception rate of data and the number of data streams in the network shown in fig. 1, when the method of the present invention and the prior art method are used. It can be seen from the figure that, when the method of the present invention is used, the receiving rate of data in the network is always kept at 1, and when the fixed priority method of the existing method is used for scheduling, the receiving rate of data in the network is gradually reduced along with the increase of data streams in the network, because the MU-MIMO node has the characteristics of multiple antennas and capability of simultaneously transmitting and receiving data streams, the data streams in the network can be scheduled, that is, the data streams in the network can all reach the target node within the deadline of the MU-MIMO node.
Fig. 5 is a schematic diagram showing changes in the number of MU-MIMO nodes required by a network along with the number of times of searching for and replacing MU-MIMO nodes deployed in the network shown in fig. 1 when an existing fixed priority (FP policy) scheduling method is used, the present invention continuously generates data streams in advance according to a real network and performs scheduling according to the fixed priority, in fig. 5, the node replacement policy (NRA 1 policy) and the node reduction policy (NRA 2 policy) described in the present invention are not used, the existing fixed priority method is used for scheduling, when a collision node is encountered, the MU-MIMO node is replaced by the collision node, and the number of MU-MIMO nodes required by the network at three different deadline times is compared. As can be seen from the figure, as the number of times of searching for and replacing conflicting nodes increases, more and more MU-MIMO nodes are gradually found, but the number of the MU-MIMO nodes is kept constant until the last time, and the number of the MU-MIMO nodes is the number of the MU-MIMO nodes required by the network, which is not reduced by the methods NRAl and NRA2 described in the present invention, so that the number of the MU-MIMO nodes is more, and it can also be seen that when the deadline of the data stream is larger, the number of the MU-MIMO nodes required by the network is relatively less.
Fig. 6 shows the number of MU-MIMO nodes in the network varying with the number of times of finding and replacing the MU-MIMO nodes after using the method NRA1 of the present invention, and it can be seen from the figure that the number of MU-MIMO nodes increases from 0 and gradually stabilizes finally as in fig. 5, but it can be seen that after using NRA1, the number of MU-MIMO nodes required by the network decreases significantly, and the decrease is most significant in the case of a large data stream deadline.
Fig. 7 shows a comparison of the number of MU-MIMO nodes required by the existing method and the method of the present invention, and also compares the number of MU-MIMO nodes at different deadlines, and it is clear from the figure that the larger the deadline time of the data stream is, the smaller the number of MU-MIMO nodes required is, and the method of the present invention can effectively reduce the number of MU-MIMO nodes required by the network while ensuring the schedulability of the network, and save energy consumption and cost.
Fig. 8 shows a comparison graph of the number of MU-MIMO nodes required by different methods along with the change of the number of times of finding and replacing the MU-MIMO nodes under the same deadline time, and it can be seen from the graph that the method NRA1 of the present invention can effectively reduce the number of MU-MIMO nodes, NRA2 can further reduce the number of MU-MIMO nodes on the basis of NRA1, NRA1 can reduce about 47% of multi-antenna nodes, NRA2 can reduce about 12% of multi-antenna nodes on the basis of NRA1, and the number of MU-MIMO nodes required by the network is minimized.
Fig. 9 shows a comparison between the number of MU-MIMO nodes required by the network as a function of the number of data streams in the network and the method of the present invention, and it is clear from the figure that the number of MU-MIMO nodes required by the network increases as the number of data streams in the network increases, but the number of MU-MIMO nodes required by the method of the present invention is significantly smaller than that of the prior art method.
In conclusion, the method of the invention can solve the transmission conflict in the network, ensure the schedulability of the network and improve the receiving rate of the data in the network. And the number of MU-MIMO nodes required by the network can be minimized in consideration of cost and energy consumption.
Claims (3)
1. A method for deploying minimized multi-antenna nodes based on prior scheduling in a wireless sensor network is characterized in that: in a wireless sensor network, data streams are generated in advance according to a real network and are scheduled according to a fixed priority, when the data streams in the network have transmission conflicts at a certain node, if the data streams cannot reach a target node within the self deadline due to queuing delay, the data streams are called as non-schedulable;
for the data streams which can not be dispatched due to the transmission conflict, the time slot is redistributed, the data streams with smaller time margin from the self deadline are dispatched preferentially, if the data streams with the transmission conflict become dispatchable, the conflict node does not need to be replaced by the multi-antenna node, otherwise, the conflict node is replaced by the multi-antenna node;
according to the data flow generated by the real network, the transmission conflict is solved by the method, the unresolvable conflict nodes are replaced by the multi-antenna nodes to be deployed in the network, the number of the multi-antenna nodes in the network is gradually increased from 0, and finally a stable value is reached.
2. The method of claim 1, wherein: for the data stream with transmission collision, the time margin is calculated according to the following formula:
Δt＝di-hi
wherein, DeltatRepresenting a data stream FiThe number of data streams in the network is n, denoted as F ═ F1，F2，...，Fn}, data flow FiIs represented by<hi，ti，di，pi>1. ltoreq. i.ltoreq.n, where diRepresenting a data stream FiCutoff time of hiRepresenting a data stream FiNumber of hops from source node to destination node, tiRepresenting a data stream FiPeriod of (a), piRepresenting a data stream FiThe transmission path of (1).
3. Method according to claims 1 and 2, characterized in that: for the number of multi-antenna nodes obtained by the method of claims 1 and 2, recording the utilization rate of each deployed multi-antenna node, and replacing the multi-antenna node with extremely low utilization rate with a common node to reduce the number of multi-antenna nodes. And deploying the multi-antenna nodes in the network by using the method of claim 1, wherein the multi-antenna nodes in the network have a further increase process, the increase number is smaller than the previous decrease number, the multi-antenna nodes with lower utilization rate in the network are replaced by the common nodes, and the number of the multi-antenna nodes is further decreased, and the above two processes of deployment and decrease are repeated until the increase number is larger than or equal to the decrease number, so that the number finally obtained is the number of the multi-antenna nodes which can deal with most of the non-scheduling situations and are required by the network after the minimum number.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011482939.8A CN112770340B (en) | 2020-12-16 | 2020-12-16 | Method for deploying minimized multi-antenna nodes based on prior scheduling in wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011482939.8A CN112770340B (en) | 2020-12-16 | 2020-12-16 | Method for deploying minimized multi-antenna nodes based on prior scheduling in wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112770340A true CN112770340A (en) | 2021-05-07 |
| CN112770340B CN112770340B (en) | 2022-08-02 |
Family
ID=75694981
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011482939.8A Active CN112770340B (en) | 2020-12-16 | 2020-12-16 | Method for deploying minimized multi-antenna nodes based on prior scheduling in wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112770340B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102065433A (en) * | 2010-11-18 | 2011-05-18 | 重庆金美通信有限责任公司 | Channel distributing method based on multi-radio frequency multi-antenna multi-sector wireless MESH network |
| US20160216362A1 (en) * | 2015-01-27 | 2016-07-28 | Vivek Subramanian | Systems and methods for determining locations of wireless sensor nodes in an asymmetric network architecture |
| CN106507492A (en) * | 2016-11-08 | 2017-03-15 | 重庆邮电大学 | Based on the industry wireless network definitiveness transmission dispatching method that priority is distributed |
| CN106878928A (en) * | 2017-02-20 | 2017-06-20 | 南京邮电大学 | Cognition wireless sensor network performance optimization method based on many relaying multiple antennas |
| CN109348537A (en) * | 2018-10-28 | 2019-02-15 | 西南电子技术研究所（中国电子科技集团公司第十研究所） | Multi-beam self-organizing network channel access control method |
-
2020
- 2020-12-16 CN CN202011482939.8A patent/CN112770340B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102065433A (en) * | 2010-11-18 | 2011-05-18 | 重庆金美通信有限责任公司 | Channel distributing method based on multi-radio frequency multi-antenna multi-sector wireless MESH network |
| US20160216362A1 (en) * | 2015-01-27 | 2016-07-28 | Vivek Subramanian | Systems and methods for determining locations of wireless sensor nodes in an asymmetric network architecture |
| CN106507492A (en) * | 2016-11-08 | 2017-03-15 | 重庆邮电大学 | Based on the industry wireless network definitiveness transmission dispatching method that priority is distributed |
| CN106878928A (en) * | 2017-02-20 | 2017-06-20 | 南京邮电大学 | Cognition wireless sensor network performance optimization method based on many relaying multiple antennas |
| CN109348537A (en) * | 2018-10-28 | 2019-02-15 | 西南电子技术研究所（中国电子科技集团公司第十研究所） | Multi-beam self-organizing network channel access control method |
Non-Patent Citations (2)
| Title |
|---|
| J.P.M.G.LINNARTZ: "Multiple antenna rectifiers for radio frequency energy scavenging in wireless sensors", 《2015 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS)》 * |
| 李瑞芳: "无线多媒体传感器网络MAC协议研究综述", 《通信学报》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112770340B (en) | 2022-08-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP2120506B1 (en) | Method and apparatus for selecting between a plurality of dictionaries | |
| US20070249287A1 (en) | Methods and apparatus for selecting between a plurality of dictionaries | |
| KR100978766B1 (en) | Methods and apparatus for communicating backlog related information | |
| JP4885981B2 (en) | Method and apparatus for reporting and / or using control information | |
| US10849139B2 (en) | Hierarchical resource scheduling method of wireless communication system | |
| Mamane et al. | Scheduling algorithms for 5G networks and beyond: Classification and survey | |
| JP2006191620A (en) | Mimo communication system for adaptive scheduling and adaptive user scheduling method thereof | |
| Cheng et al. | Heterogeneous statistical QoS provisioning for downlink transmissions over mobile wireless cellular networks | |
| CN113079577B (en) | Resource allocation method based on coexistence scene of EMBB and URLLC | |
| CN110690918B (en) | Method for adjusting aerospace measurement and control link parameters | |
| WO2018045991A1 (en) | Cellular scheduler apparatus, computer program, and method for selecting user equipment based on beam or delay state information | |
| EP3338499B1 (en) | Decreasing free-riding data traffic in uplink scheduling | |
| JP2008289127A (en) | Method for scheduling heterogeneous traffic in b3g/4g cellular network with multiple channels | |
| US10952245B1 (en) | Multi-class orthogonal frequency-division multiple access (OFDMA) scheduling | |
| CN112770340B (en) | Method for deploying minimized multi-antenna nodes based on prior scheduling in wireless sensor network | |
| CN115955436A (en) | Reliable routing and scheduling method for time-sensitive network | |
| JP2007158504A (en) | Wireless communication apparatus and program | |
| Bhar et al. | Elastic hybrid MAC protocol for wireless sensor networks. | |
| Li et al. | A packet scheduling algorithm with interruption factor for cognitive radio | |
| Kurunathan et al. | An efficient approach to multisuperframe tuning for DSME networks | |
| Lakhal et al. | Parallelising reception and transmission in queues of secondary users | |
| CN110139251A (en) | Magnanimity M2M mix of traffic dispatching method based on Dynamic Packet | |
| New et al. | Resource management for symmetrical applications over heterogeneous services in IEEE 802.16 | |
| Parichehreh et al. | Inter-and intra-cloud resource allocation for delay sensitive industrial networks | |
| Gresset et al. | Fair preemption for joint delay constrained and best effort traffic scheduling in wireless networks |
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 |