CN101977376A - Mobile node-based wireless sensor network energy-saving secure routing method and system thereof - Google Patents
Mobile node-based wireless sensor network energy-saving secure routing method and system thereof Download PDFInfo
- Publication number
- CN101977376A CN101977376A CN2010105173437A CN201010517343A CN101977376A CN 101977376 A CN101977376 A CN 101977376A CN 2010105173437 A CN2010105173437 A CN 2010105173437A CN 201010517343 A CN201010517343 A CN 201010517343A CN 101977376 A CN101977376 A CN 101977376A
- Authority
- CN
- China
- Prior art keywords
- node
- mobile node
- important
- network
- data
- 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
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a mobile node-based wireless sensor network energy-saving secure routing method and a system thereof. The method includes: an important node in the wireless sensor network is determined, and communication rule between the important node and the mobile node is established; according to the communication rule, speed control is carried out on the mobile node; and network security control is carried out on the wireless sensor network. The invention considers the factors of energy consumption of node, node data transmission reliability and network security and ensures operational use time and security of the whole sensor network under the restriction of multiple conditions.
Description
Technical field
The present invention relates to wireless communication technology field, relate in particular to a kind of wireless transducer network energy saving safety routing method and system based on mobile node.
Background technology
Wireless sensor network is a kind of emerging technology, adopts distributed treatment fully, but has numerous advantages such as monitoring accuracy height, fault freedom are good, the big remote monitoring in overlay area.At present, wireless sensor network has application prospects in all many-sides such as military, industrial, civilian, is one of present research focus.The outstanding feature of wireless sensor network is a static node random scatter in fixed area, and node data transmits by the multi-hop mode.The outstanding problem of bringing is that the peripheral node energy consumption the closer to aggregation node (Sink) is fast more in the network, because these core nodes have been born than the more communication load of other nodes, be that each data route all must be through these nodes, thereby cause its energy consumption too fast, the imbalance that node energy consumption occurs is existing.
At present, a large amount of scholar at how reducing with balance node energy consumption problem study both at home and abroad, research direction mainly concentrates on aspects such as foundation, node sub-clustering, bunch head of route and network are chosen, poll strategy, and it is also relative less with the research that improves aspect such as fail safe to reduce network energy consumption by mobile node.
Summary of the invention
The present invention is directed near Sink periphery node energy and consume the too fast whole wireless sensor network Problem of Failure that causes, a kind of wireless transducer network energy saving safety routing method and system based on mobile node proposed, based on the present invention, can satisfy under many constraints such as saving network node energy consumption, guarantee the reliability and the fail safe of network data, when guaranteeing the network operate as normal, prolong the effective time of network.
On the one hand, the invention discloses a kind of wireless transducer network energy saving safety routing method based on mobile node, comprise: communication rule establishment step, determine the important node in the described wireless sensor network, set up the rule of communicating by letter of described important node and described mobile node; Rate controlling step by described communication rule, carries out speed control to described mobile node; The network security controlled step is carried out the control of network security to described wireless sensor network.
Above-mentioned wireless transducer network energy saving safety routing method, preferred described communication rule establishment step comprises the steps: to elect step, election important node, the set that makes up bunch, the node of described important node for carrying out direct communication with mobile node; The first communication mode establishment step is set up the communication mode of ordinary node in the set of described important node and described bunch; Second communication mode establishment step is set up the communication mode between important node and mobile node.
Above-mentioned wireless transducer network energy saving safety routing method, preferred described rate controlling step comprises the steps: to detect step, detects the areas of congestion in the described wireless sensor network; Controlled step according to detected described areas of congestion, is carried out speed control.
Above-mentioned wireless transducer network energy saving safety routing method, preferred described network security controlled step comprises the expansion encrypting step, described expansion encrypting step comprises: link information bag receiving step, described important node receive the link information bag that described mobile node sends; Challenge information generates step, generates challenge information according to described link information bag; Confirm step, the described challenge information that generates is sent to described mobile node and wait acknowledge; Institute's encrypting step, state the affirmation information that important node receives described mobile node after, encrypt with the data of mobile node transmission.
On the other hand, the invention also discloses a kind of wireless transducer network energy saving safety route system based on mobile node, comprise: the communication rule is set up module, is used for determining the important node of described wireless sensor network, sets up the rule of communicating by letter of described important node and described mobile node; Rate control module is used for according to described communication rule described mobile node being carried out speed control; The network security control module is used for described wireless sensor network is carried out the control of network security.
Above-mentioned wireless transducer network energy saving safety route system, preferred described communication rule is set up module and comprised: election step unit is used to elect important node, the set that makes up bunch, the node of described important node for carrying out direct communication with mobile node; First communication mode is set up the unit, is used to set up the communication mode of ordinary node in the set of described important node and described bunch; The second communication mode is set up the unit, is used to set up the communication mode between important node and mobile node.
Above-mentioned wireless transducer network energy saving safety route system, preferred described rate control module comprises: detecting unit is used for detecting the areas of congestion of described wireless sensor network; Control unit is used for carrying out speed control according to detected described areas of congestion.
Above-mentioned wireless transducer network energy saving safety route system, preferred described network security control module comprises expanding encrypts submodule, described expansion is encrypted submodule and comprised: link information bag receiving element is used for described important node and receives the link information bag that described mobile node sends; The challenge information generation unit is used for generating challenge information according to described link information bag; Confirmation unit, the described challenge information that is used for generating sends to described mobile node and wait acknowledge; Institute's ciphering unit, be used to state the affirmation information that important node receives described mobile node after, encrypt with the data of mobile node transmission.
In terms of existing technologies, the present invention has carried out research targetedly to the energy-saving safety routing issue based on mobile node in the wireless sensor network, proposition utilizes mobile node to solve the too fast Problem of Failure of Sink week mid-side node in the network, has formed the wireless transducer network energy saving safety routing method based on mobile node.This method has been considered factors such as node energy consumption, node transmission data reliability and internet security, and the utilization correlation technique can guarantee the effective time and the fail safe of whole sensor network under many constraints situation.
Description of drawings
Fig. 1 is the flow chart of steps that the present invention is based on the wireless transducer network energy saving safety routing method of mobile node;
Fig. 2 the present invention is based in the wireless transducer network energy saving safety routing method of mobile node, important node election flow chart;
Fig. 3 the present invention is based in the wireless transducer network energy saving safety routing method of mobile node, and the network-critical node makes up demonstration graph;
Fig. 4 is the data-transmission mode schematic diagram;
Fig. 5 is the Differentiated Services strategy in the important node;
Fig. 6 the present invention is based in the wireless transducer network energy saving safety routing method of mobile node mobile control algolithm flow chart;
Fig. 7 the present invention is based in the wireless transducer network energy saving safety routing method of mobile node the security algorithm flow chart;
Fig. 8 is node survival number of variations schematic diagram;
Fig. 9 is network expectation reliability and the actual reliability graph of a relation that obtains;
Figure 10 is network work time and energy consumption graph of a relation;
Figure 11 is the network security verification schematic diagram;
Figure 12 is the simple structure schematic diagram that the present invention is based on the wireless transducer network energy saving safety route system of mobile node.
Embodiment
For above-mentioned purpose of the present invention, feature and advantage can be become apparent more, the present invention is further detailed explanation below in conjunction with the drawings and specific embodiments.
With reference to Fig. 1, Fig. 1 is the flow chart of steps that the present invention is based on the wireless transducer network energy saving safety routing method of mobile node, rule establishment step 110 comprises the steps: to communicate by letter, determine the important node in the described wireless sensor network, set up the rule of communicating by letter of described important node and described mobile node; Rate controlling step 120 by described communication rule, carries out speed control to described mobile node; Network security controlled step 130 is carried out the control of network security to described wireless sensor network.
Operation principle of the present invention and content: utilize mobile node to solve and consume too fast problem, effectively reduce the energy consumption of node, prolong the effective time of network and guarantee the fail safe of network near Sink periphery node energy.
Communicate by letter with the mobile node foundation of rule of 1 important node
1.1 important node election
The groundwork of phase I is the election important node, the set that makes up bunch, just elect in the network after can with the node of mobile node direct communication.This is that Routing Protocol is set up the preparatory stage in the process, also is the basis in latter two stage.This stage mobile node comes and goes one time separately along specified path, periodically sends link information bag (Connect) on its mobile route, utilizes broadcast mode, announces the existence of oneself, sets up with the node in its communication range and gets in touch.This stage, mobile node broadcasting link information bag Connect, other nodes just are responsible for receiving this link information bag Connect, and are transmitted to all mid-side nodes, this bag are not carried out any answer.Consider that wireless sensor network topology has dynamic, so the phase I will periodically be carried out the effect that realizes adding new node and delete downright bad node.Article is with reference to document (Guoliang Xing, Tian Wang, Zhihui Xie, Weijia Jia.Rendezvous Planning in Mobility-assisted Wireless Sensor Networks.Real-Time Systems Symposium.2007, pp.311-320.) set up the important node mode, and inspired thus, following new mode about the important node election is proposed.
Concrete implementation is as follows:
1. node initializing stage
The node random scatter will be confirmed the unique ID of oneself behind whole zone, own initial simultaneously rank sign L is set to infinity.
2. mobile node initial phase
Mobile node confirms that the unique ID of oneself is 1, and the rank sign L=0 of oneself is set, and is ready for sending link information bag Connect, and link information bag Connect is by { node ID, rank sign L, leader cluster node sign, cipher mark g
xComposition, wherein cipher mark g
xWith being applied to the assurance of internet security, will introduce in detail at 4.3 chapters and sections.
3. mobile node moves along fixed path with constant speed, periodically broadcast the link information bag 1,0,0, g
x.
Among the link information bag Connect, ID is the unique identification of node, just can not change after the initialization; Rank sign L changes according to algorithm, begins to be provided with ordinary node rank sign L value most for infinitely great, and mobile node is provided with own rank and is designated L=0; The leader cluster node of mobile node sign position is set to 0, and the leader cluster node sign position of the important node of selecting according to algorithm also is set to 0 later on, and the important node ID value of self region is arranged in this position of ordinary node.
4. algorithm rule
(1) at first network node carries out initialization, comprises the node ID value, rank sign L;
(2) node is waited for reception link information bag Connect then;
(3) in case receive link information bag Connect, at first judge the L value size that receives among the link information bag Connect add 1 jump after whether less than own current L value, if the judgement establishment, then the L value with oneself changes to L=L
Connect+ 1; If be false, then get back to the link information bag Connect state that receives of waiting for;
(4) judging under the condition of setting up, whether the rank sign L value of further judging this moment oneself again is 1, if the rank of oneself sign L value is 1, prove that link information bag Connect just now sends to oneself by mobile node, the leader cluster node sign is set to 0 so; Find that the L value of oneself is not equal to 1 if judge the back, prove that then this information is the link information bag Connect that other nodes send to oneself, the leader cluster node identification information that then will receive among the next link information bag Connect is written among the link information bag Connect that oneself will send;
(5) if the leader cluster node of proof oneself is designated 0, then explanation has been chosen to be important node, proceeds broadcasting, link information bag Connect is the { ID of oneself, 1, the ID} of oneself, no longer sent g among the link information bag Connect by the node transmission this moment
xInformation, the leader cluster node sign is arranged to the ID value of oneself, is used to set up one's own bunch of zone;
(6) oneself not important node if judge, proceed broadcasting equally, the connection bag of broadcasting is that { ID of oneself upgrades the value that the back rank identifies L, under bunch ID}, wherein under bunch the ID value be exactly leader cluster node identification information among the link information bag Connect that receives of node;
(7) be circulated to wait and receive link information bag Connect step.
In the phase I, the node in the network only just can be transmitted link information bag Connect behind the link information bag Connect that receives from other nodes, and before not receiving any link information bag Connect, oneself cannot initiatively send information.Algorithm flow chart as shown in Figure 2.
The production process of important node as shown in Figure 3.After link information bag Connect goes on the air, the point nearest apart from the mobile node path at first received link information bag Connect, it is set to important node itself, bears the task that bunch interior nodes information of collection also finally sends to mobile node in the transfer of data afterwards.Each node also can continue to broadcast after receiving link information bag Connect, sets up one's own bunch of zone.The part on Fig. 3 left side has shown the zone of determining important node.
But in said process, also can occur apart from the nearer node in mobile node path because mobile node does not also in time move near this node, and at first receive the link information bag Connect that sends from other node broadcasts.As a result, these nodes at first initialization have been specified a bigger rank sign L value, have irrationality so seemingly.And in fact after mobile node is moved further more near these nodes, the rank sign L value that they may more be optimized.
According to guaranteeing the minimum principle of rank sign L value, these nodes will be selected thereby the realization rank identifies the optimal value of L value according to the numerical value of the up-to-date link information bag Connect Update Level sign L that receives.Along with moving of mobile node, the more reasonable distribution of rank sign L value trend of whole network node.Finally, rank sign L value is that 1 node will be chosen to important node, become can with mobile node interactive information node, the clear and definite own affiliated bunch zone of other ordinary nodes.For example, the present rank of the C node in figure sign L=3, it is received at first is information L=1 from node A, behind the Node B relaying, the value of rank sign L increases by 1.But along with the continuation of mobile node is moved, if it receives the link information bag Connect from mobile node, and oneself rank sign L value is updated to 1, it may become another regional important node, rather than the state of the present Fig. 3 demonstration of picture.
After phase I finished, static network will be divided into the zone of a plurality of clusters, and all there is oneself a important node in the zone of each cluster.Certainly, the situation of a node can occur having only in bunch of zone, but this does not influence the performance of whole network yet.
1.2 bunch internal information is set up
The design of second stage mainly concentrates on communication mode how to set up ordinary node in important node and its bunch zone.The present invention has designed response type mixing route matrix and has solved this problem.Response type mixing route matrix by combining with the level route, adopts level route at the communication establishment stage with plane road, and in data transmission procedure, use plane road by.
Response type mixes route and adopts the level route at the communication establishment stage.The present invention adopts the LEACH agreement of simplification, and the link information bag Connect that utilizes the phase I to receive forms corresponding bunch of zone.After node is received link information bag Connect, confirm that oneself becomes important node, this node information of going on the air is set up oneself bunch zone.Utilize the leader cluster node sign among the link information bag Connect, broadcast message is announced the existence of oneself, and wishes to set up bunch zone.Receive the ordinary node of this important node transmission information, leader cluster node is identified in the information that is written to oneself go, acquiescence adds this bunch zone.Different with the LEACH agreement is, what the LEACH agreement adopted is that bunch head selects in turn according to algorithm, and the simplification LEACH agreement that the present invention adopts is at first to select important node to take on a bunch head by mobile node, and important node is set up bunch zone of oneself more then.
The data transmission procedure that response type mixes route uses improved DD agreement.The present invention utilizes improved DD agreement, in the process of phase I important node election, the node of receiving link information bag Connect can continue link information bag Connect to transmit, and wherein the variation of L value means the distance that arrives mobile node, just the notion of gradient in the DD agreement.After node is confirmed oneself to be chosen as important node, the information of going on the air is sought the ordinary node in the zone to one's name, it with own leader cluster node identify set after, the interior gradient in zone is to one's name set up in the variation of utilization level sign L value, sets up the network of oneself.Because all Information Monitorings of all nodes among the present invention, rank sign L value record the Grad that the sign ordinary node arrives important node among the link information bag Connect.Therefore when data will transmit, as long as carry out transfer of data along the change direction of gradient.
In native system, important node is equivalent to the Sink node in each cluster zone.But different with the Sink node is that self also can produce data these important node.Each important node is stored data that self produce and the data of coming from the ordinary node transmission by response type mixing route in buffer memory.Mix route by response type and guaranteed that the information of static node generation can arrive important node the most fast, reduces delay phenomenon.In case important node and mobile node are established direct links, then can transmit data rapidly.The transmission mode of data as shown in Figure 4.
1.3 the important node and the mobile node communication of algorithms are realized
The emphasis of phase III is to set up communicating by letter between important node and mobile node.The basis that this stage sets up is intermittent availability link.For transfer of data, a The key factor determines when that the communication link of important node and mobile node is available.Only under the situation that communication channel can be used, just can carry out data and transmit.Important node starts from establishment of connection with communicating by letter of mobile node, the disconnection that ends to connect.When mobile node and important node can direct communications, important node sent data, when mobile node leave with important node can the zone of direct communication after, consider that from energy-conservation angle important node just need stop to continue to mobile node transmission data.
Concrete solution is: after mobile node sends link information bag Connect through the phase I, in ensuing path movement, mobile node is periodically broadcasted the Hello bag, notify other nodes its existence, and the important node of request in its communication range send packet to oneself.The Hello bag is according to the regular time interval T
HelloSend, the important node that receives the Hello bag sends data to mobile node.The effect of Hello bag is that important node can detect mobile node whether in oneself scope, and the important node of receiving the Hello bag just can be prepared to begin transfer data packets and be arrived mobile node.Mobile node receives from the data of important node and feeds back, and sends confirmation bag ACK.This feedback mechanism help important node to recognize to connect be enliven and data obtained reliable transmission and reception.After important node was received the affirmation packets of information ACK that mobile node sends, important node just can be removed the data that sent in buffer memory.
From storage to the important node process of transmitting, we introduce notion (the Zhou Xin-Lian of Differentiated Services, Wang Run-Yun.Reliable Data Delivery Algorithm based on Differentiated Service in WSNs.Electronic Computer Technology, 2009International Conference.2009, pp.596-599.), and to it simplify.After if node collects data, be sensor sensing data or emergency data if find this information data, be 0 then with its type definition, the general data define styles is 1.It is after 0 the information, preferentially it to be transmitted that ordinary node collects data type; Collect data type and be 1 information, formation to be sent such as then put it into and transmit.
Contain in ordinary node sends the packet of important node to when to have plenty of data type be 0 data, this bag type is also identified into 0, puts into after this packet is received by important node and waits for preferential the transmission in the highest formation of queue-level 1.Important node is collected and is judged that the bag type is 1 behind the packet, and it is medium to be sent then to put into general data formation 2.Simultaneously, important node self also needs Information Monitoring, is 0 information in case collect data type, also will be positioned in the formation 1.Otherwise, be placed in the buffer queue 3 of oneself.
The quantity of emergency data will be far smaller than the quantity of general data in the real process, therefore, distributes to the spatial cache minimum of formation 1 in the important node, the spatial cache maximum of formation 2, and middle size is formation 3.
Carrying out data packets for transmission from important node sends buffer memory in such a way.Important node stores general data the formation 2 into successively according to the order that receives data from ordinary node.The storage that it produces self is in another queue queue 3.With urgent data, the emergency data that is produced by ordinary node or self is aligned in the formation 1.When important node can transmit data, wrap at first data in the Collection Queue 1,, then preferentially collect the emergency data in the transmit queue 1 if in the formation 1 data are arranged; If the data in the formation 1 are less, to collect to wrap after the data of the formation 1 that finishes and also have living space, the mode that then adopts taking turn is the data in the Collection Queue 2,3 successively; If free of data in the formation 1, then directly collect data in 2,3 formations according to the taking turn mode.This mode has guaranteed the performance of network QoS, carries out priority treatment for emergency data, has guaranteed the service quality of network.Principle such as Fig. 5:
When important node transmits data to mobile node, will open two timers:
1. retransmission timer
Arrive when the retransmission timer time, when important node is not also received confirmation bag ACK, system will retransmit automatically.Retransmission mechanism in order to guarantee because the loss that packet loss or channel collision bring.The time of retransmission timer is greater than the time of the inner taking turn group of important node bag, the transmission time of also beaming back confirmation bag ACK much larger than mobile node.
2. connect and lose timer
Arrive if timer time is lost in connection, important node is not also received the Hello bag that mobile node sends, and important node will stop to transfer data to mobile node.Connect and to lose timer and be used to help important node to detect mobile node whether also in the communication range of oneself, whether connectedness is effective.Connection is lost timer and is set to 3 * T
HelloThe unnecessary time interval prevents because channel collision is lost Hello bag, the judgement that causes important node to be done making mistake.
Important node and mobile node communication process can be summarized as, important node at first receives the Hello packets of information and determines that mobile node is in the communication range of oneself, the packet Data that sends oneself then is to mobile node, feed back behind the packet Data of mobile node reception from important node, send confirmation bag ACK.Important node is deleted the data in the own buffer memory after receiving confirmation bag ACK, and a complete communication process finishes.If the retransmission timer time arrives, important node does not still receive the affirmation packets of information ACK from mobile node, important node detect mobile node also in its communication range after, can carry out the re-transmission of packet.
The foundation of 2 mobile node speed control rules
2.1 areas of congestion is selected
Areas of congestion determine have no backing geography information or GPS, but rely on the decision of node self character.The nodal information situation that mobile node is got in touch with it by record is judged the position that areas of congestion produces.Network is provided with m areas of congestion altogether.Below 2 predicate nodes whether in areas of congestion:
In very short time often and mobile node get in touch;
2. get in touch frequently with mobile node, but the Data Receiving speed of mobile node obviously descends.
The reason that produces above two kinds of results simultaneously is that the mobile node translational speed causes too soon because the important node distribution is too intensive.Definite foundation of areas of congestion satisfies above two conditions simultaneously, and with the receiving node data volume what as the judgement areas of congestion foundation.If find to satisfy the regional too many of above condition, the sum of areas of congestion has surpassed m, and then the principle according to selective reception minimal data amount zone filters out m areas of congestion from these zones.Be defined as the position of areas of congestion, in the moving of next time, will use the translational speed controlling mechanism.Mobile node moves with speed s for the first time, sends link information bag Connect, sets up important node information and bunch area information.Mobile node still moves with speed s for the second time, sends the Hello packets of information, informs the existence of important node oneself.At this moment, receive the important node of Hello packets of information, will send corresponding data information, attempt to get in touch with mobile node foundation.In this process, sparse if important node distributes, the probability that then produces data collision on the channel is just little, if important node is densely distributed, the probability that channel confliction then takes place is just big.The standard of areas of congestion is judged in the mobile node utilization, selects m areas of congestion.
Translational speed control strategy of the present invention is divided into two states (Somasundara, A.A, Kansal with mobile node, A, Jea, D.D, Estrin, D, and Srivastava, M.B.Controllably Mobile Infrastructure for Low Energy Embedded Networks.Mobile Computing, IEEE Transactions on.2006, vol.5, pp.958-973), mobile node is 2s in the normal region translational speed, stops to move in areas of congestion and collects data.The speed of mobile node is set to 2s, and the time of then save just can be applied in the areas of congestion goes.The network that is always s with translational speed is compared, if the translational speed of mobile node is changed to 2s, and the time that on a fullpath, can save T/2 then.These extra T/2 times can mean allocation in m areas of congestion.When mobile node is received packet and is judged when oneself having entered areas of congestion, its T that will stop
StopIndividual interval is used for collecting data in areas of congestion, wherein
After node stops, if the packet from the another one areas of congestion has been received in discovery, then it will be adjusted into 2T automatically the time of staying
Stop, by that analogy.Mobile node through first secondary move after, collect the information of important node, and determined good areas of congestion, carrying out when mobile for the third time, utilize again and stop walking strategy mobile node speed is controlled, improve the efficient that mobile node receives data.
2.2 moving algorithm is realized
As follows about mobile node speed control algorithm implementation procedure:
1. finish message link
Behind the mobile node process fullpath second time, the record nodal information is determined areas of congestion information according to the areas of congestion criterion.
2. mobile node initialization
Mobile node is according to initial state (be mobile node move with 2s speed and stop two states), and 2s moves in given line with speed.
3. detect congested
Mobile node is in moving process, and whether the nodal information of relatively collecting is identical with information in the step 1, thereby determines areas of congestion.
4. acquisition of information
When mobile node does not enter areas of congestion, move with speed 2s and to collect important node information simultaneously.When mobile node detect oneself enter areas of congestion after, automatically stop motion, and begin to collect the information that important node is sent, the time of staying is
5. timer is set
After node entered areas of congestion, time of staying timer started automatically, and the time of staying is counted.
6. continue to detect areas of congestion
Meanwhile, mobile node continues to detect the information that whether has from other areas of congestion.If have, then increase a time of staying again; If do not receive the information that other areas of congestion send, then continue to wait for and detect.
7. the timer time is full
When time of staying timer time arrives, node moves with speed 2s again.
8. repeating step 2.
In whole process, mobile route is fixed, and total elapsed time is also fixed.Fig. 6 is the flow chart of this algorithm.
We recall the part of preamble and can know, mobile node mobile fullpath for the first time is that this stage ordinary node does not have data to transmit for definite important node information.Mobile fullpath for the second time, because without any foundation can reference, also can't determine areas of congestion, and unordered transmission causes a lot of data not to be collected, therefore the purpose that moves for the second time is to detect areas of congestion, for later transfer of data is prepared.After mobile node moved for the third time, mobile node moved with speed 2s in the normal region, stopped to move at the areas of congestion mobile node receiving data.
The foundation of 3 network security rules
The expansion password (Taekyoung Kwon.Authentication and Key Agreement via Memorable Password[EB/OL] .Internet Society Network and Distributed System Security Symposium, 2001.http the eprint.iacr.org/2000/026 of: //, 2004.5.10.) thought promptly a user when proving that to authentication it has password P, not to provide P simply, but show the random password that gets by the P expansion to it, representing that this user knows password P, but do not reveal any information about P.This thought has been avoided to a certain extent owing to password only has the danger that low comentropy is easy to be subjected to guessing attack.Below provide and expand the proof of password at both sides' Qualify Phase.
The proof prerequisite is a big prime number for several constants: p, Z
pBe the residue class field of integer mould p, g is a multiplicative group
Generator.
1. select big prime number p, the feasible x ∈ Z that selects at random
pHigh comentropy is arranged, to such an extent as to conjecture is infeasible;
2. password is the user A of P, selects x ∈ Z at random
p, with g
xSend B to;
3.B authorization information g is arranged
p, select y ∈ Z at random
p, and generate challenge information g thus
(x+P) yWhether inquiry A knows P;
4.A by expanding password
Calculate feedback information g
y, send to B, with the password that shows that it knows expansion
Thereby know password P;
5.B verify sending a message back confirming the identity of A, thereby produce symmetric key g
Xy
As long as x is safe, although P can guess that x+P remains and can not guess.Expand password and be proved to be a kind of safe password, do not reveal any relevant information of password, can carry out safe authentication.
In an application of the invention, node is divided into mobile node, important node, three kinds of ordinary nodes.Each node all has password and the ID of oneself, but considers to have only mobile node to store the ID and the pairing password thereof of all nodes from the limited aspect of node memory.After improving expansion password algorithm, important node produces g
XyPromptly begin afterwards data are encrypted and transmitted to data.Similar with it, but also application enhancements expansion password algorithm of the authentication of ordinary node in important node and bunch zone.But because important node is being born the collection work of all node datas bunch zone in, and self can also image data, so the main path of external node intercepting and capturing network data is exactly in the communication process of important node and mobile node.Therefore, improvement expansion password algorithm of the present invention only is applied between important node and the mobile node.
With reference to Fig. 7, improve and expand the password method:
1. when mobile node is for the first time mobile, periodically send link information bag Connect, the bag the inside comprises the g that produces at random
x
2. after node receives link information bag Connect, judge whether the rank sign L value of oneself is at 1 o'clock, if then extract g
xInformation, otherwise do not extract.
3. when node was judged own L=1, node itself had authorization information g
p, select y ∈ Z at random
p, and generate challenge information g thus
(x+P) y
4. when mobile node is for the second time mobile, sends the Hello bag and declare its existence, if important node receives the Hello bag, then with the challenge information g that generates
(x+P) ySend to mobile node with the ID of self.
5. if when mobile node is for the second time mobile, important node does not bump on the residing position, and mobile node receives g
(x+P) yAnd ID, the record node ID, and mobile node is by expanding password
Calculate feedback information g
y
6. mobile node sends confirmation bag ACK to important node, and content comprises g
yAnd P.
7. important node receives g
yAnd P, produce g
Xy, then in the transfer of data afterwards, the data that send are carried out encrypted work.
8. if when mobile node is for the second time mobile, important node bumps on the residing position, does not receive the affirmation packets of information ACK from mobile node, then carries out certain number of times and retransmits, if do not receive confirmation bag ACK always, wait for that then receiving new Hello bag transmits again.
9. after mobile node has adopted mobile node speed control strategy, stop walking strategy in areas of congestion.When important node is received the Hello bag, then with the challenge information g that generates
(x+P) ySend to mobile node with the ID of self.
10. mobile node receives g
(x+P) yAnd ID, the record node ID, and mobile node is by expanding password
Calculate feedback information g
y
11. repeating step 6,7.
12., then carry out certain number of times and retransmit if important node is not received the affirmation packets of information ACK from mobile node; If find that mobile node has left self zone, wait for that then new Hello bag transmits again.
13. repeating step 9,10,11,12.
Improve and expand the password algorithm flow chart as shown in Figure 7.
Embodiment 1:
Wireless sensor node is randomly dispersed in the 100X100 rectangular area, and interstitial content is 100, and the communication radius of mobile node is r=25cm, and mobile node moves along a straight line, and (0,50) just in time passes across whole zone to position (100,50) from the position.After mobile node is finished once and to be moved, get back to starting point at once and begin a new round and move.Ordinary node produces a packet each second.Carry out emulation from the following aspects:
1. network lifetime relatively
Design original intention based on the wireless transducer network energy saving safety route of mobile node is to avoid because the too much problem of energy consumption that the network node multi-hop brings especially overcomes because the unavailable phenomenon of network that the node energy nearer apart from the Sink position is exhausted at first and causes.Mobile node does not stop to move, and important node and mobile node just carry out transfer of data in direct communications range, and other are in resting state constantly, have effectively saved the energy of node self.Simultaneously, reduced the number of times of multi-hop in the transfer of data, just reduced transmitting and receiving the energy loss of bringing, reached the purpose of saving network energy based on the wireless transducer network energy saving safety routing algorithm of mobile node.LEACH_A represents to use the active node number of variations curve of LEACH protocol network along with the time changes among Fig. 8; DD_A represents to use the active node number of variations curve of DD protocol network along with the time changes; CMNRA_A represents to use the active node number of variations curve of CMNRA protocol network along with the time changes.As can be seen from Figure 8, utilization reaches the purpose of saving network energy based on the life span that the wireless transducer network energy saving safety routing algorithm of mobile node can prolong network effectively.
2. data reliability relatively
The wireless transducer network energy saving safety routing algorithm based on mobile node of the present invention design is introduced the Differentiated Services mechanism of simplification in important node and ordinary node transmission data, data type is set is two kinds of emergency data and general data.After emergency data sends to important node, store the formation 1 of buffer into, and formation 1 is the highest at the buffer medium priority.After general data stored the important node buffer memory into, priority was lower.Important node can be directly with after mobile node is communicated by letter, preferentially send highest-ranking data in the important node buffer, impel the emergency data priority treatment.After the emergency data transmission finishes, send common data again.Because the quantity of emergency data will be far smaller than the quantity of general data in the real network, therefore, this preferential mode can not bring general data to send nonvolatil hysteresis.LEACH_R represents to use the actual reliability change curve that obtains of LEACH protocol network along with network expectation reliability changes among Fig. 9; CMNRA_R represents to use the actual reliability change curve that obtains of CMNRA protocol network along with network expectation reliability changes.As shown in Figure 9, the network of application division service mechanism, the processing energy of reply emergency data is obviously strengthened, and under the condition that the reliability that network is expected improves constantly, the reliability of the actual acquisition of network becomes obvious ascendant trend.
3. the network total power consumption relatively
LEACH_E represents to use the energy consumption varies curve of LEACH protocol network along with the time changes among Figure 10; DD_E represents to use the energy consumption varies curve of DD protocol network along with the time changes; CMNRA_E represents to use the energy consumption varies curve of CMNRA protocol network along with the time changes.As can be seen from Figure 10 preceding 400s is in the election of important node and definite stage in bunch zone; After mobile node reaches 800s through a complete cycle again, mobile node has been judged and has been selected areas of congestion, and will in ensuing node motion, use the mobile node speed control algorithm, mobile node is divided into rapid movement collects data and two kinds of motion states of stop motion acquisition of information.Through after the 800s, mobile node the data that begin to collect from important node transmission.See on the whole, As time goes on, operation is littler than the static network energy consumption of the static network of using the LEACH algorithm and application DD agreement based on the network of the wireless transducer network energy saving safety routing algorithm of mobile node, so the life-span of whole sensor network will prolong.
4. improve and expand the password algorithm simulating
As shown in figure 11, if having malicious node on the mobile node path, intercept and capture the data message between important node and the mobile node specially, A is the acquisition of information node.Because application enhancements expands password protocol between important node and mobile node, even data are intercepted and captured by malicious node, but the factor certificate has been encrypted when transmission, so the data message that malicious node is intercepted and captured is often unavailable, thereby has guaranteed the data security of network.
After mobile node carries out authentication to important node, the affirmation information of message has been guaranteed the infeasible of man-in-the-middle attack.As shown in figure 11, enter the zone that has malicious node when mobile node after, the malicious node on the link may transmit a secondary data to mobile node several seconds.Because use password mechanism between mobile node and the important node, it is easy that malicious node obtains password P, obtains to improve the x difficulty that expands in the password protocol, so malicious node can not pretend to be important node and mobile node to communicate.Even malicious node sends data to mobile node, after mobile node is verified, also its data can be abandoned automatically.
On the other hand, the present invention also provides a kind of embodiment of the wireless transducer network energy saving safety route system based on mobile node.With reference to Figure 12, comprising:
The communication rule is set up module 1201, is used for determining the important node of described wireless sensor network, sets up the rule of communicating by letter of described important node and described mobile node; Rate control module 1202 is used for according to described communication rule described mobile node being carried out speed control; Network security control module 1203 is used for described wireless sensor network is carried out the control of network security.
System embodiment is identical with the principle of method embodiment, does not repeat them here, and relevant part reference method embodiment gets final product.
More than a kind of wireless transducer network energy saving safety routing method and system based on mobile node provided by the present invention described in detail, used specific embodiment among the present invention principle of the present invention and execution mode are set forth, the explanation of above embodiment just is used for helping to understand method of the present invention and core concept thereof; Simultaneously, for one of ordinary skill in the art, according to thought of the present invention, part in specific embodiments and applications all can change.In sum, this description should not be construed as limitation of the present invention.
Claims (8)
1. the wireless transducer network energy saving safety routing method based on mobile node is characterized in that, comprising:
Communication rule establishment step is determined the important node in the described wireless sensor network, sets up the rule of communicating by letter of described important node and described mobile node;
Rate controlling step by described communication rule, carries out speed control to described mobile node;
The network security controlled step is carried out the control of network security to described wireless sensor network.
2. wireless transducer network energy saving safety routing method according to claim 1 is characterized in that, described communication rule establishment step comprises the steps:
The election step, election important node, the set that makes up bunch, the node of described important node for carrying out direct communication with mobile node;
The first communication mode establishment step is set up the communication mode of ordinary node in the set of described important node and described bunch;
Second communication mode establishment step is set up the communication mode between important node and mobile node.
3. wireless transducer network energy saving safety routing method according to claim 1 is characterized in that described rate controlling step comprises the steps:
Detect step, detect the areas of congestion in the described wireless sensor network;
Controlled step according to detected described areas of congestion, is carried out speed control.
4. wireless transducer network energy saving safety routing method according to claim 1 is characterized in that, described network security controlled step comprises the expansion encrypting step, and described expansion encrypting step comprises:
Link information bag receiving step, described important node receive the link information bag that described mobile node sends;
Challenge information generates step, generates challenge information according to described link information bag;
Confirm step, the described challenge information that generates is sent to described mobile node and wait acknowledge;
Institute's encrypting step, state the affirmation information that important node receives described mobile node after, encrypt with the data of mobile node transmission.
5. the wireless transducer network energy saving safety route system based on mobile node is characterized in that, comprising:
The communication rule is set up module, is used for determining the important node of described wireless sensor network, sets up the rule of communicating by letter of described important node and described mobile node;
Rate control module is used for according to described communication rule described mobile node being carried out speed control;
The network security control module is used for described wireless sensor network is carried out the control of network security.
6. wireless transducer network energy saving safety route system according to claim 5 is characterized in that, described communication rule is set up module and comprised:
Election step unit is used to elect important node, the set that makes up bunch, the node of described important node for carrying out direct communication with mobile node;
First communication mode is set up the unit, is used to set up the communication mode of ordinary node in the set of described important node and described bunch;
The second communication mode is set up the unit, is used to set up the communication mode between important node and mobile node.
7. wireless transducer network energy saving safety route system according to claim 5 is characterized in that described rate control module comprises:
Detecting unit is used for detecting the areas of congestion of described wireless sensor network;
Control unit is used for carrying out speed control according to detected described areas of congestion.
8. wireless transducer network energy saving safety route system according to claim 5 is characterized in that, described network security control module comprises expanding encrypts submodule, and described expansion is encrypted submodule and comprised:
Link information bag receiving element is used for described important node and receives the link information bag that described mobile node sends;
The challenge information generation unit is used for generating challenge information according to described link information bag;
Confirmation unit, the described challenge information that is used for generating sends to described mobile node and wait acknowledge;
Institute's ciphering unit, be used to state the affirmation information that important node receives described mobile node after, encrypt with the data of mobile node transmission.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010105173437A CN101977376B (en) | 2010-10-18 | 2010-10-18 | Mobile node-based wireless sensor network energy-saving secure routing method and system thereof |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010105173437A CN101977376B (en) | 2010-10-18 | 2010-10-18 | Mobile node-based wireless sensor network energy-saving secure routing method and system thereof |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101977376A true CN101977376A (en) | 2011-02-16 |
| CN101977376B CN101977376B (en) | 2013-10-23 |
Family
ID=43577216
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010105173437A Expired - Fee Related CN101977376B (en) | 2010-10-18 | 2010-10-18 | Mobile node-based wireless sensor network energy-saving secure routing method and system thereof |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101977376B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103152792A (en) * | 2013-03-28 | 2013-06-12 | 东南大学 | Mobile data collecting method based on rail assistance in wireless sensor network |
| CN103491596A (en) * | 2013-09-29 | 2014-01-01 | 天公（山东）信息科技有限公司 | Micro-power wireless communication method |
| CN103686924A (en) * | 2014-01-02 | 2014-03-26 | 北京航空航天大学 | Oriented diffusion routing protocol based on returned time delay in wireless sensor network |
| CN107172681A (en) * | 2017-05-15 | 2017-09-15 | 常州工学院 | A kind of mobile node dispatching method of nearest neighbor algorithm using optimization |
| CN108834174A (en) * | 2018-07-20 | 2018-11-16 | 东北电力大学 | Wireless sensor network clustering formula Routing Protocol cross-layer optimizing method based on congestion control |
| CN109041001A (en) * | 2018-08-04 | 2018-12-18 | 浙江农林大学 | The method of prolonging wireless sensor network life cycle in city integrated piping lane |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101452079A (en) * | 2008-12-26 | 2009-06-10 | 东南大学 | Nuclear monitoring system and method based on confounding sensor network |
| CN101567835A (en) * | 2008-03-20 | 2009-10-28 | 中科院嘉兴中心微***所分中心 | Layering routing method based on geographical position message in wireless sensor network |
-
2010
- 2010-10-18 CN CN2010105173437A patent/CN101977376B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101567835A (en) * | 2008-03-20 | 2009-10-28 | 中科院嘉兴中心微***所分中心 | Layering routing method based on geographical position message in wireless sensor network |
| CN101452079A (en) * | 2008-12-26 | 2009-06-10 | 东南大学 | Nuclear monitoring system and method based on confounding sensor network |
Non-Patent Citations (1)
| Title |
|---|
| ARUN A. SOMASUNDARA: "Controllably Mobile Infrastructure for Low Energy Embedded Networks", 《IEEE TRANSACTIONS ON MOBILE COMPUTING》 * |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103152792A (en) * | 2013-03-28 | 2013-06-12 | 东南大学 | Mobile data collecting method based on rail assistance in wireless sensor network |
| CN103152792B (en) * | 2013-03-28 | 2016-05-04 | 东南大学 | In wireless sensor network based on the auxiliary mobile data collection method of track |
| CN103491596A (en) * | 2013-09-29 | 2014-01-01 | 天公（山东）信息科技有限公司 | Micro-power wireless communication method |
| CN103686924A (en) * | 2014-01-02 | 2014-03-26 | 北京航空航天大学 | Oriented diffusion routing protocol based on returned time delay in wireless sensor network |
| CN107172681A (en) * | 2017-05-15 | 2017-09-15 | 常州工学院 | A kind of mobile node dispatching method of nearest neighbor algorithm using optimization |
| CN108834174A (en) * | 2018-07-20 | 2018-11-16 | 东北电力大学 | Wireless sensor network clustering formula Routing Protocol cross-layer optimizing method based on congestion control |
| CN108834174B (en) * | 2018-07-20 | 2021-04-27 | 东北电力大学 | Congestion control-based wireless sensor network clustering type routing protocol cross-layer optimization method |
| CN109041001A (en) * | 2018-08-04 | 2018-12-18 | 浙江农林大学 | The method of prolonging wireless sensor network life cycle in city integrated piping lane |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101977376B (en) | 2013-10-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Won et al. | Certificateless cryptographic protocols for efficient drone-based smart city applications | |
| Lu et al. | Teamphone: Networking smartphones for disaster recovery | |
| CN101977376B (en) | Mobile node-based wireless sensor network energy-saving secure routing method and system thereof | |
| US8516252B2 (en) | Method and apparatus for authenticating a sensor node in a sensor network | |
| Lai et al. | Secure group communications in vehicular networks: A software-defined network-enabled architecture and solution | |
| Kumar et al. | An enhanced energy efficient routing protocol for VANET using special cross over in genetic algorithm | |
| CN101610452A (en) | A kind of sensor network is differentiated the fusion method with key management mechanism | |
| Ferdous et al. | Trust-based cluster head selection algorithm for mobile ad hoc networks | |
| CN101741566B (en) | Method for entity authentication based on secret sharing encryption | |
| CN105959921A (en) | Network controller, node equipment and grid network system with network controller and node equipment | |
| CN113626781B (en) | Block chain efficient authentication method based on trusted group | |
| CN102131193A (en) | Secure routing method for converged network of wireless sensor network and computer network | |
| Lai et al. | SEGM: A secure group management framework in integrated VANET-cellular networks | |
| KR102119586B1 (en) | Systems and methods for relaying data over communication networks | |
| WO2012094879A1 (en) | Key sharing method and system for machine type communication (mtc) server | |
| WO2014183535A1 (en) | Method and system for secure transmission of small data of mtc device group | |
| Shahzad et al. | An efficient MAC scheme in wireless sensor network with energy harvesting (EHWSN) for cloud based applications | |
| CN105611600A (en) | QoE (Quality of Experience) requirement oriented secure routing method for Internet of Things | |
| Mezghani et al. | Improving network lifetime with mobile LEACH protocol for Wireless Sensors Network | |
| Rajesh et al. | A systematic review of congestion control in ad hoc network | |
| Yoo et al. | SERA: a secure energy reliability aware data gathering for sensor networks | |
| Muthusenthil et al. | Shrp-secure hybrid routing protocol over hierarchical wireless sensor networks | |
| Yuan et al. | Location-aided and secure routing protocol for heterogeneous multi-hop wireless networks | |
| Bawage et al. | Energy efficient Secured Routing model for wireless sensor networks | |
| Sorribes et al. | A spontaneous wireless ad hoc trusted neighbor network creation protocol |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20131023 Termination date: 20141018 |
|
| EXPY | Termination of patent right or utility model |