Clustering method for wireless sensor networks based on edge betweenness
A wireless sensor and edge betweenness technology, applied in network topology, wireless communication, advanced technology, etc., can solve problems such as high clustering overhead and short time span network lifetime
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0039] The concrete steps of technical scheme of the present invention are:
[0040] by figure 2 As an example, the network consists of 10 nodes. If the set bit error rate is lower than the threshold P, it is connected, and it is represented by 1 in the adjacency matrix; otherwise, it is not connected, and it is represented by 0 in the adjacency matrix. Accordingly, a symmetrical triangular matrix composed of 0 and 1 elements can be constructed, which is the adjacency matrix G of the network:
[0041]
[0042] The obtained adjacency matrix G is followed by the shortest path algorithm, such as the Floyd algorithm. Calculate the shortest path between any two points separately, then count the number of shortest paths between any two points, and then calculate the edge betweenness of each edge on this basis.
[0043] Edge E in the network ij The calculation method of edge betweenness is:
[0044]
[0045] Among them, n(i, j) represents the number of shortest paths from...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


