The week's pick
Reseach Article
Dominating Set based Connectivity Maintenance in Wireless Sensor Networks
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 151 - Number 1 |
| Year of Publication: 2016 |
| Authors: Joy Winston, Aadil Ahmad Shah |
10.5120/ijca2016911648
|
Joy Winston, Aadil Ahmad Shah . Dominating Set based Connectivity Maintenance in Wireless Sensor Networks. International Journal of Computer Applications. 151, 1 ( Oct 2016), 32-39. DOI=10.5120/ijca2016911648
Abstract
The ability to report the sensed data to base station is called connectivity. The sensor network remains connected so that the information collected by sensor nodes can be transmitted back to the base station. Connectivity depends mainly on the existence of link. It is affected by changes in network topology due to mobility, the failure of sensor nodes and attacks and so on. Therefore, Coverage alone in WSN is not sufficient. Therefore, WSN must satisfy both Coverage and Connectivity required by applications simultaneously.in this we proposed RC-CDS algorithm to provide coverage and connectivity in WSN. We compared the proposed algorithm with the existing algorithms and we find that it outperforms well.
References
- Balamurugan & Purusothaman 2012, ‘IPSD: New coverage preserving and connectivity maintenance scheme for improving lifetime of wireless sensor networks’, WSEAS transactions on communications, vol.11, no.1, pp.26-36.
- Yiwei Wu, Feng Wang, Thai & Yingshu Liv 2007, ‘Constructing k-connected m-dominating sets in wireless sensor networks’, IEEE Military Communications Conference, pp.1-7.
- Weili Wu, Hongwei Du, Xiaohua Jia, Yingshu Li & Scott C-H Huang 2006, ‘Minimum connected dominating sets and maximal independent sets in unit disk graphs’, Journal of Theoretical Computer Science, vol.352, no.1, pp.1-7.
- Raihan Hazaika 2014, ‘A Load Based Approach to forming a connected dominating set for an adhoc network’, Thesis.
- Mallikarjun Avula, Seong-Moo Yoo & Seungjin Park 2012, ‘Constructing Minimum connected dominating set in mobile adhoc networks’, International journal on applications of graph theory in wireless adhoc networks and sensor networks, vol.4, no.2/3, pp.15-27.
- Koh, Ting & Xu 2010, ‘Lower bound on the weakly connected domination number of a cycle-disjoint graph’, Australian Journal of Combinatorics, vol.46, pp.157-166
- Rourke 1998, ‘Computational Geometry in C’, Cambridge university, pp.1-358.
- Kamrul Islam 2010, ‘Energy aware techniques for certain problems in wireless sensor networks’, Thesis.
- Alim Al Islam, Chowdhury Sayeed Hyder, Humayun Kabir & Mahmuda Naznin 2010, ‘Stable Sensor Network(SSN): A dynamic clustering technique for maximizing stability in wireless sensor networks’, Scientific Research in Wireless Sensor Networks, vol.2, no.7, pp.538-554.
- Rosana Lachowski, Marcelo Pellenz, Manoel Penna, Edgard Jamhour & Richard Souza 2015, ‘An efficient distributed algorithm for constructing spanning trees in wireless sensor networks’, Journal of Sensors, vol.15, no.1, pp.1518-1536.
- Misra, Hong, Xue & Tang 2010, ‘Constrained relay node placement in wireless sensor networks: Formulation and approximations’, IEEE/ACM Transaction Networks, vol.18, no.2, pp.434-447.
- Qiang Tang, Kun Yang, Ping Li, Jianming Zhang, Yuansheng Luo & Bing Xiong 2012, ‘An energy efficient MCDS construction algorithm for wireless sensor networks’, EURASIP Journal on Wireless Communications and Networking, vol83, pp.1-15.
- Shi Ting-jun, Shi Xu & Fang Xu-ming 2014, ‘A Virtual Backbone Construction Algorithm Based on Connected Dominating Set in Wireless Sensor Networks’, International Conference on Computer, Communications and Information Technology, pp.156-159.
Index Terms
Keywords