Multicriteria Steiner Tree Problem for Communication Network

Details Multicriteria Steiner Tree Problem for Communication Network Multicriteria Steiner Tree Problem for Communication Network

2011-02-12

arxiv.org/abs/1102.2524v1

Information Processes 9(3) (2009) 199-209

Computer Science

Data Structures and Algorithms

11 pages, 7 figures

Scientific paper

This paper addresses combinatorial optimization scheme for solving the multicriteria Steiner tree problem for communication network topology design (e.g., wireless mesh network). The solving scheme is based on several models: multicriteria ranking, clustering, minimum spanning tree, and minimum Steiner tree problem. An illustrative numerical example corresponds to designing a covering long-distance Wi-Fi network (static Ad-Hoc network). The set of criteria (i.e., objective functions) involves the following: total cost, total edge length, overall throughput (capacity), and estimate of QoS. Obtained computing results show the suggested solving scheme provides good network topologies which can be compared with minimum spanning trees.

Affiliated with

Also associated with

No associations

Rating

Multicriteria Steiner Tree Problem for Communication Network does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Multicriteria Steiner Tree Problem for Communication Network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multicriteria Steiner Tree Problem for Communication Network will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-84940