Research on Fault-Tolerant Relay Node Placement Based on Greedy Optimization Algorithm in Wireless Sensor Networks

Article Preview

Abstract:

In this paper, relay node’s communication capacity was introduced into the existing model of relay node placement. And we presented a new evaluation standard based on the minimum distance factor of communication network. A new relay node placement algorithm was implemented in solutions, and the algorithm was based on greedy optimization algorithm. The simulation result demonstrates that the algorithm can limit the communication capacity of relay nodes conveniently. Compared with other placement algorithms, improvement of energy-efficiencies in this algorithm is obvious.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 204-210)

Pages:

1000-1004

Citation:

Online since:

February 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Z. Wang, Q. Wang and X.Q. Hao, in: The design of the Remote Water Quality Monitoring System based on WSN. The 5th International Conference on Wireless Communications, Networking and Mobile Computing, Beijing, China, Sept (2009).

DOI: 10.1109/wicom.2009.5303974

Google Scholar

[2] I.F. Akyildiz, W. Su, Y. Sankarasubramaniam and E. Cayirci: A Survey on Sensor Networks. IEEE Communication Magazine: Vol. 8(2002), p.102.

DOI: 10.1109/mcom.2002.1024422

Google Scholar

[3] Y.T. Hou, Y. Shi, H.D. Sherali, S.F. Midkiff, in: Prolonging Sensor Network Lifetime with Energy Provisioning and Relay Node Placement. The Second Annual IEEE Communications Society Conference on Sensor and Ad hoc Communications and Networks, Santa Clara, CA, USA, Sept (2005).

DOI: 10.1109/sahcn.2005.1557084

Google Scholar

[4] A. Srinivas, G. Zussman and E. Modiano: Construction and Maintenance of Wireless Mobile Backbone Networks. IEEE/ACM Transactions on Networking: Vol. 17(2009), p.239.

DOI: 10.1109/tnet.2009.2012474

Google Scholar

[5] G. Wang, L.S. Huang and H.L. Xu, in: Reliable Relay Node Placement in Wireless Sensor Network. The 3th International Conference on Communications and Networking, Hangzhou, China, Aug (2008).

DOI: 10.1109/chinacom.2008.4685044

Google Scholar

[6] A. Kashyap, S. Khuller and M. Shayman, in: Relay Placement for Higher Order Connectivity in Wireless Sensor Networks. The 25th IEEE International Conference on Computer Communications. Proceedings, Barcelona, Spain, April (2006).

DOI: 10.1109/infocom.2006.273

Google Scholar

[7] X.F. Han, X. Cao and E.L. Lioyd: Fault-Tolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks. IEEE Transactions on Mobile Computing: Vol. 9(2010), p.643.

DOI: 10.1109/tmc.2009.161

Google Scholar

[8] S. Misra, S.D. Hong and G.L. Xue: Constrained Relay Node Placement in WSNs: Formulation and Approximations. IEEE/ACM Transaction on Networking: Vol. 18(2010), p.434.

DOI: 10.1109/tnet.2009.2033273

Google Scholar

[9] D.J. Yang, S. Misra and X. Fang, in: Two-Tiered Constrained Relay Node Placement in WSNs: Efficient Approximations. The 7th Annual IEEE Communications Society Conference on Sensor Mesh and Ad Hoc Communications and Networks, Boston, USA, June (2010).

DOI: 10.1109/secon.2010.5508241

Google Scholar

[10] J.L. Bredin, E.D. Demaine, M.T. Hajiaghayi and D. Rus: Deploying Sensor Networks with Guaranteed Fault Tolerance. IEEE/ACM Transactions on Networking: Vol. 18(2010), p.216.

DOI: 10.1109/tnet.2009.2024941

Google Scholar

[11] A. Bereketli and O.B. Akan: Communication coverage in wireless passive sensor networks. IEEE Communication Letters: Vol. 13(2009), p.133.

DOI: 10.1109/lcomm.2009.081691

Google Scholar

[12] LIN G H, XUE G L: Steiner tree problem with minimum number of Steiner points and bounded edge-length. Information Processing Letters: Vol. 69(1999), p: 53.

DOI: 10.1016/s0020-0190(98)00201-4

Google Scholar