期刊名称：International Journal of Innovative Research in Computer and Communication Engineering
印刷版ISSN：2320-9798
电子版ISSN：2320-9801
出版年度：2015
卷号：3
期号：5
DOI：10.15680/ijircce.2015.0305039
出版社：S&S Publications
摘要：Newly, the research center on geographic routing, a capable routing scheme in wireless (Mobile) sensornetworks (WSNs), is changing in the direction of duty-cycled WSNs in which sensors are sleep scheduled to reduceenergy consumption. However, distant from the connected-k neighborhood (CKN) sleep scheduling algorithm and thegeographic routing slanting sleep scheduling (GSS) algorithm, nearly all study work about geographic routing in dutycycledWSNs has alert on the geographic forwarding mechanism; further, most of the nearby work has unnoticed thefact that sensors can be mobile. In this paper, we spotlight on sleep scheduling for geographic routing in duty-cycledWSNs with mobile sensors and recommend two geographic-distance-based related-k neighborhood (GCKN) sleepscheduling algorithms. The first one is the geographic-distance-based connected-k-neighborhood for first path(GCKNF) sleep scheduling algorithm. The second one is the geographic-distance-based connected-k-neighborhood forall paths (GCKNA) sleep scheduling algorithm. By abstract analysis and simulations, we express that when there aremobile sensors, geographic routing can realize shorter average lengths for the first transmission path explored in WSNsemploying GCKNF sleep scheduling and all transmission paths searched in WSNs employing GCKNA sleepscheduling compared with those in WSNs employing CKN and GSS sleep scheduling. finally we evaluate differentrouting protocol with accessible scenario.
