CN103973801A - Wireless sensor network source tracing and tracking method - Google Patents
Wireless sensor network source tracing and tracking method Download PDFInfo
- Publication number
- CN103973801A CN103973801A CN201410210496.5A CN201410210496A CN103973801A CN 103973801 A CN103973801 A CN 103973801A CN 201410210496 A CN201410210496 A CN 201410210496A CN 103973801 A CN103973801 A CN 103973801A
- Authority
- CN
- China
- Prior art keywords
- node
- packet
- daily record
- base station
- ring
- 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
Abstract
The invention discloses a wireless sensor network source tracing and tracking method. The method comprises the following steps that (1) the first ring performing logging or migrating on all tabbed information in the direction from a far base station to a base station is set as the first mitigation ring; (2) before routing data packages arrive at the first mitigation ring, all nodes sign the received data packages, logging is performed when the number of the signed data packages reaches a preset number, and the data packages are reversely migrated to the nodes of the area of the far base station to be stored if the residual memory space of the logging nodes is smaller than a preset value; (3) after the data packages arrive at the first mitigation ring, and all nodes perform logging on the received data packages. According to the method, by directly reducing energy consumption and storage requirements of a hot spot region, the service life of a network can be directly prolonged, the storage requirements of the nodes are reduced, and therefore the network performance is improved.
Description
Technical field
The present invention relates to wireless sensor network field, be specifically related to a kind of wireless sensor network tracing method.
Background technology
The main policies that is applicable at present wireless sensor network tracing has two kinds, and one is the method that adopts packet marking (marking), and one is the method based on daily record (logging).
Adopting the method for packet marking (marking) is in the process of data route, intermediate node is added in the path of route process after packet, if thereby make to obtain after malicious data bag, routing information in extraction packet just can be known the routed path (routed path information partly or completely) of packet, if obtaining malicious data bag number acquires a certain degree, just can learn the source node information of malice completely, thereby can successfully carry out malicious node tracing.The advantage of adopting is in this way that agreement is simple, to the almost not requirement of the memory space of node, and easily implements: each node is only attached to the routed path information of oneself in packet and both can.Not enough place is if the node of mark is more, can cause so the length of packet constantly to increase, thereby node could send after even needing that packet is divided into multi-disc, has not only increased the conflict of route, and has seriously reduced the life-span of sensor network.Therefore, for improving network life, generally can in the whole process of packet route, all not carry out mark (data packet length can be very large like this, has a strong impact on network life), only have at most in routed path but only define
kvertex ticks, and the not method of mark of other node.Although the energy consumption that this has reduced node, just needs systematic collection to arrive more packet, carries out comprehensive analysis and can determine malicious source node, has increased convergence time.In addition, much study the methods of finding to adopt marks, if limit the maximum marks of each packet quilt k time, the probability of the vertex ticks of nearly base station will be high, and far the probability of base station is less.This is because in such strategy, each node can decide oneself whether to carry out flag data bag with certain probability, and packet is labeled after k time, node below will will replace the information of mark, thereby the marking probability of nearly base-station node is high, and base-station node marking probability far away is low.
The main points of the method based on daily record (logging) are the routing informations of nodes records packet, like this, in the time carrying out tracing, rebuild the attack path of malicious node by obtaining routing information in daily record.In the tracing method based on daily record, label information ratio in packet is less, node is mainly to forward necessary packet, and the routing information of route is to be kept in node by the form of daily record, only have when being injured node perceived to there being attack, or need to carry out tracing operation time, just send out inquiry request to needed node, the information of these log store is just sent to base station, thereby can greatly reduce the data volume that sends to base station, therefore it is higher that the advantage of this mode is network life, overcome to a certain extent in labelling strategies, node needs a large amount of energy to cause for transmitting the label information of packet the shortcoming that network life is not high.The deficiency that daily record strategy exists is that node needs larger memory capacity with storage mark information, and specifically the probability of nearly base station area logging is far more than base station area far away, thereby needs a large amount of memory spaces.
Document Traceback in wireless sensor networks with packet marking and logging(Frontiers of Computer Science in China, 5 (3) (2011) 308-315) strategy that is called CPMLT (combined packet mark ing and logging scheme for traceback) that adopts mark to combine with daily record proposed.In CPMLT strategy, a packet is at most by k vertex ticks, each node is with certain probabilistic packet marking packet, when after coated k the vertex ticks of data, so next flag node is with regard to this packet of daily record, and log information is used in tracing subsequently, when collecting enough packets, base-station node just can be rebuild by mark and log information the path of whole attack, thereby can position malicious node.Thereby CPMLT strategy is the combination of mark and daily record strategy, be in the memory capacity of node and the compromise of the one of network life.Fig. 1 has described this strategy, packet arrives base station by routed path L → K → J → I → H, in transport process, node L, K, J path label information are in packet, now, the k=3 that packet an is preset vertex ticks, therefore, at this packet of node I daily record, then node H carries out again mark.Although adopt the strategy that this mark combines with daily record to have compromise to a certain degree to memory capacity and communication cost aspect, but in general, still can not change the nearly base station area demand of energy consumption and memory capacity larger, and base station area far away has large remaining unbalanced situation, thereby have influence on these tactful performances.
Summary of the invention
The invention provides and a kind ofly can overcome the serious limited deficiency of sensor network resource, improve the wireless sensor network tracing method of network performance.
For solving the problems of the technologies described above, the present invention by the following technical solutions:
A kind of wireless sensor network tracing method, comprises the steps:
(1) setting from base station far away to base station direction, first ring that all label informations is carried out to daily record or migration slows down ring for first;
(2) packet of route arrive first slow down before ring, each node carries out mark to the packet receiving, after the number of times of packet marking reaches preset times with regard to daily record; If when the residual memory space of daily record node is less than preset value, oppositely moves on the node of base station area far away and store;
(3) slow down after ring when packet reaches first, the packet that each node is docked to carries out daily record.
Wherein, in described step (2), the preset value of daily record node residual memory space is 15%.
Wherein, in step (3), whether each node determines whether migration according to the memory space situation anxiety of node.
Compared with prior art, the present invention adopts the tracing strategy of daily record in conjunction with migration, weakens the energy consumption of hot spot region and the anxiety of memory space, shifts to an earlier date and just all label informations is carried out to daily record or migration approaching before focus.Like this, when packet arrives hot spot region, its data packet length is the shortest, needed memory space minimum.And directly reduce energy consumption and the storage demand of hot spot region, and just can directly improve network life, reduce the storage demand of node, thereby improve network performance.
Brief description of the drawings
Fig. 1 is the tactful schematic diagram that prior art mark combines with daily record.
Fig. 2 is the schematic diagram of embodiment of the present invention wireless sensor network tracing method.
Embodiment
Below in conjunction with the drawings and specific embodiments, the present invention is described in further detail.
Embodiment of the present invention wireless sensor network tracing method adopts daily record in conjunction with migration (logging joint migrating, LM) tracing strategy), comprising the steps: to set from base station far away to base station direction, first ring that all label informations is carried out to daily record or migration slows down ring (first alleviation crown for first, FAC), in arrival, first slows down before ring the packet of route, each node carries out mark to the packet receiving, after the number of times of packet marking reaches preset times with regard to daily record; If when the residual memory space of daily record node is less than a preset value (as 15%), oppositely migration (migrating) is stored to the node of base station area far away; Slow down after ring when packet reaches first, the packet that each node is docked to carries out daily record.
As shown in Figure 2, routed path is G → F → E → D → C → B → A, and G → F → E → D → C → B slows down ring for first, and B is first last node that slows down ring.The number of times of default daily record is 5 times, and the residual memory space ratio of migration is 15%.Therefore, all the packet receiving is carried out to mark at node F, E, D, C, in Node B, packet is carried out to daily record.At this moment, the residual memory space of node is less than 15%, therefore label information is oppositely moved to the upper storage of node F of base station area far away.The packet that Node B node A is below docked to carries out daily record.In the present embodiment, daily record node overlaps (being Node B) with last node that first slows down ring, and in the time that Node B is carried out daily record for the first time, residual memory space is less than 15%, therefore move.In other embodiments, when daily record for the first time, residual memory space is greater than 15%, does not at this moment need migration.Until the residual memory space of the daily record node in downstream while being less than 15%, just oppositely moves.Also may not overlap with last node that first slows down ring by daily record node, if node E, C are daily record node, node E, C need calculate residual memory space, judge whether migration.
Adopt the method for daily record in conjunction with migration, only by No. ID of packet with store being stored on node own for No. ID of this packet, and real label information is routed on real memory node and is preserved along inverse direction.In the time that victim is under attack, by the label information of the upstream node request malicious data bag to route, thereby can rebuild the attack path that obtains assailant like this, to determine the route (G → F → E → D → C → B → A as shown in Figure 2) of malicious node.Node B is first node that slows down ring (FAC), and its residual memory space is fewer, and hot spot region node A memory space and energy are all more nervous.Thereby, when the packet of mark is routed to Node B, the information of mark is oppositely moved on the node F that residue memory capacity is larger.And in Node B, only store No. ID and the node number (being node F) of storage mark information of this packet.More much smaller than the required memory space of storage mark information owing to only storing packet and node No. ID, and node F has abundant memory space, thereby can, in the situation that individual node filling is less, store more substantial label information from whole network.And on the other hand, after the migration of Node B, the data packet length of route greatly reduces, thereby the data volume that the node A of hot spot region is born greatly reduces, thereby can reach and reduce node storage capacity, store a large amount of label informations in order to tracing, can improve again the object of network life simultaneously.
In other embodiments, can also increase heavy migration strategy, slow down after ring (FAC) when packet reaches first, whether each node determines whether migration according to the memory space situation anxiety of node.In the time that the memory space of nearly base station area node is higher, institute's canned data is carried out to the 2nd migration, move to the node storage of base station area far away.And the information of a nearly base station area node address that storage mark information moves to and packet ID.Reduce the required memory space of node thereby reach, greatly increase the label information of LM tracing policy store, thereby improve internet security.And being base station area far away, the basis that this heavy migration strategy can be realized also remains a large amount of energy and memory space, thereby heavily migration strategy can reduce the required memory capacity of node under the prerequisite of not damaging network life, and increase the label information that strategy can be preserved.
Adopt the advantage of LM strategy to have following 3 points.
(1) LM strategy has higher network life.
Because the hot spot region of sensor network has determined the life-span of network.Thereby LM strategy, in the time that route data packets arrives hot spot region soon, in advance by the daily record of flag data bag or move on the node of base station area far away, thereby can reduce in a large number the amount of information that the focus of nearly base station need to forward, thereby directly improve network life.Theoretical analysis result according to us shows, LM strategy is with respect to data markers method and log approach, and its network life improves respectively 33% and 21%.
(2) the required memory capacity of LM strategy is less, and between node, storage is balanced, is a kind of fair memory mechanism.
In tracing policy-related (noun) research in the past, nearly base station area node need to be stored a large amount of information.Because in homogeneous network, the memory capacity of node need to be disposed by maximum storage capacity, thereby makes the memory capacity of non-hot spot region remain and waste.Thereby, LM strategy with studied important not being both in the past: in the time that the residue memory capacity of node is nervous, this node storage is not real label information, but No. ID and the node ID of storage mark information of storing this label information bag are stored and really need the label information of storage oppositely to send on the node that on source node source direction, a certain residue memory capacity is larger again.Because these two of storages need the memory capacity of much less than the label information of storage route No. ID, thereby just can greatly reduce the required memory capacity of the nervous node of hot spot region memory capacity.Because the residue storage of non-hot spot region is easily all more with energy, thereby oppositely move label information and do not affect network life, but can make the storage of whole network node more balanced, reduce the required memory capacity of node, thus reduction network cost.With respect to log approach, in the case of storage label information identical, the required memory space of its node is only 44.3 ~ 66.6% of log approach.
(3) LM strategy has higher fail safe, can within the time still less, determine that the source of malicious data bag goes out.Account for whole network and reach dump energy and the memory capacity of 90% non-focus Area Node because LM strategy takes full advantage of, thereby can the more label information of daily record.According to calculating: LM strategy is with respect to mark in conjunction with daily record strategy, and the label information of the former daily record is 1.71 times to 3.17 times of the latter.Because fully label information can help victim to be only subjected to that a small amount of attack just can be collected more label information and definite attack source, so can reduce its convergence time.
The above is only the preferred embodiment of the present invention, and protection scope of the present invention is also not only confined to above-described embodiment.For those skilled in the art, also should be considered as protection scope of the present invention not departing from the improvement and the conversion that obtain under the technology of the present invention design prerequisite.
Claims (3)
1. a wireless sensor network tracing method, is characterized in that, comprises the steps:
(1) setting from base station far away to base station direction, first ring that all label informations is carried out to daily record or migration slows down ring for first;
(2) packet of route arrive first slow down before ring, each node carries out mark to the packet receiving, after the number of times of packet marking reaches preset times with regard to daily record; If when the residual memory space of daily record node is less than preset value, oppositely moves on the node of base station area far away and store;
(3) slow down after ring when packet reaches first, the packet that each node is docked to carries out daily record.
2. wireless sensor network tracing method according to claim 1, is characterized in that: in described step (2), the preset value of daily record node residual memory space is 15%.
3. wireless sensor network tracing method according to claim 1, is characterized in that: in step (3), whether each node determines whether migration according to the memory space situation anxiety of node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410210496.5A CN103973801B (en) | 2014-05-19 | 2014-05-19 | Wireless sensor network source tracing and tracking method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410210496.5A CN103973801B (en) | 2014-05-19 | 2014-05-19 | Wireless sensor network source tracing and tracking method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103973801A true CN103973801A (en) | 2014-08-06 |
| CN103973801B CN103973801B (en) | 2017-04-12 |
Family
ID=51242834
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410210496.5A Expired - Fee Related CN103973801B (en) | 2014-05-19 | 2014-05-19 | Wireless sensor network source tracing and tracking method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103973801B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105338570A (en) * | 2015-10-08 | 2016-02-17 | 山东大学（威海） | Wireless sensor network data traceablility method based on pseudorandom sequence |
| CN105656691A (en) * | 2016-03-11 | 2016-06-08 | 中南大学 | Marking method based on unequal probabilities during log and migration trace source tracking in wireless sensor network |
| CN105682098A (en) * | 2016-02-24 | 2016-06-15 | 中南大学 | Trust-based probability marking and source tracing method in wireless sensor network |
| CN105792212A (en) * | 2016-02-29 | 2016-07-20 | 中南大学 | Fair probability marking based trace tracking method in wireless sensor network |
| CN107087287A (en) * | 2017-05-23 | 2017-08-22 | 山东大学 | Based on the orthogonal WSN node energies monitoring method and system traced to the source |
| CN107222880A (en) * | 2017-05-23 | 2017-09-29 | 山东大学 | Method and system are found based on the orthogonal WSN abnormal nodes traced to the source |
| CN113347585A (en) * | 2021-04-27 | 2021-09-03 | 滴翠智能科技(上海)有限公司 | Remote wireless communication module based on radio communication |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2001059584A1 (en) * | 2000-02-10 | 2001-08-16 | University Of Washington | Practical network support for ip traceback |
| US20060085861A1 (en) * | 2004-03-12 | 2006-04-20 | Andrey Belenky | Tracing slaves from reflectors with deterministic packet marking |
| CN103249177A (en) * | 2012-08-13 | 2013-08-14 | 常州大学 | Method of tracking DDoS attack in wireless sensor network |
-
2014
- 2014-05-19 CN CN201410210496.5A patent/CN103973801B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2001059584A1 (en) * | 2000-02-10 | 2001-08-16 | University Of Washington | Practical network support for ip traceback |
| US20060085861A1 (en) * | 2004-03-12 | 2006-04-20 | Andrey Belenky | Tracing slaves from reflectors with deterministic packet marking |
| CN103249177A (en) * | 2012-08-13 | 2013-08-14 | 常州大学 | Method of tracking DDoS attack in wireless sensor network |
Non-Patent Citations (1)
| Title |
|---|
| 杨坤等: "关于无线传感器网络中溯源方法的分析", 《计算机技术与发展》 * |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105338570B (en) * | 2015-10-08 | 2018-10-26 | 山东大学（威海） | Wireless sensor network data source tracing method based on pseudo-random sequence |
| CN105338570A (en) * | 2015-10-08 | 2016-02-17 | 山东大学（威海） | Wireless sensor network data traceablility method based on pseudorandom sequence |
| CN105682098B (en) * | 2016-02-24 | 2018-11-30 | 中南大学 | A kind of probabilistic packet marking tracing method based on trust in wireless sensor network |
| CN105682098A (en) * | 2016-02-24 | 2016-06-15 | 中南大学 | Trust-based probability marking and source tracing method in wireless sensor network |
| CN105792212A (en) * | 2016-02-29 | 2016-07-20 | 中南大学 | Fair probability marking based trace tracking method in wireless sensor network |
| CN105792212B (en) * | 2016-02-29 | 2019-01-04 | 中南大学 | A kind of tracing method based on fair probabilistic packet marking in wireless sensor network |
| CN105656691B (en) * | 2016-03-11 | 2018-11-09 | 中南大学 | Based on daily record and the unequal probability labeling method in migration tracing in wireless sensor network |
| CN105656691A (en) * | 2016-03-11 | 2016-06-08 | 中南大学 | Marking method based on unequal probabilities during log and migration trace source tracking in wireless sensor network |
| CN107222880A (en) * | 2017-05-23 | 2017-09-29 | 山东大学 | Method and system are found based on the orthogonal WSN abnormal nodes traced to the source |
| CN107087287A (en) * | 2017-05-23 | 2017-08-22 | 山东大学 | Based on the orthogonal WSN node energies monitoring method and system traced to the source |
| CN107087287B (en) * | 2017-05-23 | 2020-04-17 | 山东大学 | WSN node energy monitoring method and system based on orthogonal tracing |
| CN107222880B (en) * | 2017-05-23 | 2020-04-17 | 山东大学 | WSN abnormal node discovery method and system based on orthogonal tracing |
| CN113347585A (en) * | 2021-04-27 | 2021-09-03 | 滴翠智能科技(上海)有限公司 | Remote wireless communication module based on radio communication |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103973801B (en) | 2017-04-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103973801A (en) | Wireless sensor network source tracing and tracking method | |
| CN101588293B (en) | Full IP communication interconnection system of Ad Hoc network and IPv6 network | |
| CN102447618B (en) | Route switching method in a kind of LISP network and device thereof | |
| CN106161610A (en) | A kind of method and system of distributed storage | |
| CN102752322B (en) | Method for storing and querying distributed data in internet of things | |
| CN107070786A (en) | The processing method of data source movement, the method E-Packeted and its device | |
| CN103379029B (en) | A kind of method of the routing forwarding of content network, apparatus and system | |
| CN102362470B (en) | Path setting server and path setting method | |
| CN109005562A (en) | Transmit the methods, devices and systems of data | |
| CN102025606B (en) | Data transmission method and system | |
| CN102035738B (en) | Method and device for acquiring routing information | |
| CN101127714B (en) | A route management method and device for wireless mesh network | |
| CN101772193A (en) | Method, system and mobile access gateway for optimizing local routing | |
| CN105072030A (en) | NDN (Named Data Networking) route system based on content clustering, and clustering query method therefor | |
| CN103929782A (en) | Resource leveling multi-path routing method applicable to industrial wireless sensor network | |
| CN104410655A (en) | Named mechanism based storage system and method of distributed network | |
| CN107124470A (en) | Car networking framework and network layer communication method based on name data network | |
| CN104038384A (en) | Tracking and tracing system based on GBF and working method thereof | |
| CN106878072A (en) | A kind of message transmitting method and device | |
| CN106792838A (en) | DTN via node Candidate Set systems of selection | |
| CN103139752B (en) | Transmission channel table amending method and device | |
| CN102123161A (en) | Distributed mobility management method and distributed mobility management system | |
| CN103874160B (en) | Method for routing based on three-dimensional scenic in vehicle self-organizing network | |
| US20200167357A1 (en) | Query enhancement system and method for constructing elastic field based on time delay | |
| CN103117913B (en) | A kind of mac address information notifying method and equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB03 | Change of inventor or designer information |
Inventor after: Zeng Zhiwen Inventor after: He Cheng Inventor before: Liu Anfeng Inventor before: Liu Yuxin Inventor before: He Cheng Inventor before: Liu Xiao |
|
| COR | Change of bibliographic data | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| 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: 20170412 |