CN101442787A - Energy-saving routing method for wireless sensor network based on power control - Google Patents
Energy-saving routing method for wireless sensor network based on power control Download PDFInfo
- Publication number
- CN101442787A CN101442787A CNA200810240745XA CN200810240745A CN101442787A CN 101442787 A CN101442787 A CN 101442787A CN A200810240745X A CNA200810240745X A CN A200810240745XA CN 200810240745 A CN200810240745 A CN 200810240745A CN 101442787 A CN101442787 A CN 101442787A
- Authority
- CN
- China
- Prior art keywords
- node
- power
- route
- message
- source node
- 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.)
- Granted
Links
Images
Classifications
-
- 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
Abstract
The invention relates to an energy-saving routing method for wireless sensor network based on power control. The invention relates to establishment of optimum communication power between node and neighbor, establishment of energy-optimizing route. The invention provides a power control method for minimizing communication power between nodes, based on that and designs an energy-saving routing protocol considering multipath total consumption and selecting path of minimum power consumption for data transmission based on AODV routing protocol; the routing protocol can save energy in energy-limited wireless sensor network.
Description
Technical field
The present invention relates to the wireless router networks technology, particularly the energy-efficient method for routing of controlling based on power of wireless sensor network.
Background technology
In recent years, wireless sensor network (Wireless Sensor Networks, WSN) caused mondial extensive concern, it combines sensor technology, embedded computing technique, modern network and wireless communication technology, distributed information processing etc., is that multidisciplinary height intersects, the research field in emerging forward position.WSN is made up of a large amount of microsensor nodes that are deployed in the monitored area, the ad hoc network system of a multi-hop that forms by communication.The sensor node data monitored is transmitted along other sensor node hop-by-hop ground, and Monitoring Data may be routed to the coordinator through behind the multi-hop by a plurality of node processing in transmission course, reaches server by the Internet or wireless network at last.The user is configured and manages sensor network by server.Wireless sensor network will be in logic information world merge with objectively physical world, changed human and natural interactive mode.
Compare with wireless self-organization network (mobile Ad Hoc network) the characteristics such as, node self-organization distributed, change in topology, multi-hop route except that having, have also that node capacity is limited, characteristic such as poor reliability, deployment scale are big, density height, thereby wireless sensor network is different from the characteristics of legacy network has proposed new challenge for the design of sensor network and realization: (1) low energy consumption, wireless sensor network is for a long time at unattended state, to the sensor node charging or change very difficulty of battery; (2) low cost, sensor network nodes communication, calculating and storage capacity are limited, require the communication protocol of exploitation than the low-resource expense; (3) node redundancy is disposed large-scale sensing node usually and is reduced unreliablely in surveyed area, but redundant node causes the probability of data packet collision to increase, and the error rate increases, and reduces inter-node communication efficient; (4) cooperation needs exchange message between node, and common the realization gathered, handled target, incident.
In the many application of sensor network, the wireless sensor network node scale is big, volume is little, usually carry very limited battery, deployment region circumstance complication, even personnel can't arrive, adopting artificial mode to change the node battery, to replenish the energy be unrealistic, therefore the energy consumption of node be must reduce as far as possible, the operating time of node and the bulk life time of network effectively prolonged.According to the characteristics of wireless sensor network, designing the energy consumption that new agreement, algorithm and Energy Saving Strategy reduce network is one of most important research contents of current wireless sensor network, and wherein Routing Protocol is the important means that reduces energy consumption.
Routing Protocol is the core technology of network service, does not have the support of good Routing Protocol, and wireless sensor network stability is difficult to guarantee that whole energy also is difficult to realize that wireless sensor network low-power consumption market competition advantage has not just existed.Therefore designing the efficient low-power consumption Routing Protocol of wireless sensor network is the wireless sensor network problem demanding prompt solution.At present the wireless sensor network Routing Protocol all and imperfection, network self-healing, energy-conservation, reduce aspect such as routing cost and all have room for improvement, particularly aspect energy-conservation, existing Routing Protocol all can not well adapt to the demand of wireless sensor network.
The wireless sensor network Routing Protocol can be used for reference ripe Ad hoc network routing protocol, can be advantageously applied to wireless sensor network by the Routing Protocol AODV (Ad hoc On demand Distance Vectorrouting) of the Ad hoc network of RFC3561 standard through suitable modification.AODV is a kind of Routing Protocol that drives as required, and it can be set up dynamic multi-hop route and safeguard an Ad hoc network between mobile node.AODV can allow node be established to the route of new destination node fast, and does not need node maintenance to be in the route in inactive state path.Very important innovative point of AODV is that each bar route has been used an aim sequence number, and the application target sequence number can guarantee the route loop free.
AODV has defined three kinds of type of messages: route requests (RREQ), routing reply (RREP), routing error (RERR).When one of node needs arrived the route of new destination node, this node can be broadcasted route requests and be sought.When this route requests arrives destination node, when perhaps intermediate node had a route to " enough newly " of destination node, this new route just can be decided.When a route entry sequence number to destination node more than or equal to route requests in during the sequence number of this destination node, this route is the route of " enough new ".Node with " enough new " route can be told the route requests node with this routing iinformation by the method for clean culture " routing reply ".Each node of receiving route requests all can reverse route to the route requests source node of buffer memory, and like this, " routing reply " just can be delivered to requesting node smoothly from final purpose node or the intermediate node that satisfies request condition.
In wireless sensor network, node overwhelming majority energy consumption there are some researches show that on wireless communication module sensor node uses wireless mode to transmit 1 bit to the 100 meter energy that consumes far away can supply 3000 instructions of processor processing.Therefore using the wireless sensor network Routing Protocol to guarantee on the basis of proper communication between node, the transmitting power that reduces each hop node by the use power control techniques is significant to reducing node energy consumption.
Power control mechanism research in the wireless sensor network mainly concentrates on 3 aspects, i.e. network layer power control, the control of link layer power and combined power control.The problem that the control of network layer power is concerned about is how dynamically to adjust topology of networks and routing by changing transmitting power, and the whole network performance is optimized; Link layer power control is mainly by finishing at the MAC layer, and sending node is dynamically adjusted transmitting power according to conditions such as the distance of each message destination node, channel conditions, in order to raising network capacity or reduction node energy consumption.Combined power control combines these two kinds of mechanism, use the power control of network layer to adjust network topology structure and routing, and the distance adjustment of controlling according to destination node by link layer power when sending message sends used power.
All do not consider the requirement and the characteristics of transfer of data at present in the mechanism aspect the power control, just when transfer of data requires, just need carry out suitable control transmitting power.Therefore and the part of transfer of data most critical is the foundation of route, and it is the most direct in setting up routing procedure power control being taken into account, the most effective, also is the way of simple possible, also is groundwork of the present invention.
Summary of the invention
The objective of the invention is to, a kind of energy-saving routing protocol based on power control is provided for the wireless sensor network of energy constraint.The present invention relates to the foundation of node and neighbours' optimal communication power, the contents such as foundation of energetic optimum route.Characteristics at wireless sensor network node wireless communication module energy consumption maximum, the invention provides a kind of Poewr control method and make inter-node communication power minimum, and design a kind of consideration mulitpath wastage in bulk or weight on this basis based on the AODV Routing Protocol, and select the energy-saving routing protocol of that paths of minimal power consumption as transfer of data, this agreement can be in the wireless sensor network of energy constraint conserve energy well.
The technical scheme that technical solution problem of the present invention is adopted is:
The wireless sensor network node composition that this programme was suitable for is identical, and (radiofrequency characteristics that is often referred to node is identical, identical threshold level and identical transmit power levels are arranged), the network node wireless communication module has several transmit power levels, and node can dynamically be adjusted transmitting power.In order to reduce the size of storage item and transmission and reception message, 64 bit interface identifier of IEEE 802.15.4 definition, i.e. 64 extended address are used in the address of this energy-saving routing protocol.
This wireless transducer network energy saving Routing Protocol based on power control mainly is divided into two processes, and the forward direction route is set up process and set up process with the back to route:
1) the forward direction route is set up process: after node joins network, the initialization routing table, send self information (comprising information such as identity ID) to aggregation node (aggregation node is the node of convergence in the sensor network), begin to start the routing procedure that is established to aggregation node: send route requests RREQ message with maximum transmission power, as shown in Figure 1.This RREQ message could arrive aggregation node through the forwarding of a plurality of intermediate nodes.
After intermediate node is received the RREQ message, carry out two-part operation:
A) intermediate node according to maximum power value, received power value, receive threshold can in the hope of it a last hop neighbor node (promptly sending the node of this RREQ message) and this intermediate node between the minimum emissive power P of communication link
m, and needn't use maximum power, and minimum emissive power is recorded in field " this jumping transmitting power " in the reverse route table items, routing table is as shown in Figure 2.
Annotate:
P wherein
t: the transmitted power of sending node; P
Thresh: oneself can correctly detect the also power threshold of decoded signal; P
r: the energy of received signal.
B) this intermediate node then judges oneself to be the destination (being aggregation node) of route requests RREQ message.If not, earlier minimum power is added in " to the gross power of source node " item, then amended RREQ message is transmitted; If, then this intermediate node is exactly an aggregation node, after aggregation node is received first RREQ message, within a certain period of time all RREQ messages of receiving are carried out buffer memory (owing to be broadcasting, have a plurality of RREQ messages and arrive aggregation node) via different paths, then " to the gross power of source node " field in a plurality of RREQ messages of receiving is compared, select the RREQ message of this field minimum is replied.
2) process is set up to route in the back: aggregation node selects " to the gross power of source node " minimum RREQ message to reply, structure RREP message, and clean culture sends the RREP message, the RREP message format as shown in Figure 3, the destination of this message (address of destination node) source node when sending the RREQ message.Added " this jumping minimum emissive power " and " to the gross power of aggregation node " two fields in the RREP message, in the RREP message that aggregation node sends, the former value is set to the P that writes down in the reverse routing table
mValue, the latter's value is set to " 0 ".When certain intermediate node is received the RREP message of its adjacent node x, this node just can be established to the route of aggregation node, and the next-hop node of this route is exactly node x, and is its " this jumping minimum emissive power " in the RREP of node x message of receiving to the best transmit power of node x.Equal " this jumping minimum emissive power " and " to the gross power of aggregation node " sum in the received RREP message to " to the gross power of destination node " in the routing table of this intermediate node.It should be noted that in the forward direction route and set up in the process that each intermediate node has all been set up the reverse route of source node, and all as calculated and write down minimum emissive power P
mIn addition, this intermediate node also will use information in the reverse routing table of source node and revise field " this jumpings minimum emissive power " and " arriving the gross power of aggregation node " in the RREP message, and along the next-hop node of this route amended RREP message be forwarded.Like this, the RREP message arrives source node through behind several intermediate nodes, and has set up by the route of source node to aggregation node in these a series of repeating process.
So just set up source node to route to aggregation node, the message transmissions of node will be transmitted by the route of newly setting up, table of query and routing before sending message, not only inquiry arrives the next-hop node address of aggregation node, inquiry simultaneously sends data to the transmitting power of next-hop node, this power just node to the minimum emissive power of next-hop node.
According to goal of the invention of the present invention, the invention provides a kind of energy-saving routing method for wireless sensor network based on power control, this method comprises the following steps:
In wireless sensor network, set up the forward direction route from the source node to the aggregation node;
In wireless sensor network, set up back from the aggregation node to the source node to route;
By the described forward direction route set up and described back to the route transmission message.
According to an aspect of the present invention, the described forward direction route of setting up specifically may further comprise the steps:
Step 2-1: source node joins initialization routing table behind the described wireless sensor network,
Step 2-2: the self information that sends described source node to aggregation node;
Step 2-3: send the route requests message with maximum transmission power;
Step 2-4: described route requests message is forwarded to aggregation node through at least one intermediate node;
Step 2-5: described intermediate node computes minimum emissive power of communication link between a hop neighbor node and this intermediate node on it;
Step 2-6: set up the reverse route of described intermediate node to source node;
Step 2-7: judge whether described intermediate node exists the route of aggregation node,, then enter step 2-8 if having; Otherwise, enter step 2-9;
Step 2-8: construct new route requests message, and along the described described new route requests message of route clean culture to aggregation node to aggregation node;
Step 2-9: construct new route requests message, and broadcast described new route requests message with maximum transmission power.
According to an aspect of the present invention, described foundation back specifically may further comprise the steps to route:
Step 3-1: after the route requests message arrived aggregation node, aggregation node was set the certain hour section, continued to receive the route requests message that never arrives with the path in the described time period;
Step 3-2: aggregation node is to comparing in all route requests messages of receiving;
Step 3-3: according to the comparative result of step 3-2, structure routing reply message, and, give corresponding intermediate node with the clean culture of routing reply message according to the described reverse route of setting up in the described forward direction route to source node;
Step 34: after intermediate node is received the routing reply message, be established to the forward route of aggregation node;
Step 3-5: construct new routing reply message;
Step 3-6: after new routing reply message passed through a plurality of intermediate nodes, finally arrives source node, the forward route was set up process and is finished, and finishes source node and sets up process to the energy-conservation route of aggregation node.
According to an aspect of the present invention, " to the gross power of the source node " field value in the route requests message is set to zero among the described step 2-3.
According to an aspect of the present invention, intermediate node among the described step 2-5 is tried to achieve on it minimum emissive power of communication link between hop neighbor node and described intermediate node according to maximum power value, received power value, receive threshold, and minimum emissive power is recorded in " this jumping transmitting power " field of routing table.
According to an aspect of the present invention, the concrete grammar that is established to the reverse route of source node among the described step 2-6 is inserted in routing table and is calculated " this jumping transmitting power " and " to the destination node gross power " field, and " to the gross power of source node " field adds this jumping minimum emissive power in the route requests message that the value of described " to the destination node gross power " field equals to receive.
According to an aspect of the present invention, " to the gross power of the source node " field value in the new route requests message is " arriving the destination node gross power " field value three sum in " this jumpings transmitting power " field value, the routing table in " to the gross power of source node " field value, the routing table in the former route requests message among the described step 2-8.
According to an aspect of the present invention, " to the gross power of the source node " field value in the new route requests message equals that " to the gross power of source node " field value adds this jumping minimum emissive power in the former route requests message among the described step 2-9.
According to an aspect of the present invention, aggregation node compares " to the gross power of source node " field in all route requests messages of receiving among the described step 3-2, selects the route requests message of this field value minimum to send the routing reply message.
According to an aspect of the present invention, structure routing reply message among the described step 3-3, insert " this jumping minimum emissive power " and " to the gross power of aggregation node " two fields, wherein " this jumps minimum emissive power " field is by calculating gained, and " to the gross power of aggregation node " is initially zero.
According to an aspect of the present invention, the new routing reply message of structure among the described step 3-5, insert " this jumping minimum emissive power " and " to the gross power of destination node " two fields, wherein " this jumping minimum emissive power " field can be by checking in the routing table of source node, and " to the gross power of aggregation node " field is routing reply message Central Plains " to the gross power of an aggregation node " field value and " this jumping minimum emissive power " value sum.
The beneficial effect that the present invention produces is:
This invention has remedied in the routing of existing routing protocol the not problem of transmitting power, in the present Routing Protocol many times node always send message with fixing transmitting power, cause the unnecessary consumption of energy like this.This invention considers that the distance of two communication nodes is also little always identical, transmitting power can be carried out suitable adjustment, setting up in the process in route then, calculate and send the minimum emissive power of message to next-hop node, maximum transmission power can be adopted when sending message like this, thereby the energy resource of node preciousness can be saved.
In order to further specify principle of the present invention and characteristic, the present invention is described in detail below in conjunction with the drawings and specific embodiments.
Description of drawings
Fig. 1 is the structural representation according to the route requests RREQ message of one embodiment of the present invention.
Fig. 2 is the routing table structural representation according to one embodiment of the present invention.
Fig. 3 is the structural representation according to the routing reply RREP message of one embodiment of the present invention.
Fig. 4 is the process schematic diagram of setting up energy-conservation route according to one embodiment of the present invention.
Fig. 5 is the schematic flow sheet of setting up the energy-conservation route of forward direction according to one embodiment of the present invention.
Fig. 6 be according to after the foundation of one embodiment of the present invention to the schematic flow sheet of energy-conservation route.
Embodiment
Describe the specific embodiment of the present invention in detail below in conjunction with accompanying drawing.
Fig. 1 is the structural representation according to the route requests RREQ message of one embodiment of the present invention.
The structure main difference of message has been to increase " to the gross power of source node " field among the structure of this RREQ message and the AODV, this field can be used for the optimized choice of destination node to many routed paths, select a RREQ message that arrives source node gross power minimum to reply, thereby save the whole network energy consumption to greatest extent.
Fig. 2 is the routing table structural representation according to one embodiment of the present invention.
Routing table is inquired about next hop address before being mainly used in and sending message, and inquiry simultaneously sends the needed minimum emissive power of message.This routing table and traditional routing table major different are exactly the address that not only comprises next jumping, and have comprised " this jumping transmitting power " and " to the destination node gross power " these two fields, as shown in Figure 2.
Fig. 3 is the structural representation according to the routing reply RREP message of one embodiment of the present invention.
The message structure main distinction has been to increase " this jumping minimum emissive power " and " to the gross power of aggregation node " among the structure of this RREP message and the AODV, when receiving the RREP message, intermediate node can revise relevant routing table information, " this jumping minimum emissive power " in the RREP message that " to the gross power of destination node " equals to be received in the route table items and " to the gross power of aggregation node " sum by these two fields.
Fig. 4 is the process schematic diagram of setting up energy-conservation route according to one embodiment of the present invention.
As shown in Figure 4, the round dot among the figure is represented node.Blue solid node " " expression source node is represented with capital S in the drawings, and red solid node " " expression aggregation node is represented with capital D in the drawings.Hollow node "
" expression intermediate node, lowercase a, b, c in the drawings ... the node of expression is intermediate node.
When source node S has data to send, table of query and routing at first, if the route table items that reaches aggregation node arranged then send data according to the routing iinformation in this list item, when finding not reach the route table items of aggregation node, then, begin the forward direction route establishment stage of energy-conservation route this moment with maximum transmission power broadcasting RREQ message.
Node in the source node communication range can be received the RREQ message that source node sends, node a among Fig. 4, b, c, d, f, the g node is all received the RREQ message, the routing table of these querying nodes self then, if found to have the routing iinformation that arrives aggregation node directly clean culture RREQ message, if not then revise field " to the gross power of source node " in the RREQ message and broadcast away with maximum power once more to aggregation node, a among the figure, b, c, d, f, six nodes of g all will be broadcasted the RREQ message once more.Notice to have the RREQ message of same route requests ID simultaneously, representing same RREQ message, if intermediate node is when successively receiving a plurality of RREQ message with identical route requests ID, and this intermediate node will directly abandon the RREQ message of follow-up repetition.(dotted line among the figure is being represented the propagation path of RREQ message)
So just might there be a plurality of REEQ messages to arrive aggregation node D via a plurality of different paths.Aggregation node is according to a plurality of RREQ messages of receiving, select the RREQ message (the value minimum of field " to the gross power of source node " in this message just) of optimum route to send routing reply RREP message, for just selecting this paths of D-e-d-S to arrive source node (shown in solid line among the figure) for this example, notice that the transmission of RREP message is clean culture.Intermediate node and source node upgrade the routing table of self after receiving the RREP message, thereby set up the route that arrives aggregation node, finish whole energy-conservation route and set up process.
Fig. 5 is the schematic flow sheet of setting up the energy-conservation route of forward direction according to one embodiment of the present invention.
Be illustrated in figure 5 as energy-conservation route forward direction and set up flow chart, idiographic flow is as follows:
Step 5-1: source node is with maximum transmission power broadcasting RREQ message, and " to the gross power of source node " field value is set to zero in the RREQ message at this moment;
Step 5-2: intermediate node is received the RREQ message, and route requests ID relatively if find once to receive the RREQ message of identical ID then directly abandon, otherwise forwards next step to;
Step 5-3: the performance number in the RREQ message that the intermediate node taking-up receives and the address of a last hop node;
Step 5-4: intermediate node according to the RREQ message maximum power value that receives, received power value, receive threshold can be in the hope of its a last hop node (transmission RREQ message is to its node) and the minimum emissive power P of the communication link between this intermediate node
m
Step 5-5: intermediate node is established to the reverse route of source node.Concrete grammar is, in routing table, insert " this jumping transmitting power " that calculate, and " to the destination node gross power " field, " to the gross power of source node " field adds the minimum emissive power P that this jumping calculates in the RREQ message that this gross power field equals to receive
m
Step 5-6: judge whether this intermediate node exists the route of aggregation node,, then enter step 5-7 if having; Otherwise, enter step 5-8;
Step 5-7: construct new RREQ message, and along this RREQ message of this route clean culture to aggregation node, and " to the gross power of source node " in the new RREQ message be " arriving the destination node gross power " three's sum in " this jumping transmitting power " that arrive destination node in the former RREQ message in this field value, the routing table, the routing table.
Step 5-8: construct new RREQ message, and with maximum transmission power broadcasting RREQ message, " to the gross power of the source node " field in the new RREQ message equals that the gross power field adds this jumping minimal power values in the former RREQ message.
Fig. 6 be according to after the foundation of one embodiment of the present invention to the schematic flow sheet of energy-conservation route.
Be illustrated in figure 6 as after the energy-conservation route to setting up flow chart, idiographic flow is as follows:
After step 6-1:RREQ message finally arrived aggregation node, aggregation node was set certain hour, continued to receive the RREQ message that never arrives with the path in this time.
Step 6-2: aggregation node compares " to the gross power of source node " field in all RREQ messages of receiving, selects the RREQ message of this field value minimum to send routing reply RREP message.
Step 6-3: structure RREP message, insert " this jumping minimum emissive power " and " to the gross power of aggregation node " two fields, wherein " this jumps minimum emissive power " field is by calculating gained, and " to the gross power of aggregation node " is initially zero (because initially time send RREP message by aggregation node).According to the reverse route of setting up in the forward direction routing procedure, give corresponding intermediate node with the clean culture of RREP message to source node.
Step 6-4: after intermediate node is received the RREP message, be established to the forward route of aggregation node.
Step 6-5: construct new RREP message, insert " this jumping minimum emissive power " and " to the gross power of destination node " two fields, wherein " this jumping minimum emissive power " field can be by checking in the routing table of source node, and " to the gross power of aggregation node " field is RREP message Central Plains " to the gross power of an aggregation node " field and " this jumping minimum emissive power " sum;
Step 6-6: after the RREP message passed through a plurality of intermediate nodes, finally arrives source node, the forward route was set up process and is finished, and source node S is set up process to the energy-conservation route of aggregation node D and finished.
Though more than described the specific embodiment of the present invention, but those skilled in the art is to be understood that, these embodiments only illustrate, those skilled in the art can carry out various omissions, replacement and change to the details of said method and system under the situation that does not break away from principle of the present invention and essence.For example, merge the said method step, then belong to scope of the present invention to realize the identical result of essence thereby carry out the essence identical functions according to the identical method of essence.Therefore, wooden scope of invention is only limited by appended claims.
Claims (10)
1, a kind of energy-saving routing method for wireless sensor network based on power control is characterized in that this method comprises the following steps:
In wireless sensor network, set up the forward direction route from the source node to the aggregation node;
In wireless sensor network, set up back from the aggregation node to the source node to route;
By the described forward direction route set up and described back to the route transmission message.
2, method according to claim 1 is characterized in that, the described forward direction route of setting up specifically may further comprise the steps:
Step 2-1: source node joins initialization routing table behind the described wireless sensor network,
Step 2-2: the self information that sends described source node to aggregation node;
Step 2-3: send the route requests message with maximum transmission power;
Step 2-4: described route requests message is forwarded to aggregation node through at least one intermediate node;
Step 2-5: described intermediate node computes minimum emissive power of communication link between a hop neighbor node and this intermediate node on it;
Step 2-6: set up the reverse route of described intermediate node to source node;
Step 2-7: judge whether described intermediate node exists the route of aggregation node,, then enter step 2-8 if having; Otherwise, enter step 2-9;
Step 2-8: construct new route requests message, and along the described described new route requests message of route clean culture to aggregation node to aggregation node;
Step 2-9: construct new route requests message, and broadcast described new route requests message with maximum transmission power.
3, method according to claim 2 is characterized in that, described foundation back specifically may further comprise the steps to route:
Step 3-1: after the route requests message arrived aggregation node, aggregation node was set the certain hour section, continued to receive the route requests message that never arrives with the path in the described time period;
Step 3-2: aggregation node is to comparing in all route requests messages of receiving;
Step 3-3: according to the comparative result of step 3-2, structure routing reply message, and, give corresponding intermediate node with the clean culture of routing reply message according to the described reverse route of setting up in the described forward direction route to source node;
Step 3-4: after intermediate node is received the routing reply message, be established to the forward route of aggregation node;
Step 3-5: construct new routing reply message;
Step 3-6: after new routing reply message passed through a plurality of intermediate nodes, finally arrives source node, the forward route was set up process and is finished, and finishes source node and sets up process to the energy-conservation route of aggregation node.
According to claim 2 or 3 described methods, it is characterized in that 4, " to the gross power of the source node " field value among the described step 2-3 in the route requests message is set to zero.
5, according to claim 2 or 3 described methods, it is characterized in that, intermediate node among the described step 2-5 is tried to achieve on it minimum emissive power of communication link between hop neighbor node and described intermediate node according to maximum power value, received power value, receive threshold, and minimum emissive power is recorded in " this jumping transmitting power " field of routing table.
6, according to claim 2 or 3 described methods, it is characterized in that, the concrete grammar that is established to the reverse route of source node among the described step 2-6 is inserted in routing table and is calculated " this jumping transmitting power " and " to the destination node gross power " field, and " to the gross power of source node " field adds this jumping minimum emissive power in the route requests message that the value of described " to the destination node gross power " field equals to receive.
7, according to claim 2 or 3 described methods, it is characterized in that " to the gross power of the source node " field value among the described step 2-8 in the new route requests message is " arriving the destination node gross power " field value three sum in " this jumpings transmitting power " field value, the routing table in " to the gross power of source node " field value, the routing table in the former route requests message.
8, according to claim 2 or 3 described methods, it is characterized in that " to the gross power of the source node " field value among the described step 2-9 in the new route requests message equals that " to the gross power of source node " field value adds this jumping minimum emissive power in the former route requests message.
9, method according to claim 3, it is characterized in that, aggregation node compares " to the gross power of source node " field in all route requests messages of receiving among the described step 3-2, selects the route requests message of this field value minimum to send the routing reply message.
10, method according to claim 3, it is characterized in that, structure routing reply message among the described step 3-3, insert " this jumping minimum emissive power " and " to the gross power of aggregation node " two fields, wherein " this jumps minimum emissive power " field is by calculating gained, and " to the gross power of aggregation node " is initially zero;
Or the new routing reply message of structure among the described step 3-5, insert " this jumping minimum emissive power " and " to the gross power of destination node " two fields, wherein " this jumping minimum emissive power " field can be by checking in the routing table of source node, and " to the gross power of aggregation node " field is routing reply message Central Plains " to the gross power of an aggregation node " field value and " this jumping minimum emissive power " value sum.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200810240745XA CN101442787B (en) | 2008-12-24 | 2008-12-24 | Energy-saving routing method for wireless sensor network based on power control |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200810240745XA CN101442787B (en) | 2008-12-24 | 2008-12-24 | Energy-saving routing method for wireless sensor network based on power control |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101442787A true CN101442787A (en) | 2009-05-27 |
| CN101442787B CN101442787B (en) | 2010-12-01 |
Family
ID=40726993
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200810240745XA Expired - Fee Related CN101442787B (en) | 2008-12-24 | 2008-12-24 | Energy-saving routing method for wireless sensor network based on power control |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101442787B (en) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101873663A (en) * | 2010-05-26 | 2010-10-27 | 北京科技大学 | Multi-path routing algorithm based on energy sensing reliability |
| CN101945460A (en) * | 2010-08-26 | 2011-01-12 | 湘潭大学 | Energy-saving AODV routing method used in Ad Hoc network environment |
| CN102413538A (en) * | 2011-12-02 | 2012-04-11 | 上海交通大学 | Route improving method based on AODV (ad hoc on-demand distance vector) and considering delay energy saving |
| WO2012087184A1 (en) * | 2010-12-20 | 2012-06-28 | Telefonaktiebolaget Lm Ericsson (Publ) | Energy efficient routing and switching |
| CN102883401A (en) * | 2012-10-17 | 2013-01-16 | 江苏省邮电规划设计院有限责任公司 | Realization method for prolonging life cycle of wireless multihop self-organizing network |
| CN103222241A (en) * | 2010-11-25 | 2013-07-24 | 皇家飞利浦电子股份有限公司 | System and method for optimizing data transmission to nodes of a wireless mesh network |
| CN103841020B (en) * | 2014-03-17 | 2017-01-18 | 山东大学 | Ad Hoc stable routing algorithm based on power control |
| CN106792975A (en) * | 2016-12-09 | 2017-05-31 | 南京理工大学 | AODV Routing Protocol optimization methods based on distance estimations |
| CN106888500A (en) * | 2017-03-31 | 2017-06-23 | 北京邮电大学 | A kind of communication means and device for self-organizing network |
| CN112822098A (en) * | 2020-12-25 | 2021-05-18 | 河南卓正电子科技有限公司 | Routing method and device of Internet of things and storage medium |
| CN114615189A (en) * | 2022-03-10 | 2022-06-10 | 中国电子科技集团公司第十研究所 | Distributed topology control method for wireless self-organizing network |
-
2008
- 2008-12-24 CN CN200810240745XA patent/CN101442787B/en not_active Expired - Fee Related
Cited By (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101873663B (en) * | 2010-05-26 | 2012-10-31 | 北京科技大学 | Multi-path routing algorithm based on energy sensing reliability |
| CN101873663A (en) * | 2010-05-26 | 2010-10-27 | 北京科技大学 | Multi-path routing algorithm based on energy sensing reliability |
| CN101945460A (en) * | 2010-08-26 | 2011-01-12 | 湘潭大学 | Energy-saving AODV routing method used in Ad Hoc network environment |
| CN101945460B (en) * | 2010-08-26 | 2012-12-05 | 湘潭大学 | Energy-saving AODV routing method used in Ad Hoc network environment |
| CN103222241A (en) * | 2010-11-25 | 2013-07-24 | 皇家飞利浦电子股份有限公司 | System and method for optimizing data transmission to nodes of a wireless mesh network |
| CN103222241B (en) * | 2010-11-25 | 2017-10-03 | 飞利浦灯具控股公司 | System and method for the data transfer of the node that is optimized to wireless mesh network |
| WO2012087184A1 (en) * | 2010-12-20 | 2012-06-28 | Telefonaktiebolaget Lm Ericsson (Publ) | Energy efficient routing and switching |
| CN102413538B (en) * | 2011-12-02 | 2014-07-02 | 上海交通大学 | Route improving method based on AODV (ad hoc on-demand distance vector) and considering delay energy saving |
| CN102413538A (en) * | 2011-12-02 | 2012-04-11 | 上海交通大学 | Route improving method based on AODV (ad hoc on-demand distance vector) and considering delay energy saving |
| CN102883401A (en) * | 2012-10-17 | 2013-01-16 | 江苏省邮电规划设计院有限责任公司 | Realization method for prolonging life cycle of wireless multihop self-organizing network |
| CN102883401B (en) * | 2012-10-17 | 2014-09-10 | 江苏省邮电规划设计院有限责任公司 | Realization method for prolonging life cycle of wireless multihop self-organizing network |
| CN103841020B (en) * | 2014-03-17 | 2017-01-18 | 山东大学 | Ad Hoc stable routing algorithm based on power control |
| CN106792975A (en) * | 2016-12-09 | 2017-05-31 | 南京理工大学 | AODV Routing Protocol optimization methods based on distance estimations |
| CN106792975B (en) * | 2016-12-09 | 2020-04-10 | 南京理工大学 | AODV routing protocol optimization method based on distance estimation |
| CN106888500A (en) * | 2017-03-31 | 2017-06-23 | 北京邮电大学 | A kind of communication means and device for self-organizing network |
| CN106888500B (en) * | 2017-03-31 | 2019-11-08 | 北京邮电大学 | A kind of communication means and device for self-organizing network |
| CN112822098A (en) * | 2020-12-25 | 2021-05-18 | 河南卓正电子科技有限公司 | Routing method and device of Internet of things and storage medium |
| CN114615189A (en) * | 2022-03-10 | 2022-06-10 | 中国电子科技集团公司第十研究所 | Distributed topology control method for wireless self-organizing network |
| CN114615189B (en) * | 2022-03-10 | 2023-05-02 | 中国电子科技集团公司第十研究所 | Distributed topology control method for wireless self-organizing network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101442787B (en) | 2010-12-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101442787B (en) | Energy-saving routing method for wireless sensor network based on power control | |
| Yu et al. | Energy efficient routing protocols for mobile ad hoc networks | |
| Yadav et al. | Energy aware cluster based routing protocol over distributed cognitive radio sensor network | |
| Liu et al. | Energy efficient on-demand multipath routing protocol for multi-hop ad hoc networks | |
| CN106817738B (en) | Routing method based on alliance game | |
| Tseng et al. | Fully power-aware and location-aware protocols for wireless multi-hop ad hoc networks | |
| Wang | Study on energy conservation in MANET | |
| CN101217381A (en) | Wireless transducer network energy saving method based on cross layers | |
| Chen et al. | A power efficiency routing and maintenance protocol in wireless multi-hop networks | |
| CN101835099B (en) | Large-scale sensor network routing method based on cluster and RREP broadcast | |
| Awerbuch et al. | The pulse protocol: Energy efficient infrastructure access | |
| Galluccio et al. | A MAC/Routing cross-layer approach to geographic forwarding in wireless sensor networks | |
| Loh et al. | Performance evaluation of efficient and reliable routing protocols for fixed-power sensor networks | |
| Bai et al. | An energy optimization protocol based on cross-layer for wireless sensor networks. | |
| CN103139073A (en) | Cognitive routing method based on Ad Hoc network form | |
| Poongkuzhali et al. | An optimized power reactive routing based on AODV protocol for Mobile Ad-hoc network | |
| CN101466160B (en) | Method and system for saving energy of wireless netted network node | |
| Xie et al. | Energy aware reliable routing protocol for mobile ad hoc networks | |
| Yuvaraj et al. | A survey on energy efficient routing protocols for MANET | |
| Banu et al. | A New Multipath Routing Approach for Energy Efficiency in Wireless Sensor Networks | |
| Pitchai et al. | Game theoretical computation based energy efficient routing for wireless sensor networks | |
| Youn et al. | Routing algorithms for balanced energy consumption in ad hoc networks | |
| Zhang et al. | Adaptive energy-aware routing protocols for wireless ad hoc networks | |
| El Ghanami et al. | Grids: geographically repulsive insomnious distributed sensors–an efficient node selection mechanism using passive clustering | |
| Gupta et al. | DBET: demand based energy efficient topology for MANETs |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20090527 Assignee: Beijing Sheenline Technology Co., Ltd. Assignor: Beijing Jiaotong University Contract record no.: 2016990000185 Denomination of invention: Energy-saving routing method for wireless sensor network based on power control Granted publication date: 20101201 License type: Common License Record date: 20160505 |
|
| LICC | Enforcement, change and cancellation of record of contracts on the licence for exploitation of a patent or utility model | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20101201 Termination date: 20161224 |