Link to the University of Pittsburgh Homepage
Link to the University Library System Homepage Link to the Contact Us Form

Demand-Based Wireless Network Design by Test Point Reduction

Pongthaipat, Natthapol (2008) Demand-Based Wireless Network Design by Test Point Reduction. Doctoral Dissertation, University of Pittsburgh. (Unpublished)

[img]
Preview
PDF
Primary Text

Download (6MB) | Preview

Abstract

The problem of locating the minimum number of Base Stations (BSs) to provide sufficient signal coverage and data rate capacity is often formulated in manner that results in a mixed-integer NP-Hard (Non-deterministic Polynomial-time Hard) problem. Solving a large size NP-Hard problem is time-prohibitive because the search space always increases exponentially, in this case as a function of the number of BSs. This research presents a method to generate a set of Test Points (TPs) for BS locations, which always includes optimal solution(s). A sweep and merge algorithm then reduces the number of TPs, while maintaining the optimal solution. The coverage solution is computed by applying the minimum branching algorithm, which is similar to the branch and bound search. Data Rate demand is assigned to BSs in such a way to maximize the total network capacity. An algorithm based on Tabu Search to place additional BSs is developed to place additional BSs, in cases when the coverage solution can not meet the capacity requirement. Results show that the design algorithm efficiently searches the space and converges to the optimal solution in a computationally efficient manner. Using the demand nodes to represent traffic, network design with the TP reduction algorithm supports both voice and data users.


Share

Citation/Export:
Social Networking:
Share |

Details

Item Type: University of Pittsburgh ETD
Status: Unpublished
Creators/Authors:
CreatorsEmailPitt UsernameORCID
Pongthaipat, Natthapolnap101@pitt.eduNAP101
ETD Committee:
TitleMemberEmail AddressPitt UsernameORCID
Committee ChairKabara, Josephjkabara@pitt.eduJKABARA
Committee MemberSimaan, Marwansimaan@engr.pitt.eduSIMAAN
Committee MemberMcCloud, Michaelmmccloud@gmail.com
Committee MemberKrishnamurthy, Prashantprashant@mail.sis.pitt.eduPRASHK
Committee MemberThompson, Richardthompson@sis.pitt.eduRTHOMPSO
Date: 31 January 2008
Date Type: Completion
Defense Date: 9 November 2007
Approval Date: 31 January 2008
Submission Date: 16 November 2007
Access Restriction: No restriction; Release the ETD for access worldwide immediately.
Institution: University of Pittsburgh
Schools and Programs: School of Information Sciences > Information Science
Degree: PhD - Doctor of Philosophy
Thesis Type: Doctoral Dissertation
Refereed: Yes
Uncontrolled Keywords: Base Station (BS); Test Point (TP); Demand Node
Other ID: http://etd.library.pitt.edu/ETD/available/etd-11162007-163544/, etd-11162007-163544
Date Deposited: 10 Nov 2011 20:05
Last Modified: 15 Nov 2016 13:51
URI: http://d-scholarship.pitt.edu/id/eprint/9690

Metrics

Monthly Views for the past 3 years

Plum Analytics


Actions (login required)

View Item View Item