Fee-based route and relay method for wireless self-organized network
A technology of wireless self-organization and forwarding method, which is applied in the direction of data exchange network, data exchange through path configuration, digital transmission system, etc., to achieve the effect of reducing overhead
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0053] The working mechanism and specific operation steps of the method of the present invention will be described in detail below in conjunction with the accompanying drawings.
[0054] 1. Routing
[0055] 1. Minimum cost path selection based on VCG mechanism
[0056] 1A. Establish a network topology G{V, E, ω} from source S to destination D by using route discovery method, V={v 1 ,...,v n}, the directed edge (v i , v j ) set E_V*V, and with each edge (v i , v j ) associated weight function ω: E→R, which represents the data packet from node v i to node v j Fees upon delivery.
[0057] 1B. According to the shortest path algorithm, find the shortest cost path from source S to destination D, which is S, 1, ... n, D.
[0058] 1C. According to the VCG mechanism, the compensation for node i on the shortest path is:
[0059] αi:=|SP -(i,i+1) |-|SP\(i, i+1)|. Where|SP -(i,i+1) | indicates the minimum cost path when there is no link (i, i+1), and |SP\(i, i+1)| indicates t...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
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