CN105722175B - Cluster routing method based on angle optimization rumour routing and location technology - Google Patents

Cluster routing method based on angle optimization rumour routing and location technology Download PDF

Info

Publication number
CN105722175B
CN105722175B CN201610209542.9A CN201610209542A CN105722175B CN 105722175 B CN105722175 B CN 105722175B CN 201610209542 A CN201610209542 A CN 201610209542A CN 105722175 B CN105722175 B CN 105722175B
Authority
CN
China
Prior art keywords
wireless sensor
sensor node
node
axis
distance
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201610209542.9A
Other languages
Chinese (zh)
Other versions
CN105722175A (en
Inventor
刘壮
冯欣
张剑飞
韩成
张昕
王雁龙
张晶晶
李腾
杨文龙
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Changchun University of Science and Technology
Original Assignee
Changchun University of Science and Technology
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Changchun University of Science and Technology filed Critical Changchun University of Science and Technology
Priority to CN201610209542.9A priority Critical patent/CN105722175B/en
Publication of CN105722175A publication Critical patent/CN105722175A/en
Application granted granted Critical
Publication of CN105722175B publication Critical patent/CN105722175B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/32—Flooding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/46—Cluster building
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The present invention relates to a kind of Clustering Routings based on angle optimization rumour routing and location technology, it is characterised in that: position of the aggregation node in plane right-angle coordinate x-axis and y-axis is (100,100)；Wireless sensor node group includes 200 wireless sensor nodes (rear abbreviation " node "), is used respectivelyIt indicates, i=1,2 ..., 200；It is randomly dispersed in the network area of 100m*100m,It indicatesX-axis and y-axis coordinate on plane right-angle coordinate；There is N number of Node distribution in the event area of 33m*33m in wireless sensor node group, event area corresponding x-axis and y-axis range on plane right-angle coordinate are respectively 0~33 and 0~33；The communication radius of 200 nodes and aggregation node in wireless sensor node group is 40m；It establishes optimal path by prejudging the size of angle between node, reduces the energy consumption of node, further extends whole network life cycle, improve data transfer efficiency.

Description

Clustering routing method based on included angle optimized rumor routing and positioning technology
Technical Field
The invention relates to a clustering routing algorithm based on an included angle optimized rumor routing and positioning technology, and belongs to the technical field of wireless sensor networks.
Background
The wireless sensor network is a research hotspot which is concerned at present, and is a multi-hop self-organizing network system formed by a plurality of cheap wireless sensor nodes deployed in a monitoring area in a wireless communication mode, and the aim of the system is to cooperatively sense, acquire and process information of a sensing object in a coverage network area and send the information to a user terminal. At present, wireless sensor networks are put into use in many fields, for example, in the aspect of environment, soil conditions, air pollution conditions, growth conditions of crops and the like can be monitored. The patient can be comprehensively tracked in the aspect of medical monitoring without greatly influencing the life of the patient. The system can be used for detecting enemy, monitoring military force, equipment and materials, positioning battlefield targets and the like in the military aspect.
However, in practical application of the WSN, the viability of the node often determines the life cycle of the entire network, and the smaller the node energy consumption, the longer the life cycle of the network. In a static network topology structure, once a first data packet reaches a destination node from a sink node through a long path, a hot spot routing problem is caused, so that energy consumption in a network is unbalanced, and the service life of the network is shortened.
At present, research and improvement based on rumor routing algorithms are more and more at home and abroad, wherein a clustering algorithm is utilized, the energy consumption of nodes is reduced, and the loop problem is improved. Aiming at the defect that the generated route is not the optimal route, a genetic algorithm is introduced, energy consumption is used as an evaluation standard, the route is optimized, and the service life of the network is prolonged to a great extent. And the rumor routing based on the ant colony algorithm is also provided, the loop problem possibly caused by random unicast is solved, the convergence of the rumor protocol is better, and the energy is saved compared with the original protocol.
The rumor routing protocol is a routing protocol based on query, and introduces a unicast random forwarding mechanism of query messages, firstly generates proxy messages in sensor nodes in an event area, the proxy messages are spread outwards along a random path, and meanwhile, query messages sent by a sink node are also spread in a network along the random path. When the transmission paths of the proxy message and the query message are crossed, a complete path from the aggregation node to the event area is formed. However, in the process of establishing a route, the path that may be established is too long and is not the optimal path or a routing loop problem is formed, so that all the data packets are transmitted along the path afterwards, which may consume energy of the node greatly.
Therefore, the project researches the problem of the non-optimal path in the WSN, analyzes the included angle between each node, and researches the problem of continuously updating the path by judging the size of the included angle between the nodes so as to improve the path establishment in the network and prolong the life cycle of the network.
Disclosure of Invention
In order to solve the problem of uneven energy consumption of network nodes caused by non-optimal paths, the invention aims to provide a clustering routing algorithm based on an included angle optimization rumor routing and positioning technology, which establishes an optimal path by judging the size of an included angle between nodes in advance, reduces the energy consumption of the nodes, further prolongs the life cycle of the whole network and improves the data transmission efficiency.
The technical scheme of the invention is realized as follows: a clustering routing algorithm based on an included angle optimization rumor routing and positioning technology comprises a sink node 1 and a wireless sensor node group 2; the method is characterized in that: the positions of the sink nodes 1 on the x axis and the y axis of the plane rectangular coordinate system are (100 ); the wireless sensor node group 2 includes 200 wireless sensor nodes (hereinafter referred to as "nodes"), respectivelyDenotes, i =1,2, …, 200;randomly distributed in a network area of 100m x 100m,to representX-axis and y-axis coordinates on a planar rectangular coordinate system; n nodes in the wireless sensor node group 2 are distributed in an event area of 33m x 33m, and the ranges of the x axis and the y axis of the event area on a plane rectangular coordinate system are 0-33 and 0-33 respectively; the communication radiuses of 200 nodes in the wireless sensor node group 2 and the sink node 1 are both 40 m; the method comprises the following specific steps:
1. for wireless sensor nodeIts initial energy usesIndicating, current energy usageIndicating, for power consumption of the power amplifierRepresenting energy consumption by free spaceIndicating the energy consumed by the transmitting circuitIt is shown that,。
2. the sink node 1 sends the x-axis coordinates and the y-axis coordinates of the sink node 1 under the plane rectangular coordinate system to 200 nodes in the wireless sensor node group 2, and the 200 nodes in the wireless sensor node group 2 record the x-axis coordinates and the y-axis coordinates of the sink node 1 under the plane rectangular coordinate system.
3. For N nodes in the event area, useIt is shown that,，represents a node inAnd x-axis coordinates and y-axis coordinates on the plane rectangular coordinate system. According to the formula
ComputingDistance to sink node 1, byDenoted, e =1,2, … N. Will be provided withOrdered and formed from small to large according to numerical valuesCorresponding node set queue，Is composed ofThe first element in (1) isTo representThe queues are sorted according to the numerical value from small to large,is composed ofTo (1)lAn elementl=1,2, …, N. Will be provided withFirst node in (1)As a destination node, the node is,as the distance from the node to the sink node, and recording the point as D, useAnd representing the x-axis coordinate and the y-axis coordinate of the destination node D under a plane rectangular coordinate system.
4. The sink node 1 is taken as the starting point of the query path R to the destination node D, and is denoted as node R (1), and the query starting from the sink node 1 is referred to as a forward query, and the query starting from the destination node D is referred to as a reverse query. 200-N nodes in a non-event area are randomly arranged in the wireless sensor network to form a non-event area node group, and the nodes in the non-event area node group are usedDenotes z =1,2, …,200-N,representing non-event area node groupsAnd x-axis and y-axis coordinates on a plane rectangular coordinate system.
5. According to the formula
ComputingDistance to sink node 1Z =1,2, …,200-N, provided thatM nodes in the non-event area node group less than or equal to 40M are usedIndicates that h =1,2, …, M,to representX-axis and y-axis coordinates on a rectangular plane coordinate system, and usingTo representTo the sink node 1, wherein，h=1,2,…,M。
6. According to the formula
Computing，Denotes the distance of the non-event area node to the destination node, h =1,2, …, M.
7. According to the formula
ComputingH =1,2, …, M. If it is notIs thatMedium maximum value, thenThe first node obtained by forward query of the query path R is represented by R (2), and the coordinates of the x axis and the y axis on the rectangular plane coordinate system areAnd f = 2. Wherein,is composed ofThe number 1 element of (a) is,the distance from the non-event area node to the sink node,representing the distance of the non-event area node to the destination node,is composed ofThe distance to the sink node 1 is,h=1,2,…,M。
8. according to the formula
ComputingDistance to R (2)Z =1,2, …,200-N, provided thatL (f) nodes in the node group of the non-event area less than or equal to 40m are selectedDenotes, j =1,2, …, l (f),to representX-axis and y-axis coordinates on a rectangular plane coordinate system, and usingTo representTo R (2), wherein，j=1,2,…,L(f)。
9. According to the formula
ComputingDistance to destination node, byDenotes, j =1,2, …, l (f).
10. According to the formula
Calculating the distance from R (3) to the destination nodeAnd (4) showing.
11. According to the formula
ComputingJ =1,2, …, l (f). If it is notIs thatMedium maximum value, thenA second node obtained by forward query of the query path R and represented by R (3), f = f +1, and x-axis and y-axis coordinates on a planar rectangular coordinate system are。
12. According to the formula
ComputingDistance to event area node DZ =1,2, …,200-N, provided thatQ nodes in the non-event area node group less than or equal to 40m are usedDenotes, Q =1,2, …, Q,to representX-axis and y-axis coordinates on a planar rectangular coordinate system, andto representThe distance of each node in the event area to node D.
13. According to the formula
ComputingDistance to sink node, usingDenotes, Q =1,2, …, Q.
14. According to the formula
ComputingQ =1,2, …, Q. If it is notIs thatMedium maximum value, thenThe first node in the opposite direction of the query path R is represented by RD (1), and the coordinates of the x-axis and the y-axis on the rectangular plane coordinate system are，w=1。
15. According to the formula
ComputingDistance to RD (1)Z =1,2, …,200-N, provided thatV (w) nodes in the node group of the non-event area less than or equal to 40m are selectedDenotes, v =1,2, …, v (w),to representX-axis and y-axis coordinates on a rectangular plane coordinate system, and usingTo representThe distance of each node in the set to RD (1), wherein，v=1,2,…,V(w)。
16. According to the formula
ComputingDistance to sink node, usingDenotes, v =1,2, …, v (w).
17. According to the formula
Calculating the distance from RD (1) to the sink nodeAnd (4) showing.
18. According to the formula
ComputingV =1,2, …, v (w). If it is notIs the maximum value of cos2w, thenAnd a second node obtained by reverse query of the query path R and represented by RD (2), wherein w = w +1, and x-axis coordinates and y-axis coordinates on a plane rectangular coordinate system are。
19. And sequentially repeating the steps 8, 9, 10, 11, 15, 16, 17 and 18 to search for other nodes in the path R. When the next node searched by the forward path is exactly the node on the reverse path, the query is finished, the node when meeting is recorded only once, and the path R is determined at the moment. Let path R have b nodes, represented by R (1), R (2), R (3), …, R (b) in that order.
20. The rest N-1 nodes except the destination node D in the event area form a non-destination node group, and the nodes in the non-destination node group are usedDenotes, k =1,2, …, N-1,representing non-destination node groupsX-axis and y-axis coordinates on a rectangular plane coordinate system according to a formula
ComputingDistance to destination node, byDenotes, k =1,2, …, N-1.
21. The destination node D floods the data transmitted by the sink node 1 along the query path R to N-1 nodes in the non-destination node group U _ D according to a formula
Calculating the energy consumed by the destination node D to N-1 nodes in the non-destination node groupDenotes, k =1,2, …, N-1. According to the formula
Calculating the current residual energy of the destination node DWherein k =1,2, … N-1.
22. According to the formula
In the formula, the energy consumption from the kth node to the destination node D in the event area is calculatedDenotes, k =1,2, …, N-1. According to the formula
Calculating the energy consumption from the kth node to the destination node D in the event areaDenotes, k =1,2, …,N-1。
23. Rearranging the b nodes in the query path R from back to front to form a reverse path R ', R' (1) = R (b), R '(2) = R (b-1), …, R' (b)b) = R (1). The destination node D transmits the collected data to the sink node 1 along a reverse path R ', and the starting point R' (1) of the reverse path R 'is used for coordinates of each node in the destination nodes D and R' in the event area on a rectangular plane coordinate systemDenotes, s =1,2, …, b.
24. According to the formula
Wherein s =1,2, …, n-1, the distance between each two nodes in the reverse path R' is calculated byDenotes, s =1,2, …, n-1.
25. According to the formula
Calculating the energy consumption of each node in the reverse query path RDenotes, s =1,2, …, n-1. According to the formula
Calculating the current residual energy of each node in the reverse query path RDenotes, s =1,2, …, n-1.
26. The implementation is divided into the following three cases:
(1) if the destination node D in the region currently has residual energyLess than or equal to 0, then select from Queue
Replacing the current node with the next node of the current node, and replacing the coordinates of the original node with the coordinates of the next node. Step 26 is then performed.
(2) If a certain node in the reverse path R' has residual energyIf the value is less than or equal to 0, the node is marked as R' (p) (p is one value of 1-n-1), and the coordinate is。
According to the formula
According to the formula
Calculating the distance from Point (z) to node R' (p)Z =1,2, …,200-1-N, provided thatG nodes in the node group of the non-event area less than or equal to 40m are usedIndicates that G =1,2, …, G,to representX-axis and y-axis coordinates on a planar rectangular coordinate system, andto representEach ofDistance of node to node R' (p).
According to the formula
Calculating the distance from the non-event area node to the destination nodeAnd (4) showing.
According to the formula
ComputingG =1,2, …, G. By usingThe node with the largest value replaces the node R' on the reverse path (R:)) The reverse path R' is updated. Step 27 is then performed.
(3) If neither of the above two cases is satisfied, step 23, step 24, step 25, step 26 are repeated in this order.
27. Judgment ofAnd whether the value is less than or equal to 0 or not, and if the value is less than or equal to 0, ending the process. If not, step 26 is repeated.
An optimized path can be established through the steps, the cost of route establishment is effectively reduced, the over-fast consumption of node energy is avoided, and the life cycle of the whole network is prolonged.
The invention has the advantages that on the basis of rumor routing, the included angle of every three node connecting lines is optimized and introduced into the establishment of the path, and the most appropriate node is selected by comparing the sizes of all the included angles to establish the path, so that the problems of uneven node energy consumption and premature death of part of nodes are effectively solved, and the service life of the nodes and the life cycle of the whole wireless sensor network are prolonged.
Drawings
FIG. 1 is a schematic diagram of the coordinates of the present invention.
Detailed Description
The invention is further described with reference to the accompanying drawings in which:
clustering routing algorithm based on included angle optimization rumor routing and positioning technology, including convergent node 1, wireless sensor node group 2, its characterized in that: as shown in fig. 1, the position of the sink node 1 on the x-axis and the y-axis of the planar rectangular coordinate system is (100 ); the wireless sensor node group 2 includes 200 wireless sensor nodes (hereinafter referred to as "nodes"), respectivelyIt is shown that,=1,2,…,200。randomly distributed in a network area of 100m x 100m,to representX-axis and y-axis coordinates on a planar rectangular coordinate system; n nodes in the wireless sensor node group 2 are distributed in an event area 33m x 33m, and the range of an x axis and the range of a y axis corresponding to the event area on a plane rectangular coordinate system are 0-33 and 0-33 respectively. The communication radius of 200 nodes in the wireless sensor node group 2 and the communication radius of the sink node 1 are both 40 m.
The specific implementation steps are as follows:
1. for wireless sensor nodeIts initial energy usesIndicating, current energy usageIndicating, for power consumption of the power amplifierRepresenting energy consumption by free spaceIndicating the energy consumed by the transmitting circuitIt is shown that,。
2. the sink node 1 sends the x-axis coordinates and the y-axis coordinates of the sink node 1 under the plane rectangular coordinate system to 200 nodes in the wireless sensor node group 2, and the 200 nodes in the wireless sensor node group 2 record the x-axis coordinates and the y-axis coordinates of the sink node 1 under the plane rectangular coordinate system.
3. For N nodes in the event area, useIt is shown that,，represents a node inAnd x-axis coordinates and y-axis coordinates on the plane rectangular coordinate system. According to the formula
ComputingDistance to sink node 1, byDenoted, e =1,2, … N. Will be provided withOrdered and formed from small to large according to numerical valuesCorresponding node set queue，Is composed ofThe first element in (1) isTo representThe queues are sorted according to the numerical value from small to large,is composed ofTo (1)lAn elementl=1,2, …, N. Will be provided withFirst node in (1)As a destination node, the node is,as the distance from the node to the sink node, and recording the point as D, useAnd representing the x-axis coordinate and the y-axis coordinate of the destination node D under a plane rectangular coordinate system.
4. The sink node 1 is taken as the starting point of the query path R to the destination node D, and is denoted as node R (1), and the query starting from the sink node 1 is referred to as a forward query, and the query starting from the destination node D is referred to as a reverse query. 200-N nodes in a non-event area are randomly arranged in the wireless sensor network to form a non-event area node group, and the nodes in the non-event area node group are usedDenotes z =1,2, …,200-N,representing non-event area node groupsRectangular coordinate system on planeThe x-axis and y-axis coordinates of (c).
5. According to the formula
ComputingDistance to sink node 1Z =1,2, …,200-N, provided thatM nodes in the non-event area node group less than or equal to 40M are usedIndicates that h =1,2, …, M,to representX-axis and y-axis coordinates on a rectangular plane coordinate system, and usingTo representTo the sink node 1, wherein，h=1,2,…,M。
6. According to the formula
Computing，Denotes the distance of the non-event area node to the destination node, h =1,2, …, M.
7. According to the formula
ComputingH =1,2, …, M. If it is notIs thatMedium maximum value, thenThe first node obtained by forward query of the query path R is represented by R (2), and the coordinates of the x axis and the y axis on the rectangular plane coordinate system areAnd f = 2. Wherein,is composed ofThe number 1 element of (a) is,is notThe distance of the event area node to the sink node,representing the distance of the non-event area node to the destination node,is composed ofThe distance to the sink node 1 is,h=1,2,…,M。
8. according to the formula
ComputingDistance to R (2)Z =1,2, …,200-N, provided thatL (f) nodes in the node group of the non-event area less than or equal to 40m are selectedDenotes, j =1,2, …, l (f),to representX-axis and y-axis coordinates on a rectangular plane coordinate system, and usingTo representTo R (2), wherein，j=1,2,…,L(f)。
9. According to the formula
ComputingDistance to destination node, byDenotes, j =1,2, …, l (f).
10. According to the formula
Calculating the distance from R (3) to the destination nodeAnd (4) showing.
11. According to the formula
ComputingJ =1,2, …, l (f). If it is notIs thatMedium maximum value, thenA second node obtained by forward query of the query path R and represented by R (3), f = f +1, and x-axis and y-axis coordinates on a planar rectangular coordinate system are。
12. According to the formula
ComputingDistance to event area node DZ =1,2, …,200-N, provided thatQ nodes in the non-event area node group less than or equal to 40m are usedDenotes, Q =1,2, …, Q,to representX-axis and y-axis coordinates on a planar rectangular coordinate system, andto representThe distance of each node in the event area to node D.
13. According to the formula
ComputingDistance to sink node, usingDenotes, Q =1,2, …, Q.
14. According to the formula
ComputingQ =1,2, …, Q. If it is notIs thatMedium maximum value, thenThe first node in the opposite direction of the query path R is represented by RD (1), and the coordinates of the x-axis and the y-axis on the rectangular plane coordinate system are，w=1。
15. According to the formula
ComputingDistance to RD (1)Z =1,2, …,200-N, provided thatV (w) nodes in the node group of the non-event area less than or equal to 40m are selectedDenotes, v =1,2, …, v (w),to representX-axis and y-axis coordinates on a rectangular plane coordinate system, and usingTo representThe distance of each node in the set to RD (1), wherein。
16. According to the formula
ComputingDistance to sink node, usingDenotes, v =1,2, …, v (w).
17. According to the formula
Calculating the distance from RD (1) to the sink nodeAnd (4) showing.
18. According to the formula
ComputingV =1,2, …, v (w). If it is notIs the maximum value of cos2w, thenAnd a second node obtained by reverse query of the query path R and represented by RD (2), wherein w = w +1, and x-axis coordinates and y-axis coordinates on a plane rectangular coordinate system are。
19. And sequentially repeating the steps 8, 9, 10, 11, 15, 16, 17 and 18 to search for other nodes in the path R. When the next node searched by the forward path is exactly the node on the reverse path, the query is finished, the node when meeting is recorded only once, and the path R is determined at the moment. Let path R have b nodes, represented by R (1), R (2), R (3), …, R (b) in that order.
20. The rest N-1 nodes except the destination node D in the event area form a non-destination node group, and the nodes in the non-destination node group are usedDenotes, k =1,2, …, N-1,representing non-destination node groupsX-axis and y-axis coordinates on a rectangular plane coordinate system according to a formula
Computing，k=1,2,…,N-1。
21. The destination node D floods the data transmitted by the sink node 1 along the query path R to N-1 nodes in the non-destination node group U _ D according to a formula
Calculating the energy consumed by the destination node D to N-1 nodes in the non-destination node groupDenotes, k =1,2, …, N-1. According to the formula
Calculating the current residual energy of the destination node DWherein k =1,2, … N-1.
22. According to the formula
In the formula, the energy consumption from the kth node to the destination node D in the event area is calculatedDenotes, k =1,2, …, N-1. According to the formula
Calculating the energy consumption from the kth node to the destination node D in the event areaDenotes, k =1,2, …,N-1。
23. Rearranging the b nodes in the query path R from back to front to form a reverse path R ', R' (1) = R (b), R '(2) = R (b-1), …, R' (b)b) = R (1). The destination node D transmits the collected data to the sink node 1 along a reverse path R ', and the starting point R' (1) of the reverse path R 'is used for coordinates of each node in the destination nodes D and R' in the event area on a rectangular plane coordinate systemDenotes, s =1,2, …, b.
24. According to the formula
Wherein s =1,2, …, n-1, the distance between each two nodes in the reverse path R' is calculated byDenotes, s =1,2, …, n-1.
25. According to the formula
Calculating the energy consumption of each node in the reverse query path RDenotes, s =1,2, …, n-1. According to the formula
Calculating the current residual energy of each node in the reverse query path RDenotes, s =1,2, …, n-1.
26. The implementation is divided into the following three cases:
(1) if the destination node D in the region currently has residual energyLess than or equal to 0, then select from Queue
Replacing the current node with the next node of the current node, and replacing the coordinates of the original node with the coordinates of the next node. Step 27 is then performed.
(2) If a certain node in the reverse path R' has residual energyIf the value is less than or equal to 0, the node is marked as R' (p) (p is one value of 1-n-1), and the coordinate is。
According to the formula
According to the formula
Calculating the distance from Point (z) to node R' (p)Z =1,2, …,200-1-N, provided thatG nodes in the node group of the non-event area less than or equal to 40m are usedIndicates that G =1,2, …, G,to representX-axis and y-axis coordinates on a planar rectangular coordinate system, andto representThe distance of each node from node R' (p).
According to the formula
Calculating the distance from the non-event area node to the destination nodeAnd (4) showing.
According to the formula
ComputingG =1,2, …, G. By usingThe node with the largest value replaces the node R' on the reverse path (R:)) The reverse path R' is updated. Step 26 is then performed.
(3) If neither of the above two cases is satisfied, step 22, step 23, step 24, step 25 are repeated in sequence.
27. Judgment ofAnd whether the value is less than or equal to 0 or not, and if the value is less than or equal to 0, ending the process. If not, step 26 is repeated.
An optimized path can be established through the steps, the cost of route establishment is effectively reduced, the over-fast consumption of node energy is avoided, and the life cycle of the whole network is prolonged.

