CN103747497A - Method of data download in wireless sensor network - Google Patents

Method of data download in wireless sensor network Download PDF

Info

Publication number
CN103747497A
CN103747497A CN201310749108.6A CN201310749108A CN103747497A CN 103747497 A CN103747497 A CN 103747497A CN 201310749108 A CN201310749108 A CN 201310749108A CN 103747497 A CN103747497 A CN 103747497A
Authority
CN
China
Prior art keywords
node
tree
gateway
heartbeat message
child node
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.)
Pending
Application number
CN201310749108.6A
Other languages
Chinese (zh)
Inventor
徐葳
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Jiangsu Ning Ke Sensor Science And Technology Ltd
Original Assignee
Jiangsu Ning Ke Sensor Science And Technology Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Jiangsu Ning Ke Sensor Science And Technology Ltd filed Critical Jiangsu Ning Ke Sensor Science And Technology Ltd
Priority to CN201310749108.6A priority Critical patent/CN103747497A/en
Publication of CN103747497A publication Critical patent/CN103747497A/en
Pending legal-status Critical Current

Links

Images

Abstract

The invention discloses a method of data download in a wireless sensor network. The method mainly comprises the following steps: merging all child node lists in an undirected tree by a gateway, and constructing a routing list including end-to-end routing information for traversing all tree nodes in the undirected tree; based on the constructed routing list, initiating a data download request by sending a request including the end-to-end routing information to each tree node in sequence by the gateway; feeding back data requested by the data download request to the gateway along the route opposite to the data download request in the undirected tree by a target node. According to the method of data download in the wireless sensor network disclosed by the invention, the defects of low data acquisition reliability, low data transmission efficiency and the like in the prior art can be overcome so as to realize the advantages of high data acquisition reliability and high data transmission efficiency.

Description

