Network Selection for Mobile Nodes in Heterogeneous Wireless Networks using Knapsack Problem Dynamic Algorithms
Sibanda, Clifford and Antoine Bagula (2012) Network Selection for Mobile Nodes in Heterogeneous Wireless Networks using Knapsack Problem Dynamic Algorithms. In Proceedings Telecommunications forum TELFOR, pages 1-4, Belgrade, Serbia.
With the accelerated proliferation wireless networks ranging from GPRS and EDGE to high speed networks such as HSPDA and Mobile Wi-Fi, network selection by mobile nodes will benefit more from knowledge of Network Capability of candidate networks. Network selection is important for handover in heterogeneous wireless environment. User Profiles/Needs and Network Capability will greatly influence the next logical step after network discovery, which is Network Selection. We examine the Dynamic Network Selection paradigm that uses User Profiling/needs to rank networks for selection and ignore networks with less capacity than required, using the Knapsack problem 0/1 Dynamic algorithm and the Knapsack problem Optimization Algorithm.
|EPrint Type:||Conference Paper|
|Keywords:||Dynamic Selection, Heterogeneous Wireless Networks, Mobile Nodes, Network Capability, Network Selection, User Profile/needs.|
|Subjects:||C Computer Systems Organization: C.2 COMPUTER-COMMUNICATION NETWORKS|
|Deposited By:||Bagula, Antoine|
|Deposited On:||22 March 2013|