WSN中改进的分布式多维定标定位算法

针对无线传感器网络经典集中式多维定标MDS-MAP算法在定位精度与矩阵计算复杂度方面的不足,提出一种基于分布式的ADMDS-MAP定位算法.该算法通过采用测定距离量化,得到节点的近邻向量(CNV),然后通过相关的估算算法得到距离矩阵D和节点的初始估值,加入适当的求精计算得到节点的精确位置.理论分析和仿真实验表明,改进算法能够提高节点的定位精度.     

低速无线个域网隐蔽站问题研究

低速无线个域网标准IEEE802.15.4协议MAC层的主要目标是有效地减少能量的消耗,而并没有考虑如何有效地减少隐蔽站问题的产生.在无线多跳网络中解决隐蔽站问题主要方法有RTS/CTS和调节载波侦听范围等办法,但是均不适用于低速无线个域网.在对基于IEEE802.15.4的时隙CSMA/CA退避算法和隐蔽站问题产生的原理进行深入分析的基础上,得出了在节点均匀分布的情况下退避指数的最小值macminBE相对于发帧成功率的表达式,提出了通过调节macminBE,来减少由于隐蔽站问题引发的帧冲突的方法.并通过NS2仿真实验验证了方法的可行性.克服了现有方法的不足,较大地提高了网络的性能.     

BP神经网络隐层单元数的确定方法及实例

针对BP神经网络隐层单元数不易确定的问题,提出一种在传统的经验公式基础上快速确定隐层单元数的方法。该方法首先借助经验公式确定隐层单元数的取值范围,然后将其扩大,在这个扩大的范围内寻找最优值。以BP神经网络预测交通流量为例,解释说明了具体的步骤,以及网络模型的隐层结构对模型仿真精度的影响。结果表明,采用该方法可快速决定隐层单元数,在实例中采用16个隐层单元数为最佳。     

Power efficient scheme for self localization in wireless sensor networks

With the tremendous applications of the wireless sensor network, self-localization has become one of the challenging subject matter that has gained attention of many researchers in the field of wireless sensor network. Localization is the process of assigning or computing the location of the sensor nodes in a sensor network. As the sensor nodes are deployed randomly, we do not have any knowledge about their location in advance. As a result, this becomes very important that they localize themselves as manual deployment of sensor node is not feasible. Also, in WSN the main problem is the power as the sensor nodes have very limited power source. This paper provides a novel solution for localizing the sensor nodes using controlled power of the beacon nodes such that we will have longer life of the beacon nodes which plays a vital role in the process of localization as it is the only special nodes that has the information about its location when they are deployed such that the remaining ordinary nodes can localize themselves in accordance with these beacon node. We develop a novel model that first finds the distance of the sensor nodes then it finds the location of the unknown sensor nodes in power efficient manner. Our simulation results show the effectiveness of the proposed methodology in terms of controlled and reduced power.     

Personalized Cancer Immunotherapy via Transporting Endogenous Tumor Antigens to Lymph Nodes Mediated by Nano Fe3O4

While immunotherapy has a tremendous clinical potential to combat cancer, immune responses generated by conventional cancer immunotherapy remain not enough to completely eliminate tumors, mainly due to the tumor's immunosuppressive microenvironment and heterogeneity of tumor immunogenicity. To improve antitumor immune responses and realize personalized immunotherapy, in this report, endogenous tumor antigens (ETAs) that dynamically present on tumor cells are transported to lymph nodes (LNs). Based on the hypothesis that nano Fe₃O₄ (≈10 nm) could serve as the nanocarrier for transporting ETAs from the tumor to LNs, we wondrously find that Fe₃O₄ has a tremendous potential to improve cancer immunotherapy, because of its excellent protein‐captured efficiency and LNs‐targeted ability. To ensure the optimal ETAs‐bound efficiency of Fe₃O₄, a core–shell formulation (denoted as Ce6/Fe₃O₄‐L) is developed and specific release of Fe₃O₄ in tumor is enabled. These findings provide a simple and general strategy for boosting cytotoxic T‐cell response and realizing personalized cancer immunotherapy simultaneously.     

工业软测量模型结构与输入变量选择的研究

针对过程工业中难以直接测量的变量建立其软测量模型,对于实现关键指标的在线监测和实时控制具有十分重要的意义.变量的选择直接关系到神经网络软测量模型的预测性能,针对现有输入变量和网络结构选择方法在工业应用中的不足,提出了一种基于敏感度分析的方法来确定网络输入变量集和前馈神经网络隐含层节点个数,并建立了高密度聚乙烯(HDPE...     

带移动节点的无线传感器网络时间同步方法

为提高无线传感器网络中节点间时间同步的精度并且降低节点能量消耗,提出了一种基于移动节点与静态节点混合网络的时间同步方法.先建立一个带移动的节点的分簇网络结构,再结合发送者一接受者与改进的发送者一发送者两种同步模型从多个移动节点同时发起同步.通过数学分析和仿真得出该同步方法在同步时间精度和节点节能方面具有良好的性能.     

PRST-Chord:基于Chord的低延时查询改进算法

针对目前Chord协议中逻辑覆盖网与底层物理拓扑不匹配的问题,提出了一种改进算法PRST-Chord(proximity routing selection and topology-based Chord).该算法基于底层的拓扑信息来构造节点标识,使得物理上相邻的节点在逻辑上也尽可能相邻,同时修改了Chord的查询算法,通过预测节点问的网络延时优化下一跳节点的路由选择.仿真实验结果表明,改进算法有效地降低了查询延时,提高了资源定位的性能.     

一种基于移动坐标系的新型节点定位算法

提出一种与距离无关的基于移动坐标系的分布式定位算法,以移动锚节点为原点建立坐标系,未知节点以邻居锚节点信息在临时坐标系中确定自身位置区域,通过在不同坐标系下确定的位置区域取公共集不断缩小自身未知区域,最后利用质心算法求出节点位置坐标。仿真结果表明:新算法拥有较高的定位精度和适度的开销。