Subnets based Distributed Data-Centric Hierarchical Ant Routing for Sensor Networks
In this paper, a novel routing algorithm is proposed in which the nodes are clustered into different subnets by their geographical location, and a node with maximum surplus energy is selected as the core node in every subnet. The core node set routes for sensor data by using ant algorithm, which needs only local information to find the optimal path to the sink node distributedly.Analysis and simulation results demonstrate that this new algorithm is of better routing performance for sensor networks compared with previous algorithms such as AC and GITDC.
sensor networks subnets energy-core location information ant algorithm
XIE Zhi-jun Chen Hong WANG Lei
School of Information RenMin University BeiJingChina 100872 College of Computer and Information Science, Fujian University of Technology, Fuzhou
国际会议
武汉
英文
895-900
2005-09-23（万方平台首次上网日期，不代表论文的发表时间）