计算机研究与发展
計算機研究與髮展
계산궤연구여발전
JOURNAL OF COMPUTER RESEARCH AND DEVELOPMENT
2009年
12期
2053-2061
,共9页
无线传感器网络%分布式%多路径路由%不相交路径路由%可靠性
無線傳感器網絡%分佈式%多路徑路由%不相交路徑路由%可靠性
무선전감기망락%분포식%다로경로유%불상교로경로유%가고성
wireless sensor network%distribution%multi-path routing%disjoint multi-path routing%reliability
无线传感器网络经常被用来采集物理数据,监测环境变化.由于低功耗无线通信不确定性、链路质量不稳定性以及节点失效等问题,传感器网络很容易导致路由数据包丢失.为了提高网络路由的可靠性,人们提出多路径路由算法.多路径路由中源节点到目的节点的多条路径可能含有公共节点,或者公共边,如果公共节点或者公共链路失效,则这个数据包也丢失,因此又有人提出不相交多路径路由算法.不相交多路径路由算法又分为链路不相交多路径路由算法和节点不相交多路径路由算法.提出了一种不相交路径路由算法,可以将感知节点采集到的数据通过不相交路径传送到汇聚节点,提高路由的可靠性.而且,这个算法还可以很方便地应用到多Sink节点的网络当中.该路由算法用到的路由表大小为|K|,其中|K|表示路径数.算法的运行时间复杂度是O(|L|),其中|L|表示网络中的边数.
無線傳感器網絡經常被用來採集物理數據,鑑測環境變化.由于低功耗無線通信不確定性、鏈路質量不穩定性以及節點失效等問題,傳感器網絡很容易導緻路由數據包丟失.為瞭提高網絡路由的可靠性,人們提齣多路徑路由算法.多路徑路由中源節點到目的節點的多條路徑可能含有公共節點,或者公共邊,如果公共節點或者公共鏈路失效,則這箇數據包也丟失,因此又有人提齣不相交多路徑路由算法.不相交多路徑路由算法又分為鏈路不相交多路徑路由算法和節點不相交多路徑路由算法.提齣瞭一種不相交路徑路由算法,可以將感知節點採集到的數據通過不相交路徑傳送到彙聚節點,提高路由的可靠性.而且,這箇算法還可以很方便地應用到多Sink節點的網絡噹中.該路由算法用到的路由錶大小為|K|,其中|K|錶示路徑數.算法的運行時間複雜度是O(|L|),其中|L|錶示網絡中的邊數.
무선전감기망락경상피용래채집물리수거,감측배경변화.유우저공모무선통신불학정성、련로질량불은정성이급절점실효등문제,전감기망락흔용역도치로유수거포주실.위료제고망락로유적가고성,인문제출다로경로유산법.다로경로유중원절점도목적절점적다조로경가능함유공공절점,혹자공공변,여과공공절점혹자공공련로실효,칙저개수거포야주실,인차우유인제출불상교다로경로유산법.불상교다로경로유산법우분위련로불상교다로경로유산법화절점불상교다로경로유산법.제출료일충불상교로경로유산법,가이장감지절점채집도적수거통과불상교로경전송도회취절점,제고로유적가고성.이차,저개산법환가이흔방편지응용도다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.