Keywords

wireless, transport, connectivity, selection mechanisms

Abstract

Transport selection mechanisms are designed to facilitate seamless connectivity in heterogeneous multi-transport environments, allowing access to the “best” available transport according to user requirements. Evaluating transport configurations dynamically according to the user’s preferences and Quality of Service (QoS) requirements is a challenging task. This paper describes a quantitative approach that applies the Utility Theorem and Nash’s Bargaining solution to heterogeneous wireless environments. The mathematical model presented generates and adjusts the transport preference list dynamically depending on the degree to which a transport satisfies user preferences and the application’s QoS requirements. We incorporate a negotiation engine using the Axiomatic Multi-Transport Bargaining algorithm to integrate local and remote users’ requirements in a mutually beneficial manner as devices are connected via a peer-to-peer link. The transport selection model discussed in this paper is computationally light with modest communication overhead, making it suitable for mobile devices.

Original Publication Citation

Qiuyi Duan, Lei Wang, Charles D. Knutson, and Michael A. Goodrich. "Axiomatic Multi-Transport Bargaining: A Quantitative Method for Dynamic Transport Selection in Heterogeneous Multi-Transport Wireless Environments." Proceedings of the IEEE Wireless Communication and Networking Conference (WCNC 26), Las Vegas, Nevada, April 3-6, 26.

Document Type

Peer-Reviewed Article

Publication Date

2006-04-03

Permanent URL

http://hdl.lib.byu.edu/1877/2336

Publisher

IEEE

Language

English

College

Physical and Mathematical Sciences

Department

Computer Science

Download

Share

COinS