欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
无线传感器网络经常被用来采集物理数据，监测环境变化。由于低功耗无线通信不确定性、链路质量不稳定性以及节点失效等问题，传感器网络很容易导致路由数据包丢失。为了提高网络路由的可靠性，人们提出多路径路由算法。多路径路由中源节点到目的节点的多条路径可能含有公共节点，或者公共边，如果公共节点或者公共链路失效，则这个数据包也丢失，因此又有人提出不相交多路径路由算法。不相交多路径路由算法又分为链路不相交多路径路由算法和节点不相交多路径路由算法。提出了一种不相交路径路由算法，可以将感知节点采集到的数据通过不相交路径传送到；12聚节点，提高路由的可靠性。而且，这个算法还可以很方便地应用到多Sink节点的网络当中。该路由算法用到的路由表大小为｜K｜，其中｜K｜表示路径数。算法的运行时间复杂度是O（｜L｜），其中｜L｜表示网络中的边数。
英文摘要：
Wireless sensor network （WSN） are usually used to monitor environment by collecting data from sensors deployed in a particular area. But the link quality of WSN is unstable and the network easily has nodes failures, so the data loss is an open problem in wireless sensor network. In order to achieve routing robustness in networks, people proposed multi-path routing （MPR） in sensor networks. But MPR fails when the common links or the common nodes in multiple paths fail. To solve the common-link and common-node problem, disjoint multi-path routing （DMPR） is employed where sensors send data to the sink through link-disjoint or node-disjoint path. In this paper, the authors develop a routing mechanism where sensor nodes can send data to sink through node-disjoint paths. And the algorithm is suited for multi-sink applications where every sensor node can forward the packets to any one of the sinks. The number of routing table entries of the algorithms at each node is ｜K｜, where ｜K｜ denotes the number of multi-path. The running time complexity of the algorithm is O（｜L｜）, where ｜L｜ denotes the number of links in the network. The experiment results show that the algorithm can effectively improve the routing reliability in sensor networks.
同期刊论文项目
同项目期刊论文
期刊信息
位置：