论文信息 - Minimal Hop Count Path Routing Algorithm for Mobile Sensor Networks

Minimal Hop Count Path Routing Algorithm for Mobile Sensor Networks

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%

Jae-Young Choi | Jun-Hui Lee | Yeong-Jee Chung

[1] Jerry Zhao,et al. Habitat monitoring: application driver for wireless communications technology , 2001, CCRV.

[2] Ian F. Akyildiz,et al. Sensor Networks , 2002, Encyclopedia of GIS.

[3] Wendi Heinzelman,et al. Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[4] John Anderson,et al. Wireless sensor networks for habitat monitoring , 2002, WSNA '02.

[5] Deborah Estrin,et al. Habitat monitoring: application driver for wireless communications technology , 2001, SIGCOMM LA '01.

[6] Anantha P. Chandrakasan,et al. An application-specific protocol architecture for wireless microsensor networks , 2002, IEEE Trans. Wirel. Commun..