CN102497620A - Method and system of information transmission in wireless sensor network - Google Patents
Method and system of information transmission in wireless sensor network Download PDFInfo
- Publication number
- CN102497620A CN102497620A CN2011103932697A CN201110393269A CN102497620A CN 102497620 A CN102497620 A CN 102497620A CN 2011103932697 A CN2011103932697 A CN 2011103932697A CN 201110393269 A CN201110393269 A CN 201110393269A CN 102497620 A CN102497620 A CN 102497620A
- Authority
- CN
- China
- Prior art keywords
- node
- path
- centroid
- emergency
- breadth
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
An embodiment of the invention provides a method and a system of emergency event transmission in a wireless sensor network and relates to the technical field of communication. The method includes that when a detection node detects an emergency event, the emergency event is sent to a central node along a built breadth-first path from the detection node to the central node; and when the central node receives the emergency event, the emergency event is broadcasted to other nodes along a built colored communication dominating set path from the central node to the other nodes. The technical scheme can effectively reduce transmission delay of alarming information in a wireless sensor network (WSN) and can avoid transmission conflicts of the alarming information in the WSN.
Description
Technical field
The present invention relates to communication technical field, the method and system of emergency transmission in particularly a kind of wireless sensor network.
Background technology
The wireless sensor network widespread deployment be applied to important use scenes such as battle reconnaissance, forest fire detection or coal mine gas detection; User's configuration usually communicates as the node in the wireless sensor network like PDA communication equipments such as (Personal Digital Assistant, personal digital assistants).
When a certain node detection in the wireless sensor network takes place to emergency; The warning message of other all these emergencies of node broadcasts in wireless sensor network as early as possible; So that the user makes a response to this emergency fast, guarantee people's the life and the safety of property.Therefore, must in wireless sensor network, design a high-efficiency information transmission plan, could guarantee that emergency can be from all nodes that are broadcast in the whole wireless sensor network other of the low time delay of arbitrary node.
Summary of the invention
For can be from all nodes that are broadcast in the whole wireless sensor network other of the low time delay of arbitrary node with emergency, the embodiment of the invention provides the method and system of emergency transmission in a kind of wireless sensor network.Said technical scheme is following:
The method of emergency transmission in a kind of wireless sensor network is characterized in that said method comprises:
When detection node monitors emergency, said emergency is sent to said Centroid along the breadth First path of setting up of leading to Centroid by said detection node;
When said Centroid receives said emergency, said emergency is broadcast to said other nodes along coloured UNICOM dominant set path of leading to other nodes by said Centroid of setting up.
Emergency system for transmitting in a kind of wireless sensor network is characterized in that said system comprises at least: detection node and Centroid,
Said detection node is used for when monitoring emergency, and said emergency is sent to said Centroid along the breadth First path of setting up of leading to said Centroid by said detection node;
Said Centroid is used for when receiving said emergency, and said emergency is broadcast to said other nodes along coloured UNICOM dominant set path of leading to other nodes by said Centroid of setting up.
The embodiment of the invention is through when detection node detects emergency; Detected emergency is sent to Centroid through the BFS path of setting up of leading to Centroid by detection node; When the center node receives emergency; Emergency is broadcast to the realization of the technical scheme of other nodes along the CCDS path of setting up of leading to other nodes by Centroid; The propagation delay time of warning message in the WSN network can be effectively reduced, the transmission collision of warning message in the WSN network can be avoided.
Description of drawings
In order to be illustrated more clearly in the technical scheme in the embodiment of the invention; The accompanying drawing of required use is done to introduce simply in will describing embodiment below; Obviously, the accompanying drawing in describing below only is some embodiments of the present invention, for those of ordinary skills; Under the prerequisite of not paying creative work, can also obtain other accompanying drawing according to these accompanying drawings.
Fig. 1 is the method flow diagram of emergency transmission in a kind of wireless sensor network of providing of the embodiment of the invention 1;
Fig. 2 is the method flow diagram of emergency transmission in a kind of wireless sensor network of providing of the embodiment of the invention 2;
Fig. 3 is the interior BFS path of the wireless sensor network sketch map that the embodiment of the invention 2 provides;
Fig. 4 is the interior CCDS path of the wireless sensor network sketch map that the embodiment of the invention 2 provides;
When Fig. 5 uses the time slot of 2ms for the present invention, the simulation result of the propagation delay time of the present invention and prior art scheme contrast sketch map;
When Fig. 6 uses the time slot of 10ms for the present invention, the simulation result of the propagation delay time of the present invention and prior art scheme contrast sketch map;
When Fig. 7 uses the time slot of 20ms for the present invention, the simulation result of the propagation delay time of the present invention and prior art scheme contrast sketch map;
When Fig. 6 uses the time slot of 10ms for the present invention, the simulation result of the propagation delay time of the present invention and prior art scheme contrast sketch map;
Fig. 8 is the interior emergency system for transmitting sketch map of a kind of wireless sensor network that the embodiment of the invention 3 provides;
Fig. 9 is the interior emergency system for transmitting sketch map of a kind of wireless sensor network that the embodiment of the invention 3 provides.
Embodiment
For making the object of the invention, technical scheme and advantage clearer, will combine accompanying drawing that embodiment of the present invention is done to describe in detail further below.
Referring to Fig. 1, the method for emergency transmission in a kind of wireless sensor network, this method specifically comprises following operation:
Step 101: when detection node monitors emergency, emergency is sent to Centroid along the breadth First path of setting up of leading to Centroid by detection node;
Step 102: when the center node receives emergency, emergency is broadcast to other nodes along coloured UNICOM dominant set path of leading to other nodes by Centroid of setting up.
The embodiment of the invention is through when detection node detects emergency; Detected emergency is sent to Centroid through the BFS path of setting up of leading to Centroid by detection node; When the center node receives emergency; Emergency is broadcast to the realization of the technical scheme of other nodes along the CCDS path of setting up of leading to other nodes by Centroid; The propagation delay time of warning message in the WSN network can be effectively reduced, the transmission collision of warning message in the WSN network can be avoided.
Embodiment 2
In the embodiment of the invention, the some nodes in the WSN network have obtained the topology of whole WSN network when initialization, and particularly, node can obtain whole WSN topology of networks through waiting such as the deep packet Detection Techniques; The present invention is called this node that has obtained the WSN network topology Centroid of this WSN network in real time; Centroid through such as broadcasting mode with other nodes in the information notification WSN networks such as address of self, this Centroid can also be through coming indicating self such as modes such as in circuit, writing sign.
In the embodiment of the invention, the WSN network node is received packet or transmits data packets to the minimum time of its adjacent node from its adjacent node, be designated as τ,, this τ is referred to as a time slot here;
In the embodiment of the invention, the detection node in the WSN network passes in the whole WSN network all nodes with a packet and knows that the used time is called a duty cycle, is designated as T; Wherein, T=L* τ, L are timeslot number total in each duty cycle, preestablish according to the scale of WSN network;
In the embodiment of the invention, each node in the WSN network is in order to reduce energy consumption, sleep when not working; With reach node under the situation of not changing battery, work the longer time purpose; And the node in the WSN network all is assigned self the time slot that wakes up according to the preset time slot distribution method, and only when self wake time slot up and arrive, could wake up to receive from other nodes from sleep state receives packet to the sleep node; In addition; What need explanation a bit is that node can send this packet to other nodes in any time slot in duty cycle after receiving packet.
The technical scheme that the embodiment of the invention provided specifically comprises: set up BFS (the Breadth First Search that is led to Centroid by detection node; Range is preferred) path and lead to CCDS (Colour Connect Dominant Set, the coloured connected dominating set) path of other nodes in the WSN network by Centroid; When detection node detects emergency, emergency is sent to Centroid along said BFS path, Centroid is broadcast to other nodes in the WSN network with emergency along said CCDS path when receiving emergency; Thereby can pass to whole WSN network by detection node with what the low time delay of emergency did not have a broadcast collision.
Specify the method that above-mentioned detection node does not pass to the low time delay of detected emergency whole WSN network with having broadcast collision below in conjunction with specific embodiment; Referring to Fig. 2; The method of emergency transmission specifically comprises the steps: in a kind of wireless sensor network
Step 201: set up and lead to the BFS path of Centroid by detection node;
In the embodiment of the invention; When the WSN netinit, just can set up the BFS path of leading to Centroid by detection node; Also can when detecting emergency, set up BFS path again by the current Centroid of detection node; Particularly, setting up the BFS route method of leading to Centroid by detection node comprises:
Each node in the WSN network is carried out layering according to the fewest number of hops that it arrives Centroid;
Setting up with the Centroid according to each internodal annexation in layering result and the WSN network is the breadth First tree of root;
In the embodiment of the invention; It with the fewest number of hops that arrives Centroid in the WSN network ground floor node that 1 node is set as the breadth First of being set up; With the fewest number of hops that arrives Centroid in the WSN network second layer node that 2 node is set as the breadth First of being set up, and the like;
On the breadth First set up tree, confirm to arrive the BFS path of Centroid, so that the jumping figure of detection node when this BFS path arrives Centroid is minimum by detection node.
Step 202: wake time slot up for each node on the BFS path distributes;
In the embodiment of the invention, each node on the BFS path is in its corresponding dormancy when waking time slot up of no show, and wherein, node can not receive any the emergency to self under resting state; Self is corresponding when waking time slot up arriving for node on the BFS path, just can receive a packet of sending out to self.
Like this, the mode through node dormancy can be so that node be worked under the situation of not changing battery the purpose of longer time, the energy savings spending.
Particularly, for waking time slot up, each node distribution on the BFS path comprises:
Confirm that respectively each node is to the fewest number of hops of Centroid on the BFS path;
The total timeslot number in the cycle of will setting the tasks in advance respectively deduct each node on the BFS path multiply by after the fewest number of hops of Centroid predetermined time slot obtain each node on the BFS path corresponding wake time slot up so that each node on the BFS path no show self corresponding wake time slot up the time sleep.
Step 203: when detection node detects emergency, by detecting the cautious BFS path of leading to Centroid emergency is sent to Centroid along what set up, wherein, emergency comprises like fire or gas leak etc.;
In the embodiment of the invention, the node on the BFS path is corresponding when waking time slot up and arriving at self, receives the emergency of the last hop node transmission on the BFS, and emergency is sent to the next-hop node on the BFS path;
In the embodiment of the invention, node all can send emergency by the next-hop node of arbitrary time slot on the BFS path in duty cycle on the BFS path after receiving emergency.
Illustrate the concrete implementation procedure of above-mentioned steps at present, as follows:
WSN network as shown in Figure 3, the BFS path of leading to Centroid C that detection node a set up is a → b → c, and wherein, detection node a only needs double bounce just can reach Centroid c through node b, and node b is through reaching Centroid c once jumping.In the embodiment of the invention; The jumping figure that Centroid c reaches Centroid c is 0; Then the total timeslot number L in predefined duty cycle is under 10 the situation; The time slot that wakes up that detection node a is assigned is (10-2) τ=8 τ, and the time slot that wakes up that node b is assigned is (10-1) τ=9 τ, and the time slot that wakes up that Centroid c is assigned is (10-0) τ=10 (0) τ; Here, why the time slot that wakes up of Centroid is 0 to be because the span of waking time slot up of each node in embodiment of the invention circulation value between 0 to (10-1) τ.
So, set up each joint on the BFS path of leading to Centroid by detection node and the BFS path all distributed separately wake time slot up after, specifically describe the transmission course of emergency on the BFS path below, as follows:
Detection node a is after detection obtains emergency; Detected emergency is sent to Centroid along the BFS path of being set up; At first; Detection node a can send to the next-hop node on the BFS path with detected emergency by the arbitrary time slot in duty cycle, just node b; At this moment, if node b is in running order, then node b receives the emergency that detection node a is sent, if node b is in resting state, then node b waits for the arrival that self wakes time slot up, and is waking the emergency that time slot reception detection node a is sent up; Afterwards, node b can send to the next-hop node c on this BFS path with the emergency that receives by the arbitrary time slot in duty cycle; Same; If node c is in running order this moment; Then node c receives the last hop node on the BFS path, and the node b emergency of being sent just is if node c is in resting state; Then node c waits for the arrival that self wakes time slot up, and is waking the emergency that time slot receiving node c is sent up.
Step 204: set up and lead to the CCDS path of other nodes by Centroid;
In the embodiment of the invention; When the WSN netinit, just can set up the CCDS path that Centroid leads to other nodes; Also can after Centroid receives emergency, set up the CCDS path of being led to other nodes by Centroid, foundation is comprised the steps: by the CCDS route method that Centroid leads to other nodes
Particularly, confirm the fewest number of hops of other nodes arrival Centroids in the WSN network respectively, the identical node of fewest number of hops that arrives Centroid is divided into one deck;
In the embodiment of the invention, with the fewest number of hops that arrives Centroid in other nodes be each node of 1 as the ground floor node, with the fewest number of hops that reaches Centroid in other nodes be each node of 2 as second layer node, and the like.
Step 2, confirm isolated node in each node layer successively;
The implementation method of this step is specially:
Set up a MIS (Maximal Independent Set, maximum independent set) set;
Centroid is put into the MIS set as isolated node;
In the i node layer, search with MIS in the non-conterminous node of node, whenever find one with MIS in non-conterminous node, just this node that finds is added during MIS gathers as isolated node; Afterwards, continuation is searched in the i node layer and is upgraded the non-conterminous node of isolated node among the MIS of back, and the node that will find once more adds the MIS set as isolated node; Then; The continuation execution is searched in the i node layer and is upgraded the non-conterminous node of isolated node among the MIS of back; And the node that will find once more adds the operation of MIS set as isolated node; So circulation is carried out, up in the i node layer, search less than with MIS in till the non-conterminous node of isolated node.
Wherein, i is the self-heating number since 1 value, smaller or equal to N.
Particularly; Isolated node on the K layer is constituted an isolated node collection I_i; In the last layer of K layer isolated node collection or the independent node in the two-layer node, find out the minimum covering set that can cover K layer isolated node collection I_i, the node in this minimum covering set is the connection node.
Step 4, adopt IMC (Interactive Markov chains, interactive Markov chain) algorithm to determined isolated node and be communicated with set of node and handle and obtain the CDS set;
The one preferred implementation of this step is:
To be communicated with set of node and be designated as W_i, 1, in MIS set, find out a set U_i, 1, make this U_i, the adjacent node that node all has only a node in 1 set is at W_i, in 1;
At W_i, find out a sub-set in 1, make the subclass of being found out for can cover I_i-U_i, 1 minimal set is designated as W_i, and 2;
At I_i-U_i, find out a set U_i in 1,2, making should set U_i, and the adjacent node that node all has only a node in 2 is at W i, in 2;
At W_i, find out a sub-set in 2, make this subclass for can cover I_i-U_i, I_i-U_i, 2 minimal set is designated as W_i, and 3;
Thereby obtain CDS set U_i, j and W_i, j, 1＜=j＜=3;
Process by above structure connected dominating set can be known, connected dominating set W_i, and j and U_i, node is positioned at different layerings among the j, so, work as W_i, during node broadcasts emergency among the j, U_i, the node among the j can not conflicted.
Step 5, be to constitute the CCDS path by the node allocated channel that CDS concentrates;
The one preferential implementation of this step is:
Nodes all among the CDS is divided into three set according to its minimum hop count at CDS centre to centre heart node C: isolated node collection (I), connection set of node (C) and dominate node collection (B), wherein, the isolated node collection is an even number at the jumping figure of CDS centre to centre heart node C; Be designated as I0; I2, I4, Being communicated with set of node is odd number at the jumping figure of CDS centre to centre heart node C, is designated as C1, C3, and C5, The jumping figure of dominate node collection Centroid C in road in CDS is an even number, is designated as B0, B2, and B4,
Each node among the CDS that above-mentioned steps 4 is obtained allocated channel respectively obtains the connected dominating set path, in the embodiment of the invention, each node that connects among the CDS is coloured to the CCDS path with being no more than 12 channels, is specially:
To each node nk definition transmitting channel chs (channel send) and the receive channel chr (channel receive) in the CDS collection; Each node nk in isolated node collection I (Ii) and the dominate node collection (B) according to it at Ui, the color getter transmitting channel chs among the j, each the node nt in the connected set according to its father node (Ii-1) at Wi; Color among the j (0≤j≤3) is obtained receive channel chr; Each node nk among the independent sets I (Ii) according to it at Ui, the color getter receive channel chr among the j, each the node nt in the connected set according to its father node (Ii-1) at Wi; Color among the j (0≤j≤3) is obtained receive channel chr; Like this, each node just can separately transmit and receive data, thereby makes each node can not produce broadcast collision.
Step 205: wake time slot up for each node on the CCDS path distributes;
In the embodiment of the invention, each node on the CCDS path is in its corresponding dormancy when waking time slot up of no show, and wherein, node can not receive any the emergency to self under resting state; Self is corresponding when waking time slot up arriving for node on the CCDS path, just can receive a packet of sending out to self.
Like this, the mode through node dormancy can be so that node be worked under the situation of not changing battery the purpose of longer time, the energy savings spending.
Particularly, for waking time slot up, each node distribution on the CCDS path comprises:
Confirm that respectively each node is to the fewest number of hops of Centroid on the CCDS path;
Respectively with each node on the CCDS path to the fewest number of hops of Centroid multiply by predetermined time slot obtain each node on the CCDS path corresponding wake time slot up so that on the CCDS path each node it corresponding is slept when waking time slot up in self no show.
Step 206: when the center node receives emergency, the emergency of arriving along the CCDS path broadcast reception of leading to other nodes of setting up;
In the embodiment of the invention,, receive the emergency that the last hop node on the CCDS path is broadcasted, and emergency is broadcast to the next-hop node on the CCDS path when the node on the CCDS path is corresponding when waking time slot up and arriving at self.
In the embodiment of the invention, node all can send emergency by the next-hop node of arbitrary time slot on the BFS path in duty cycle on the BFS path after receiving emergency.
In the embodiment of the invention, on the CCDS path node after receiving emergency, the next-hop node broadcasting emergency incident of arbitrary time slot on the CCDS path that all can be in duty cycle.
When Fig. 4 receives emergency for a kind of Centroid that the embodiment of the invention provided to the instance graph to other node broadcasts emergencies along the CCDS path.
In addition, in the embodiment of the invention, the distribution that wakes time slot up of the node on the BFS path and the distribution that wakes time slot up of the node on the CCDS path see table 1 for details.
The time slot allocation table of each node in the table 1:WSN network
The embodiment of the invention is through when detection node detects emergency; Detected emergency is sent to Centroid through the BFS path of setting up of leading to Centroid by detection node; When the center node receives emergency; Emergency is broadcast to the realization of the technical scheme of other nodes along the CCDS path of setting up of leading to other nodes by Centroid; The propagation delay time of warning message in the WSN network can be effectively reduced, the transmission collision of warning message in the WSN network can be avoided.
Below, the beneficial effect that the result through emulation experiment comes the description technical scheme that the embodiment of the invention provides of visualize to bring:
Adopt the experimental situation of NS-2 network simulation, wherein, the node number in the NS-2 network that this experiment is adopted is 225, the area size 150*150m of NS-2 network, and the success rate of two inter-node communications is p=1-(d/20) in the hypothesis NS-2 network
2, wherein, d is the distance of two nodes.
Technical scheme that the embodiment of the invention adopts: the duty cycle setting is 1s; Time slot is set to 2ms, 10ms or 20ms respectively; And the number of times that under each time slot, experimentizes is 10; Detect from detection node respectively and detect emergency, issue Centroid along the BFS path, Centroid is broadcast to the time delay of other nodes along the CCDS path.
Among the contrast scheme 1:DW-MAC (the MAC layer is dispatching algorithm as required), the sensor node store information is transmitted again, detects detection node and is detecting an emergency to this emergency being transferred to the time delay that whole net is known.
Among the contrast scheme 2:ADB (asynchronous task periodic broadcasting algorithm); Sensor node adopts asynchronous system; In the ideal case, the propagation delay time of each jumping is the half the of duty cycle, detects detection node and is detecting an emergency to this emergency being transferred to the time delay that whole net is known.
When Fig. 5 uses the time slot of 2ms for technical scheme of the present invention, the simulation result contrast sketch map of the propagation delay time of technical scheme of the present invention and prior art scheme;
When Fig. 6 uses the time slot of 10ms for technical scheme of the present invention, the simulation result contrast sketch map of the propagation delay time of technical scheme of the present invention and prior art scheme;
When Fig. 7 uses the time slot of 20ms for technical scheme of the present invention, the simulation result contrast sketch map of the propagation delay time of technical scheme of the present invention and prior art scheme;
Can find out from Fig. 5,6 and 7 that then when adopting technical scheme of the present invention, the propagation delay time of emergency is significantly less than the prior art scheme in the wireless sensor network.
Referring to Fig. 8, emergency system for transmitting in a kind of wireless sensor network, this system comprises at least: detection node 301 and Centroid 302,
Detection node 301 is used for when monitoring emergency, and emergency is sent to Centroid along the breadth First path of setting up of leading to Centroid by detection node;
Centroid 302 is used for when receiving emergency, and emergency is broadcast to other nodes along coloured UNICOM dominant set path of leading to other nodes by Centroid of setting up.
Referring to Fig. 9; In the embodiment of the invention, the emergency system for transmitting also comprises in the wireless sensor network: the range preferred path sets up that module 303, first is waken time slot allocation module 304 up, coloured connected dominating set path is set up module 305 and second and waken time slot allocation module 306 up;
Wherein, the range preferred path is set up module 303 and is comprised:
The layering unit is used for each node in the wireless sensor network is carried out layering according to its fewest number of hops to Centroid;
The breadth First tree is set up the unit, and being used for setting up with the Centroid according to each internodal annexation and layering result in the wireless senser networking is the breadth First tree of root;
The unit is established in the breadth First path, is used for confirming to lead to the breadth First path of Centroid by detection node in the breadth First tree, and is minimum so that detection node arrives the jumping figure of Centroid along the breadth First path.
First wakes time slot allocation module 304 up comprises:
Confirm the unit, be used for confirming respectively that each node is to the fewest number of hops of Centroid on the breadth First path;
Time slot allocating unit; Be used for total timeslot number in the cycle that will set the tasks in advance respectively deduct each node on the breadth First path multiply by after the fewest number of hops of Centroid predetermined time slot obtain each node on the breadth First path corresponding wake time slot up so that each node on the breadth First path no show self corresponding wake time slot up the time sleep.
Then correspondingly; Referring to Fig. 9; The emergency system for transmitting also comprises in the wireless sensor network that the embodiment of the invention provided: the node 307 on the breadth First path; Be used at self correspondingly when waking time slot up and arriving, receive the emergency of the last hop node transmission on the breadth First path, and emergency is sent to the next-hop node on the breadth First path.
Module 305 is set up in coloured connected dominating set path, is used to set up coloured connected dominating set path that Centroid leads to other nodes, comprising:
The layering unit is used for each node in the wireless sensor network according to its jumping figure layering to Centroid;
Isolated node is confirmed the unit, is used for confirming successively the isolated node in each node layer;
Be communicated with node and confirm the unit, be used for confirming to be communicated with in the wireless sensor network node according to determined isolated node;
The connected dominating set construction unit is used to adopt interactive The Markov Chain Algorithm that determined isolated node and determined connection node are handled and obtains connected dominating set;
Channel-assignment unit is used to the node allocated channel in the connected dominating set, constitutes coloured connected dominating set path.
Second wakes the time slot allocation module up comprises that 306 comprise:
Confirm the unit, be used for confirming respectively that each node is to the fewest number of hops of Centroid in coloured connected dominating set;
Time slot allocating unit; Be used for respectively with each node on coloured connected dominating set path to the fewest number of hops of Centroid multiply by predetermined time slot obtain each node on coloured connected dominating set path corresponding wake time slot up so that on coloured connected dominating set path each node it corresponding is slept when waking time slot up in self no show.
Then correspondingly; Referring to Fig. 9; The emergency system for transmitting also comprises in the wireless sensor network that the embodiment of the invention provided: the node 308 on coloured connected dominating set path; Be used for receiving the emergency that the last hop node on coloured connected dominating set path is broadcasted, and emergency being broadcast to the next-hop node on coloured connected dominating set path when self is corresponding when waking time slot up and arriving.
The embodiment of the invention is through when detection node detects emergency; Detected emergency is sent to Centroid through the BFS path of setting up of leading to Centroid by detection node; When the center node receives emergency; Emergency is broadcast to the realization of the technical scheme of other nodes along the CCDS path of setting up of leading to other nodes by Centroid; The propagation delay time of warning message in the WSN network can be effectively reduced, the transmission collision of warning message in the WSN network can be avoided.
The inventive method and system embodiment can be mutually with reference to quoting.Especially, owing in method, whole flow process is described in detail, some details in the system embodiment are not described in detail again, but all can reference method embodiment.
The all or part of step that one of ordinary skill in the art will appreciate that realization the foregoing description can be accomplished through hardware; Also can instruct relevant hardware to accomplish through program; Described program can be stored in a kind of computer-readable recording medium; The above-mentioned storage medium of mentioning can be a read-only memory, disk or CD etc.
The above is merely preferred embodiment of the present invention, and is in order to restriction the present invention, not all within spirit of the present invention and principle, any modification of being done, is equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (14)
1. the method for emergency transmission in the wireless sensor network is characterized in that said method comprises:
When detection node monitors emergency, said emergency is sent to said Centroid along the breadth First path of setting up of leading to Centroid by said detection node;
When said Centroid receives said emergency, said emergency is broadcast to said other nodes along coloured UNICOM dominant set path of leading to other nodes by said Centroid of setting up.
2. method according to claim 1 is characterized in that, said said emergency is sent to said Centroid along the breadth First path of setting up of leading to Centroid by said detection node before, said method also comprises:
Each node in the wireless sensor network is carried out layering according to its fewest number of hops to said Centroid;
Setting up with said Centroid according to each internodal annexation in layering result and the said wireless senser networking is the breadth First tree of root;
On said breadth First tree, confirm to lead to the breadth First path of said Centroid, so that said detection node is minimum along the jumping figure that said breadth First path arrives said Centroid by said detection node.
3. method according to claim 1 and 2 is characterized in that, said said emergency is sent to said Centroid along the breadth First path of setting up of leading to Centroid by said detection node before, said method also comprises:
Confirm that respectively each node is to the fewest number of hops of said Centroid on the said breadth First path;
Respectively with the total timeslot number in the predetermined duty cycle deduct each node on the said breadth First path multiply by after the fewest number of hops of said Centroid predetermined time slot obtain each node on the said breadth First path corresponding wake time slot up so that each node on the said breadth First path no show self corresponding wake time slot up the time sleep.
4. method according to claim 3; It is characterized in that; Said method also comprises: when the node on the said breadth First path corresponding when waking time slot up and arriving at self; Receive the said emergency that the last hop node on the said breadth First path sends, and said emergency is sent to the next-hop node on the said breadth First path.
5. method according to claim 1 is characterized in that, said said emergency is broadcast to said other nodes along coloured UNICOM dominant set path of leading to other nodes by said Centroid of setting up before, said method also comprises:
Respectively other nodes in the said wireless sensor network are arrived the jumping figure layering of said Centroid according to it;
Confirm the isolated node in each node layer successively;
Confirm to be communicated with node in the said wireless sensor network according to determined isolated node;
Adopt interactive The Markov Chain Algorithm that determined isolated node and determined connection node are handled and obtain connected dominating set;
Be the node allocated channel in the said connected dominating set, constitute coloured connected dominating set path.
6. according to claim 1 or 5 described methods, it is characterized in that, said said emergency is broadcast to said other nodes along coloured UNICOM dominant set path of leading to other nodes by said Centroid of setting up before, said method comprises:
Confirm that respectively each node is to the fewest number of hops of said Centroid on said coloured connected dominating set path;
Respectively with each node on said coloured connected dominating set path to the fewest number of hops of said Centroid multiply by predetermined time slot obtain each node on said coloured connected dominating set path corresponding wake time slot up so that on said coloured connected dominating set path each node its no show self corresponding wake time slot up the time sleep.
7. method according to claim 6; It is characterized in that; Said method also comprises: when the node on said coloured connected dominating set path corresponding when waking time slot up and arriving at self; Receive the said emergency of the last hop node broadcasting on said coloured connected dominating set path, and said emergency is broadcast to the next-hop node on said coloured connected dominating set path.
8. emergency system for transmitting in the wireless sensor network is characterized in that said system comprises at least: detection node and Centroid,
Said detection node is used for when monitoring emergency, and said emergency is sent to said Centroid along the breadth First path of setting up of leading to said Centroid by said detection node;
Said Centroid is used for when receiving said emergency, and said emergency is broadcast to said other nodes along coloured UNICOM dominant set path of leading to other nodes by said Centroid of setting up.
9. system according to claim 8 is characterized in that, said system comprises that also the range preferred path sets up module, and said breadth First path is set up module and comprised:
The layering unit is used for each node in the wireless sensor network is carried out layering according to its fewest number of hops to said Centroid;
The breadth First tree is set up the unit, and being used for setting up with said Centroid according to each internodal annexation and layering result in the said wireless senser networking is the breadth First tree of root;
The unit is established in the breadth First path, is used for confirming to lead to the breadth First path of said Centroid by said detection node, so that said detection node is minimum along the jumping figure that said breadth First path arrives said Centroid in said breadth First tree.
10. according to Claim 8 or 9 described systems, it is characterized in that said system comprises that also first wakes the time slot allocation module up, said first wakes the time slot allocation module up comprises:
Confirm the unit, be used for confirming respectively that each node is to the fewest number of hops of said Centroid on the said breadth First path;
Time slot allocating unit; Be used for total timeslot number in the cycle that will set the tasks in advance respectively deduct each node on the said breadth First path multiply by after the fewest number of hops of said Centroid predetermined time slot obtain each node on the said breadth First path corresponding wake time slot up so that each node on the said breadth First path no show self corresponding wake time slot up the time sleep.
11. system according to claim 10; It is characterized in that; Said system also comprises: the node on the breadth First path; Be used at self correspondingly when waking time slot up and arriving, receive the said emergency of the last hop node transmission on the said breadth First path, and said emergency is sent to the next-hop node on the said breadth First path.
12. system according to claim 8 is characterized in that, said system comprises that also coloured connected dominating set path sets up module, and said coloured connected dominating set path is set up module and comprised:
The layering unit is used for each node in the said wireless sensor network according to its jumping figure layering to said Centroid;
Isolated node is confirmed the unit, is used for confirming successively the isolated node in each node layer;
Be communicated with node and confirm the unit, be used for confirming to be communicated with node in the said wireless sensor network according to determined isolated node;
The connected dominating set construction unit is used to adopt interactive The Markov Chain Algorithm that determined isolated node and determined connection node are handled and obtains connected dominating set;
Channel-assignment unit is used to the node allocated channel in the said connected dominating set, constitutes coloured connected dominating set path.
13. according to Claim 8 or 12 described systems, it is characterized in that said system comprises: second wakes the time slot allocation module up, and said second wakes the time slot allocation module up comprises:
Confirm the unit, be used for confirming respectively that each node is to the fewest number of hops of said Centroid in said coloured connected dominating set;
Time slot allocating unit; Be used for respectively with each node on said coloured connected dominating set path to the fewest number of hops of said Centroid multiply by predetermined time slot obtain each node on said coloured connected dominating set path corresponding wake time slot up so that on said coloured connected dominating set path each node it corresponding is slept when waking time slot up in self no show.
14. system according to claim 13; It is characterized in that; Said system also comprises: the node on coloured connected dominating set path; Be used for receiving the said emergency that the last hop node on said coloured connected dominating set path is broadcasted, and said emergency being broadcast to the next-hop node on said coloured connected dominating set path when self is corresponding when waking time slot up and arriving.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110393269.7A CN102497620B (en) | 2011-12-01 | 2011-12-01 | Method and system of information transmission in wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110393269.7A CN102497620B (en) | 2011-12-01 | 2011-12-01 | Method and system of information transmission in wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102497620A true CN102497620A (en) | 2012-06-13 |
| CN102497620B CN102497620B (en) | 2015-03-11 |
Family
ID=46189401
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110393269.7A Expired - Fee Related CN102497620B (en) | 2011-12-01 | 2011-12-01 | Method and system of information transmission in wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102497620B (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103280071A (en) * | 2013-06-09 | 2013-09-04 | 重庆邮电大学 | Urgency signal judging and efficient scheduling method in wireless body area network |
| CN104735755A (en) * | 2013-12-23 | 2015-06-24 | 中兴通讯股份有限公司 | Service processing method and system for wireless body area network |
| CN104865933A (en) * | 2015-03-30 | 2015-08-26 | 北京银信长远科技股份有限公司 | Method of centralized management and rapid response of wireless sensor network for cabinet environment monitoring |
| CN106303979A (en) * | 2015-06-25 | 2017-01-04 | 北京信威通信技术股份有限公司 | A kind of broadcast transmission method in self-organizing network |
| CN106878109A (en) * | 2017-03-13 | 2017-06-20 | 网宿科技股份有限公司 | Server detection method and server system |
| CN108347700A (en) * | 2017-12-29 | 2018-07-31 | 武汉船舶通信研究所（中国船舶重工集团公司第七二二研究所） | A kind of broadcasting method and broadcaster for wireless self-networking |
| CN109787898A (en) * | 2019-03-07 | 2019-05-21 | 杭州电子科技大学 | A method of the wireless sensor network downstream message energy conservation flooding based on sleep scheduling |
| CN112055405A (en) * | 2019-06-05 | 2020-12-08 | 中南大学 | Data collection method for increasing duty ratio only to connected domination centralized node |
| WO2022121234A1 (en) * | 2020-12-08 | 2022-06-16 | 三维通信股份有限公司 | Data transmission method and device, storage medium and electronic device |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101790233A (en) * | 2009-12-29 | 2010-07-28 | 中兴通讯股份有限公司 | Channel allocating method and device for multichannel multi-interface wireless mesh network |
| CN102111912A (en) * | 2011-03-09 | 2011-06-29 | 南京瀚之显电子科技有限公司 | Centralized construction method for Zigbee homogeneous tree-type wireless sensor network |
| US20110176465A1 (en) * | 2010-01-21 | 2011-07-21 | Robert Bosch Gmbh | Asynchronous low-power multi-channel media access control |
-
2011
- 2011-12-01 CN CN201110393269.7A patent/CN102497620B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101790233A (en) * | 2009-12-29 | 2010-07-28 | 中兴通讯股份有限公司 | Channel allocating method and device for multichannel multi-interface wireless mesh network |
| US20110176465A1 (en) * | 2010-01-21 | 2011-07-21 | Robert Bosch Gmbh | Asynchronous low-power multi-channel media access control |
| CN102111912A (en) * | 2011-03-09 | 2011-06-29 | 南京瀚之显电子科技有限公司 | Centralized construction method for Zigbee homogeneous tree-type wireless sensor network |
Non-Patent Citations (2)
| Title |
|---|
| KUI ZHANG,N.MERATNIA,P.J.M.HAVINGA,PENG GUO: "Demo Abstract: Fast Alarm Broadcasting in Critical Event event monitoring using wireless sensor networks", 《HTTP://DOC.UTWENTE.NL/74236/》 * |
| L.G,K.B,R.C: "An adaptive energy-efficient and low-latency mac for data gathering in wireless sensor networks", 《IEEE》 * |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103280071A (en) * | 2013-06-09 | 2013-09-04 | 重庆邮电大学 | Urgency signal judging and efficient scheduling method in wireless body area network |
| CN103280071B (en) * | 2013-06-09 | 2016-01-06 | 重庆邮电大学 | The judgement of urgent signal and efficient dispatching method in wireless body area network |
| CN104735755A (en) * | 2013-12-23 | 2015-06-24 | 中兴通讯股份有限公司 | Service processing method and system for wireless body area network |
| WO2015096339A1 (en) * | 2013-12-23 | 2015-07-02 | 中兴通讯股份有限公司 | Service processing method and system for wireless body area network |
| CN104735755B (en) * | 2013-12-23 | 2019-10-11 | 中兴通讯股份有限公司 | A kind of method and system of the business processing of wireless body area network |
| CN104865933A (en) * | 2015-03-30 | 2015-08-26 | 北京银信长远科技股份有限公司 | Method of centralized management and rapid response of wireless sensor network for cabinet environment monitoring |
| CN106303979B (en) * | 2015-06-25 | 2019-06-21 | 北京信威通信技术股份有限公司 | A kind of broadcast transmission method in self-organizing network |
| CN106303979A (en) * | 2015-06-25 | 2017-01-04 | 北京信威通信技术股份有限公司 | A kind of broadcast transmission method in self-organizing network |
| CN106878109A (en) * | 2017-03-13 | 2017-06-20 | 网宿科技股份有限公司 | Server detection method and server system |
| CN108347700A (en) * | 2017-12-29 | 2018-07-31 | 武汉船舶通信研究所（中国船舶重工集团公司第七二二研究所） | A kind of broadcasting method and broadcaster for wireless self-networking |
| CN108347700B (en) * | 2017-12-29 | 2021-02-26 | 武汉船舶通信研究所（中国船舶重工集团公司第七二二研究所） | Broadcasting method and broadcasting device for wireless ad hoc network |
| CN109787898A (en) * | 2019-03-07 | 2019-05-21 | 杭州电子科技大学 | A method of the wireless sensor network downstream message energy conservation flooding based on sleep scheduling |
| CN112055405A (en) * | 2019-06-05 | 2020-12-08 | 中南大学 | Data collection method for increasing duty ratio only to connected domination centralized node |
| WO2022121234A1 (en) * | 2020-12-08 | 2022-06-16 | 三维通信股份有限公司 | Data transmission method and device, storage medium and electronic device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102497620B (en) | 2015-03-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102497620A (en) | Method and system of information transmission in wireless sensor network | |
| Mangharam et al. | Voice over sensor networks | |
| CN102149160B (en) | Energy perception routing algorithm used for wireless sensing network | |
| Sitanayah et al. | ER-MAC: A hybrid MAC protocol for emergency response wireless sensor networks | |
| Gobriel et al. | TDMA-ASAP: Sensor network TDMA scheduling with adaptive slot-stealing and parallelism | |
| CN102057731B (en) | Method of establishing a wireless multi-hop network | |
| US20090010190A1 (en) | Path Selection and Power Management in Mesh Networks | |
| CN101489275A (en) | Relay wireless sensor network routing method based on energy balance and distance cooperation | |
| CN102026329A (en) | Wireless communication network and self-adaptive route selecting communication method thereof | |
| Sarang et al. | Energy-efficient asynchronous QoS MAC protocol for wireless sensor networks | |
| Afroz et al. | Energy-efficient MAC protocols for wireless sensor networks: A survey | |
| Liang et al. | SW-MAC: A low-latency MAC protocol with adaptive sleeping for wireless sensor networks | |
| CN103634913A (en) | Clustering-based multi-hop multi-channel cognitive wireless sensor network communication method | |
| Ajmi et al. | SPEECH‐MAC: Special purpose energy‐efficient contention‐based hybrid MAC protocol for WSN and Zigbee network | |
| CN104349418A (en) | Rapid routing transmission method for data in wireless sensor network facing sudden events | |
| EP3304996B1 (en) | Adaptive time slot allocation in tsch wireless communication network | |
| CN102083164A (en) | Method for opportunistic routing of wireless sensor network (WSN) based on energy perception | |
| Aziz et al. | A new improved algorithm of leach protocol for wireless sensor networks | |
| Kazmi et al. | Recent MAC protocols for mobility-aware wireless sensor networks—a survey and future directions | |
| Al-Nidawi et al. | Mesh-under cluster-based routing protocol for IEEE 802.15. 4 sensornetwork | |
| KR20100112869A (en) | Method of processing communication in node composed wireless sensor network for low power | |
| Feng et al. | An adaptive data gathering strategy for target tracking in cluster-based wireless sensor networks | |
| CN101651925B (en) | Point-to-multipoint channel booking method | |
| Abid et al. | Collision free communication for energy saving in wireless sensor networks | |
| Mathioudakis et al. | Wireless sensor networks: A case study for energy efficient environmental monitoring |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20150311 Termination date: 20161201 |