International Journal of Scientific & Technology Research

Home About Us Scope Editorial Board Blog/Latest News Contact Us
10th percentile
Powered by  Scopus
Scopus coverage:
Nov 2018 to May 2020


IJSTR >> Volume 3- Issue 11, November 2014 Edition

International Journal of Scientific & Technology Research  
International Journal of Scientific & Technology Research

Website: http://www.ijstr.org

ISSN 2277-8616

A Survey On: Energy Aware CSI For Distributed Randomized K-Covered WSN

[Full Text]



D.Shilpa Kamala Priya, S.Boopathy



Keywords: Geographic Forwarding, Scheduling, Clustering, k-coverage, Wireless Sensor Network.



Abstract: In Wireless Sensor Network each sensor is powered with battery life. Energy consumption plays an important role in WSN. Network life is prolonged by enhancing the energy conservation. The geographical forwarding and k coverage is used together to analyze the energy and the battery life. The sleep awake scheduling algorithm is used where energy loss takes place, so a distributed k covered randomized algorithm is used to improve the battery life and energy. The k coverage covers the maximum area with minimum number of sensors. Example for k coverage is planet exploration, multi sensor data etc. The k coverage plays an important role by minimizing energy and determining the number of active sensor for the required k coverage field. Geographic forwarding is used for passing the data from source to destination, when forwarding the data it assumes that all sensors are active but it is unrealistic in real world application where the sensors are switched on and off. The work carried out in this paper focuses on providing a minimum energy duty cycling protocol to prolong the battery life and energy efficient geographic forwarding.



[1] C. Huang, Y. Tseng, and H. Wu, “Distributed Protocols for Ensuring Both Coverage and Connectivity of a Wireless Sensor Network,” ACM Trans. Sensor Networks, vol. 3, no. 1, pp. 1-24,2007.

[2] G. Xing, X. Wang, Y. Zhang, C. Lu, R. Pless, and C. Gill,“Integrated Coverage and Connectivity Configuration for Energy Conservation in Sensor Networks,” ACM Trans. Sensor Networks, vol. 1, no. 1, pp. 36-72, 2005.

[3] B. Chen, K. Jameson, H. Balakrishnan, and R. Morris, “Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks,” ACM Wireless Networks, vol. 8, no. 5, pp. 481-494, 2002.

[4] J.Ai and A.Abouzeid, “Coverage by Directional Sensors in Randomly Deployed Wireless Sensor Networks,” J. Combinatorial Optimization, vol. 11, no. 1, pp. 21-41, 2006.

[5] X. Du and F. Lin, “Maintaining Differentiated Coverage in Heterogeneous Sensor Networks,” EURASIP J. Wireless Comm. and Networking (WCN), vol. 5, no. 4, pp. 565-572, 2005.

[6] William conner, Tarek Abdelzaher ,Klara Nahrsted, “Using Data Aggregation to Prevent Traffic Analysis in Wireless Sensor Networks” vol. 6, no. 1, pp. 21-41, 2010

[7] P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, “Routing with Guaranteed Delivery in Ad Hoc Wireless Networks,” ACM/ Kluwer Wireless Networks, vol. 7, no. 6, pp. 609-616, 2001.

[8] X.-Y. Li, G. Calinescu, P.-J. Wan, and Y. Wang, “Localized Delaunay Triangulation with Application in Ad Hoc Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 10, pp. 1035-1047, Oct. 2003.

[9] S. Lindsey, C. Raghavendra, and K. Sivalingam, “Data Gathering Algorithms in Sensor Networks Using Energy Metrics,” IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 9, pp. 924-935, Sept. 2002.

[10] M. Zorzi and R. Rao, “Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance,” IEEE Trans. Mobile Computing, vol. 2, no. 4, pp. 337-348, Oct.-Dec. 2003.