CN102158888B - Data forwarding method based on random walk backup and node cooperation - Google Patents
Data forwarding method based on random walk backup and node cooperation Download PDFInfo
- Publication number
- CN102158888B CN102158888B CN 201110129422 CN201110129422A CN102158888B CN 102158888 B CN102158888 B CN 102158888B CN 201110129422 CN201110129422 CN 201110129422 CN 201110129422 A CN201110129422 A CN 201110129422A CN 102158888 B CN102158888 B CN 102158888B
- Authority
- CN
- China
- Prior art keywords
- node
- data
- msg
- packet
- wireless sensor
- 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
Images
Abstract
The invention discloses a data forwarding method based on random walk backup and node cooperation, mainly solving the problems of high cost, low universality and difficult practical application of the traditional survivable technology. Characteristics of communication of a wireless sensor network are fully considered in the method, in a data perceptual stage, nodes needing to execute a data backup strategy are selected, data perceived by the nodes are backed-up through random walk of the data among the nodes, so that the survivability of the network is improved; and in a data transmission stage, the nodes of the sensor broadcast a packet with a data bit zone of 1 in a storage and calculate the data bit zone of the packet in the storage so as to realize cooperative forwarding of the data, reduce additional data transmission quantity caused by data backup and lower average path length of the network. The invention has the characteristics of high survivability, good universality, simplicity for realization and low cost, and can be used for data collection and transmission of a large-scale wireless sensor network.
Description
Technical field
The invention belongs to network communications technology field, relate to data forwarding method, a kind of data forwarding method based on random walk backup and node cooperation specifically, can be used for improving the fault-tolerance of wireless sensor network.
Background technology
Wireless sensor network is the comprehensive intelligent information system that integrates information gathering, communication, information processing, it is a focus of current information area research and exploitation, the collection that can realize data quantizes, processes and merge and transmission, in military and civilian fields such as military surveillance, environmental monitoring, medical monitoring, space exploration, urban traffic control, warehousing managements, has a wide range of applications.In the practical application of wireless sensor network, generally all need to dispose a large amount of wireless sensor nodes, because node often is operated in rugged environment, and usually adopt the battery of finite energy that energy is provided, the energy depletion or be subject to nature and destroy and the situation that part of nodes lost efficacy occurs so wireless sensor network is easy to occur; In addition, to wireless sensor network, purposive destruction also can cause disintegrating of whole network directly or indirectly.Therefore, in the face of the practical application of wireless sensor network, how to save node energy, guarantee the network data transmission reliability, the survivability that improves whole network becomes the major issue of wireless sensor network research.
The current study general for the wireless sensor network survivability is based on redundancy scheme and Complex Networks Theory is carried out.Redundancy scheme is generally by the heavy overlay network of structure k or increases the survivability that via node improves network, thereby increased the expense of network but the increase meeting of redundant node forms many unnecessary communication links in network, thus reduced system performance, affected life-span of network.Complex Networks Theory is generally that the topological structure that has Small-world Characters and a scale-free networks network feature by structure improves Survivabilities of Networks.
The wireless sensor network topology that has at present Small-world Characters is mainly to rely in network add wire communication line or adopt mobile node between node, as data mule, realizes longer range communications between node, reduces the average path of network.But there is following defect in these methods:
(1) wireless sensor network generally goes out in severe operational environment, so the laying of wire communication line and difficult in maintenance;
(2) once Wireline lay to be difficult to its deployment is adjusted, so the scheme of wire communication line is difficult to the fast-changing wireless sensor network of reply topological structure;
(3) validity of the time delay of network and topology depends on the speed of mobile node greatly, but the translational speed of node is far smaller than the propagation velocity of wireless communication signals, therefore adopts the scheme network performance of mobile node not good;
(4) the mobile node cost is generally far away higher than wireless sensor node, and also needs the movement locus of special software control mobile node, so the cost high cost of mobile node method.
Wireless sensor network topology with scale-free networks network characteristic is mainly that the pattern of growth by increasing new node and new link forms the topological structure that node degree has the power-law distribution characteristics, but do not consider limited this restriction of wireless sensor network node communication radius in the increase new link stage, so the method is needed improvement badly in the application of wireless sensor network.
Summary of the invention
The objective of the invention is the deficiency for above-mentioned prior art, a kind of data forwarding method based on random walk backup and node cooperation is proposed, with the laying of avoiding wire link and difficult in maintenance, and the cost of mobile node is high and network delay is large, the communication radius finiteness problem of wireless sensor node, be suitable for the wireless sensor network of practical application request by structure, improve its universality and survivability energy.
Realize that technical thought of the present invention is: in the perception stage of data, data realize the backup between network node according to the random walk strategy; In the transmit stage of data, the mode of taking cooperation to forward between node sends to sink by data, and the characteristics that simultaneously take full advantage of radio communication broadcast reduce the traffic by the redundant data produced in the backup of data perception stage.Implementation step comprises as follows:
(1) in the planar range of S * S, shed at random the wireless sensor node of N isomorphism, build random wireless sensor network, S=200m wherein, 400≤N≤700, and gateway node sink is arranged in to the position of network center;
(2) in the wireless sensor network built, whole nodes in wireless sensor network are by the Data Collection of perception and store in the memory of node, simultaneously, find out all nodes that need the executing data backup policy in wireless sensor network node, and the data that these node perceived are arrived are respectively in the mode of random walk, store in the memory of data node that random walk is passed through and back up;
(3) mode that each node in wireless sensor network takes cooperation to forward the data of collecting in step (2) and backing up converges to gateway node sink:
(3a) select the packet MSG_ID that need to send to gateway node sink, the i.e. packet of Data Labels position MSG_ID_CHECK=1 in each node memory of wireless sensor network;
(3b) in the wireless sensor network, the present node source to gateway node sink transmission data only broadcasts in this node memory the packet MSG_ID that needs transmission;
(3c) node in present node source neighborhood Neighbour, after receiving packet MSG_ID, recalculate the Data Labels position MSG_ID_CHECK_N of each packet in memory separately;
(3d) repeating step (3a), (3b) and (3c) until the node in network all to gateway node sink, sent separately and needed the data that send in memory;
(4) gateway node sink receives the data that each node sends in step (3), and, for the application background of wireless sensor network, the data that receive is made to corresponding processing.
The present invention has advantages of as follows:
(1) the present invention is due to the data by node perceived in wireless sensor network, store into the data random walk in the node memory of process, therefore make data node that random walk pass through only need to obtain the information of interior other wireless sensor nodes of its communication range, so the wireless sensor network that the more applicable node communication of the present invention is limited in scope;
(2) the present invention is by the random walk backup strategy of data, make the node of Backup Data and the distribution of node in wireless sensor network of these data of perception relatively disperse, so the probability of the node simultaneous faults of the node of Backup Data and these data of perception, well below the probability of the node failure of these data of perception, therefore can improve the survivability of network greatly;
(3) the present invention in the wireless senser networking node will be separately convergence in memory during to gateway node sink, utilize the characteristics of radio communication broadcast to recalculate the Data Labels position MSG_ID_CHECK of packet in memory separately, in wireless sensor network, each node is only broadcasted the packet MSG_ID of Data Labels position MSG_ID_CHECK=1 in its memory simultaneously, so can under the prerequisite of the communication overhead do not increased, reduce the transmission quantity by the caused redundant data of data backup;
(4) backup policy due to the random walk of the data data-driven of wireless sensor network node perception has backup in other node memories, therefore when adopting data cooperation forwarding strategy of the present invention, the average path length of network has certain reduction;
(5) method that data backup of the present invention and cooperation forward is under the prerequisite that meets the wireless senser communication feature fully, do not include the conditions such as wired link, mobile node, therefore make method of the present invention can under the prerequisite that does not improve network struction, maintenance, communications cost, improve the survivability of network.
The accompanying drawing explanation:
Fig. 1 is general flow chart of the present invention;
Fig. 2 is based on data random walk backup strategy sub-process figure in the present invention;
Fig. 3 is the transfer of data sub-process figure forwarded based on cooperation in the present invention;
Fig. 4 is that network size of the present invention affects schematic diagram to the network average path length;
Fig. 5 is that random walk Probability p of the present invention affects schematic diagram to the network average path length;
Fig. 6 be the present invention under different forwarding strategies, the data packet number comparison diagram that network sends;
Fig. 7 be the present invention when network size is 400 nodes, the performance chart of Survivabilities of Networks;
Fig. 8 be the present invention when network size is 500 nodes, the performance chart of Survivabilities of Networks;
Fig. 9 be the present invention when network size is 600 nodes, the performance chart of Survivabilities of Networks;
Figure 10 is that the present invention's failure node ratio in network is 0.2 o'clock, the performance chart of Survivabilities of Networks;
Figure 11 is that the present invention's failure node ratio in network is 0.4 o'clock, the performance chart of Survivabilities of Networks;
Figure 12 is that the present invention's failure node ratio in network is 0.6 o'clock, the performance chart of Survivabilities of Networks.
Embodiment:
For making the purpose, technical solutions and advantages of the present invention clearer, below in conjunction with accompanying drawing, the present invention will be further described.
With reference to accompanying drawing 1, performing step of the present invention is as follows:
Step 1., in the planar range of S * S, is shed the wireless sensor node of N isomorphism at random, builds random wireless sensor network, S=200m wherein, and 400≤N≤700, and gateway node sink is arranged in to the position of network center.
(2a) the whole nodes in the wireless sensor network are by the Data Collection of perception and store in the memory of node;
(2b) find out all nodes that need the executing data backup policy in wireless sensor network node, and the data that these node perceived are arrived are respectively in the mode of random walk, store in the memory of data node that random walk is passed through and back up;
With reference to accompanying drawing 2, specifically being implemented as follows of this step:
(2b1) calculate the efficiency function value F (V of each node
i), and the starting point walker of definite random walk:
F(V
i)＝hop
i/hop
max+E
current(i)/E
initial(i)，
Wherein, E
currentand E (i)
initial(i) be respectively node V
idump energy and primary power, hop
ifor node V
ithe jumping figure of distance webs artis sink node, hop
maxmaximum hop count for all nodal distance gateway node sink in network;
The data random walk to the neighborhood Neighbour of present node in, by efficiency function value F (V
i) maximum node is as the starting point walker of next step random walk of data;
(2b2) determine the node set that needs the executing data backup policy: with node V
idump energy and the ratio of primary power as node V
idecision function value C (V
i), by decision function value C (V in wireless sensor network
i) be less than the node V of random walk Probability p
ias the node source that carries out the random walk backup strategy, and the set that these nodes are formed is designated as BACK_NODE, node in the BACK_NODE set is the node that needs the executing data backup policy, if there is not any node in BACK_NODE, be that BACK_NODE is null set, in wireless sensor network, do not exist and need executing data backup policy node;
(2b3) judge whether in the BACK_NODE set be null set, if BACK_NODE is not null set, to the node executing data backup policy in BACK_NODE, be initialization intermediate variable temp=d, walker=source, wherein temp means the residue step number of data walking, the upper limit that d is predefined data duration of random walk, walker means the starting point of each step in data random walk process, source means the present node of executing data backup policy in BACK_NODE, and go to step (2b4), otherwise, the backup procedure of end data;
If (2b4) intermediate variable temp>0, the data that source perceived store in the reservoir of walker as backup, and temp=temp-1 then selects efficiency function F (V in the neighborhood Neighbour of walker
i) be worth next step starting point walker of maximum node as the data random walk, go to step (2b4), if intermediate variable temp=0, deletion of node source in set B ACK_NODE, go to step (2b3).
The mode that each node in step 3. wireless sensor network takes cooperation to forward the data of collecting in step (2) and backing up, converge to gateway node sink.
With reference to accompanying drawing 3, specifically being implemented as follows of this step:
(3a) by the Data Labels position MSG_ID_CHECK that judges packet MSG_ID, whether be 1, select the packet MSG_ID that need to send to gateway node sink in each node memory of wireless sensor network, if the Data Labels position MSG_ID_CHECK=1 of packet MSG_ID, mean does not have node to send packet MSG_ID in the present node source communication range of gateway node sink transmission data, and packet MSG_ID is in present node source memory needs the packet sent to gateway node sink; If the Data Labels position MSG_ID_CHECK=0 of packet MSG_ID mean had node to send packet MSG_ID in present node source communication range, present node source no longer needs to send this packet to gateway node sink;
(3b) judging in network and whether have not the node source that sends data to sink, is to go to step (3c), otherwise finish each node in network by step 2, collect and the convergence of backup to the process of gateway node sink;
(3c) judge in present node source memory whether have the packet MSG_ID need forwarded, i.e. the packet of MSG_ID_CHECK=i, if exist, go to step (3d), if there is no, mark source is for to sink, sending data, and goes to step (3b);
(3d) present node source is broadcasted packet MSG_ID, and makes the Data Labels position MSG_ID_CHECK=0 of packet MSG_ID;
(3e) neighbor node of present node source is after the packet MSG_ID that receives source broadcast, recalculate the Data Labels position MSG_ID CHECK_N of each packet in its memory according to MSG_ID_CHECK_N=MSG_ID XOR MSG_ID_N, go to step (3c).
Effect of the present invention can be further detailed by the simulation experiment result once.
1. simulated conditions
The condition of emulation experiment is as shown in table 1:
Table 1 simulation parameter
| Parameter name | Parameter setting values |
| Target area | 200m×200m |
| |
400，500，600 |
| The node communication radius | 20m |
| |
400 |
| The node primary power | 2J |
| Simulation times | 100 |
| Default random walk Probability p | 0.3 |
| Default duration of |
0 |
| Gateway node Sink coordinate | (100m，100m) |
| The ratio p of failure node in network fail | 0.2，0.4，0.6 |
2. emulation content and the simulation experiment result:
Because the backup policy of the random walk of the data data-driven of wireless sensor network node perception has backup in other node memories, therefore, when adopting data cooperation forwarding strategy of the present invention, the average path length of network has certain reduction.
As can be seen from Figure 4, the network average path length of the wireless sensor network that utilizes the present invention to build decreases, and the average path length of network is along with the increase of network size does not significantly increase, this explanation the present invention is applicable to large-scale wireless senser, so the present invention has higher universality to wireless sensor network.
As can be seen from Figure 5, the Probability p of the random backup of node is larger, and it is larger that the average path length of network reduces, and this also tallies with the actual situation, and Fig. 5 can illustrate reasonability of the present invention.
As can be seen from Figure 6, relatively the situation of d=3 can obtain, the situation that adopts radio communication broadcast characteristics to cooperate in situation about forwarding not adopt cooperation to forward can reduce the traffic of network greatly, and the situation of d=1 does not have significant increase than the traffic ratio of the situation network of d=0.
From Fig. 7, Fig. 8 and Fig. 9, can find out, the wireless sensor network that adopts the present invention to build under different network node inefficacy ratios survivability all significantly higher than not adopting wireless sensor network of the present invention.
From Figure 10, Figure 11 and Figure 12 can find out, the wireless sensor network that adopts the present invention to build under different network sizes survivability all significantly higher than not adopting wireless sensor network of the present invention.
Complex chart 7-Figure 12 knows, the wireless sensor network that adopts the present invention to build is under different network sizes and different failure node ratio, the survivability of network all is better than not adopting network of the present invention, and in the situation of d=1, the survivability of network has just had significant raising, and this has absolutely proved validity of the present invention.
The foregoing is only checking embodiment of the present invention, not in order to limit the present invention, all any modifications of doing, be equal to replacement, improvement etc., within all should being included in protection scope of the present invention under the technology of the present invention thought.
Claims (3)
1. the data forwarding method based on random walk backup and node cooperation, comprise the steps:
(1) in the planar range of S * S, shed at random the wireless sensor node of N isomorphism, build random wireless sensor network, S=200m wherein, 400≤N≤700, and gateway node sink is arranged in to the position of network center;
(2) in the wireless sensor network built, whole nodes in wireless sensor network are by the Data Collection of perception and store in the memory of node, simultaneously, find out all nodes that need the executing data backup policy in wireless sensor network node, and the data that these node perceived are arrived are respectively in the mode of random walk, store in the memory of data node that random walk is passed through and back up;
(2a) calculate the efficiency function value F (V of each node
i), and the starting point walker of definite random walk:
F(V
i)＝hop
i/hop
max+E
current(i)/E
initial(i)，
Wherein, E
currentand E (i)
initial(i) be respectively node V
idump energy and primary power, hop
ifor node V
ithe jumping figure of distance webs artis sink node, hop
maxmaximum hop count for all nodal distance gateway node sink in network;
The data random walk to the neighborhood Neighbour of present node in, by efficiency function value F (V
i) maximum node is as the starting point walker of next step random walk of data;
(2b) determine the node set that needs the executing data backup policy: with node V
idump energy and the ratio of primary power as node V
idecision function value C (V
i), by decision function value C (V in wireless sensor network
i) be less than the node V of random walk Probability p
ias the node source that carries out the random walk backup strategy, and the set that these nodes are formed is designated as BACK_NODE, node in the BACK_NODE set is the node that needs the executing data backup policy, if there is not any node in BACK_NODE, be that BACK_NODE is null set, in wireless sensor network, do not exist and need executing data backup policy node;
(2c) judge whether in the BACK_NODE set be null set, if BACK_NODE is not null set, to the node executing data backup policy in BACK_NODE, be initialization intermediate variable temp=d, walker=source, wherein temp means the residue step number of data walking, the upper limit that d is predefined data duration of random walk, walker means the starting point of each step in data random walk process, source means the present node of executing data backup policy in BACK_NODE, and go to step (2d), otherwise, the backup procedure of end data;
If (2d) intermediate variable temp > 0, the data that source perceived store in the reservoir of walker as backup, temp=temp-1, then select efficiency function F (Vi) and be worth next step starting point walker of maximum node as the data random walk in the neighborhood Neighbour of walker, if intermediate variable temp=0, deletion of node source in set B ACK_NODE, go to step (2c), otherwise go to step (2d);
(3) mode that each node in wireless sensor network takes cooperation to forward the data of collecting in step (2) and backing up converges to gateway node sink:
(3a) select the packet MSG_ID that need to send to gateway node sink, the i.e. packet of Data Labels position MSG_ID_CHECK=1 in each node memory of wireless sensor network;
(3b) in the wireless sensor network, the present node source to gateway node sink transmission data only broadcasts in this node memory the packet MSG_ID that needs transmission;
(3c) node in present node source neighborhood Neighbour, after receiving packet MSG_ID, recalculate the Data Labels position MSG_ID_CHECK_N of each packet in memory separately;
(3d) repeating step (3a), (3b) and (3c) until the node in network all to gateway node sink, sent separately and needed the data that send in memory;
(4) gateway node sink receives the data that each node sends in step (3), and, for the application background of wireless sensor network, the data that receive is made to corresponding processing.
2. data forwarding method as claimed in claim 1, selecting in each node memory of wireless sensor network that wherein step (3a) is related need to be to the packet MSG_ID of gateway node sink transmission, whether Data Labels position MSG_ID_CHECK by judging packet MSG_ID is 1 realization: if the Data Labels position MSG_ID_CHECK=1 of packet MSG_ID, mean does not have node to send packet MSG_ID in the present node source communication range of gateway node sink transmission data, packet MSG_ID is in present node source memory needs the packet sent to gateway node sink, if the Data Labels position MSG_ID_CHECK=0 of packet MSG_ID mean had node to send packet MSG_ID in present node source communication range, present node source no longer needs to send this packet to gateway node sink.
3. data forwarding method as claimed in claim 1, the described Data Labels position MSG_ID_CHECK_N that recalculates each packet in memory separately of step (3c) wherein, after node in present node source neighborhood Neighbour is receiving the packet MSG_ID of source broadcast, according to MSG_ID_CHECK_N=MSG_ID XOR MSG_ID_N formula, calculate the Data Labels position MSG_ID_CHECK_N of each packet in memory separately.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110129422 CN102158888B (en) | 2011-05-18 | 2011-05-18 | Data forwarding method based on random walk backup and node cooperation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110129422 CN102158888B (en) | 2011-05-18 | 2011-05-18 | Data forwarding method based on random walk backup and node cooperation |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102158888A CN102158888A (en) | 2011-08-17 |
| CN102158888B true CN102158888B (en) | 2013-12-25 |
Family
ID=44439996
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201110129422 Expired - Fee Related CN102158888B (en) | 2011-05-18 | 2011-05-18 | Data forwarding method based on random walk backup and node cooperation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102158888B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102684917B (en) * | 2012-04-26 | 2016-09-07 | 华为技术有限公司 | A kind of data back up method, Apparatus and system |
| CN103152792B (en) * | 2013-03-28 | 2016-05-04 | 东南大学 | In wireless sensor network based on the auxiliary mobile data collection method of track |
| CN110727549B (en) * | 2019-10-08 | 2022-07-05 | 浙江百岸科技有限公司 | Sensor data backup method and system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101360051A (en) * | 2008-07-11 | 2009-02-04 | 西安电子科技大学 | Energy efficient wireless sensor network routing method |
| CN101808382A (en) * | 2010-01-20 | 2010-08-18 | 西安电子科技大学 | Data communication method of wireless sensor network |
| CN101883326A (en) * | 2010-05-31 | 2010-11-10 | 西安电子科技大学 | Wireless sensor network data transmission method based on pilotless vehicle monitoring |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7693120B2 (en) * | 2006-06-26 | 2010-04-06 | The Boeing Company | Neural network-based mobility management for self-partition detection and identification of mobile ad hoc radio networks |
-
2011
- 2011-05-18 CN CN 201110129422 patent/CN102158888B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101360051A (en) * | 2008-07-11 | 2009-02-04 | 西安电子科技大学 | Energy efficient wireless sensor network routing method |
| CN101808382A (en) * | 2010-01-20 | 2010-08-18 | 西安电子科技大学 | Data communication method of wireless sensor network |
| CN101883326A (en) * | 2010-05-31 | 2010-11-10 | 西安电子科技大学 | Wireless sensor network data transmission method based on pilotless vehicle monitoring |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102158888A (en) | 2011-08-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102404817B (en) | Networking method and system for wireless sensor network based on multiple sink nodes | |
| Chen et al. | Energy-efficient broadcasting scheme for smart industrial wireless sensor networks | |
| CN109547351B (en) | Routing method based on Q learning and trust model in Ad Hoc network | |
| CN103916942A (en) | LEACH protocol improvement method capable of lowering energy consumption | |
| CN102111912B (en) | Centralized construction method for Zigbee homogeneous tree-type wireless sensor network | |
| CN110049530B (en) | Routing method based on Q learning and trust model in vehicle-mounted self-organizing network | |
| CN103209435B (en) | Congestion control based wireless multi-hop network multicast method | |
| CN102098691B (en) | Method for establishing scale-free sensor having survivability | |
| CN104411000A (en) | Method for selecting cluster head of hierarchical routing protocol in wireless sensor network | |
| KR101560523B1 (en) | Operating method of wireless sensor networks considering energy efficiency | |
| CN103582065A (en) | Efficient ad hoc network routing method for wireless sensor network | |
| CN101640944B (en) | Clustering and multi-hop communication method of wireless sensor | |
| CN102158888B (en) | Data forwarding method based on random walk backup and node cooperation | |
| CN105246117A (en) | Energy-saving routing protocol realization method suitable for mobile wireless sensor network | |
| CN102883399B (en) | Cluster-based CTP (coordinated test program) routing protocol | |
| CN104853396A (en) | Chain wireless sensor network oriented clustering routing system and methods thereof | |
| CN101938804B (en) | Multipath routing protocol suitable for wireless sensing network | |
| CN103281696B (en) | A kind of distributed wireless sensor network topology reconstructing method | |
| CN103560966A (en) | Opportunistic network route mixing method based on network coding and copying | |
| CN103260206A (en) | Mixing dynamic wireless router effective search convergence method based on influence degree factors | |
| CN105634964A (en) | Mobile self-organizing network and multicast routing method thereof | |
| Alnaham et al. | Improving QoS in WSN based on an optimal path from source to sink node routing algorithm | |
| CN103532667A (en) | Reliable wireless sensor network data transmission method based on Chinese remainder theorem | |
| CN105246123A (en) | Improved CARP routing protocol | |
| Kouvatsos et al. | Broadcasting methods in mobile ad hoc networks: an overview |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20131225 Termination date: 20200518 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |