Mathematical model about stochastic covering of local communication network and applications

Author

Liu, Weifang ; Liu, Binyang

Author_Institution

Coll. of Sci., Shenyang Aerosp. Univ., Shenyang, China

fYear

2011

fDate

28-30 Oct. 2011

Firstpage

144

Lastpage

147

Abstract

In this paper, we focus on the full-covering repeater distribution problem of local communication network, especially for the case with random-distributing users. Through the improved hexagonal network structure composed by round domain which is covered by repeaters, a new Greedy Algorithm is applied into the established topological structure of the stochastic network. Thus, the optimal number of repeaters can be solved, and the locations of repeaters can be determined.

Keywords

greedy algorithms; repeaters; stochastic processes; telecommunication network topology; full-covering repeater distribution problem; greedy algorithm; hexagonal network structure; local communication network; mathematical model; random-distributing user; round domain; stochastic covering; stochastic distribution; stochastic network; topological structure; Aggregates; Approximation algorithms; Gaussian distribution; Greedy algorithms; Mathematical model; Repeaters; Stochastic processes; greedy algorithm; maximum covering; network topological structure; stochastic distribution;

fLanguage

English

Publisher

ieee

Conference_Titel

Broadband Network and Multimedia Technology (IC-BNMT), 2011 4th IEEE International Conference on

Conference_Location

Shenzhen

Print_ISBN

978-1-61284-158-8

Type

conf

DOI

10.1109/ICBNMT.2011.6155913

Filename

6155913