无线传感器网络中保证交付的贪婪路由算法3 - 传感技术学报.pdfVIP

第 22 卷 　第 7 期 传 感 技 术 学 报 Vol . 22 　N o . 7 2009 年 7 月 CHIN ES E J OU RNAL OF S EN SORS AND AC TUA TORS J ul . 2009 Greedy Routing with Guaranteed Del ivery in Wireless Sensor Net works TA N G M i ng d ong 1 , 2 , 3 , YA N G J i ng 2 , Z H A N G Guoqi ng 2 1 Key L ab. of Know ledge P rocess ing N etw orked M anuf act ure , H unan University of S cience and Technology , X iang tan H anan 4 11201, China; 2 I ns t it ute of Comp ut i ng Technology , Chi nese A ca demy of S ciences , B eij i ng 100 190 , Chi na; 3 Gra d uate S chool , Chi nese A ca demy of S ciences , B eij i ng 100049 , Chi na; Abstract :Thi s p ap er p re sent s a scalable p ointtop oint routing scheme for wirele ss sen sor net wor k s. The scheme a ssign s a coor dinat e to each no de of t he net wor k so t hat t he no de s are embedded into a met ric sp ace induced by a small size of sp anning t ree s of t he net wor k grap h ,and t hu s accor din g to t he coor dinat e sp ace a greedy routing algorit hm can be u sed for every p air of no de s. i . e . , no de s alway s forwar d p acket s to t he neighbor w hich i s clo se st to t he de stination . In t he scheme ,each no de only needs to maint ain t he coor di ( ) 2 nat e s of it s neighbor s in it s routin g t able ,and t he over head of each p acket head s i s bounded by O lo g2 n bit s. Co mp ared wit h many po sitionba sed greedy routing algorit hm s ,t he scheme en sure s t hat greedy rou ting i s alway s succe ssf ul in finding a rout e to t he de stination ,if such a rout e exi st s