专利汇可以提供Wireless link delivery ratio prediction专利检索,专利查询,专利分析的服务。并且Packet signal-to-noise ratio (SNR) values and historical delivery ratio information are combined to predict a delivery ratio for a communication link. Since packet SNR may be available with every received packet on the link, link SNR level is both accurate and easy to obtain. In one embodiment, a link quality classification algorithm uses delivery ratio and SNR history, based on local classification methods (such as k-Nearest-Neighbor, Kernel-based method) and global classification methods (e.g. Support vector machines) to classify links as either good or bad. In further embodiments, links may be classified at multiple different levels to indicate predicted link quality.,下面是Wireless link delivery ratio prediction专利的具体信息内容。
Wireless mesh and ad hoc networks route packets through links between nodes in the network from a source node to a destination node. Inaccurate prediction of wireless link quality can lead to routing of packets over poor quality links. This can result in low end-to-end throughput and low quality of service.
Delivery ratio prediction algorithms are used to predict a wireless link delivery ratio with packet SNR (signal-to-noise ratio) values. Existing delivery ratio prediction algorithms use historical deliver ratio data only as an algorithm input. Factors such as channel fading, multi-path interference and physical obstruction, can result in the delivery ratio of wireless links being highly volatile. Further, as deliver ratio is inherently a probability value, an exorbitant number of probe packets need to be transmitted (to accumulate a satisfactory historical delivery ratio series) to obtain higher prediction accuracy. Better algorithms are needed to effectively operate high-demanding communication applications, such as voice over IP, in wireless mesh/ad hoc networks.
Packet signal-to-noise ratio (SNR) values and historical delivery ratio information are combined to predict a delivery ratio for a communication link. Since packet SNR is available with every received packet on the link, link SNR level is both accurate and easy to obtain. In one embodiment, a link quality classification algorithm uses delivery ratio and SNR history, based on local classification methods (such as k-Nearest-Neighbor, Kernel-based method) and global classification methods (e.g. Support vector machines) to classify links as either good or bad. In further embodiments, links may be classified at multiple different levels to indicate predicted link quality.
In the following description, reference is made to the accompanying drawings that form a part hereof, and in which is shown by way of illustration specific embodiments which may be practiced. These embodiments are described in sufficient detail to enable those skilled in the art to practice the invention, and it is to be understood that other embodiments may be utilized and that structural, logical and electrical changes may be made without departing from the scope of the present invention. The following description is, therefore, not to be taken in a limited sense, and the scope of the present invention is defined by the appended claims.
The functions or algorithms described herein are implemented in software or a combination of software and human implemented procedures in one embodiment. The software comprises computer executable instructions stored on computer readable media such as memory or other type of storage devices. The term “computer readable media” is also used to represent carrier waves on which the software is transmitted. Further, such functions correspond to modules, which are software, hardware, firmware or any combination thereof. Multiple functions are performed in one or more modules as desired, and the embodiments described are merely examples. The software is executed on a digital signal processor, ASIC, microprocessor, or other type of processor operating on a computer system, such as a personal computer, server or other computer system.
Accurate prediction of a packet delivery ratio for each wireless link in the network can aid routing protocols in selecting paths for packets that are most likely to result in delivery of the packets with minimum retransmission required. In some networks, it allows the exclusion of low quality links from the network topology. Predicting the packet delivery ratio may be achieved by sending probe packets periodically on wireless links. Unfortunately, due to factors such as channel fading, multi-path interference and physical obstruction, the delivery ratio of wireless links can be highly volatile. Besides, delivery ratio, which determines the number of retransmissions a sender performs to successfully deliver a packet to its one-hop receiver on a wireless link, is inherently a probability value. It can take a large number of probes to get an accurate estimation of it.
Packet SNR (signal to noise ratio), on the other hand is an easy-to-obtain value that comes with every probe packet. For example some commercially available wireless cards return an “RSSI” (receiver signal strength indication, which roughly corresponds to the signal level of a packet) and a “silence value” (noise level) value for every received packet. A packet's SNR can be derived by simply subtracting the silence value from the RSSI. Due to the obvious potential causal relationship between SNR and delivery ratio (higher SNR leads to higher packet delivery ratio). However, simple mapping between SNR and delivery ratio has not been done, and SNR is not thought to be a reliable predictive tool.
After multiple probes have been sent, a delivery ratio may be calculated as indicated at 230. In one embodiment, the delivery ratio is calculated as the fraction of probe packets a receiver receives successfully from its one-hop sender on a wireless link during a period. To obtain very accurate delivery ratios, many probes may need to be sent.
At 235, an algorithm utilizing both delivery ratio and measured SNR is used to determine whether or not a link is desirable for use. The algorithm will be described in further detail below, but basically involves first using the delivery ratio estimate to make the desirability determination, and if it is within a border threshold of a desired ratio, then using the SNR to make the final determination.
At 240, a connection status is communicated to the sender. If the status is acceptable, the sender may run a routing algorithm to determine which links to use for sending a packet. If the link to receiver 215 is selected, and if the connection status is acceptable, the packet may be sent at 245 to receiver 215.
In one example mesh network, data was gathered to determine if there was a correlation between SNR and delivery ratio. The example mesh network consisted of 38-nodes distributed over roughly six square kilometers in an urban area. Each node consisted of a PC (personal computer) with an 802.11b card connected to an omni-directional antenna mounted on the roof of a building. Each node in turn sent 1500-byte 802.11 broadcast packets as fast as possible, while the rest of the nodes passively listened. Each sender sent for 90 seconds at each of the 802.11b bit-rates (1 Mbps, 2 Mbps, 5.5 Mbps and 11 Mbps). Each packet had a unique sequence number. The sender recorded, as illustrated at 300 in
Records of the types (sent and received) were matched with the “Source” and “Sequence No.” fields. Since every node sent for 90 seconds, the entire sending time may be divided into 450 0.2-sec slots. For each time slot, the delivery ratio for a uni-directional link is calculated, with s as its source end node and d as its destination end node, as follows (the set of packets sent out by s during the time slot are denoted by P):
To obtain the average SNR value of each time slot of a link, the SNR value of each received packet may be calculated by subtracting its noise value from its signal value. The SNR value of a specific time slot on a link may then obtained by averaging over all the packets received during the slot on that link.
Next, a simple taxonomy on the 352 uni-directional links in the measurement trace is performed. These links are partitioned according to the mean and standard deviation of each link's 450 delivery ratio values in 90 seconds. The links then are partitioned into three types:
Experiments were focused on the 27 links in Type II category, since Type III links have low delivery ratio and therefore are generally unusable, Type I links are links with high delivery ratio and low volatility, hence may not need constant monitoring of link quality.
Prediction of wireless delivery ratio is viewed as a standard (binary) classification problem under the general setting for predictive learning. The delivery ratio at time t+1 is to be predicted and the link assigned a class label, y.
where dt+1 is the exact value of delivery ration at time t+1. dThreshold is predefined. The class label yt+1 helps to specify “good link”, 1, or “bad link”, −1, which benefits whether to include the (wireless) link into network topology (i.e., to use or not to use the link in t+1).
Performance metric: prediction accuracy is defined as:
where the loss function
Formula (2) represents the generalization ability of the learning system. ntest is the number of data in the test set and estimate ŷi can be obtained by various classification methods. In this paper, we use both local classification methods (K-nearest neighbor method and Kernel method) and global classification methods (support vector machines).
Two local methods, K-nearest neighbor method and Kernel method may be used to estimate the exact value of dt+1 in formula (1).
where Nk(x) is the neighborhood of x defined by the k closest points xi in the training data. The value of k effectively controls the width of the local region near x. Euclidean distance may be used to measure closeness. As shown in
The kernel method provides more information on local neighborhood in local methods. In one embodiment, a Nadaraya-Watson weighted average kernel estimate may be used,
where Kλ(x, xi) is a Gaussian kernel, which have a weight function based on the Gaussian density function.
The parameter λ controls the width of the valid neighborhood. The x distance between dt+1 and dt is 1, the x distance between dt+1 and dt−1 is 2, etc.
For a global classification method such as a Support vector machine, as illustrated in
In one embodiment, a linear classifier (discriminant function) is used, f(x)=sign(d(x)) where
d(x)=w·x+b (6)
Parameters (a.k.a. weights) are w and b (bias parameter).
Support vector machines (SVM) may be used for classification. Their practical successes can be attributed to solid theoretical foundations based on statistical learning theory. For a given data set, the SVM approach considers an optimal separating hyper-plane, for which the margin (distance between the closest data points to the hyper-plane) is maximized. For example, SVM formulation for linear decision boundary, non-separable case, given the training data, the (primal) optimization problem is:
Solution of constrained optimization problem (7) results in a (linear) SVM decision boundary d(x)=w·x+b. The value of regularization parameter C controls the margin, i.e. larger C—values result in SVM models with a smaller margin. Each training sample can be characterized by its distance from the margin ξi≧0, i=1, . . . , n , a.k.a. called slack variables.
The delivery ratio prediction problem is framed as a classification problem. In one embodiment, both local classification methods (k-NN and Nadaraya-Watson kernel) and global classification methods (SVM) are used on the data from the data acquisition described above.
Classification is performed as illustrated at 500 in
In a real network protocol implementing the estimation algorithm, the threshold is provided by the user (e.g. the routing protocol). Note that at 505, a function f(dt−2, dt−1, dt) is used to estimate the delivery ratio, dt+1. In the k-near-neighbor (k-NN) method, f(dt−2, dt−1, dt)=(dt−2+dt−1+dt)/3; In the Nadaraya-Watson kernel method, λ=3 may be used in formula (5) to obtain a weighted estimate, thereby having f(dt−2, dt−1, dt)=w2·dt−2+w1·di−1+w0·dt, where (w2, w1, w0)=(0.535, 0.320, 0.145). At 515, if the delivery ratio is greater than the threshold plus the border value, the classification is set to 1 at 520. If the delivery ratio is less than the threshold minus the border value at 525, then the classification is set to −1 at 530.
When the delivery ratio {circumflex over (d)}t+1 is within the borderline near dThreshold, as indicated at 535, the likelihood of the classification is weak, resulting a ‘weak tie’ in classification. In that case, SNR is used as a judge to break the tie. At 540, SNR values rt−2, rt−1, rt, rt+1 are used as a tie breaker. Fewer, or a greater number of SNR values may be used for different embodiments using various classification methods. g(rt−2, rt−1, rt) is the simple mean of the three SNR values and establishes a SNR threshold. If the measured SNR value, rt+1, is greater than the average, the classification is set to 1 at 545. Otherwise, 550, the classification is set to −1 at 555.
In most observed cases, the addition of an SNR value increases the accuracy of the delivery ratio. Using three SNR values resulted in further increase in accuracy. In some cases, the addition of the SNR value actually reduced the accuracy of the measurement. This may be due to the SNR value containing a high noise component. Overall, most delivery ratio estimates were improved an average of between 6 and 8% by adding one or more SNR values to the estimation algorithm
The Abstract is provided to comply with 37 C.F.R. §1.72(b) to allow the reader to quickly ascertain the nature and gist of the technical disclosure. The Abstract is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims.
标题 | 发布/更新时间 | 阅读量 |
---|---|---|
一种基于非线性增强子空间聚类的图像识别方法 | 2020-05-11 | 634 |
三维裁剪Voronoi图的多线程并行计算方法、系统 | 2020-05-08 | 167 |
一种基于CBR和RBR的机器人焊接工艺参数优化方法 | 2020-05-11 | 581 |
一种基于步长匹配的行人室内定位方法 | 2020-05-12 | 175 |
基于多传感网络的室内活动检测识别方法及系统 | 2020-05-12 | 678 |
一种基于加权联合最近邻的多任务稀疏表示检测方法 | 2020-05-08 | 944 |
一种基于光流颜色聚类的运动物体分割方法及其系统 | 2020-05-11 | 769 |
基于深度卷积特征和语义近邻的多标签图像补全方法 | 2020-05-08 | 234 |
基于多元时移多尺度排列熵的滚动轴承故障诊断方法 | 2020-05-13 | 286 |
高分辨率遥感影像的海上典型人造目标识别系统及方法 | 2020-05-08 | 22 |
高效检索全球专利专利汇是专利免费检索,专利查询,专利分析-国家发明专利查询检索分析平台,是提供专利分析,专利查询,专利检索等数据服务功能的知识产权数据服务商。
我们的产品包含105个国家的1.26亿组数据,免费查、免费专利分析。
专利汇分析报告产品可以对行业情报数据进行梳理分析,涉及维度包括行业专利基本状况分析、地域分析、技术分析、发明人分析、申请人分析、专利权人分析、失效分析、核心专利分析、法律分析、研发重点分析、企业专利处境分析、技术处境分析、专利寿命分析、企业定位分析、引证分析等超过60个分析角度,系统通过AI智能系统对图表进行解读,只需1分钟,一键生成行业专利分析报告。