A kind of method that wireless sensor network data is downloaded
Technical field
The present invention relates to communication technical field, particularly, relate to a kind of method that wireless sensor network data is downloaded.
Background technology
Wireless sensor network (Wireless Sensor Networks, be called for short WSN) be current that receive much concern in the world, relate to that multidisciplinary height intersects, the integrated hot research field, forward position of knowledge height.The progress of the technology such as sensor technology, MEMS (micro electro mechanical system), modern network and radio communication, has promoted generation and the development of modern wireless sensor network.Wireless sensor network has been expanded people's information obtaining ability, and the physical message of objective world is linked together with transmission network, in next generation network, will provide the most directly for people, the most effectively, the most real information.Wireless sensor network can obtain objective physical message, has very wide application prospect, can be applied to the fields such as military and national defense, industrial or agricultural control, city management, biologic medical, environment measuring, rescue and relief work, deathtrap Long-distance Control.Cause the great attention of many national academias and industrial quarters, be considered to one of technology of power that 21 century is had an immense impact on.
Wireless sensor network is exactly to form by being deployed in cheap microsensor nodes a large amount of in monitored area, the network system of the self-organizing of the multi-hop forming by communication, its objective is the information of perceived object in perception collaboratively, acquisition and processing network's coverage area, and send to observer.Transducer, perceptive object and observer have formed three key elements of wireless sensor network.
Wireless sensor network is a kind of network being comprised of great quantity of small transducer.These Miniature Sensors are generally called sensor node (sensor node) or node (mote).In this kind of network, generally also there is one or several base station (being called sink) to be used for concentrating the data of collecting from Miniature Sensor.
In the wireless sensor network of large scale and high density, traditional downloading mode can reduce the reliability of data acquisition.
Realizing in process of the present invention, inventor finds at least to exist in prior art the defects such as the low and data transmission efficiency of data acquisition reliability is low.
Summary of the invention
The object of the invention is to, for the problems referred to above, propose a kind of method that wireless sensor network data is downloaded, to realize data acquisition reliability height and the high advantage of data transmission efficiency.
For achieving the above object, the technical solution used in the present invention is: a kind of method that wireless sensor network data is downloaded, mainly comprises:
A, gateway merge all child node lists in undirected tree, build for traveling through all tree nodes of undirected tree and comprising the route list of routing iinformation end to end;
B, the route list based on building, gateway, by sending and comprise the request of routing iinformation end to end to each tree node successively, is initiated data download request;
C, destination node are along the path contrary with data download request in undirected tree, the data of asking to gateway feedback data download request.
Further, after step c, also comprise:
The data that d, data download request are asked arrive after gateway along destination node, gateway checking CRC data.
3. the method that wireless sensor network data according to claim 2 is downloaded, is characterized in that, in steps d, also comprises: when gateway checking CRC data are made mistakes, return to step b, request retransmission.
Further, between step a and step b, also comprise:
Child node is estimated local time of delay in the process of route construction;
Child node uploads to gateway by this locality time of delay, and gateway is estimated to the transmission delay of each node.
Further, in step a, described structure, for traveling through all tree nodes of undirected tree and comprising the operation of the route list of routing iinformation end to end, specifically comprises:
(1) the child node list of gateway inquiry ground floor child node;
(2) gateway sends polling request to second layer child node, obtains the list of second layer child node;
(3) gateway is sought child node list to the child node of deep layer level more in this way;
(4) gateway is gone through the child node all over all levels, obtains complete child node list and routing iinformation.
Further, before step a, also comprise: set up the network topology with undirected tree.
Further, described foundation has the operation of the network topology of undirected tree, specifically comprises:
A0, in default network topology table, add the sensor node that can carry out transfer of data, this sensor node is called to tree node; To not add the sensor node of network topology table to be called non-tree node temporarily;
B0, gateway are by the mode of the heartbeat message of broadcast tree node, the process of establishing of initialization network topology;
The initialization result of c0, topological process of establishing Network Based, the competition of non-tree node adds after network topology table, by sending the mode of heartbeat message of self, raises more sensor node, sets up required network topology structure.
Further, in step b0, gateway is the root node of whole tree, and gateway can periodically send heartbeat message;
After a node joins seeds, node can be waited for second heartbeat message that its father node is sent, and this heartbeat message can trigger the heartbeat message of this node transmission oneself; In heartbeat message, clearly indicated which father node of this node and child node are in active state;
If a node cannot obtain heartbeat message from its father node in Preset Time section, this node thinks that its father node is unreachable, and oneself can be returned to again to the state of scanning;
Similarly, father node also can be deleted child node from topology table, if do not receive the heartbeat data of child node for a long time;
In step b0, gateway is by the mode of the heartbeat message of broadcast tree node, and the operation of the process of establishing of initialization network topology, specifically comprises:
Gateway sends heartbeat message;
Node is received heartbeat message, adds in-tree;
Gateway sends heartbeat message again, the information that comprises node;
Node is confirmed to add network, and outwards broadcasts the heartbeat message of self.
Further, in step c0, by sending the mode of heartbeat message of self, the operation of raising more sensor node, specifically comprises:
Non-tree node enters initialized scanning mode, intercepts on one's own initiative the heartbeat message in network; Non-tree node is established father node by following mode:
(1) the signal strength signal intensity of guaranteeing the heartbeat message of catching exceedes threshold value;
(2) check the child node list of the potential father node that sends heartbeat message, determine whether this father node has reached allowed son node number object maximum;
(3) by calculating total transmission counting ETTC, determine the quality of node to the up link of gateway; Step (3) in, the calculating of ETTC is as follows in formula:
Figure 2013107491086100002DEST_PATH_IMAGE001
(1);
In formula (1), j represents present node, and i identifies potential father node, and p sign is from j to the path to gateway through i, and ELDRl represents estimation link transfer rate on l link; Recursive calculation ETTCj, ETTCi is included in heartbeat message; Determine that i need to carry out message samsara repeatedly to the ELDR between j;
In step c0, by sending the mode of heartbeat message of self, the operation of raising more sensor node, specifically also comprises:
When non-tree node enters the end of scan of initialized scanning mode, non-tree node selects the minimum upstream node of total transmission counting to be used as potential father node, and sends the request that adds tree;
This potential father node can be estimated the link circuit condition on link from then on;
If link-quality can be accepted, this potential father node will send authorization messages to the child node of the request of sending, to confirm that it joins in tree topology; If link circuit condition is not good, can not authorize to child node, child node now can become timeout mode, and continues to intercept the heartbeat message broadcast in network.
Further, in step b0 or step c0, during broadcast heartbeat message, specifically by mixed mechanism, broadcast heartbeat message, father node distributes the fragment of scheduled duration to child node;
The field that heartbeat message comprises, comprises the state of respective sensor node, jump a distance and the sequence number of respective sensor node place father node and the list of child node of respective sensor nodal distance root node; Child node list is for coordinating the transmission of heartbeat message;
Child node list can be used in the timesharing plan of carrying out local time division multiplexing, and the computing formula of the time window that child node is used is as follows:
Figure 532193DEST_PATH_IMAGE002
(2);
In formula (2), T represents to distribute to the time span of child node, and I represents node number, and nmax represents the maximum child node number that topological tree allows, and nmax represents it is the maximum child node number stipulating in network; The remaining time is distributed in the initialization of non-tree node both-way communication.
The method that the wireless sensor network data of various embodiments of the present invention is downloaded, owing to mainly comprising: gateway merges all child node lists in undirected tree, builds for traveling through all tree nodes of undirected tree and comprising the route list of routing iinformation end to end; Based on the route list building, gateway, by sending and comprise the request of routing iinformation end to end to each tree node successively, is initiated data download request; Destination node is along the path contrary with data download request in undirected tree, the data of asking to gateway feedback data download request; Can be along the path of undirected tree, reliably image data; Thereby can overcome in prior art the low and low defect of data transmission efficiency of data acquisition reliability, to realize the high and high advantage of data transmission efficiency of data acquisition reliability.
Other features and advantages of the present invention will be set forth in the following description, and, partly from specification, become apparent, or understand by implementing the present invention.
Below by drawings and Examples, technical scheme of the present invention is described in further detail.
Accompanying drawing explanation
Accompanying drawing is used to provide a further understanding of the present invention, and forms a part for specification, for explaining the present invention, is not construed as limiting the invention together with embodiments of the present invention.In the accompanying drawings:
Fig. 1 is the schematic flow sheet of the method for wireless sensor network data download of the present invention.
Embodiment
Below in conjunction with accompanying drawing, the preferred embodiments of the present invention are described, should be appreciated that preferred embodiment described herein, only for description and interpretation the present invention, is not intended to limit the present invention.
According to the embodiment of the present invention, as shown in Figure 1, a kind of method that provides wireless sensor network data to download.
The method that the wireless sensor network data of the present embodiment is downloaded, utilizes " a kind of method that network topology is set up " described undirected tree, along the path of tree, image data reliably.In the method that this wireless sensor network data is downloaded, the collection of data is not that initiated by node asynchronous uploaded, and this is because in the common data upload process of being initiated by node, can cause strong network congestion.In the wireless sensor network of large scale and high density, traditional mode can reduce the reliability of data acquisition.In the method for downloading at this wireless sensor network data, employing be centralized data acquisition modes.Gateway poll in this model is the each node of poll in order, along the direction of tree, downloads the data that node collects.
As " a kind of method that network topology is set up ", mention, the node in undirected tree is only known their father node and child node.In order to travel through all tree nodes, gateway need to have a routing iinformation end to end.Gateway is set up this route by merging all child node lists.(process that the tree of describing in a kind of method of setting up according to network topology is set up, has comprised the list of its father node and downstream child node thereof in the heartbeat message that each node is broadcasted) foundation of route list is the process of a recurrence.Gateway sequential query oneself is child node directly, and these nodes respond their child node list.Then, the child node list query deeper child node of gateway from recently receiving.This process is continued until that gateway travels through all tree nodes.Due to the variation of heartbeat message triggering undirected tree topological structure, reduce to greatest extent the expense of line construction, the palmic rate that gateway can reduce by cache way origin.
Briefly, to set up the order of route as follows for gateway:
(1) the child node list of gateway inquiry ground floor child node;
(2) gateway sends polling request to second layer child node, obtains the list of second layer child node;
(3) gateway is sought child node list to the child node of deep layer level more in this way;
(4) gateway is gone through the child node all over all levels, obtains complete child node list and routing iinformation.
Build after the route of downstream, gateway is initiated data download by successively request being sent to each node.In each request, comprised routing iinformation (need to pass through node A and Node B from gateway 1 to node C) end to end, the data that destination node is asked along contrary path feedback gateway.
Because packets need could arrive gateway through multiple hops, for efficiency of transmission, source node must be determined the transmission delay on the path of disturbing mutually minimum (channel status is good) and end-to-end transmission delay minimum (metric is few).In the method for downloading at this wireless sensor network data, node utilizes the chance of uploading child node list to gateway to estimate transmission delay.Node starts timing when sending child node list to gateway, listen to that its father node sends when it same data time the (process of a transmission that jumps more, it is the process of a broadcast, for example node A and Node B are set memberships, Node B sends child node table data bag to gateway, after node A receives this packet, identical data can be sent in network again, be similar to relaying.Because A and B are set memberships, the transmission range between them directly can reach, and when therefore A node sends data, B node also can listen to) stop timing, node just can be known the transmission delay that himself arrives its father node.When carrying out transfer of data, each node layer all can join its local delay duration in packet.Like this, when gateway is received data, just known time of delay end to end.
In order to realize reliability end to end, Linkmote adopts link level and end-to-end re-transmission simultaneously.By adding, confirm that function realizes the confirmation of re-transmission in software.We by adding CRC check to carry out the integrality of verification msg in packet.Simply, if gateway receive after the packet from node, can carry out verification.In the situation that verification is not passed through, can require to retransmit.
The all processes that data are downloaded is as follows:
(1) build route list, gateway is gone through all over all child nodes and is obtained complete child node routing iinformation;
(2) child node is estimated local time of delay in the process of route construction;
(3) child node uploads to gateway by this locality time of delay, and gateway is estimated to the transmission delay of each node;
(4) gateway sends download request to specific child node;
(5) ask to arrive specific child node along the node in route;
(6) child node is replied the download request of gateway;
(7) data arrive gateway along the node in route;
(8) gateway checking CRC data;
(9) gateway checking CRC makes mistakes, and requires to retransmit.
The method that the network topology of mentioning is in the above-described embodiments set up, mainly comprises:
A0, in default network topology table, add the sensor node that can carry out transfer of data, this sensor node is called to tree node; To not add the sensor node of network topology table to be called non-tree node temporarily;
B0, gateway are by the mode of the heartbeat message of broadcast tree node, the process of establishing of initialization network topology;
In step b0, gateway is the root node of whole tree, and gateway can periodically send heartbeat message;
After a node joins seeds, node can be waited for second heartbeat message that its father node is sent, and this heartbeat message can trigger the heartbeat message of this node transmission oneself; In heartbeat message, clearly indicated which father node of this node and child node are in active state;
If a node cannot obtain heartbeat message from its father node in Preset Time section, this node thinks that its father node is unreachable, and oneself can be returned to again to the state of scanning;
Similarly, father node also can be deleted child node from topology table, if do not receive the heartbeat data of child node for a long time;
In step b0, gateway is by the mode of the heartbeat message of broadcast tree node, and the operation of the process of establishing of initialization network topology, specifically comprises:
Gateway sends heartbeat message;
Node is received heartbeat message, adds in-tree;
Gateway sends heartbeat message again, the information that comprises node;
Node is confirmed to add network, and outwards broadcasts the heartbeat message of self;
The initialization result of c0, topological process of establishing Network Based, the competition of non-tree node adds after network topology table, by sending the mode of heartbeat message of self, raises more sensor node, sets up required network topology structure;
In step c0, by sending the mode of heartbeat message of self, the operation of raising more sensor node, specifically comprises:
Non-tree node enters initialized scanning mode, intercepts on one's own initiative the heartbeat message in network; Non-tree node is established father node by following mode:
(1) the signal strength signal intensity of guaranteeing the heartbeat message of catching exceedes threshold value;
(2) check the child node list of the potential father node that sends heartbeat message, determine whether this father node has reached allowed son node number object maximum;
(3) by calculating total transmission counting ETTC, determine the quality of node to the up link of gateway; Step (3) in, the calculating of ETTC is as follows in formula:
Figure 201071DEST_PATH_IMAGE001
(1);
In formula (1), j represents present node, and i identifies potential father node, and p sign is from j to the path to gateway through i, and ELDRl represents estimation link transfer rate on l link; Recursive calculation ETTCj, ETTCi is included in heartbeat message; Determine that i need to carry out message samsara repeatedly to the ELDR between j;
In step c0, by sending the mode of heartbeat message of self, the operation of raising more sensor node, specifically also comprises:
When non-tree node enters the end of scan of initialized scanning mode, non-tree node selects the minimum upstream node of total transmission counting to be used as potential father node, and sends the request that adds tree;
This potential father node can be estimated the link circuit condition on link from then on;
If link-quality can be accepted, this potential father node will send authorization messages to the child node of the request of sending, to confirm that it joins in tree topology; If link circuit condition is not good, can not authorize to child node, child node now can become timeout mode, and continues to intercept the heartbeat message broadcast in network;
In step b0 or step c0, during broadcast heartbeat message, specifically by mixed mechanism, broadcast heartbeat message, father node distributes the fragment of scheduled duration to child node.The field that heartbeat message comprises, comprises the state of respective sensor node, jump a distance and the sequence number of respective sensor node place father node and the list of child node of respective sensor nodal distance root node; Child node list is for coordinating the transmission of heartbeat message.Child node list can be used in the timesharing plan of carrying out local time division multiplexing, and the computing formula of the time window that child node is used is as follows:
Figure 381386DEST_PATH_IMAGE002
(2);
In formula (2), T represents to distribute to the time span of child node, and I represents node number, and nmax represents the maximum child node number that topological tree allows, and nmax represents it is the maximum child node number stipulating in network; The remaining time is distributed in the initialization of non-tree node both-way communication.
Finally it should be noted that: the foregoing is only the preferred embodiments of the present invention, be not limited to the present invention, although the present invention is had been described in detail with reference to previous embodiment, for a person skilled in the art, its technical scheme that still can record aforementioned each embodiment is modified, or part technical characterictic is wherein equal to replacement.Within the spirit and principles in the present invention all, any modification of doing, be equal to replacement, improvement etc., within all should being included in protection scope of the present invention.

