Energy optimized safe routing method

Abstract

An energy optimizing secure routing method provides a secure routing protocol based on low consumption cluster head election algorithm, directed towards solving the security threatening problem faced by cluster-based routing protocol and the problem that cluster head election algorithm consumes too much energy. The protocol adopts mutual cooperation to obtain the total of the nodes participating election currently in the cluster election process, and can correctly calculate the threshold value of the currently-produced cluster nodes, which allows the probability of producing optimal cluster number to be largest and the allows the network energy consumption to be optimal. The invention adopts a preset shared key pair distribution method and raises the security of routing effectively. At the same time of optimizing energy, the new protocol raises the security of routing and prolongs network lifetime.

Description

Technical field

[0001] The invention is a safety routing protocol based on energy optimization used in information networks, especially wireless sensor network routing protocols, and belongs to the technical field of computer and information security. Background technique

[0002] Wireless sensor networks are generally divided into two structures: plane structure and layer cluster structure. The scale of the planar structure is greatly restricted, the scalability is poor, and the energy is high. In order to reduce the energy consumption of nodes, provide flexible and reliable communication, and improve the scalability of wireless sensors, the network is usually managed by a hierarchical structure: the network is divided into clusters, and each cluster consists of a cluster head and multiple cluster members Composition, these clusters can form a higher-level network.

[0003] One of the most important factors in the hardware design of wireless sensor nodes is the energy of the bat...

Examples

Embodiment Construction

[0018] (1) The cluster head election stage

[0019] Assuming that the total number of nodes in the sensor network is N, the expected optimal number of cluster heads is k, and the initial probability of each node becoming a cluster head is p=k / N. The nodes that apply to become cluster heads in this round are defined as candidate cluster head nodes. The candidate cluster head nodes broadcast their information to the entire network and declare themselves as cluster head nodes. The protocol uses the CSMA protocol, and only one cluster head node can broadcast its own information at the same time. First, suppose that the current number of rounds of cluster head selection is sequence, and the candidate cluster head node H broadcasts the message {sequence|ID H |ch(r)} To the nodes around you, tell the current round sequence and the total number of elected cluster head nodes ch(r), and tell the ID of each key on the key ring H .

[0020] (2) Cluster establishment stage

[0021] Once certai...

Technical field

[0001] The invention is a safety routing protocol based on energy optimization used in information networks, especially wireless sensor network routing protocols, and belongs to the technical field of computer and information security. Background technique

[0002] Wireless sensor networks are generally divided into two structures: plane structure and layer cluster structure. The scale of the planar structure is greatly restricted, the scalability is poor, and the energy is high. In order to reduce the energy consumption of nodes, provide flexible and reliable communication, and improve the scalability of wireless sensors, the network is usually managed by a hierarchical structure: the network is divided into clusters, and each cluster consists of a cluster head and multiple cluster members Composition, these clusters can form a higher-level network.

[0003] One of the most important factors in the hardware design of wireless sensor nodes is the energy of the bat...

Examples

Embodiment Construction

[0018] (1) The cluster head election stage

[0019] Assuming that the total number of nodes in the sensor network is N, the expected optimal number of cluster heads is k, and the initial probability of each node becoming a cluster head is p=k / N. The nodes that apply to become cluster heads in this round are defined as candidate cluster head nodes. The candidate cluster head nodes broadcast their information to the entire network and declare themselves as cluster head nodes. The protocol uses the CSMA protocol, and only one cluster head node can broadcast its own information at the same time. First, suppose that the current number of rounds of cluster head selection is sequence, and the candidate cluster head node H broadcasts the message {sequence|ID H |ch(r)} To the nodes around you, tell the current round sequence and the total number of elected cluster head nodes ch(r), and tell the ID of each key on the key ring H .

[0020] (2) Cluster establishment stage

[0021] Once certai...