检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]长安大学电子与控制工程学院,西安710064 [2]江西赣粤高速公路股份有限公司,南昌330025
出 处:《计算机应用研究》2013年第6期1820-1823,共4页Application Research of Computers
基 金:西安市科技局工业应用技术研发项目(CXY1120)
摘 要:在WSN中采用独立分析(SFA)法求得的单数据流端到端延迟上界有时比整体分析(TFA)法求得的总数据流端到端延迟上界要大,这不符合物理意义。针对这一问题,分析了现有TFA法与SFA法在数据流服务分配机制上的差别,并指出这两种方法求得的延迟上界不具有可比性。随后在修正流经节点数据流输出上界的基础上,推导出与TFA法数据流服务分配机制相匹配的单数据流端到端延迟上界表达式。公式推导与数值分析结果均表明,本方法求得的单数据流端到端延迟上界能够被TFA法总数据流端到端延迟上界所包络,符合物理意义且更精确。Present research shows that the single flow end-to-end delay upper bound got by separate flow analysis(SFA) me-thod is sometimes greater than the bound of total flow by total flow analysis(TFA) method in WSN,which is out of physical meanings.Aiming at the above problem,this paper firstly analyzed the difference in data flow's service allocation mechanism between current TFA and SFA,with pointing out that the delay bounds got by these two methods were incomparable.Finally,on the basis of the improved output bound of a data flow traversing a node,it deduced the expression of single flow end-to-end delay upper bound,which accorded with the data flow's service allocation mechanism of TFA.Both of the derived expression and numerical results illustrate that the single flow end-to-end delay upper bound got in this paper,which can be bounded by the bound of total flow by TFA,is physically significant and more accurate.
关 键 词:无线传感器网络 网络微积分 延迟上界 单数据流 服务速率
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222