Method for establishing WSN (wireless sensor network) energy equalizing routing based on local network betweenness
A local network, energy balancing technology, applied in network topology, energy reduction, advanced technology, etc., can solve problems such as poor scalability
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0034] A method for establishing WSN energy-balanced routing based on local network betweenness. The first node X of the WSN structure 1 Send the data packet P1 to the destination node destination, and the steps to establish the route are:
[0035] Step 1, the first node X 1 If there is no routing table routing_table, it is the first node X 1 Construct a routing table routing_table. The routing table routing_table is composed of "destination" column and "next hop" column. The routing table routing_table is empty.
[0036] Step 2, the first node X in WSN 1 When receiving data packet P1, at the first node X 1 Neighbor node n 1 and neighbor node n 2 Find the destination node destination, the first node X 1 Neighbor node n 1 is the second node X 2 , the first node X 1 Neighbor node n 2 is the fourth node X 4 ; If the destination node is not found, the data packet P1 cannot be directly sent to the destination node.
[0037] Step 3. The destination node is not found, exce...
Embodiment 2
[0054] A method for establishing WSN energy-balanced routing based on local network betweenness. The first node X of the WSN structure 1 Send the data packet P2 to the destination node destination, and the steps to establish the route are:
[0055] Step 1. Since the first node X 1 The routing table routing_table already exists, go to step 2 directly.
[0056] Step 2, the first node X in WSN 1 When receiving data packet P2, at the first node X 1 Neighbor node n 1 and neighbor node n 2 Find the destination node destination, the first node X 1 Neighbor node n 1 is the second node X 2 , the first node X 1 Neighbor node n 2 is the fourth node X 4 ; If the destination node is not found, the data packet P2 cannot be directly sent to the destination node.
[0057] Step 3. The destination node is not found, except for the neighbor node of the previous hop, the first node X 1 Neighbor node n 1 and neighbor node n 2 energy cost 1 and cost 2 They are:
[0058] ...
Embodiment 3
[0108] A method for establishing WSN energy-balanced routing based on local network betweenness. The first node X of the WSN structure 1 Send the data packet P3 to the destination node destination, and the steps to establish the route are:
[0109] Step 1. Since the first node X 1 If the number already exists in the routing table routing_table, go to step 2 directly.
[0110] Step 2, the first node X in WSN 1 When receiving data packet P3, at the first node X 1 Neighbor node n 1 and neighbor node n 2 Find the destination node destination, the first node X 1 Neighbor node n 1 is the second node X 2 , the first node X 1 Neighbor node n 2 is the fourth node X 4 ; If the destination node is not found, the data packet P3 cannot be directly sent to the destination node.
[0111] Step 3. The destination node is not found, except for the neighbor node of the previous hop, the first node X 1 Neighbor node n 1 number and neighbor node n 2 energy cost 1 and cost 2 They a...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 