Skip to Main Content
 

Global Search Box

 
 
 
 

ETD Abstract Container

Abstract Header

Network Selection Algorithm for Satisfying Multiple User Constraints Under Uncertainty in a Heterogeneous Wireless Scenario

Mahadevan, Srisudha

Abstract Details

2011, MS, University of Cincinnati, Engineering and Applied Science: Computer Science.
The constant evolution of various wireless access technologies has led to an advancement in the communication domain where mobile clients (MCs) are equipped with multiple interfaces for simultaneous access to different types of networks. This heterogeneous wireless scenario satisfies the user's preferences and offers the desired quality of service (QoS). Route selection satisfying multiple constraints has proven to be NP-Complete and various approximation schemes exist which consider the network state resources to be fixed and complete. Additionally, in practical scenarios, the user's constraints are imprecise and vague and the changing network conditions force the condition of uncertainty to exist in a routing mechanism. This thesis focuses on the imprecise and dynamic nature of network parameters and maps it to uncertain user constraints. We, hence consider a heterogeneous wireless network (HWN) and propose a novel approach to identify the key network metrics that satisfies the user's criteria. Our design of a fuzzy model maps the underlying uncertainty in the metrics to crisp values and demonstrates the stability of our proposed technique through extensive simulations and analysis. In order to satisfy the user's imprecise demands, we consider the problem of decision making in a HWN where emphasis is on selecting the best network interface to forward the data. We propose an enhanced minimization of maximal regret (MMR) approach to rank the available network interfaces by considering pure uncertainty in a user's constraint. MCs state their needs based on application requirements and thus, we implement a generalized MMR and include Ordered Weighted Averaging (OWA) operators to enable each MC to efficiently select the best possible alternative. The weights utilized in OWA are modeled using application characteristics. Our simulations and experiments compare the sensitivity of user demands depicted in MMR and OWA to that of existing multiple attribute decision making (MADM) algorithms. Simulation results prove that variability in a user's preference and changes in a network scenario can impact decision making and influence the routing process.
Dharma Agrawal, DSc (Committee Chair)
Chia Han, PhD (Committee Member)
Carla Purdy, PhD (Committee Member)
105 p.

Recommended Citations

Citations

  • Mahadevan, S. (2011). Network Selection Algorithm for Satisfying Multiple User Constraints Under Uncertainty in a Heterogeneous Wireless Scenario [Master's thesis, University of Cincinnati]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1302550606

    APA Style (7th edition)

  • Mahadevan, Srisudha. Network Selection Algorithm for Satisfying Multiple User Constraints Under Uncertainty in a Heterogeneous Wireless Scenario. 2011. University of Cincinnati, Master's thesis. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=ucin1302550606.

    MLA Style (8th edition)

  • Mahadevan, Srisudha. "Network Selection Algorithm for Satisfying Multiple User Constraints Under Uncertainty in a Heterogeneous Wireless Scenario." Master's thesis, University of Cincinnati, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1302550606

    Chicago Manual of Style (17th edition)