Optimization Algorithm of the Repeaters Distribution by Square and Cellular Model

Article Preview

Abstract:

Very high frequency (VHF) is widely used in radio and television broadcasting. In order to improve the quality of service (QoS) and signal transmission distance, the repeaters be applied to lengthen the transmitting distance of VHF and expand the coverage of radio stations. Under ensuring the QoS, the reduction cost is very important. In this paper, focusing on the different coverage of repeaters, we discuss the minimum number of repeaters to cover a whole circular area, and the square model and cellular model are proposed. Then we analyze the case in view of the simplex communication and duplex communication. Furthermore, the influence of the location of the radio station to the minimum number of repeaters needed is discussed. Finally, we discuss how the minimum number of repeaters changes with the change of the numbers of radio stations. The minimum number of repeaters to cover the circle area will increase as the radius of the repeaters coverage decreases. The radio station in the center of the circle flat can broadcast to the farthest area and the radio station in the fringe area can’t broadcast to farther area. In simplex communication, the minimum number of repeaters with n radio stations in the circle are is n-1 times greater than that with only one radio station.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

2677-2681

Citation:

Online since:

January 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] S. Boettcher, and A.G. Percus: Optimization with external dynamics, Physical Review Letters, 86, 5211-5214(2011).

Google Scholar

[2] G.K. Das, S. Das, S.C. Nandy, and B.P. Sinha, Efficient algorithm for placing a given number of base stations to cover a convex region, Journal of Parallel and Distributed Computing, 66, 11, 1353-1356 (2006).

DOI: 10.1016/j.jpdc.2006.05.004

Google Scholar

[3] J. Tang, B. Hao, and A. Sen: Relay node placement in large scale wireless sensor networks, Computer Communications, 29, 4, 490-501 (2006).

DOI: 10.1016/j.comcom.2004.12.032

Google Scholar

[4] G. Gupta, and M. Younis: Load-balanced clustering of wireless sensor networks, In: IEEE International Conference on Communications, 1848-1852, IEEE Press, New York(2003).

DOI: 10.1109/icc.2003.1203919

Google Scholar

[5] I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci: Wireless sensor networks: A survey, Computer Networks, 38, 4, 393-422 (2002).

DOI: 10.1016/s1389-1286(01)00302-4

Google Scholar

[6] Information on http: /ussc. com/~uvhfs/rptr. html.

Google Scholar