CN105656691B - Based on daily record and the unequal probability labeling method in migration tracing in wireless sensor network - Google Patents
Based on daily record and the unequal probability labeling method in migration tracing in wireless sensor network Download PDFInfo
- Publication number
- CN105656691B CN105656691B CN201610140395.4A CN201610140395A CN105656691B CN 105656691 B CN105656691 B CN 105656691B CN 201610140395 A CN201610140395 A CN 201610140395A CN 105656691 B CN105656691 B CN 105656691B
- Authority
- CN
- China
- Prior art keywords
- node
- base station
- probability
- migration
- network
- 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.)
- Expired - Fee Related
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 in a kind of wireless sensor network based on daily record with migration tracing in unequal probability labeling method, this method is by the way that in the wireless sensor network using daily record with migration tracing strategy, the node at the different distance of base station is using not equal marking probability：The node of nearly base station area uses relatively low marking probability, and the node in remote base station area uses higher marking probability；The marking probability that remote base station area node is further increased on the basis of previous strategy increases total labelled amount of system, so as to improve the security performance of tracing so as to increase the labeled probability of node.On the basis of increasing marking probability, the memory capacity of node need not be increased, the service life of network will not be influenced.
Description
Technical field
The invention belongs to wireless network secure field, more particularly to based on daily record and migration in a kind of wireless sensor network
Unequal probability labeling method in tracing.
Background technology
Wireless sensor network be by it is a large amount of each other by multi-hop wireless link and the sensor node of communication with
The wireless network that the mode of self-organizing and multi-hop is constituted can widely apply to industry monitoring, agricultural, civilian, environmental monitoring,
Battlefield, ocean, the various particular surroundings such as fire with application in, it is considered to be the Key technology of following important internet of things
One of.The safety problem of wireless sensor network is a kind of important research topic.Wherein tracing problem is wireless sensing
Ensure that a kind of safe important mechanisms, research have great importance in device network.
Tracing is a kind of important mechanisms for ensureing wireless sensor network security.Its principle is in data packet toward base
It stands during transmitting, by adding the identification number information of routing node, that is, label information in the packet.Afterwards such as
The attack that fruit occurs, then system can stand the path that data packet is passed through by the information reconstruction of these labels, so as to
With the possible malicious node of determination.In packet marking method, the method that most starts is each of on data packet routed path
The identification number information of oneself is all added in data packet and (is known as flag data packet) by node.The deficiency of this method is with data
It wraps the routing to base station to carry out, the length of data packet is increasingly longer, and when reaching before base station, the length of data packet, which reaches, most to be greatly enhanced
Degree.And the energy of sensor network interior joint is extremely limited, and cannot generally recharge.And there are hot-zone areas for nearly base station area
Domain, thus the energy expenditure of network has more been aggravated, accelerate the death in advance of network.Subsequent research carries out this method
It improves and proposes a kind of probabilistic packet marking method for IP network.The improvement of probabilistic packet marking method is each node with certain probability
The data packet passed through is marked, so as to reduce the length of data packet.In the probabilistic packet marking method that existing literature proposes, each
The data packet that node passes through each marks with equal probability, and this method is referred to as equiprobability labeling method.
Subsequent has researched and proposed a kind of method that daily record combines migration, in this approach, device network is passed according to wireless
The data volume and labelled amount that nearly base-station node undertakes are more, and the memory space of remote base station area node have with energy it is largely remaining
Situation.When the labelled amount of nearly base-station node daily record is more, then labelled amount is moved into remote base station area, is utilized so remote
The dump energy and memory space of base-station node.The memory space inadequate for alleviating nearly base station area again reduces nearly base station area
Domain needs the labelled amount transmitted.However in this method, the node of remote base station area still has a large amount of dump energy and storage
Space is not utilized, and there are a degree of wastes.
Invention content
The present invention provides in a kind of wireless sensor network based on daily record with migration tracing in unequal probability mark
Note method improves remote base station area by the marking probability to node near base station using the same tag probability with previous strategy
The marking probability of domain node so that the marking probability of whole network node increases, and total labelled amount increases, and remote base station is made full use of to save
The energy of point and space, to reduce the time needed for tracing.
Based on daily record and the unequal probability labeling method in migration tracing in a kind of wireless sensor network, using
Daily record is with the wireless sensor network of migration tracing strategy, and the node at the different distance of base station is using the mark not waited
Remember probability：The node of nearly base station area uses relatively low marking probability, and the node in remote base station area uses higher marking probability；And
Wireless sensor network is divided into three regions, respectively hot-zone, buffering area and rich region；
The hot-zone refers to the region where being 1 node jumped apart from base station, and it is that 2-4 is jumped that the buffering area, which is apart from base station,
Node where region, the affluence region refers to node in wireless network sensor not in the node of hot-zone and buffering area
Region；
After the node of buffering area receives the data packet with label information, label information is stored onto node,
It is deposited on the node that label information is reversely moved to remote base station if when the residual memory space of node is less than scheduled space
Storage.
The node τ at the different distance of base stationiIt is set according to following formula using not equal marking probability：
Wherein, τ is the node initial markers probability set in wireless network, and i indicates the hop count of nodal distance base station, distance
The marking probability for the node that base station hop count is i is τi；N indicates the hop count apart from the farthest node in base station in wireless network；υ indicates number
According to the number for the maximum mark amount for allowing to carry in packet.
The node in regional extent is jumped in the nearly base station area apart from base station hop count for 2-4 to aim at delaying by flag information day
Area is deposited, when buffer space is inadequate, the flag information of node is migrated to the node in energy affluence region, while by migration information
It is recorded in and is stored on the node of flag information in buffer area.
Flag information is stored in buffering area in advance, the data packet length for being sent to base station is reduced, if buffer space
Not enough, then farther place is moved to, but the original node for preserving label information has the mark for the label information that migration is walked
Number, thus when base station inquires that who has these label informations to these nodes, node can know whether present label information is sent out
It is raw which node migrated and move to.
During node migrates flag information, node is according to the migration hop count m of setting, the negative direction being route to data
The node that routing m is reached after jumping is the memory node of flag information and migration information.
The migration hop count m values are 5.
Routed path as shown in Figure 1In.Side according to the present invention
The label principle of method uses high marking probability to the rich Area Node of remote base station, thus in Fig. 1, nodeIt adopts
With high marking probability, such as 1, i.e., these nodes by each data packet of oneself to being marked.Thus, from nodeThe data packet sent out is by nodeAfterwards, node is reachedWhen, the length of tag field is 3.When label information domain is long
When degree reaches υ=3, with regard to carrying out daily record, by label information daily record to nodeOn, work as nodeThe label information amount of daily record is more
When, nodeWith regard to the method using migration, by nodeNode of the information transfer of daily record to farther base stationOn, such as Fig. 1 institutes
Show.And for nodeFor, these nodes belong to buffering area, thus the data volume that these nodes undertake is far above affluence
The data volume of Area Node, to reduce the data volume that these nodes undertake, thus in the method for the invention, to the section in this region
Point uses smaller marking probability, so as to reduce the data volume that node undertakes.NodeBelong to hot zone region, is entire net
Energy expenditure maximum and the maximum node of required memory capacity in network, thus to improve network life and be deposited with required for reduction node
Store up capacity, it is most important that reduce nodeThe data volume and memory capacity undertaken.To reduce nodeThe data volume undertaken,
When routing, when data packet passes through buffering area, all daily records of all label informations (or are moved into rich region, along routing
Negative direction route m and jumps, and then stores label information onto this node.If reversed hop count, which is less than m, jumps network of arriving
If edge, just on that node of storage to the end.) in buffering area, so that the labelled amount for reaching hot zone region subtracts
It is few to arrive minimum, to substantially reduce energy expenditure and the storage demand of hot-zone node, network performance can be greatly improved
Meanwhile keeping the ability of very high tracking malice source node.
Advantageous effect
The present invention provides in a kind of wireless sensor network based on daily record with migration tracing in unequal probability mark
Note method, this method by using daily record with migrate tracing strategy wireless sensor network in, apart from base station difference
Node at distance uses not equal marking probability：The node of nearly base station area uses relatively low marking probability, in remote base station area
Node use higher marking probability；The marking probability of remote base station area node is further increased on the basis of previous strategy,
So as to increase the labeled probability of node, increase total labelled amount of system, so as to improve the safety of tracing
Energy.On the basis of increasing marking probability, the memory capacity of node need not be increased, the service life of network will not be influenced.
Advantage possessed by this method, it is specific as follows：
(1) use unequal probability labeling method for the first time, compare previous tracing strategy have preferably resist attack
Ability.
Remote base station area use higher marking probability, so as to mark more routing iinformations, can make by
Evil node can obtain more label informations when under attack, so as to determine attacker position within the smaller time,
Namely there is higher safety.But the probability for only improving label can cause the energy expenditure of node to increase, thus at this
In literary the method, higher marking probability only is used in remote base station area, and in remote base station area, memory capacity and residue
Energy is all relatively more, thus even if using higher marking probability, will not damage network life, and higher marking probability obtains
The flag information arrived can be earlier remote base station area carry out daily record with migration, so as to make full use of remote base station area
Dump energy and memory space.And in nearly base station area, we gradually reduce marking probability, and when to hot zone region, node
Energy expenditure is not higher than previous fair marking probability.To improve safety, and without reducing network life.
(2) principle of daily record nearby and label is used, more balanced than previous strategy can utilize node with sufficient
Memory space, the storage compared between previous polices node is also more fair.
In previous tracing strategy study, nearly base station area node needs to store a large amount of information because in isomorphism
In network, the memory capacity of node needs to dispose by maximum storage capacity, so that the memory capacity of non-thermal region is surplus
It is remaining and waste.Thus, the method for the invention and previous research one it is important be not both in addition to using unequal probability label side
Outside method, the method that remote base station area is moved to flag information is additionally used.In the method for the invention, the area of remoter base station
Domain, marking probability is bigger, thus only needs to can be carried out daily record and migration when shorter hop count, can thus be utilized just
Recently the principle of will and migration.I.e. in the region of remote base station, the dump energy of node and space are more, thus institute of the present invention
The method of stating makes full use of this point, uses higher marking probability in remote base station area, can thus make full use of remote base station
The energy in region and memory space daily record nearby and migration, when being migrated, are all short-range migrations, avoid long range
Migration, to the energy saved, otherwise the memory space for changing remote base station area node in research in the past cannot be fully sharp
With, or need to migrate longer distance when utilization to consume the deficiency of big energy, so that the storage between node is empty
Between using studied than in the past it is more balanced with it is abundant.
Description of the drawings
Fig. 1 is the node-routing schematic diagram using the method for the invention；
Fig. 2 is the marking probability of distinct methods lower node；
Fig. 3 is the labelled amount of basic tracing method and the reception of equiprobability method lower node, transmission and migration；
Fig. 4 is the labelled amount of equiprobability method and the reception of the method for the present invention lower node, transmission and migration；
Fig. 5 is the total label measurement sent and received under Different Strategies；
Fig. 6 is the total labelled amount stored under different transmission radiuses；
Fig. 7 is the total labelled amount stored under heterogeneous networks radius；
Fig. 8 is the network life under different transmission radiuses；
Fig. 9 is memory space needed for network different zones node.
Specific implementation mode
Below in conjunction with drawings and examples, the present invention is described further.
Based on daily record and the unequal probability labeling method in migration tracing in a kind of wireless sensor network, using
Daily record is with the wireless sensor network of migration tracing strategy, and the node at the different distance of base station is using the mark not waited
Remember probability：The node of nearly base station area uses relatively low marking probability, and the node in remote base station area uses higher marking probability；And
Wireless sensor network is divided into three regions, respectively hot-zone, buffering area and rich region；
The hot-zone refers to the region where being 1 node jumped apart from base station, and it is that 2-4 is jumped that the buffering area, which is apart from base station,
Node where region, the affluence region refers to node in wireless network sensor not in the node of hot-zone and buffering area
Region；
After the node of buffering area receives the data packet with label information, label information is stored onto node,
It is deposited on the node that label information is reversely moved to remote base station if when the residual memory space of node is less than scheduled space
Storage.
The node τ at the different distance of base stationiIt is set according to following formula using not equal marking probability：
Wherein, τ is the node initial markers probability set in wireless network, and i indicates the hop count of nodal distance base station, distance
The marking probability for the node that base station hop count is i is τi；N indicates the hop count apart from the farthest node in base station in wireless network；υ indicates number
According to the number for the maximum mark amount for allowing to carry in packet.
The node in regional extent is jumped in the nearly base station area apart from base station hop count for 2-4 to aim at delaying by flag information day
Area is deposited, when buffer space is inadequate, the flag information of node is migrated to the node in energy affluence region, while by migration information
It is recorded in and is stored on the node of flag information in buffer area.
Flag information is stored in buffering area in advance, the data packet length for being sent to base station is reduced, if buffer space
Not enough, then farther place is moved to, but the original node for preserving label information has the mark for the label information that migration is walked
Number, thus when base station inquires that who has these label informations to these nodes, node can know whether present label information is sent out
It is raw which node migrated and move to.
During node migrates flag information, node is according to the migration hop count m of setting, the negative direction being route to data
The node that routing m is reached after jumping is the memory node of flag information and migration information.
Routed path as shown in Figure 1In.Side according to the present invention
The label principle of method uses high marking probability to the rich Area Node of remote base station, thus in Fig. 1, nodeIt adopts
With high marking probability, such as 1, i.e., these nodes by each data packet of oneself to being marked.Thus, from nodeThe data packet sent out is by nodeAfterwards, node is reachedWhen, the length of tag field is 3.When label information domain is long
When degree reaches υ=3, with regard to carrying out daily record, by label information daily record to nodeOn, work as nodeThe label information amount of daily record is more
When, nodeWith regard to the method using migration, by nodeNode of the information transfer of daily record to farther base stationOn, such as Fig. 1 institutes
Show.And for nodeFor, these nodes belong to buffering area, thus the data volume that these nodes undertake is far above affluence
The data volume of Area Node, to reduce the data volume that these nodes undertake, thus in the method for the invention, to the section in this region
Point uses smaller marking probability, so as to reduce the data volume that node undertakes.NodeBelong to hot zone region, is entire net
Energy expenditure maximum and the maximum node of required memory capacity in network, thus to improve network life and be deposited with required for reduction node
Store up capacity, it is most important that reduce nodeThe data volume and memory capacity undertaken.To reduce nodeThe data volume undertaken,
When routing, when data packet passes through buffering area, all daily records of all label informations (or are moved into rich region, along routing
Negative direction route m and jumps, and then stores label information onto this node.If reversed hop count, which is less than m, jumps network of arriving
If edge, just on that node of storage to the end.) in buffering area, so that the labelled amount for reaching hot zone region subtracts
It is few to arrive minimum, to substantially reduce energy expenditure and the storage demand of hot-zone node, network performance can be greatly improved
Meanwhile keeping the ability of very high tracking malice source node.
Fig. 2 gives the marking probability of distinct methods lower node.As can be seen from the figure under equiprobability labeling method, institute
There is the marking probability of node equal.And in the methods of the invention, nodal distance base station is remoter, and marking probability is higher.Pass through increasing
Big marking probability utilizes tracing to improve network security to which the label information stored in network is more to have.And by
In the method for the present invention using the method for migration, and only increase the marking probability of remote base station area node, to which there is no reduce net
The network service life.
What Fig. 3 and Fig. 4 was provided is basic tracing method, under equiprobability method, the method for the present invention lower node receives,
Send the labelled amount with migration.Basic tracing method refers to using marking probability identical with equiprobability method, still
Not using the method for migration.And system probabilistic method is not both with the method for the present invention, the probability of the method for the present invention label is different.
It can be seen from the figure that the labelled amount that the nearly base-station node of basic tracing method is received and sent is maximum, because
And cause that the energy expenditure of hot spot region node is excessive and influences network life, thus its performance is worst.And the method for the present invention
With using the difference of equiprobability method it is that the method for the present invention uses higher marking probability in remote base station area, and in nearly base station
Region uses the marking probability equal with equiprobability, to labelled amount that in the methods of the invention nearly base station area node undertakes with
Equiprobability method is identical, and in remote base station area, the labelled amount that node undertakes is more than equiprobability labeling method, illustrates the present invention's
Method increases labelled amount, to improve the ability of tactful tracing, that is, improves safety.
What Fig. 5 was provided is total labelled amount, it is seen that：The maximum mark of basic tracing method is maximum.And it is of the invention
The maximum mark amount of method is minimum, illustrates that the method for the present invention has superiority in network life method.And the method for the present invention is filled
Divide the energy and memory space using remote base station area node, the labelled amount to be undertaken in remote base station area node is more than
The method of proposition.
Fig. 6 gives sends the total labelled amount that can be stored in radius lower network in node difference, can from Fig. 6
Go out, the label information amount that basic tracing method stores in a network with equiprobability labeling method is only that the method for the present invention is deposited
0.043 times to 0.418 times of the labelled amount of storage.This illustrates that the method for the present invention can make full use of the remaining storage of Non-hotspot region
Space stores more label informations, so that node when under attack, can be obtained quickly and adequately be can determine
Attack node, that is to say, that greatly reduced convergence time.
Fig. 7 gives under heterogeneous networks radius, and the method for the present invention is marked with basic tracing method and equiprobability
The comparative situation of total labelled amount of method storage.From Fig. 7 it is concluded that：The method of the present invention is under heterogeneous networks radius
The labelled amount of storage is 1.00 times to 3.11 times of basic tracing method and equiprobability labeling method.
Fig. 8 gives at different transmission radius r, the network life comparative situation of different tracing methods, from figure
It can be seen that：At different transmission radius r, the method for the present invention and equiprobability labeling method, network life difference is simultaneously little,
To which it is concluded that going out, the method for the present invention can't influence the network life of network.But it is improved from known to the analysis of front
Network life.And basic tracing method is secret has labelled amount to be transmitted to base station, thus its network life is much smaller than it
Its method.
Fig. 9 gives the memory space needed for network different zones node.The method of the present invention is chased after relative to basic tracing to the source
The memory space of node for track method in balanced network, although the maximum storage energy in basic tracing method
There is no the method for the present invention and equiprobability method height, but since the data volume of its all node has all been sent to base station, from
And the service life of network can be caused to be much smaller than other methods, and the method for the present invention known to us and the comparison of equiprobability method, it is known that, this hair
There is no the maximum storage capacities for increasing network for bright method, and the memory space in balanced well network node.
Claims (3)
1. being existed based on daily record and the unequal probability labeling method in migration tracing, feature in a kind of wireless sensor network
In in the wireless sensor network using daily record with migration tracing strategy, the node at the different distance of base station is adopted
With not equal marking probability：The node of nearly base station area uses relatively low marking probability, the node use in remote base station area higher
Marking probability；And wireless sensor network is divided into three regions, respectively hot-zone, buffering area and rich region；
The hot-zone refer to apart from base station be 1 jump node where region, the buffering area be apart from base station be 2-4 jump section
Region where point, the affluence region refer to node in wireless network sensor not where the node of hot-zone and buffering area
Region；
After the node of buffering area receives the data packet with label information, label information is stored onto node, if
Then label information is reversely moved to when the residual memory space of node is less than scheduled space and is stored on the node of remote base station；
The node τ at the different distance of base stationiIt is set according to following formula using not equal marking probability：
Wherein, τ is the node initial markers probability set in wireless network, and i indicates the hop count of nodal distance base station, apart from base station
The marking probability for the node that hop count is i is τi；N indicates the hop count apart from the farthest node in base station in wireless network；υ indicates data packet
The number of the middle maximum mark amount for allowing to carry；
The node in regional extent is jumped in the nearly base station area apart from base station hop count for 2-4 to aim at buffering by flag information day
Area, when buffer space is inadequate, the flag information of node is migrated to the node in energy affluence region, while migration information being remembered
Record is being stored in buffering area on the node of flag information.
2. according to the method described in claim 1, it is characterized in that, node migrate flag information during, node according to
The migration hop count m of setting, the node that the negative direction routing m being route to data is reached after jumping, is flag information and migration information
Memory node.
3. according to the method described in claim 2, it is characterized in that, the migration hop count m values are 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 CN105656691A (en) | 2016-06-08 |
| CN105656691B true 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 (2)
| 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 |
| CN103973801A (en) * | 2014-05-19 | 2014-08-06 | 中南大学 | Wireless sensor network source tracing and tracking method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2010100655A2 (en) * | 2009-02-12 | 2010-09-10 | Kumar Praveen | Addressing and routing scheme for distributed systems |
-
2016
- 2016-03-11 CN CN201610140395.4A patent/CN105656691B/en not_active Expired - Fee Related
Patent Citations (2)
| 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 |
| CN103973801A (en) * | 2014-05-19 | 2014-08-06 | 中南大学 | Wireless sensor network source tracing and tracking method |
Non-Patent Citations (1)
| Title |
|---|
| 一种快速且安全的概率标记追溯技术;田红成 等;《清华大学学报(自然科学版)》;20110430;542-547 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105656691A (en) | 2016-06-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103973801B (en) | Wireless sensor network source tracing and tracking method | |
| Hail et al. | Caching in named data networking for the wireless internet of things | |
| TW200935953A (en) | Communication handover management | |
| ES2498991T3 (en) | Planning a dynamic broadcast channel | |
| CN102595504B (en) | Dynamic multi-path OLSR (Optimized Link State Routing) routing method based on link congestion degree | |
| RU2011150508A (en) | MEMORY OPTIMIZATION METHOD FOR STORING ROUTING DATA | |
| WO2008022272A3 (en) | System and method of wirelessly communicating with mobile devices | |
| WO2009061591A4 (en) | Method for providing fast secure handoff in a wireless mesh network | |
| WO2008042489A3 (en) | Priority handoff based on battery charge level | |
| WO2007145899A3 (en) | Mobile universal communication gateway | |
| WO2010126261A3 (en) | System and method for managing femto base stations and a femto zone in a wireless communication network | |
| CN104135436A (en) | Self-organizing network route selecting method for vehicles | |
| CN103501209B (en) | Heterogeneous multi-network cooperative transmission single service flow division method and equipment | |
| CN102685249A (en) | Group identification (GID) system with global ubiquitous communication function and terminal identity recognition method thereof | |
| CN107124470A (en) | Car networking framework and network layer communication method based on name data network | |
| CN109995840A (en) | CDN method of data synchronization, device, equipment and computer storage medium | |
| Rahman et al. | Consistent data collection and assortment in the progression of continuous objects in IoT | |
| CN105656691B (en) | Based on daily record and the unequal probability labeling method in migration tracing in wireless sensor network | |
| CN109996208A (en) | Vacuum tube high-speed flight train train-ground communication method based on C-RAN framework | |
| CN110941682A (en) | Efficient and safe decentralized data link service and storage mode | |
| CN103971424A (en) | Vehicle driving recording technology based on cloud computing | |
| WO2011083445A3 (en) | Memory management using packet segmenting and forwarding | |
| CN105682098B (en) | A kind of probabilistic packet marking tracing method based on trust in wireless sensor network | |
| Kaur et al. | Energy efficient two level distributed clustering scheme to prolong stability period of wireless sensor network | |
| Cao et al. | Replication routing for Delay Tolerant Networking: A hybrid between utility and geographic approach |
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 |