Claims (10)

1. the method that wireless sensor network data is downloaded, is characterized in that, mainly comprises:
A, gateway merge all child node lists in undirected tree, build for traveling through all tree nodes of undirected tree and comprising the route list of routing iinformation end to end;
B, the route list based on building, gateway, by sending and comprise the request of routing iinformation end to end to each tree node successively, is initiated data download request;
C, destination node are along the path contrary with data download request in undirected tree, the data of asking to gateway feedback data download request.
2. the method that wireless sensor network data according to claim 1 is downloaded, is characterized in that, after step c, also comprises:
The data that d, data download request are asked arrive after gateway along destination node, gateway checking CRC data.
3. the method that wireless sensor network data according to claim 2 is downloaded, is characterized in that, in steps d, also comprises: when gateway checking CRC data are made mistakes, return to step b, request retransmission.
4. the method that wireless sensor network data according to claim 1 is downloaded, is characterized in that, between step a and step b, also comprises:
Child node is estimated local time of delay in the process of route construction;
Child node uploads to gateway by this locality time of delay, and gateway is estimated to the transmission delay of each node.
5. the method for downloading according to the wireless sensor network data described in any one in claim 1-4, it is characterized in that, in step a, described structure, for traveling through all tree nodes of undirected tree and comprising the operation of the route list of routing iinformation end to end, specifically comprises:
(1) the child node list of gateway inquiry ground floor child node;
(2) gateway sends polling request to second layer child node, obtains the list of second layer child node;
(3) gateway is sought child node list to the child node of deep layer level more in this way;
(4) gateway is gone through the child node all over all levels, obtains complete child node list and routing iinformation.
6. the method for downloading according to the wireless sensor network data described in any one in claim 1-4, is characterized in that, before step a, also comprises: set up the network topology with undirected tree.
7. the method that wireless sensor network data according to claim 6 is downloaded, is characterized in that, described foundation has the operation of the network topology of undirected tree, specifically comprises:
A0, in default network topology table, add the sensor node that can carry out transfer of data, this sensor node is called to tree node; To not add the sensor node of network topology table to be called non-tree node temporarily;
B0, gateway are by the mode of the heartbeat message of broadcast tree node, the process of establishing of initialization network topology;
The initialization result of c0, topological process of establishing Network Based, the competition of non-tree node adds after network topology table, by sending the mode of heartbeat message of self, raises more sensor node, sets up required network topology structure.
8. the method that wireless sensor network data according to claim 7 is downloaded, is characterized in that, in step b0, gateway is the root node of whole tree, and gateway can periodically send heartbeat message;
After a node joins seeds, node can be waited for second heartbeat message that its father node is sent, and this heartbeat message can trigger the heartbeat message of this node transmission oneself; In heartbeat message, clearly indicated which father node of this node and child node are in active state;
If a node cannot obtain heartbeat message from its father node in Preset Time section, this node thinks that its father node is unreachable, and oneself can be returned to again to the state of scanning;
Similarly, father node also can be deleted child node from topology table, if do not receive the heartbeat data of child node for a long time;
In step b0, gateway is by the mode of the heartbeat message of broadcast tree node, and the operation of the process of establishing of initialization network topology, specifically comprises:
Gateway sends heartbeat message;
Node is received heartbeat message, adds in-tree;
Gateway sends heartbeat message again, the information that comprises node;
Node is confirmed to add network, and outwards broadcasts the heartbeat message of self.
9. the method that wireless sensor network data according to claim 7 is downloaded, is characterized in that, in step c0, by sending the mode of heartbeat message of self, the operation of raising more sensor node, specifically comprises:
Non-tree node enters initialized scanning mode, intercepts on one's own initiative the heartbeat message in network; Non-tree node is established father node by following mode:
(1) the signal strength signal intensity of guaranteeing the heartbeat message of catching exceedes threshold value;
(2) check the child node list of the potential father node that sends heartbeat message, determine whether this father node has reached allowed son node number object maximum;
(3) by calculating total transmission counting ETTC, determine the quality of node to the up link of gateway; Step (3) in, the calculating of ETTC is as follows in formula:
Figure 2013107491086100001DEST_PATH_IMAGE002
(1);
In formula (1), j represents present node, and i identifies potential father node, and p sign is from j to the path to gateway through i, and ELDRl represents estimation link transfer rate on l link; Recursive calculation ETTCj, ETTCi is included in heartbeat message; Determine that i need to carry out message samsara repeatedly to the ELDR between j;
In step c0, by sending the mode of heartbeat message of self, the operation of raising more sensor node, specifically also comprises:
When non-tree node enters the end of scan of initialized scanning mode, non-tree node selects the minimum upstream node of total transmission counting to be used as potential father node, and sends the request that adds tree;
This potential father node can be estimated the link circuit condition on link from then on;
If link-quality can be accepted, this potential father node will send authorization messages to the child node of the request of sending, to confirm that it joins in tree topology; If link circuit condition is not good, can not authorize to child node, child node now can become timeout mode, and continues to intercept the heartbeat message broadcast in network.
10. the method that wireless sensor network data according to claim 7 is downloaded, it is characterized in that, in step b0 or step c0, during broadcast heartbeat message, specifically by mixed mechanism, broadcast heartbeat message, father node distributes the fragment of scheduled duration to child node;
The field that heartbeat message comprises, comprises the state of respective sensor node, jump a distance and the sequence number of respective sensor node place father node and the list of child node of respective sensor nodal distance root node; Child node list is for coordinating the transmission of heartbeat message;
Child node list can be used in the timesharing plan of carrying out local time division multiplexing, and the computing formula of the time window that child node is used is as follows:
Figure 2013107491086100001DEST_PATH_IMAGE004
(2);
In formula (2), T represents to distribute to the time span of child node, and I represents node number, and nmax represents the maximum child node number that topological tree allows, and nmax represents it is the maximum child node number stipulating in network; The remaining time is distributed in the initialization of non-tree node both-way communication.
CN201310749108.6A 2013-12-31 2013-12-31 Method of data download in wireless sensor network Pending CN103747497A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310749108.6A CN103747497A (en) 2013-12-31 2013-12-31 Method of data download in wireless sensor network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310749108.6A CN103747497A (en) 2013-12-31 2013-12-31 Method of data download in wireless sensor network

