GEO ROUTING IN DUTY-CYCLED MOBILE SENSOR NETWORKS USING SLEEP SCHEDULING ALGORITHM
K. Sabarul Hasna
M.C.A Student, Department of Master of Computer Applications
Dr. A. Suresh
Professor, K.S.Rangasamy College of Technology, Tamilnadu, India
44-50
Vol: 5, Issue: 1, 2015
Receiving Date:
2014-11-19
Acceptance Date:
2014-12-20
Publication Date:
2015-01-18
Download PDF
Abstract
In this paper focus on sleep scheduling for geographic routing in duty cycled WSNs with mobile sensors and
proposes two geographic-distance-based connected-k neighbourhood (GCKN) sleep scheduling algorithms. The
first one is the geographic-distance-based connected-k neighbourhood for first path (GCKNF) sleep scheduling
algorithm. The second one is the geographic-distance-based connected-k neighbourhood for all paths (GCKNA)
sleep scheduling algorithm. The main concept of this paper is Geographic routing, a promising routing scheme in
wireless sensor networks (WSNs), is shifting toward duty-cycled WSNs in which Mobile sensors are sleep
scheduled to reduce energy consumption.
Keywords:
geographic routing ; scheduling ; algorithms ; neighbourhood
References
- C. Zhu et al., “A survey on communication and data management issues in mobile sensor networks,” Wireless Commun. Mobile Comput., vol. 14,no. 1, pp. 19–36, Jan. 2014.
- C. Zhu, L. T. Yang, L. Shu, J. J. P. C. Rodrigues, and T. Hara, “A geographic routing oriented sleep scheduling algorithm in duty-cycled sensor networks,” in Proc. IEEE ICC, 2012.
- H. Takagi and L. Kleinrock,“Optimal transmission ranges for randomly distributed packet radio networks,”IEEE Trans. Commun.,vol.COM-32,no.3, Mar. 1984.
- P. Cheng, F. Zhang, J. Chen, Y. Sun, and X. Shen, “A distributed TDMA scheduling algorithm for in ultrasonic sensor networks,” IEEE Trans. Ind. Electron., vol. 60, no. 9target tracking , pp. 3836– 3845,Sep. 2013.
- H. Zhang, L. Shu, J. J. P. C. Rodrigues, and H.-C. Chao, “Solving network isolation problem in duty-cycled wireless sensor networks,” in Proc. MobiSys, 2013.
- Z. Jiang, J. Wu, and R. Ito, “A metric for routing in d e l a y-s e n s i t i v e wireless sensor networks,” in Proc. IEEE MASS, 2010, pp. 272–281.
- C. Ma et al., “A geographic routing algorithm in duty-cycled sensor networks with mobile sinks,” in Proc. MSN, 2011, pp. 343–344.
- S. Nath and P. B. Gibbons, “Communicating via fireflies: Geographic routing on duty-cycled sensors,” in Proc. IPSN, 2007, pp. 440–449.
- E. M. Royer, P. M. Melliar-Smith, and L. E. Moser, “An analysis of the optimum node density for ad hoc mobile networks,” in Proc. IEEE ICC, 2001, pp. 857–861.
- J. Reich, V. Misra, D. Rubenstein, and G. Zussman, “Connectiv- ity maintenance in mobile wireless networks via constrained mobil- ity,” IEEE J. Sel. Areas Commun., vol. 30, no. 5, pp. 935–950, Jun. 2012.
- S. Subramanian and S. Shakkottai, “Geographic routing with limited in- formation in sensor networks,” IEEE Trans. Inf. Theory, vol. 56, no. 9, pp. 4506–4519, Sep. 2010.
- C. Zhua, L. T. Yang, L. Shu, T. Q. Duong, and S. Nishio, “Secured energy-aware sleep scheduling algorithm in duty-cycled sensor networks,” in Proc. IEEE ICC, 2012, pp. 1953–1957.
- C. Zhu, L. T. Yang, L. Shu, J. J. P. C. Rodrigues, and T. Hara, “A geo- graphic routing oriented sleep scheduling algorithm in duty-cycled sensor networks,” in Proc. IEEE ICC, 2012, pp. 5473–5477
Back
