CN105656691A - Marking method based on unequal probabilities during log and migration trace source tracking in wireless sensor network - Google Patents
Marking method based on unequal probabilities during log and migration trace source tracking in wireless sensor network Download PDFInfo
- Publication number
- CN105656691A CN105656691A CN201610140395.4A CN201610140395A CN105656691A CN 105656691 A CN105656691 A CN 105656691A CN 201610140395 A CN201610140395 A CN 201610140395A CN 105656691 A CN105656691 A CN 105656691A
- Authority
- CN
- China
- Prior art keywords
- node
- base station
- jumping
- marking
- probability
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/06—Management of faults, events, alarms or notifications
- H04L41/069—Management of faults, events, alarms or notifications using logs of notifications; Post-processing of notifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/14—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic
- H04L63/1441—Countermeasures against malicious traffic
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/02—Arrangements for optimising operational condition
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a marking method based on the unequal probabilities during log and migration trace source tracking in a wireless sensor network. According to the method, the unequal marking probabilities are adopted for nodes different distances away from base stations in the wireless sensor network adopting a log and migration trace source tracking strategy; lower marking probabilities are adopted for the nodes of near base station regions, and higher marking probabilities are adopted for the nodes of far base station regions. The marking probabilities of the nodes of the far base station regions are further improved based on existing strategies, the probability that the nodes are marked and the total marking amount of a system can be increased, and accordingly the safety performance of trace source tracking can be improved. The storage capacity of the nodes is not needed to be increased based on increase of the marking probabilities, and the service life of the network is not influenced.
Description
Technical field
The invention belongs to wireless network secure field, particularly in a kind of wireless sensor network based on daily record and the unequal probability labeling method migrated in tracing.
Background technology
Wireless sensor network is by the substantial amounts of wireless network consisted of in the way of self-organizing and multi-hop with the sensor node communicated multi-hop wireless link each other, industry monitoring can be applied to widely, agricultural, civilian, environmental monitoring, battlefield, ocean, the various special environment such as fire with in application, it is believed that be one of following Key technology of important internet of things. The safety problem of wireless sensor network is the research topic that a class is important. Wherein tracing problem is a kind of important mechanisms ensureing safety in wireless sensor network, and its research has great importance.
Tracing is a kind of important mechanisms ensureing wireless sensor network security. Its principle is in the process that packet transmits toward base station, by the packet plus the identification number information of routing node, namely label information. Afterwards if it occur that attack, then system by the path of the vertical packet process of the information reconstruction of these labellings, can may thereby determine that possible malicious node. In packet marking method, the identification number information of oneself is added in packet (being called flag data bag) by each node that the method started most is on packet routed path. The deficiency of this method is as packet and carries out to the route of base station, and the length of packet is more and more longer, and when reaching before base station, the length of packet reaches greatest length. And the energy of sensor network interior joint is extremely limited, and generally can not recharge. And nearly base station area exists hot zone region, thus more increase the weight of the energy expenditure of network, accelerate the death in advance of network. This method has been carried out improvement and has proposed a kind of probabilistic packet marking method for IP network by research subsequently. The improvement of probabilistic packet marking method is each node packet with certain probabilistic packet marking process, such that it is able to reduce the length of packet. In the probabilistic packet marking method that existing document proposes, the packet of each process is carry out labelling with equal probability by each node, and claiming this method is equiprobability labeling method.
A kind of daily record of having researched and proposed subsequently combines the method migrated, and in this approach, the data volume undertaken according to the wireless biography nearly base-station node of device network is many with labelled amount, and the memory space of remote base station area node has a large amount of remaining situation with energy. When the labelled amount of nearly base-station node daily record is more, then labelled amount is moved to remote base station area, so namely make use of the dump energy of remote base-station node and memory space. Alleviate again the memory space inadequate of nearly base station area, decrease the labelled amount that nearly base station area needs to transmit. But in the method, the node of remote base station area yet suffers from substantial amounts of dump energy and memory space is not utilized, there is a degree of waste.
Summary of the invention
The invention provides in a kind of wireless sensor network based on daily record and the unequal probability labeling method migrated in tracing, by the marking probability of node near base station is adopted and the same tag probability of strategy in the past, improve the marking probability of remote base station area node, the marking probability making whole network node increases, total labelled amount increases, make full use of energy and the space of remote base-station node, thus the time needed for decreasing tracing.
Based on daily record and the unequal probability labeling method migrated in tracing in a kind of wireless sensor network, in the wireless sensor network adopting daily record and migration tracing strategy, the node at distance different distance place, base station adopts the marking probability not waited: the node of nearly base station area adopts relatively low marking probability, and the node in remote base station area adopts higher marking probability; And wireless sensor network is divided into three regions, hot-zone, relief area and rich region respectively;
Described hot-zone refers to the region at the node place that distance base station is 1 jumping, and described relief area is distance base station is the region at the 2-4 node place jumped, and described rich region refers to that the node in wireless network sensor is not in the node region of hot-zone Yu relief area;
It is positioned at after the node of relief area receives the packet with label information, label information is stored on node, if the residual memory space of node is less than predetermined space, label information is reversely moved to the node of remote base station stores.
The node �� at described distance different distance place, base stationiThe marking probability not waited is adopted to set according to below equation:
Wherein, �� is the node initial markers probability set in wireless network, and i represents the jumping figure of nodal distance base station, and the marking probability that distance base station jumping figure is the node of i is ��i; N represents the jumping figure of the farthest node in distance base station in wireless network; �� represents the number of maximum mark amount allowing in packet to carry.
In described nearly base station area, distance base station jumping figure is that flag information day is aimed at buffer area by the 2-4 node jumped in regional extent, when buffer space is inadequate, the flag information of node migrates to the node in energy affluence region, is had on the node of flag information being arranged in buffer area storage by migration information record simultaneously.
In advance flag information is stored in relief area, reduce and send the data packet length to base station, if between buffer empty not, then move to farther place, but the node of original preservation label information has the identification number migrating the label information walked, thus base station to these nodes inquire that who has these label informations time, node can know present label information whether occur migrate and move to which node.
Migrating in the process of flag information at node, node is according to the migration jumping figure m set, and the node arrived after jumping to the opposite direction route m of data route, for the memory node of flag information and migration information.
Described migration jumping figure m value is 5.
Routed path as shown in Figure 1In. The labelling principle of foundation the inventive method, the marking probability that the rich Area Node employing of remote base station is high, thus in FIG, nodeAdopt high marking probability, such as 1, namely each packet through oneself is carried out labelling by these nodes. Thus, from nodeThe packet sent is through nodeAfter, arrive nodeTime, the length of its tag field is 3. When label information length of field reaches ��=3, just carry out daily record, by label information daily record to nodeOn, work as nodeWhen the label information amount of daily record is more, nodeJust adopt the method migrated, by nodeThe information transfer of daily record is to the node of farther base stationOn, as shown in Figure 1. And for node; these nodes belong to relief area; thus the data volume that undertakes of these nodes is far above the data volume of rich Area Node; for reducing the data volume that these nodes undertake; thus in the method for the invention; the node in this region is adopted less marking probability, such that it is able to reduce the data volume that node undertakes. NodeBelong to hot zone region, be the node that in whole network, energy expenditure is maximum and required memory capacity is maximum, thus to improve network life with reduce node required for memory capacity, it is most important that reduce nodeThe data volume undertaken and memory capacity. For reducing nodeThe data volume undertaken, when route, packet is through relief area, and by all daily records of all of label information, (or moving to rich region, the opposite direction route m along route jumps, and is then stored on this node by label information. If reverse jumping figure is less than m jumps the edge of network of arriving, just storage is to that last node. ) in relief area, so that the labelled amount arriving hot zone region reduces to minimum, thus being substantially reduced energy expenditure and the storage demand of hot-zone node, it is possible to while network performance is greatly improved, keep the ability of significantly high tracking malicious source node.
Beneficial effect
The invention provides in a kind of wireless sensor network based on daily record and the unequal probability labeling method migrated in tracing, the method is by the wireless sensor network adopting daily record and migration tracing strategy, the node at distance different distance place, base station adopts the marking probability not waited: the node of nearly base station area adopts relatively low marking probability, and the node in remote base station area adopts higher marking probability; The basis of strategy in the past is improved the marking probability of remote base station area node further, such that it is able to increase the probability that node is labeled, increases total labelled amount of system, such that it is able to improve the security performance of tracing. Increasing on the basis of marking probability, it is not necessary to increase the memory capacity of node, without the life-span affecting network.
The method have the advantage that, specific as follows:
(1) have employed unequal probability labeling method first, tracing strategy than ever is had and better resists attacking ability.
Higher marking probability is adopted in remote base station area, such that it is able to the more routing iinformation of labelling, so that being obtained in that more label information when victim Node is under attack, such that it is able to determine assailant position within the less time, can namely have higher safety. But the energy expenditure that the probability only improving labelling can cause node increases, thus in methods described herein, only adopt higher marking probability in remote base station area, and in remote base station area, its memory capacity all compares many with dump energy, even if thus adopt higher marking probability, without infringement network life, and the flag information that higher marking probability obtains can carry out daily record and migration earlier in remote base station area, such that it is able to make full use of dump energy and the memory space of remote base station area. And in nearly base station area, we gradually reduce marking probability, and during to hot zone region, the energy expenditure of node is not higher than conventional fair marking probability. Thus, namely improve safety, do not reduce again network life.
(2) have employed the principle of daily record nearby and labelling, it is possible to strategy is more balanced with the memory space utilizing node fully than ever, storage between polices node than ever is also more fair.
In conventional tracing strategy study, nearly base station area node needs to store substantial amounts of information. because in homogeneous network, the memory capacity of node needs to dispose by maximum storage capacity, so that the memory capacity in non-thermal region region remains and wastes. thus, different important from the past research one of the method for the invention are in addition to adopt outside unequal probability labeling method, additionally use the method that flag information moves to remote base station area. in the method for the invention, the region of more remote base station, marking probability is more big, thus can be carried out daily record and migration when having only to shorter jumping figure, thus can make use of the principle of daily record nearby and migration. namely in the region of remote base station, the dump energy of node is more many with space, thus the method for the invention makes full use of this point, higher marking probability is adopted in remote base station area, thus can make full use of energy and memory space daily record nearby and the migration of remote base station area, when migrating, it it is all short-range migration, avoid the migration of distance, thus the energy saved, change in research in the past or the memory space of remote base station area node is not fully utilized, or need when utilizing to migrate longer distance thus the deficiency of lot of energy, so that the utilization of internodal memory space is studied more balanced and abundant than ever.
Accompanying drawing explanation
Fig. 1 is the node-routing schematic diagram of application the method for the invention;
Fig. 2 is the marking probability of distinct methods lower node;
The labelled amount that the tracing method that Fig. 3 is basic receives with equiprobability method lower node, sends and migrate;
Fig. 4 is the labelled amount that equiprobability method receives with the inventive method lower node, sends and migrate;
Fig. 5 sends under Different Strategies to measure with the total labelling received;
Fig. 6 is the different total labelled amounts sending and storing under radius;
Fig. 7 is total labelled amount of storage under heterogeneous networks radius;
Fig. 8 is the different network lifes sent under radius;
Fig. 9 is memory space needed for network zones of different node.
Detailed description of the invention
Below in conjunction with drawings and Examples, the present invention is described further.
Based on daily record and the unequal probability labeling method migrated in tracing in a kind of wireless sensor network, in the wireless sensor network adopting daily record and migration tracing strategy, the node at distance different distance place, base station adopts the marking probability not waited: the node of nearly base station area adopts relatively low marking probability, and the node in remote base station area adopts higher marking probability; And wireless sensor network is divided into three regions, hot-zone, relief area and rich region respectively;
Described hot-zone refers to the region at the node place that distance base station is 1 jumping, and described relief area is distance base station is the region at the 2-4 node place jumped, and described rich region refers to that the node in wireless network sensor is not in the node region of hot-zone Yu relief area;
It is positioned at after the node of relief area receives the packet with label information, label information is stored on node, if the residual memory space of node is less than predetermined space, label information is reversely moved to the node of remote base station stores.
The node �� at described distance different distance place, base stationiThe marking probability not waited is adopted to set according to below equation:
Wherein, �� is the node initial markers probability set in wireless network, and i represents the jumping figure of nodal distance base station, and the marking probability that distance base station jumping figure is the node of i is ��i;N represents the jumping figure of the farthest node in distance base station in wireless network; �� represents the number of maximum mark amount allowing in packet to carry.
In described nearly base station area, distance base station jumping figure is that flag information day is aimed at buffer area by the 2-4 node jumped in regional extent, when buffer space is inadequate, the flag information of node migrates to the node in energy affluence region, is had on the node of flag information being arranged in buffer area storage by migration information record simultaneously.
In advance flag information is stored in relief area, reduce and send the data packet length to base station, if between buffer empty not, then move to farther place, but the node of original preservation label information has the identification number migrating the label information walked, thus base station to these nodes inquire that who has these label informations time, node can know present label information whether occur migrate and move to which node.
Migrating in the process of flag information at node, node is according to the migration jumping figure m set, and the node arrived after jumping to the opposite direction route m of data route, for the memory node of flag information and migration information.
Routed path as shown in Figure 1In. The labelling principle of foundation the inventive method, the marking probability that the rich Area Node employing of remote base station is high, thus in FIG, nodeAdopt high marking probability, such as 1, namely each packet through oneself is carried out labelling by these nodes. Thus, from nodeThe packet sent is through nodeAfter, arrive nodeTime, the length of its tag field is 3. When label information length of field reaches ��=3, just carry out daily record, by label information daily record to nodeOn, work as nodeWhen the label information amount of daily record is more, nodeJust adopt the method migrated, by nodeThe information transfer of daily record is to the node of farther base stationOn, as shown in Figure 1. And for node; these nodes belong to relief area; thus the data volume that undertakes of these nodes is far above the data volume of rich Area Node; for reducing the data volume that these nodes undertake; thus in the method for the invention; the node in this region is adopted less marking probability, such that it is able to reduce the data volume that node undertakes. NodeBelong to hot zone region, be the node that in whole network, energy expenditure is maximum and required memory capacity is maximum, thus to improve network life with reduce node required for memory capacity, it is most important that reduce nodeThe data volume undertaken and memory capacity. For reducing nodeThe data volume undertaken, when route, packet is through relief area, and by all daily records of all of label information, (or moving to rich region, the opposite direction route m along route jumps, and is then stored on this node by label information. If reverse jumping figure is less than m jumps the edge of network of arriving, just storage is to that last node. ) in relief area, so that the labelled amount arriving hot zone region reduces to minimum, thus being substantially reduced energy expenditure and the storage demand of hot-zone node, it is possible to while network performance is greatly improved, keep the ability of significantly high tracking malicious source node.
Fig. 2 gives the marking probability of distinct methods lower node. As can be seen from the figure, under equiprobability labeling method, the marking probability of all nodes is equal. And in the methods of the invention, nodal distance base station is more remote, its marking probability is more high. By increasing marking probability, thus the label information of storage is more in network, thus utilizing tracing to improve network security.Again owing to the inventive method adopts the method migrated, and only increase the marking probability of remote base station area node, thus not reducing network life.
What Fig. 3 and Fig. 4 provided is basic tracing method, under equiprobability method, and the labelled amount that the inventive method lower node receives, sends and migrate. Basic tracing method refers to and adopts the marking probability identical with equiprobability method, but the method not adopting migration. And system probabilistic method and the inventive method are not both, the probability of the inventive method labelling is different.
It can be seen that the basic nearly base-station node of tracing method receives maximum with the labelled amount sent, the energy expenditure thus resulting in hot spot region node is excessive and affects network life, thus its performance is worst. And the method for the present invention and the difference adopting equiprobability method are, the inventive method adopts higher marking probability in remote base station area, and adopt the marking probability equal with equiprobability in nearly base station area, thus the labelled amount that nearly base station area node undertakes in the methods of the invention is identical with equiprobability method, and in remote base station area, the labelled amount that node undertakes is more than equiprobability labeling method, illustrate that the method for the present invention increases labelled amount, thus improve the ability of strategy tracing, namely improve safety.
What Fig. 5 provided is total labelled amount, it is seen that: the maximum mark of basic tracing method is maximum. And the maximum mark amount of the inventive method is minimum, describes the inventive method, in network life method, there is superiority. And the inventive method makes full use of energy and the memory space of remote base station area node, thus the labelled amount undertaken at remote base station area node is more than the method having been proposed that.
Fig. 6 gives and sends, in node difference, the total labelled amount that can store in radius lower network, from fig. 6 it can be seen that the label information amount that basic tracing method and equiprobability labeling method store in a network is only 0.043 times to 0.418 times of the labelled amount of the inventive method storage. This illustrates that the inventive method can make full use of the residual memory space more label information of storage of non-hot spot region, so that node is time under attack, can quickly obtain and can determine attack node fully, say, that greatly reducing convergence time.
Fig. 7 gives under heterogeneous networks radius, the contrast situation of total labelled amount that the inventive method stores with equiprobability labeling method with basic tracing method. From Fig. 7 it is concluded that: the labelled amount that the inventive method stores under heterogeneous networks radius is 1.00 times to 3.11 times of basic tracing method and equiprobability labeling method.
Fig. 8 gives and sends under radius r in difference, the network life contrast situation of different tracing methods, as can be seen from the figure: under different transmission radius r, the inventive method and equiprobability labeling method, its network life difference is also little, thus it is concluded that go out, the inventive method can't affect the network of network life-span. But improve network life from analysis above is known. And basic tracing method is secret has labelled amount to be all sent to base station, thus its network life is much smaller than other method.
Fig. 9 gives the memory space needed for network zones of different node. The inventive method is the memory space of the node in balanced network relative to basic tracing method, although the maximum storage energy in basic tracing method does not have the inventive method and equiprobability method is high, but give base station owing to the data volume of its all of node all sends, thus can cause that life-span of network is much smaller than other method, our known the inventive method and the contrast of equiprobability method, known, the inventive method does not increase the maximum storage capacity of network, and the memory space in well balanced network node.
Claims (5)
1. based on daily record and the unequal probability labeling method migrated in tracing in a wireless sensor network, it is characterized in that, in the wireless sensor network adopting daily record and migration tracing strategy, the node at distance different distance place, base station adopts the marking probability not waited: the node of nearly base station area adopts relatively low marking probability, and the node in remote base station area adopts higher marking probability; And wireless sensor network is divided into three regions, hot-zone, relief area and rich region respectively;
Described hot-zone refers to the region at the node place that distance base station is 1 jumping, and described relief area is distance base station is the region at the 2-4 node place jumped, and described rich region refers to that the node in wireless network sensor is not in the node region of hot-zone Yu relief area;
It is positioned at after the node of relief area receives the packet with label information, label information is stored on node, if the residual memory space of node is less than predetermined space, label information is reversely moved to the node of remote base station stores.
2. method according to claim 1, it is characterised in that the node �� at described distance different distance place, base stationiThe marking probability not waited is adopted to set according to below equation:
Wherein, �� is the node initial markers probability set in wireless network, and i represents the jumping figure of nodal distance base station, and the marking probability that distance base station jumping figure is the node of i is ��i; N represents the jumping figure of the farthest node in distance base station in wireless network; �� represents the number of maximum mark amount allowing in packet to carry.
3. method according to claim 1 and 2, it is characterized in that, in described nearly base station area, distance base station jumping figure is that flag information day is aimed at buffer area by the 2-4 node jumped in regional extent, when buffer space is inadequate, the flag information of node migrates to the node in energy affluence region, is had on the node of flag information being arranged in buffer area storage by migration information record simultaneously.
4. method according to claim 3, it is characterised in that migrate in the process of flag information at node, node is according to the migration jumping figure m set, and the node arrived after jumping to the opposite direction route m of data route, for the memory node of flag information and migration information.
5. method according to claim 4, it is characterised in that described migration jumping figure m value is 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610140395.4A CN105656691B (en) | 2016-03-11 | 2016-03-11 | Based on daily record and the unequal probability labeling method in migration tracing in wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610140395.4A CN105656691B (en) | 2016-03-11 | 2016-03-11 | Based on daily record and the unequal probability labeling method in migration tracing in wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105656691A true CN105656691A (en) | 2016-06-08 |
| CN105656691B CN105656691B (en) | 2018-11-09 |
Family
ID=56493570
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610140395.4A Expired - Fee Related CN105656691B (en) | 2016-03-11 | 2016-03-11 | Based on daily record and the unequal probability labeling method in migration tracing in wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105656691B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101873258A (en) * | 2010-06-07 | 2010-10-27 | 清华大学 | Probabilistic packet marking and attack source tracing method, system and device |
| US20110299425A1 (en) * | 2009-02-12 | 2011-12-08 | Praveen Kumar | Addressing and Routing Scheme for Distributed Systems |
| CN103973801A (en) * | 2014-05-19 | 2014-08-06 | 中南大学 | Wireless sensor network source tracing and tracking method |
-
2016
- 2016-03-11 CN CN201610140395.4A patent/CN105656691B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110299425A1 (en) * | 2009-02-12 | 2011-12-08 | Praveen Kumar | Addressing and Routing Scheme for Distributed Systems |
| CN101873258A (en) * | 2010-06-07 | 2010-10-27 | 清华大学 | Probabilistic packet marking and attack source tracing method, system and device |
| CN103973801A (en) * | 2014-05-19 | 2014-08-06 | 中南大学 | Wireless sensor network source tracing and tracking method |
Non-Patent Citations (1)
| Title |
|---|
| 田红成 等: "一种快速且安全的概率标记追溯技术", 《清华大学学报(自然科学版)》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105656691B (en) | 2018-11-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103973801A (en) | Wireless sensor network source tracing and tracking method | |
| CN101784067B (en) | Method for quickly sensing meeting nodes based on cross-layer triggering in opportunistic network | |
| CN102088666B (en) | Multicast route method of mobile self-organizing network system | |
| CN104661275A (en) | Method for transmitting data in opportunity network | |
| CN101800692A (en) | Wireless sensor network geographic location route addressing method based on Hull tree | |
| WO2021184373A1 (en) | Electronic tag positioning method, electronic device, and electronic tag | |
| CN108769926A (en) | Car networking method for secret protection based on quorum-sensing system layer and car networking framework | |
| De Castro et al. | A dynamic hierarchical VANET architecture for named data networking applications | |
| CN103379575A (en) | Vehicular network routing protocol utilizing intersection static nodes to assist with data forwarding | |
| CN107040471A (en) | Directional perception retransmission method, apparatus and system based on the NDN network architectures | |
| CN101159966A (en) | Peer-to-peer network topology matching method in mobile environment | |
| CN105282813A (en) | Routing method, device and system used in vehicle-mounted network environment | |
| CN104468290B (en) | A kind of network-building method and device of chain communication network | |
| CN105391631A (en) | Enhanced stable routing protocol for vehicle Ad Hoc network | |
| CN105656691A (en) | Marking method based on unequal probabilities during log and migration trace source tracking in wireless sensor network | |
| CN105682098B (en) | A kind of probabilistic packet marking tracing method based on trust in wireless sensor network | |
| US20130159357A1 (en) | Method of context aware data-centric storage for wireless sensor networks | |
| CN102333314A (en) | Routing method of wireless ad hoc network | |
| CN101437303B (en) | Method for routing and forwarding Ad Hoc network data packet | |
| CN104980493A (en) | Discovery service method based on active buffer algorithm | |
| Wadday et al. | Performance of Maximum distance on-demand routing protocol based on random variable velocity | |
| CN103686919B (en) | A kind of self adaptation WSN routing algorithm inspired based on biology | |
| CN105792212A (en) | Fair probability marking based trace tracking method in wireless sensor network | |
| Jung et al. | VRSense: Validity region sensitive query processing strategies for static and mobile point-of-interests in MANETs | |
| CN103312535B (en) | Community-based layering opportunistic network and method for building up thereof and communication means |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| 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: 20181109 Termination date: 20200311 |