Claims (1)

1. The clustering routing method is applied to a wireless sensor network, and the wireless sensor network comprises a sink node and a wireless sensor node group; the method is characterized in that: the positions of the sink nodes on the x axis and the y axis of the plane rectangular coordinate system are (100 ); the wireless sensor node group comprises 200 wireless sensor nodes, which are respectively denoted by node (i), i is 1, 2. Node (i) is randomly distributed in a network area of 100m by 100m, (X)i，Yi) Representing node (i) x-axis sum in a rectangular plane coordinate systemy-axis coordinates; n wireless sensor nodes in the wireless sensor node group are distributed in an event area of 33m x 33m, and the ranges of the x axis and the y axis of the event area on a plane rectangular coordinate system are 0-33 and 0-33 respectively; the communication radiuses of 200 wireless sensor nodes and sink nodes in the wireless sensor node group are both 40 m; the method comprises the following specific steps:
1) for the wireless sensor node (i), its initial energy is Einit(i) Indicating that the current energy is Ecurrent(i) Indicating that the power consumption of the power amplifier is in ∈comp(i) Representing the energy consumed by free space by εfs(i) Indicating the energy consumed by the transmitting circuit by Eelect(i) Denotes, i ═ 1, 2.., 200;
2) the sink node sends the x-axis coordinates and the y-axis coordinates of the sink node under a plane rectangular coordinate system to 200 wireless sensor nodes in the wireless sensor node group, and the 200 wireless sensor nodes in the wireless sensor node group record the x-axis coordinates and the y-axis coordinates of the sink node under the plane rectangular coordinate system;
3) and for N wireless sensor nodes in the event area, indicating by event (e), wherein e is 1,2e，YEe) Representing x-axis coordinates and y-axis coordinates of the wireless sensor node event (e) on a plane rectangular coordinate system;
according to the formula
Calculating the distance from event (e) to the sink node, denoted by D _ s (e), where e is 1, 2.
D _ s (e) is sorted from small to large according to values and forms a wireless sensor node set Queue (Queue) corresponding to e, wherein Queue (l) is the l-th element in Queue, D _ s (e) is represented by Queue _ Dis, and the Queue sorted from small to large according to values is represented by Queue _ Dis (l) is the l-th element l in Queue _ Dis, which is 1,2,... times.n;
taking the first wireless sensor node Queue (1) in Queue as a destination wireless sensor node, and taking Queue _ Dis (1) as the wireless sensor nodeThe distance from the point to the sink node, and the destination wireless sensor node is recorded as D, and is used as (X)d，Yd) Representing an x-axis coordinate and a y-axis coordinate of the target wireless sensor node D under a plane rectangular coordinate system;
4) taking the sink node as the starting point of a query path R from the sink node to a destination wireless sensor node D, marking as the wireless sensor node R (1), and calling the query from the sink node as a forward query and the query from the destination wireless sensor node D as a reverse query;
in the wireless sensor network, 200-N wireless sensor nodes in a non-event area are randomly arranged to form a non-event area wireless sensor node group, wherein the wireless sensor nodes in the non-event area wireless sensor node group are represented by point (z), and z is 1,2z，YPz) Representing x-axis and y-axis coordinates of a non-event area wireless sensor node group Point (z) on a plane rectangular coordinate system;
5) according to the formula
Calculating the distance S1(z) from the point (z), wherein z is 1,2,., 200-N, and setting M wireless sensor nodes in the non-event area wireless sensor node group satisfying S1(z) less than or equal to 40M, wherein h is 1,2,., M, (XN 1) and is represented by Neighborl (h)h，YN1h) Representing x-axis and y-axis coordinates of the Neighbor1(h) on a plane rectangular coordinate system, and representing the distance from each wireless sensor node in the Neighbor1(h) to the sink node by D _ T1(h), whereinh＝1，2，...，M；
6) According to the formula
Calculating D _ H1(H), wherein D _ H1(H) represents the distance from the non-event area wireless sensor node to the destination wireless sensor node, and H is 1, 2.
7) According to the formula
Calculating cos α (h), h ═ 1, 2.., M;
if cos α (h1) is the largest value in cos α, the Neighbor1(h1) is used as the first wireless sensor node which is obtained by forward query of the query path R and is represented by R (2), and the x-axis coordinate and the y-axis coordinate on the plane rectangular coordinate system are (RX)f，RYf)，f＝2；
Wherein, Queue (1) _ Dis is the 1 st element in Queue _ Dis, D _ T1(H) is the distance from the non-event area wireless sensor node to the sink node, D _ H1(H) represents the distance from the non-event area wireless sensor node to the destination wireless sensor node, D _ s (e) is the distance from event (e) to the sink node, and H is 1, 2.
8) According to the formula
Calculating the distance S2(z) from point (z) to R (2), wherein z is 1,2, 200-N, and L (f) wireless sensor nodes in the non-event area wireless sensor node group satisfying S2(z) less than or equal to 40m are represented by Neighbor2(j), and j is 1,2, 3, L (f), (XN 2)j，YN2j) Representing x-axis and y-axis coordinates of the Neighbor2(j) on a plane rectangular coordinate system, and representing the distance from each wireless sensor node in the Neighbor2(j) to R (2) by D _ T2(j), wherein
9) According to the formula
Calculating the distance from the Neighbor2(j) to the destination wireless sensor node, which is denoted by D _ H2(j), wherein j is 1, 2.
10) According to the formula
Calculating the distance from R (3) to the destination wireless sensor node, and denoted by D _ S2;
11) according to the formula
Calculating cos α 2f (j), j ═ 1, 2.., l (f);
if cos α 2f (j1) is the largest value in cos α 2f, the Neighbor2(j1) is used as the second wireless sensor node obtained by forward query of the query path R and is represented by R (3), f is f +1, and the x-axis coordinate and the y-axis coordinate on the plane rectangular coordinate system are (RX)f，RYf)；
12) According to the formula
Calculating the distance SS1(z) from the point (z) to the wireless sensor node D in the event area, wherein z is 1,2, 200-N, and Q wireless sensor nodes in the wireless sensor node group in the non-event area satisfying SS1(z) less than or equal to 40m are represented by Neighbor _ D1(Q), and Q is 1,2, 1, Q, (XND)q，YNDq) Representing the x-axis and y-axis coordinates of Neighbor _ D1(g) on a planar rectangular coordinate system, and willRepresenting the distance from each wireless sensor node in Neighbor _ D1(q) to the event area wireless sensor node D;
13) according to the formula
Calculating the distance from the Neighbor _ D1(Q) to the sink node, and using DD _ H1(Q), wherein Q is 1, 2.
14) According to the formula
Calculating cos α d (Q), Q ═ 1, 2.., Q;
if cos α D (q1) is the largest value in cos α D, the first wireless sensor node with Neighbor _ D1(q1) as the opposite direction of the query path R is represented by RD (1), and the x-axis and y-axis coordinates on the planar rectangular coordinate system are (RDX)w，RDYw)，w＝1；
15) According to the formula
Calculating a distance SS2(z) from point (z) to RD (1), wherein z is 1,2,., 200-N, and V (w) wireless sensor nodes in the non-event-area wireless sensor node group satisfying less than or equal to 40m are represented by Neighbor _ D2(v), and v is 1, 2., V (w), (XN 2)v，YN2v) Representing x-axis and y-axis coordinates of the Neighbor _ D2(v) on a plane rectangular coordinate system, and representing the distance from each wireless sensor node in the Neighbor _ D2(v) to RD (1) by DD _ T2(v), whereinv＝1，2，...，V(w)；
16) According to the formula
Calculating the distance from Neighbor _ D2(V) to the sink node, denoted by DD _ H2(V), V ═ 1, 2., V (w);
17) according to the formula
Calculating the distance from RD (1) to the sink node, and using DD _ S2 as a reference;
18) according to the formula
Calculating cos2w (v), v ═ 1, 2., v (w);
if cos2w (v1) is the largest value in cos2w, then Neighbor _ D2(v1) is used as the second wireless sensor node which is obtained by reverse query of the query path R and is represented by RD (2), w is w +1, and the x-axis coordinate and the y-axis coordinate on the planar rectangular coordinate system are (RDX)w，RDYw) (ii) a DD _ S represents the distance from RD (2) to the sink node;
19) sequentially repeating the step 8, the step 9, the step 10, the step 11, the step 15, the step 16, the step 17 and the step 18 to search for other wireless sensor nodes in the path R;
when the next wireless sensor node searched by the forward path is exactly the wireless sensor node on the reverse path, the query is finished, the wireless sensor nodes when meeting are recorded only once, and the path R is determined at the moment;
b wireless sensor nodes are arranged on the path R and are sequentially represented by R (1), R (2), R (3), R (b);
20) and the rest N-1 wireless sensor nodes except the target wireless sensor node D in the event area form a non-target wireless sensor node group, wherein the wireless sensor nodes in the non-target wireless sensor node group are represented by U _ D (k), and k is 1,2k，YUk) X-axis and y-axis coordinates on a rectangular plane coordinate system according to a formula
Calculating the distance from the U _ D (k) to the destination wireless sensor node, and representing the distance by D _ E (k), wherein k is 1, 2., N-1;
21) the destination wireless sensor node D floods the data transmitted by the sink node along the query path R to N-1 wireless sensor nodes in the non-destination wireless sensor node group U _ D, and the data are transmitted to the sink node along the query path R according to a formula
ETx-1(k)＝Eelec*3500+3500*εfs*D_E2(k)
Calculating the energy consumed by the target wireless sensor node D to N-1 wireless sensor nodes in the non-target wireless sensor node group, and using ETx-1(k) Represents, k ═ 1, 2.., N-1; eelecEnergy consumed for transmit circuitry; epsilonfsEnergy consumed for free space;
according to the formula
Ecurrent(d)＝Einit(d)-ETx-1(k)*(N-1)
Calculating the current residual energy of the target wireless sensor node D by using Ecurrent(d) Wherein k is 1, 2.. N-1;
22) according to the formula
ETx-2(k)＝Eelec*3500+3500*εfs*D_E2(k)
Wherein the energy consumption from the kth wireless sensor node to the destination wireless sensor node D in the event area is calculated as ETx-2(k) Represents, k ═ 1, 2.., N-1;
according to the formula
Ecurrent(k)＝Einit(k)-ETx-2(k)
Ecurrent(k) Is the current energy of the kth wireless sensor node, k is 1, 2.
23) Rearranging the b wireless sensor nodes in the query path R from back to front to form a reverse path R ', R' (1) ═ R (b), R '(2) ═ R (b-1),. and.R' (b) ═ R (1);
the destination wireless sensor node D transmits the collected data to the sink node along a reverse path R ', and a starting point R' (1) of the reverse path R 'is used as a coordinate (XT) of each wireless sensor node in the destination wireless sensor nodes D and R' in a plane rectangular coordinate system in the event areas，YTs) Represents, s1, 2.., b;
24) according to the formula
Wherein, s is 1, 2.. and b, the distance between every two wireless sensor nodes in the reverse path R' is calculated and is represented by D-R(s), and s is 1, 2.. and b;
25) according to the formula
ETx-3(s)＝Eelec*3500+3500*εfs*D_r2(s)
Calculating energy consumption of each wireless sensor node in the reverse query path R', using ETx-3(S) denotes, S1, 2.., b;
according to the formula
Ecurrent(s)＝Einit(s)-ETx-3(s)
Calculating the current residual energy of each wireless sensor node in the reverse query path R', and using Ecurrent(s) represents, s ═ 1, 2.., b;
26) the method is executed in the following three cases:
(1) if the destination wireless sensor node D in the region currently has the remaining energy Ecurrent(d) Less than or equal to 0, then select from Queue
Replacing the current wireless sensor node by a next wireless sensor node of the current wireless sensor node, and replacing the coordinate of the original wireless sensor node by the coordinate of the next wireless sensor node;
then step 27 is performed;
(2) if a certain wireless sensor node in the reverse path R' has residual energy Ecurrent(s) is less than or equal toAt 0, then the wireless sensor node is marked as R' (p), p is one of 1-N-1, and the coordinates are (XQ, YQ);
according to the formula
According to the formula
Calculating a distance NEI _ DIS (z) from a point (z) to a wireless sensor node R' (p), wherein z is 1,2, 200-1-N, and G is represented by Neighbor _ SD (G) and G is 1,2, 30, G, (XSD) in a non-event area wireless sensor node group which meets the requirement that NEI _ DIS (z) is less than or equal to 40mg，YSDg) Represents the x-axis and y-axis coordinates of Neighbor _ SD (g) on a planar rectangular coordinate system, and willRepresenting the distance from each wireless sensor node in the Neighbor _ SD (g) to the destination node;
according to the formula
Calculating the distance from the wireless sensor node in the non-event area to the target wireless sensor node, and expressing the distance by DD _ SS;
according to the formula
Calculating cos α 2(G), G ═ 1,2,. G;
replacing the wireless sensor node R '(p) on the reverse path with the wireless sensor node with the largest cos α 2(g) value, the reverse path R' being updated;
then step 26 is performed;
(3) if the two conditions are not met, repeating the steps 23, 24, 25 and 26 in sequence;
27) and judgment Ecurrent(N) whether or not 0 is less than or equal to 0, and if so, ending;
if not, repeating step 26; an optimized path can be established through the steps, the cost of route establishment is effectively reduced, the too fast consumption of the energy of the wireless sensor nodes is avoided, and the life cycle of the whole network is prolonged.
CN201610209542.9A 2016-04-07 2016-04-07 Cluster routing method based on angle optimization rumour routing and location technology Active CN105722175B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610209542.9A CN105722175B (en) 2016-04-07 2016-04-07 Cluster routing method based on angle optimization rumour routing and location technology

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610209542.9A CN105722175B (en) 2016-04-07 2016-04-07 Cluster routing method based on angle optimization rumour routing and location technology

