Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Pre-ordered pso network selection method based on service type in group handover

A service type and network selection technology, applied in wireless communication, access restriction, electrical components, etc.

Active Publication Date: 2019-05-14
SYSU CMU SHUNDE INT JOINT RES INST +1
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0010] The present invention proposes a pre-sorting PSO network selection method based on service type in group switching, which uses the PSO algorithm to solve the problem of network selection in group switching

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Pre-ordered pso network selection method based on service type in group handover
  • Pre-ordered pso network selection method based on service type in group handover
  • Pre-ordered pso network selection method based on service type in group handover

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0073] A pre-sorting PSO network selection method based on service type in group handover, specifically comprising:

[0074] S101. Pre-sorting stage

[0075] The solution of D mobile terminal users accessing different N networks can be represented by particle position, that is, x i =(x i1 ,x i2 ,...,x iD ), where 1≤i≤M, M is the size of the initial particle swarm. For example, if a solution is x=(2,3,...,1), it means that the first user accesses network 2, the second user accesses network 3, and the Dth user accesses network 1.

[0076] Visible x i =(x i1 ,x i2 ,...,x iD ) in each dimension x ij The value range is 1 to N. Therefore, it is necessary to sort all available networks before running the PSO main algorithm, and the sorting is mainly based on the AHP algorithm based on the business type. For users of different business types, the results of network ranking are not the same.

[0077] x ij 1 in the range of 1 to N represents the best network for user j, and...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a pre-ranking POS network selection method for group switching based on a business type, and the method aims at solving a problem of network selection in a heterogeneous wireless network environment during vertical group switching. According to different business types, the method achieves the pre-ranking of networks, and then employs a PSO algorithm to carry out network selection. The method gives full consideration to two aspects: network load balance and users' satisfaction. Compared with a conventional switching algorithm and a conventional time sequence algorithm, the method improves algorithm time consumption, access blocking rate and network load balance, and enables the users' satisfaction to be close to the optimal value.

Description

technical field [0001] The present invention relates to the technical field of wireless communication, more specifically, to a pre-sorting PSO network selection method based on service type in group handover, which is a network selection problem during vertical group handover in a wireless heterogeneous network environment. Background technique [0002] In a vertical group handover (GVHO) scenario, many MNs (Mobile Nodes—that is, users) send handover requests almost simultaneously. The traditional vertical switching algorithm assumes that users arrive sequentially, so each user who sends a switching request knows the switching result of the previous switching user, so it is easy to achieve the optimal switching. However, in a GVHO scenario, multiple vertical handover requests are processed almost at the same time. Using traditional handover algorithms is not conducive to handover decisions, but will lead to network congestion or poor performance. This is because when the tr...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): H04W36/14H04W48/18
CPCH04W36/14H04W48/18
Inventor 张雪媛戴宪华
Owner SYSU CMU SHUNDE INT JOINT RES INST
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com