Publications (1)

Publication Number Publication Date
CN103747497A true CN103747497A (en) 2014-04-23

Family

ID=50504474

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310749108.6A Pending CN103747497A (en) 2013-12-31 2013-12-31 Method of data download in wireless sensor network

Country Status (1)

Country Link
CN (1) CN103747497A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104661282A (en) * 2014-12-09 2015-05-27 中国华戎控股有限公司 Ad-hoc network access, data transmission and construction method
WO2020142983A1 (en) * 2019-01-09 2020-07-16 深圳市大疆创新科技有限公司 Information interaction method and system, and computer-readable medium
CN112218280A (en) * 2020-10-16 2021-01-12 北京杰睿中恒科技有限公司 Method for improving communication efficiency of local network by using parallel communication mode

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104661282A (en) * 2014-12-09 2015-05-27 中国华戎控股有限公司 Ad-hoc network access, data transmission and construction method
CN104661282B (en) * 2014-12-09 2018-06-26 中国华戎控股有限公司 A kind of access of ad hoc network, data transmission and construction method
WO2020142983A1 (en) * 2019-01-09 2020-07-16 深圳市大疆创新科技有限公司 Information interaction method and system, and computer-readable medium
CN111670561A (en) * 2019-01-09 2020-09-15 深圳市大疆创新科技有限公司 Information interaction method, system and computer readable medium
CN112218280A (en) * 2020-10-16 2021-01-12 北京杰睿中恒科技有限公司 Method for improving communication efficiency of local network by using parallel communication mode

