首页> 外国专利> Adaptive wireless sensor network and method for routing data in a wireless sensor network

Adaptive wireless sensor network and method for routing data in a wireless sensor network

机译:自适应无线传感器网络和用于在无线传感器网络中路由数据的方法

摘要

Method comprising the following steps: Detecting a time related event by a source sensor node of a wireless sensor network comprising a plurality of sensor nodes; Determining a plurality of paths from the source sensor node to a sink of the wireless sensor network, the multiple paths consisting of hops from sensor nodes to sensor nodes; and in response to the step of determining, a step of optimizing a distribution of data packets to each path of the plurality of paths by simultaneously using a processor of the source sensor node (i) the energy consumed by sensor nodes on each path of the plurality of paths and (ii) a time for transmitting the data packets from the source sensor node to the sink, characterized in that the step of optimizing a distribution of data packets comprises: Solving the equation: <mrow><mtext> Z </mtext><mo> = </mo><mi mathvariant="normal"> Σ </mi><mtext> j </mtext><mrow><mo> ( </mo><mrow><mn> 2 </mn><mo> * </mo><mi mathvariant="normal"> Δ </mi><mtext> j </mtext><mo> * </mo><mtext> tpj </mtext><mo> * </mo><mtext> hj </mtext><mo> * </mo><mtext> pj </mtext></mrow><mo> ) </mo></mrow></mrow> with the boundary conditions <mrow><mi mathvariant="normal"> Σ </mi><mtext> j </mtext><mi mathvariant="normal"> Δ </mi><mtext> j </mtext><mo> = </mo><mtext> D; </mtext></mrow> <mrow><mtext> Max </mtext><mrow><mo> [ </mo><mrow><mrow><mo> ( </mo><mrow><mi mathvariant="normal"> Δ </mi><mtext> j </mtext><mo> * </mo><mi mathvariant="normal"> τ </mi><mtext> j </mtext><mo> * </mo><mtext> hj </mtext><mo> * </mo><mtext> pj </mtext></mrow><mo> ) </mo></mrow></mrow><mo> ] </mo></mrow><mo> ≤ </mo><mrow><mo> { </mo><mrow><mrow><mo> [ </mo><mrow><mrow><mo> ( </mo><mrow><mtext> D </mtext><mo> * </mo><mi mathvariant="normal"> τ </mi><mtext> Rod </mtext><mo> * </mo><mtext> Hstab </mtext><mo> * </mo><mtext> pj </mtext></mrow><mo> ) </mo></mrow></mrow><mo> ] </mo></mrow><mo> + </mo><mrow><mo> [ </mo><mrow><mtext> Max </mtext><mrow><mo> [ </mo><mrow><mtext> D / nj </mtext><mo> * </mo><mi mathvariant="normal"> Δ </mi><mtext> j </mtext><mo> * </mo><mtext> hj </mtext><mo> * </mo><mtext> pj </mtext></mrow><mo> ] </mo></mrow></mrow><mo> ] </mo></mrow></mrow><mo> } </mo></mrow><mo> / </mo><mn> 2 </mn><mo> ; </mo></mrow> and <mrow><mn> 2 </mn><mo> * </mo><mi mathvariant="normal"> Δ </mi><mtext> j </mtext><mo> * </mo><mtext> tpi </mtext><mo> + </mo><mtext> Kr </mtext><mo> * </mo><mtext> Max </mtext><mrow><mo> ( </mo><mrow><mi mathvariant="normal"> Δ </mi><mtext> j </mtext><mo> * </mo><mi mathvariant="normal"> τ </mi><mtext> j </mtext><mo> * </mo><mtext> hj </mtext><mo> * </mo><mtext> pj </mtext></mrow><mo> ) </mo></mrow><mo> </mo><mtext> Pjmin; </mtext></mrow> and wherein Z is equal to the objective function; D is equal to the total volume of data to be transferred; <mrow><mtext> Kr </mtext><mo> = </mo><mtext> nj </mtext><mo> * </mo><mtext> tj; </mtext></mrow> Kr equals the effective energy loss rate of a node due to processing and detection (joules / second); nj is equal to the number of sensor nodes on the jth path; tj is equal to the time the path is used to transmit data packets; <mrow><mi mathvariant="normal"> τ </mi><mtext> j </mtext><mo> = </mo><mtext> qj </mtext><mo> + </mo><mn> 1 </mn><mo> / </mo><mtext> bj; </mtext></mrow> Tj is the mean delay / packet / hop for the jth path (seconds / packet / hop); qj is equal to the mean queue delay on the jth path; Bj is equal to the bit rate of the jth path (in packets / second); <mrow><mtext> pj </mtext><mo> = </mo><mn> 2 </mn><mo> * </mo><mi mathvariant="normal"> Δ </mi><mtext> j </mtext><mo> * </mo><mtext> tpj </mtext><mo> * </mo><mtext> Hj; </mtext></mrow> pj is the energy consumed on the jth path; tpj is equal to the transmission energy / packet / hop for the jth path (joule / packet / hop); Δj is equal to the number of data packets transmitted over the jth path; Hj is equal to the number of hops on the jth path; Pjmin is equal to the energy remaining on the jth path to the sensor node with the least amount of residual energy; τstab is equal to the mean delay / packet / hop for the maximum lifetime path (seconds / packet / hop); and Hstab is equal to the number of hop counters for the maximum lifetime path.
机译:该方法包括以下步骤:由包括多个传感器节点的无线传感器网络的源传感器节点检测与时间有关的事件;以及确定从源传感器节点到无线传感器网络的宿的多个路径,所述多个路径包括从传感器节点到传感器节点的跳。响应于确定步骤,通过同时使用源传感器节点的处理器来优化数据包到多个路径的每个路径的分配的步骤(i)传感器节点在网络的每个路径上消耗的能量多个路径;以及(ii)从源传感器节点向宿发送数据分组的时间,其特征在于,优化数据分组的分布的步骤包括:解方程: <![CDATA [ Z = Σ j < mrow> 2 * Δ j * tpj * hj * pj ]]> ,其边界条件为 <![CDATA [ Σ j Δ j = D; ]]> <![CDATA [ Max [ Δ j * τ j * hj * pj ] { [ D * τ * Hstab * pj ] + < mrow> [ 最大 [ D / nj * < / mo> Δ j * hj * pj ] ] } / 2 ; ]]> <![CDATA [ 2 < mo> * Δ j * tpi + Kr * 最大 Δ< / mi> j * τ j * hj * pj / mo> Pjmin ; ]]> ,其中Z等于目标函数; D等于要传输的数据总量; <![CDATA [ Kr = nj * < / mo> tj; ]]> Kr等于节点由于处理和检测而产生的有效能量损失率(焦耳/秒); nj等于第j条路径上的传感器节点数; tj等于路径用于传输数据包的时间; <![CDATA [ τ j = qj + 1 / bj; ]]> Tj是第j条路径的平均延迟/数据包/跳(秒/数据包/跳); qj等于第j条路径上的平均队列延迟; Bj等于第j条路径的比特率(以包/秒为单位); <![CDATA [ pj = 2 * < / mo> Δ j * tpj * Hj; ]]> pj是第j条路径上消耗的能量; tpj等于第j条路径的传输能量/分组/跳(焦耳/分组/跳); Δj等于在第j条路径上传输的数据包的数量; Hj等于第j条路径上的跳数; Pjmin等于剩余能量最少的第j条路径上到传感器节点的剩余能量; τstab等于最大生命周期路径的平均延迟/数据包/跃点(秒/数据包/跃点); Hstab等于最大生命周期路径的跳数计数器的数量。

著录项

  • 公开/公告号DE112011101470B4

    专利类型

  • 公开/公告日2018-08-23

    原文格式PDF

  • 申请/专利权人 INTERNATIONAL BUSINESS MACHINES CORPORATION;

    申请/专利号DE201111101470T

  • 发明设计人 AMITAVA MUKHERJEE;

    申请日2011-04-20

  • 分类号H04L12/761;H04W40/28;H04L12/803;H04W28/08;H04W28/06;H04W40/04;H04W84/18;

  • 国家 DE

  • 入库时间 2022-08-21 12:35:06

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号