摘要
无线传感器网络地理路由协议要求节点根据少量本地路由信息将数据分组传输路由到目标节点。为了消除路由环,地理路由算法通常需要将网络拓扑平面化。然而现有的平面化算法要么假设节点的通信半径是一固定值,在实际应用中不适用;要么对每一条链路都进行检测是否有交叉链路,路由维护代价很高。针对以上问题,提出一种具有高可靠性和低维护成本的地理路由协议RPR(region partitioning-based routing),其基本思想是将网络划分为规则多边形区域,并在贪心路由失败时将多边形区域内的所有节点看作一个虚拟节点进行周边路由。多边形区域间通信能够降低平均路由路径长度,从而提高了路由的可靠性。基于区域划分的网络平面化策略不需要检测和删除相交链路,因此减少了路由维护开销。模拟实验结果显示,RPR协议比现有方法的平均路由路径长度更短,路由维护开销更低。
Geographical routing mechanisms were widely used in wireless sensor networks （WSN）, by which data packets could be routed to the destination sensor node through a small amount of local routing information. Geographic routing algorithms usually required planar graphs derived from the original network topologies. However, most planarization algorithms assumed a fixed communication radius of the sensor nodes, which mismatched real applications. The only practical algorithm brought in overheads in deleting and adding cross links. To provide a solution to the problem of existing algorithms, RPR （region partitioning-based routing） was introduced. RPR was a high-reliable and low-cost geo- graphic routing protocol, which divided the whole network into numbers of regular regions, and tried to perform a region-greedy routing on the virtual node of a region when the node-greedy routing failed. RPR had high reliability since the transmissions between regions could reduce the average length of the routing paths. Furthermore, RPR had low cost because its planarization phase did not check or delete cross links. Experiments show that RPR performs better than existing algorithms.
出处
《通信学报》
EI
CSCD
北大核心
2012年第5期29-37,48,共10页
Journal on Communications
基金
国家自然科学基金资助项目(61033015
60831160525
60933001
60703012)~~
关键词
无线传感器网络
地理路由
平面化
区域划分
wireless sensor networks
geographical routing
planar graph
region partition
