Cart (Loading....) | Create Account
Close category search window
 

Mathematical model about stochastic covering of local communication network and applications

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Weifang Liu ; Coll. of Sci., Shenyang Aerosp. Univ., Shenyang, China ; Binyang Liu

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.

Published in:

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

Date of Conference:

28-30 Oct. 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.