Similar Documents

Publication Publication Date Title
Qasim et al. Mobile Ad Hoc Networking Protocols' Evaluation through Simulation for Quality of Service.
CN110324877A (en) Relaying robot method for routing based on servo backbone network Yu Vikor multi-standard decision
Cugola et al. A context and content-based routing protocol for mobile sensor networks
CN103747497A (en) Method of data download in wireless sensor network
Sverdlova et al. Self-organizing network topology for autonomous IoT systems
Wong et al. Efficient broadcasting in multi-hop wireless networks with a realistic physical layer
Tan et al. Queue management for network coding in ad hoc networks
Anandakumar et al. Enhanced multicast cluster-based routing protocol for delay tolerant mobile networks
Carty et al. Distributed network, neighbor discovery and blind routing for mobile wireless ad-hoc networks
Durresi et al. Broadcast protocol for energy-constrained networks
Kuo et al. A lightweight routing protocol for mobile target detection in wireless sensor networks
Kokuti et al. Location based data dissemination in mobile ad hoc networks
Hassanzadeh et al. Efficient mobile data collection with mobile collect
Gau et al. Reliable multimedia broadcasting over dense wireless ad-hoc networks
Lundell Ad-hoc network possibilities inside LoRaWAN
Nagaratna et al. Performance evaluation of mesh-based multicast routing protocols in MANET’s
Lalitha et al. Sink originated unique algorithm for clustering and routing to forward aggregated data in wireless sensor networks
Sun et al. Enhanced associativity-based multicast routing protocol in CR mobile ad hoc networks
Yadav et al. Improved ant colony optimization technique for mobile adhoc networks
Selvarani et al. Comparative Analysis of Hydra and Link Stability based Multicast Routing Protocols in Mobile Ad Hoc Networks
Leow et al. Mobile robot tracking in wireless sensor networks
Mahima et al. An Efficient Cluster-based Flooding Using Fuzzy Logic Scheme (CBF2S) In Mobile Adhoc Networks
Wang Impact of mobility and deployment in confined spaces on low power and lossy network
Kaushal Enhancing the performance of the sensor networks via implementing modify cluster based scheme
Jairath et al. Modified AODV with QoS for Asymmetric MANET

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20140423