Abstract

In wireless sensor networks, barrier coverage is one of the major challenge for high density area. To overcome this challenge, coverage control is the key solution for making more efficient and can program the sensors in active or idle state to maintain network coverage. Also, the random deployment with clustering of detection nodes plays a crucial role in the presence of an obstruction else that can become a viable route for attackers. In this paper, two strategies are proposed to resolve the problem of barrier coverage and to improve lifespan of the network. A Split and Schedule (SS) algorithm is proposed and the formation of clusters overcomes limitations with better solution. By comparing with other efficient algorithms, proposed SS algorithm sustains the better quality of network coverage and enhances the longevity of the sensor network.

References

• I Akyildiz, W Su, Y Sankara Subramaniam and E Cayirci, 2002. “Wireless Sensor Networks: a Survey”, IEEE Transactions on Computer Networks, no. 38, pp. 393–422.
• Fall K, 2003. “A Delay-Tolerant Network Architecture for Challenged Internets”, In Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM 2003), pp.27-34.
• Shah, R. C., Roy, S., Jain, S., Brunette, W, 2003. “Data mules: Modeling A Three-Tier Architecture for Sparse Sensor Networks”, In Proceedings of the 2nd ACM International Workshop on Wireless Sensor Networks and Applications (SNPA 2003) pp. 30-41.
• Chakrabarti A, Sabharwal A, Aazhang B, 2005, “Using Predictable Observer Mobility for Power Efficient Design of Sensor Networks”, in Proceedings of the 2nd International Workshop on Information Processing in Sensor Networks, pp. 129-145.
• Ekici, E., Gu, Y., Bozdag, D, 2006, “Mobility-Based Communication in Wireless Sensor Networks”, IEEE Communications Magazine vol.44, no.7, pp. 56-62.
• Gandham, S., Dawande, M., Prakash, R., Venkatesan, S, 2003, “Energy Efficient Schemes for Wireless Sensor Networks with Multiple Mobile Base Stations”, in Proceedings of 46th IEEE Global Telecommunications Conference Workshops, pp.377-381.
• Wang, Z. M., Basagni, S., Melachrinoudis, E., Petrioli.C, 2005, “Exploiting Sink Mobility for Maximizing Sensor Networks Lifetime”, In Proceedings of the 38th Hawaii International Conference on System Sciences (HICSS).
• Srinidhi T, Sridhar G, Sridhar V, 2006, “Topology Management in Ad Hoc Mobile Wireless Networks”, in Proceedings of the 24th IEEE International Real-Time Systems Symposium, pp. 29–32.
• Wu, J. Yang, S, 2005, “Smart: A Scan-Based Movement Assisted Sensor Deployment Method in Wireless Sensor Networks”, In Proceedings of the 24th IEEE Conference on Computer Communications (INFOCOM), vol. 4, pp.2313-2324.
• Wang, G., Cao, G., La Porta, T., Zhang, W, 2005, “Sensor Relocation in Mobile Sensor Networks”, in Proceedings of the 24th IEEE Conference on Computer Communications, vol. 4, pp.2302-2312.
• Tang, C., McKinley P, 2006, “Energy Optimization Under Informed Mobility”, IEEE Transactions on Parallel and Distributed Systems vol.17, no.9, pp.947-962.
• El-Moukaddem, F., Torng, E., Xing, G., Kulkarni, S. 2009, “Mobile Relay Configuration in Data-Intensive Wireless Sensor Networks”, in Proceedings of the 6th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, pp.80-89.
• Dini, G., Pelagatti, M., Savino, I. M, 2008, “An Algorithm for Reconnecting Wireless Sensor Network Partitions”, in Proceedings of the 5th European conference on Wireless Sensor Networks (EWSN), pp.253-267.
• A. A. Somasundara, A. Ramamoorthy, M. B. Srivastava, 2004, “Mobile Element Scheduling for Efficient Data Collection in Wireless Sensor Networks with Dynamic Deadlines”, in 25th IEEE International Real-Time Systems Symposium, pp.296–305.
• G. Xing, J. Wang, K.Shen, Q.Huang, X.Jia H.C.So, 2008, “Mobility Assisted Spatial-Temporal Detection in Wireless Sensor Networks”, Proc. 28th International Conference on Distributed Computing Systems (ICDCS), Beijing, China, June 17-20.
• D. Wang, J. Liu, Q. Zhang, 2007, “Mobility-Assisted Sensor Networking for Field Coverage”, In Proceeding of IEEE Global Communications Conference, pp.1190-1194.
• Yaoyao Gu and D. Bozdag and E. Ekici and F. Ozguner, 2005, Chang-Gun Lee, “Partitioning Based Mobile Element Scheduling in Wireless Sensor Networks”, in Second Annual IEEE Communications Society Conference on IEEE SECON, pp. 386-395.
• Sharmin, Selina, Fernaz Narin Nur, Md. Abdur Razzaque, Md. Mustafizur Rahman, 2015, "Network lifetime aware area coverage for clustered directional sensor networks", International Conference on Networking Systems and Security (NSysS).
• Zhao, W. Ammar, M. “Message Ferrying: Proactive Routing in Highly-Partitioned Wireless Ad Hoc Networks”, 2003, In Proceedings of the 9th IEEE International Workshop on Future Trends of Distributed Computing Systems, pp.308-314.
• J. L. Bentley, 1985, “Multidimensional Binary Search Trees used for Associative Searching,” Communications of the ACM, vol. 18, no. 9, pp. 509–517.