Research Article
Decomposition of a Wireless Sensor Flow Network into Sub – networks and the Network Survivability
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 45 - Issue 24 |
| Published: May 2012 |
| Authors: K. S. Suganthi, K. P. Gnanapreetha |
10.5120/7111-9802
|
K. S. Suganthi, K. P. Gnanapreetha . Decomposition of a Wireless Sensor Flow Network into Sub – networks and the Network Survivability. International Journal of Computer Applications. 45, 24 (May 2012), 10-13. DOI=10.5120/7111-9802
@article{ 10.5120/7111-9802,
author = { K. S. Suganthi,K. P. Gnanapreetha },
title = { Decomposition of a Wireless Sensor Flow Network into Sub – networks and the Network Survivability },
journal = { International Journal of Computer Applications },
year = { 2012 },
volume = { 45 },
number = { 24 },
pages = { 10-13 },
doi = { 10.5120/7111-9802 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2012
%A K. S. Suganthi
%A K. P. Gnanapreetha
%T Decomposition of a Wireless Sensor Flow Network into Sub – networks and the Network Survivability%T
%J International Journal of Computer Applications
%V 45
%N 24
%P 10-13
%R 10.5120/7111-9802
%I Foundation of Computer Science (FCS), NY, USA
Abstract
This paper contains an overview of some of the advantages that can be obtained by the decomposition of an underlying sensor flow network into sub-networks. Out of the various benefits that can be obtained, we have presented in this paper an idea about the optimized energy reduction and hence survival of the nodes in a network. The method of decomposing a network into sub-networks is based on the idea that smaller networks consume less energy during transmission and also for deducing a highly – resilient multipath routing to a wireless sensor network. Sensor networks offer ease of deployment and multiple functionalities. These properties are further enhanced in the sub – networks.
References
- A. Manjeshwar and D. P. Agrawal. TEEN: a routing protocol for enhanced efficiency in wireless sensor networks. Intl. Proc. of 15th Parallel and Distributed Processing Symp. , pages 2009 – 2015, 2001.
- C. M. Okino and M. G. Corr. Statistically Accurate Sensor Networking. Wireless Communications and Networking Conference, 2002.
- C. Schurgers and M. B. Srivastava. Energy Efficient Routing in Wireless Sensor Networks. Military Communications Conference, 2001.
- D. B. Shmoys. Cut problems and their application to divide-and-conquer. Approximation Algorithms for NP-hard Problems, PWS Publishing Company,Boston, pages 192 –235, 1997.
- F. Ye, A. Chen, S. Liu and L. Zhang. A scalable solution to minimum cost forwarding in large sensor networks. Proc. of Tenth Intl. Conference on Computer Communications and Networks, pages 304 –309, 2001.
- G. Even, J. Naor, S. Rao, and B. Schieber. Fast approximate graph partitioning algorithms. Proc. 8th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM, pages 639 – 648, 1997.
- G. J. Pottie. Wireless sensor networks. Information Theory Workshop, pages 139 – 140, 1998.
- G. J. Pottie and W. J. Kaiser. Wireless integrated network sensors. Communications of the ACM, 43(5):51 – 58, 2000.
- G. L. Nemhauser and L. A. Wolsey. Integer Programming and Combinatorial Optimization. Wiley, 1988.
- J. Agre and L. Clare. An integrated architecture for cooperative sensing networks. Computer, 33(5):106 – 108, 2000.
Index Terms
Keywords