|
Energy Efficient Self-Scheduling Algorithm For Wireless Sensor Networks
[Full Text]
AUTHOR(S)
Singaram M, Finney Daniel Shadrach S, Sathish Kumar N, Chandraprasad V
KEYWORDS
Index Terms: Blind spot, Energy efficient, Energy saving, Radio energy models, Scheduling algorithm, Wireless node, Wireless sensor networks.
ABSTRACT
Abstract: The goal of this work is to preserve full coverage-target area while minimising the number of active nodes.The nodes which are available in the wireless sensor networks consumes more energy even when the nodes are not sensing or covering the target area. Radio energy models are being used to find the energy consumed during access of the nodes at various modes like transmit, receive, idle and sleep mode. When the nodes enters the sleep state and doesn't sense or cover any target area then there will be an occurrence of blind point and that particular spot where the blind point occurs can be said as an blind spot. The issue of energy saving is significant since in a battery-operated wireless node, the battery energy is finite and a node can only transmit a finite number of bits. The maximum number of bits that can be sent is defined by the total battery energy divided by the required energy per bit. The blind point can be removed using the back of mechanism and that's the major part of the work.
REFERENCES
[1] Zairi.s B. Zouari Niel.E, “Nodes self-Scheduling approach for maximizing wireless Sensor Network lifetime” in IET Wireless sensor systems on The Institution of Engineering and Technology, April 2011.
[2] Tian, D., Georganas, N.D.: “A coverage-preserving node scheduling scheme for large wireless sensor networks”. WSNA’02: Proc. First ACM Int. Workshop on Wireless Sensor Networks and Applications, 2002, pp. 32–41.C. J. Kaufman, Rocky Mountain Research Laboratories, Boulder, Colo., personal communication, 1992. (Personal communication)
[3] J Cardei, M., Thai, M.T., Yingshu, L., Weili, W.: “Energy-efficient target coverage in wireless sensor networks”. INFOCOM 2005: 24th Annual Joint Conf. IEEE Computer and communications Societies, 2005, pp. 1976–1984.
[4] Chih-fan, H., Mingyan, L.: “Network coverage using low duty-cycled sensors: Random & coordinated sleep algorithms”.IPSN’04: Proc. Third Int. Symposium on Information Processing in Sensor Network, 2004, pp 433–442.Huang, D.-F., Tseng, Y.-C.: “The coverage problem in a wireless sensor network”. WSNA’03: Proc. Second ACM Int. Conf. on Wireless Sensor Networks and Applications, 2003, pp. 115-121.
[5] Tian, D., Georganas, N.D.: “A coverage-preserving node scheduling scheme for large wireless sensor networks”. WSNA’02: Proc. First ACM Int. Workshop on Wireless Sensor Networks and Applications, 2002, pp. 32–41.C. J. Kaufman, Rocky Mountain Research Laboratories, Boulder, Colo., personal communication, 1992. (Personal communication)
[6] Tian, D., Georganas, N.D.: “A coverage-preserving node scheduling scheme for large wireless sensor networks”. WSNA’02: Proc. First ACM Int. Workshop on Wireless Sensor Networks and Applications, 2002, pp. 32–41.
[7] Zhang, H., Hou, J.: ‘Maintaining sensing coverage and connectivity in large sensor networks’, Ad Hoc Sens. Wirel. Netw., 2005, 1, pp. 89 – 124
[8] Zhang, H., Wang, H., Feng, H.: ‘A distributed optimum algorithm for target coverage in wireless sensor networks’. Asia-Pacific Conf. on Information Processing, 2009, pp. 144 – 147
[9] Wang, Y.-C., Tseng, Y.-C.: ‘Distributed deployment schemes for mobile wireless sensor networks to ensure multilevel coverage’, IEEE Trans. Parallel Distrib. Syst., 2008, 19, (9), pp. 1280 – 1294
[10] Cardei, M., Thai, M.T., Yingshu, L., Weili, W.: ‘Energy-efficient target coverage in wireless sensor networks’. INFOCOM 2005: 24th AnnualJoint Conf. IEEE Computer and Communications Societies, 2005, vol. 3, pp. 1976 – 1984
[11] Li1, Y., Ai1, C., Cai2, Z., Beyah, R.: ‘Sensor scheduling for p-percent coverage in wireless sensor networks’, Cluster Computing., 2009, pp. 27 – 40
[12] Fan, G.J., Jin, S.Y.: ‘Coverage problem in wireless sensor Network a survey’, J. Netw., 2010, 5, pp. 1033 – 1040
[13] Mulligan, R.: ‘Coverage in wireless sensor networks: a survey’, Netw. Protocols Algorithms, 2001, 2, pp. 27 - 53
|
