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

A fast link assignment algorithm for satellite communication networks

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

4 Author(s)
Harathi, K. ; Dept. of Comput. & Inf. Sci., Florida Univ., FL, USA ; Krishna, P. ; Newman-Wolfe, R.E. ; Chow, R.Y.-C.

In satellite communication networks using laser transceivers, each satellite has a limited number of transceivers with a very narrow field of view. The authors consider the problem of deciding which logical connections should be formed among satellites out of all the possible connections that can be made depending on the line-of-sight (LOS) visibility of satellites. These logical connections can be decided to meet various objectives of the underlying network. The objective functions can be maximizing the number of links formed, thus, maximizing the transceiver utilization, maximizing network connectivity, minimizing link re-targeting, or minimizing average distance between nodes. Here, the satellite networks are assumed to be independent from intervention by ground stations. Hence, the decisions made should be autonomous. Another assumption is that all the computations and decisions made are either aperiodic or the input to computation is too unpredictable to be precomputed. Various approaches to link assignment with different objective functions and algorithms for some specific functions are described. Simulation results and performance analyses for some of the algorithms are also presented

Published in:

Computers and Communications, 1993., Twelfth Annual International Phoenix Conference on

Date of Conference:

23-26 Mar 1993

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.