Publications (2)

Publication Number Publication Date
CN105722175A CN105722175A (en) 2016-06-29
CN105722175B true CN105722175B (en) 2019-05-07

Family

ID=56160581

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610209542.9A Active CN105722175B (en) 2016-04-07 2016-04-07 Cluster routing method based on angle optimization rumour routing and location technology

Country Status (1)

Country Link
CN (1) CN105722175B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109977581A (en) * 2019-04-04 2019-07-05 长春理工大学 A kind of Stochastic discrete event systems mode diagnosticability determination method

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101374108A (en) * 2008-08-12 2009-02-25 北京交通大学 Routing method suitable for static state self-grouping formation
CN101489275A (en) * 2009-02-27 2009-07-22 山东大学 Relay wireless sensor network routing method based on energy balance and distance cooperation
CN102547693A (en) * 2012-02-17 2012-07-04 南京邮电大学 Secure clustering routing method for wireless sensor network

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101374108A (en) * 2008-08-12 2009-02-25 北京交通大学 Routing method suitable for static state self-grouping formation
CN101489275A (en) * 2009-02-27 2009-07-22 山东大学 Relay wireless sensor network routing method based on energy balance and distance cooperation
CN102547693A (en) * 2012-02-17 2012-07-04 南京邮电大学 Secure clustering routing method for wireless sensor network

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
无线传感器网络中基于簇的谣传路由算法;顾先问;《仪器仪表学报》;20080430;第29卷(第4期);全文

