Cooperative Energy Efficient Routing for Wireless Sensor Networks in Smart Grid Communications

Smart Grids employ wireless sensor networks for their control and monitoring. Sensors are characterized by limitations in the processing power, energy supply and memory spaces, which require a particular attention on the design of routing and data management algorithms. Since most routing algorithms for sensor networks, focus on finding energy efficient paths to prolong the lifetime of sensor networks, the power of sensors on efficient paths depletes quickly, and consequently sensor networks become incapable of monitoring events from some parts of their target areas. In consequence, the design of routing protocols should consider not only energy efficiency paths, but also energy efficient algorithms in general. In this paper we propose an energy efficient routing protocol for wireless sensor networks without the support of any location information system. The reliability and the efficiency of this protocol have been demonstrated by simulation studies where we compare them to the legacy protocols. Our simulation results show that these algorithms scale well with network size and density.




References:
[1] V.C. Gungor, "Multimedia Wireless Sensor Networks for Smart Grid
Applications," in IEEE COMSOC MMTC E-Letter, vol. 6, no. 12, pp.9-
11, 2011.
[2] Emilio Ancillotti, Raffaele Bruno, and Marco Conti, "The Role of the
RPL Routing Protocol for Smart Grid Communications," IEEE
Communications Magazine, Vol.51, no.1, January 2013, pp. 75-83.
[3] S. Shenker, S. Ratnasamy, B. Karp, R. Govindan, and D. Estrin. "Datacentric
storage in sensornets," Proc. ACM SIGCOMM Workshop on Hot
Topics In Networks, 2002.
[4] S. Ratnasamy, B. Karp, L. Yin, F. Yu, D. Estrin, R. Govindan, and S.
Shenker. "GHT: a geographic hash table for data-centric storage,"
Proceedings of the ACM Workshop on Sensor Networks and
Applications, pp. 78--87, Atlanta, Georgia, USA:ACM, September 2002.
[5] Rowstron and P. Druschel, "Pastry: Scalable, distributed object location
and routing for large-scale peer-to-peer systems," in Proceedings of the
Middleware, 2001.
[6] Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott
Shenker. "A Scalable Content-Addressable Network," In Proceedings of
the ACM SIGCOMM, 2001.
[7] Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan.
"Chord: A Scalable Peer-topeer Lookup Service for Internet
Applications," ACM SIGCOMM 2001, San Diego, CA, August 2001.
[8] Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph, and J. D.
Kubiatowicz, "Tapestry: A resilient global-scale overlay for service
deployment," IEEE Journal on Selected Areas in communications, vol.
22, no. 1, pp. 41-53, January 2004.
[9] Karp and H. T. Kung. "GPSR: greedy perimeter stateless routing for
wireless networks," Proceedings of the 6th annual international
conference on Mobile computing and networking, Boston,
Massachusetts, United States, 2000, pages 243-254.
[10] Rao, S. Ratnasamy, C. Papadimitriou, S. Shenker, and I. Stoica,
"Geographic routing without location information," in ACM MobiCom,
2003.
[11] James Newsome and Dawn Song, "Gem: graph embedding for routing
and data-centric storage in sensor networks without geographic
information," in SenSys -03: Proceedings of the 1st international
conference on Embedded networked sensor systems, New York, NY,
USA, 2003, pp. 76-88, ACM Press.
[12] "FIPS 180-1, Secure Hash Standard." U.S. Department of
commerce/NIST, National Technical Information Service, Springfield,
Apr. 1995.
[13] C. Perkins and E. Royer,"Ad hoc on demand Distance Vector routing,"
in proceedings of the 2nd IEEE Workshop on Mobile Computing Systems
and Applications: (WMCA-99), New Orleans, Louisiana, USA, February
1999.
[14] Network Simulator, http://www.isi.edu/nsnam/ns/.
[15] N. Sarkar, and W. Lol, "A study of MANET Routing Protocols: Joint
Node Density, Packet Length and Mobility", in Proceedings of ISCC '10
The IEEE symposium on Computers and Communications, Reccione,
Italy, June 2010.