Minimal Hop Count Path Routing Algorithm for Mobile Sensor Networks
Computer and Computational Sciences, 2006. IMSCCS '06. First International Multi-Symposiums（2006）
摘要
LEACH and LEACH-C have demonstrated the feasibility of achieving good efficient routing path. As considering mixed sensor fields with fixed and mobile nodes in a sensor field LEACH and LEACH-C are not appropriate to support mobile sensor nodes. In this paper, we proposed an algorithm, called "Minimal Hop Count Path Routing Algorithm", for mobile sensor nodes on mixed sensor fields using pseudo clusters, in which it has a cluster head only by the fixed node. These cluster heads are selected from fixed sensor nodes and a mobile sensor node selects minimal hop count routing path to transmit data for energy efficient routing path to sink node. Our simulation experiments were shown that it achieved average data transfer success rate to sink node of 89.3%.
更多查看译文
关键词
routing algorithm,mobile node,fixed node,mobile sensor node,mixed sensor field,mobile sensor networks,good efficient routing path,energy efficient routing path,cluster head,minimal hop count path,fixed sensor node,average data transfer success,sensor field,mobile computing,network,clustering algorithms,routing,energy efficiency,routing protocols,data transfer,sensor network,wireless sensor network,simulation experiment,wireless sensor networks,algorithm design and analysis,mobile communication
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要