Also Published As

Publication number Publication date
CN105722175A (en) 2016-06-29

Similar Documents

Publication Publication Date Title
Amgoth et al. Energy-aware routing algorithm for wireless sensor networks
Gaber et al. Trust-based secure clustering in WSN-based intelligent transportation systems
Chen et al. Geographic convergecast using mobile sink in wireless sensor networks
CN107835510B (en) Phantom routing-based wireless sensor network source node position privacy protection method
Raj An Efficient Cluster Head Selection Algorithm for Wireless Sensor Networks–Edrleach
Rajendra Prasad et al. A hybrid swarm optimization for energy efficient clustering in multi-hop wireless sensor network
Yadav et al. DLBMRP: design of load balanced multicast routing protocol for wireless mobile ad-hoc network
CN113453305A (en) Annular wireless sensor network clustering routing algorithm based on particle swarm and lion swarm
CN105722175B (en) Cluster routing method based on angle optimization rumour routing and location technology
Yadav et al. A discrete particle swarm optimization based clustering algorithm for wireless sensor networks
Singh et al. Comparative analysis of dynamic path maintenance routing protocols for mobile ad-hoc networks
Naeimi et al. Directional multi–hop clustering routing protocol for wireless sensor networks
Devika et al. An energy efficient routing and compression based data collection applying bio-inspired ant-cuckoo technique for wireless sensor network
CN104768124B (en) The wireless sensor network routing method of sub-clustering and data fusion is clustered based on double cluster heads
Rahman et al. An efficient position based power aware routing algorithm in mobile ad-hoc networks
Medhat et al. Smart clustering for multimodal wsns
Selvi et al. Balanced unequal clustering algorithm for wireless sensor network
Burušić et al. Review and analysis of bio-inspired routing protocols in VANETs
Patil Deployment algorithms in WSN-A study
Kaur et al. Analysis of metrics: Improved hybrid ACO-PSO based routing algorithm for mobile ad-hoc network
Yadav et al. Cluster based routing schemes in wireless sensor networks: A comparative study
Cheng et al. Energy efficient block division methods for data aggregation in wireless sensor networks
Bhat et al. Effective cluster head selection based on EDM for WSN
Chauhan et al. TBEE: Tier based energy efficient protocol providing sink and source mobility in wireless sensor networks
Kaur Energy efficiency in AODV using flower pollination algorithm

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant