CN102497620B - 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
- CN102497620B CN102497620B CN201110393269.7A CN201110393269A CN102497620B CN 102497620 B CN102497620 B CN 102497620B CN 201110393269 A CN201110393269 A CN 201110393269A CN 102497620 B CN102497620 B CN 102497620B
- 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.)
- Expired - Fee Related
Links
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, particularly the method and system of emergency transmissions in a kind of wireless sensor network.
Background technology
Wireless sensor network widespread deployment and be applied to the important application scenarios such as battle reconnaissance, forest fire detection or coal mine gas detection, user configures usually as the communication equipments such as PDA (Personal Digital Assistant, personal digital assistant) communicate as the node in wireless sensor network.
When a certain nodal test in wireless sensor network occurs to emergency, must the warning message of other all these emergencies of node broadcasts in wireless sensor network as early as possible, so that user makes a response to this emergency fast, ensure the life of people and the safety of property.Therefore, must design an efficient information transmission scheme in wireless sensor network, guarantee emergency can from all nodes being broadcast in whole wireless sensor network other of any node low time delay.
Summary of the invention
In order to emergency from all nodes being broadcast in whole wireless sensor network other of any node low time delay, can be embodiments provided the method and system of emergency transmissions in a kind of wireless sensor network.Described technical scheme is as follows:
In wireless sensor network, a method for emergency transmissions, is characterized in that, described method comprises:
When detection node monitors emergency, described emergency is sent to described Centroid along the breadth First path leading to Centroid by described detection node set up;
When described Centroid receives described emergency, described emergency is broadcast to other nodes described along the coloured UNICOM's dominant set path leading to other nodes by described Centroid set up.
In wireless sensor network, a system for emergency transmissions, is characterized in that, described system at least comprises: detection node and Centroid,
Described detection node, for when monitoring emergency, sends to described Centroid by described emergency along the breadth First path leading to described Centroid by described detection node set up;
Described Centroid, for when receiving described emergency, is broadcast to other nodes described by described emergency along the coloured UNICOM's dominant set path leading to other nodes by described Centroid set up.
The embodiment of the present invention is by when detection node detects emergency, the emergency detected is sent to Centroid by the BFS path leading to Centroid by detection node set up, when Centroid receives emergency, emergency is broadcast to the realization of the technical scheme of other nodes along the CCDS path leading to other nodes by Centroid set up, effectively can reduce the propagation delay time of warning message in WSN network, the transmission collision of warning message in WSN network can be avoided.
Accompanying drawing explanation
In order to be illustrated more clearly in the technical scheme in the embodiment of the present invention, below the accompanying drawing used required in describing embodiment is briefly described, apparently, accompanying drawing in the following describes is only some embodiments of the present invention, for those of ordinary skill in the art, under the prerequisite not paying creative work, other accompanying drawing can also be obtained according to these accompanying drawings.
Fig. 1 is the method flow diagram of emergency transmissions in a kind of wireless sensor network of providing of the embodiment of the present invention 1;
Fig. 2 is the method flow diagram of emergency transmissions in a kind of wireless sensor network of providing of the embodiment of the present invention 2;
Fig. 3 is BFS path schematic diagram in the wireless sensor network that provides of the embodiment of the present invention 2;
Fig. 4 is CCDS path schematic diagram in the wireless sensor network that provides of the embodiment of the present invention 2;
Fig. 5 is the present invention when using the time slot of 2ms, and the simulation result of the propagation delay time of the present invention and prior art contrasts schematic diagram;
Fig. 6 is the present invention when using the time slot of 10ms, and the simulation result of the propagation delay time of the present invention and prior art contrasts schematic diagram;
Fig. 7 is the present invention when using the time slot of 20ms, and the simulation result of the propagation delay time of the present invention and prior art contrasts schematic diagram;
Fig. 6 is the present invention when using the time slot of 10ms, and the simulation result of the propagation delay time of the present invention and prior art contrasts schematic diagram;
Fig. 8 is the system schematic of emergency transmissions in a kind of wireless sensor network of providing of the embodiment of the present invention 3;
Fig. 9 is the system schematic of emergency transmissions in a kind of wireless sensor network of providing of the embodiment of the present invention 3.
Embodiment
For making the object, technical solutions and advantages of the present invention clearly, below in conjunction with accompanying drawing, embodiment of the present invention is described further in detail.
Embodiment 1
See Fig. 1, a kind of method of emergency transmissions in wireless sensor network, this method specifically comprises following operation:
Step 101: when detection node monitors emergency, sends to Centroid by emergency along the breadth First path leading to Centroid by detection node set up;
Step 102: when Centroid receives emergency, is broadcast to other nodes by emergency along the coloured UNICOM's dominant set path leading to other nodes by Centroid set up.
The embodiment of the present invention is by when detection node detects emergency, the emergency detected is sent to Centroid by the BFS path leading to Centroid by detection node set up, when Centroid receives emergency, emergency is broadcast to the realization of the technical scheme of other nodes along the CCDS path leading to other nodes by Centroid set up, effectively can reduce the propagation delay time of warning message in WSN network, the transmission collision of warning message in WSN network can be avoided.
Embodiment 2
In the embodiment of the present invention, the some nodes in WSN network obtain the topology of whole WSN network when initialization, and particularly, node can obtain whole WSN topology of networks by such as deep packet Detection Techniques etc.; The node that this is obtained WSN network topology by the present invention is in real time called the Centroid of this WSN network, the mode that Centroid passes through such as to broadcast is by other nodes in the information notification WSN networks such as the address of self, and this Centroid can also identify self by such as writing the modes such as mark in circuit.
In the embodiment of the present invention, WSN network node received packet from its adjacent node or transmits packet to the minimum time of its adjacent node, being designated as τ, this τ being referred to as a time slot here;
In the embodiment of the present invention, a packet is passed to all nodes in whole WSN network and knows that the time used is called a duty cycle by the detection node in WSN network, is designated as T, wherein, T=L* τ, L are timeslot number total in each duty cycle, and the scale according to WSN network presets;
In the embodiment of the present invention, each node in WSN network is in order to reduce energy ezpenditure, sleep when not working, with reach node work when not changing battery longer time object, and the node in WSN network is all assigned the time slot that wakes up of self according to the slot allocation method preset, sleeping nodes only self wake up time slot arrive time, could wake up to receive from sleep state and receive packet from other nodes, in addition, it should be noted is that, node is after receiving packet, this packet can be sent to other nodes in any time slot in duty cycle.
The technical scheme that the embodiment of the present invention provides specifically comprises: set up BFS (the BreadthFirst Search being led to Centroid by detection node, range is preferred) path and led to CCDS (Colour ConnectDominant Set, the coloured connected dominating set) path of other nodes in WSN network by Centroid; When detection node detects emergency, emergency is sent to Centroid along described BFS path, emergency, when receiving emergency, is broadcast to other nodes in WSN network by Centroid along described CCDS path; Thus emergency low time delay can be passed to whole WSN network without broadcast collision by detection node.
Describe above-mentioned detection node in detail below in conjunction with specific embodiment and the emergency low time delay detected is passed to the method for whole WSN network without broadcast collision, see Fig. 2, in wireless sensor network, a method for emergency transmissions, specifically comprises the steps:
Step 201: set up the BFS path being led to Centroid by detection node;
In the embodiment of the present invention, the BFS path being led to Centroid by detection node just can be set up when WSN netinit, also the BFS path of the Centroid that to be passed through by detection node can be set up again when emergency being detected, particularly, set up the method for leading to the BFS path of Centroid by detection node to comprise:
The fewest number of hops that node each in WSN network arrives Centroid according to it is carried out layering;
Be the breadth First tree of root with Centroid according to internodal annexation foundation each in layering result and WSN network;
In the embodiment of the present invention, using the ground floor node arriving node that the fewest number of hops of Centroid is 1 in WSN network and set as set up breadth First, using the second layer node arriving node that the fewest number of hops of Centroid is 2 in WSN network and set as set up breadth First, the like;
On set up breadth First tree, determine the BFS path being arrived Centroid by detection node, so that detection node is minimum along the jumping figure during arrival Centroid of this BFS path.
Step 202: for each peer distribution on BFS path wakes time slot up;
In the embodiment of the present invention, each node on BFS path do not arrive its correspondence wake time slot up time dormancy, wherein, node can not receive any emergency being sent to self in the dormant state; Node on BFS path arrive self correspondence wake time slot up time, just can receive the packet being sent to self.
Like this, by the mode of node dormancy can make node work when not changing battery longer time object, energy savings pay wages.
Particularly, comprise for each peer distribution on BFS path wakes time slot up:
Determine that on BFS path, each node is to the fewest number of hops of Centroid respectively;
Respectively the total timeslot number in predefined duty cycle is deducted BFS path is multiplied by after each node to the fewest number of hops of Centroid predetermined time slot obtain each node on BFS path corresponding wake time slot up so that each node on BFS path do not arrive self correspondence wake time slot up time sleep.
Step 203: when detection node detects emergency, by detecting the cautious BFS path leading to Centroid, emergency is sent to Centroid along what set up, wherein, emergency comprises as fire or gas leak etc.;
In the embodiment of the present invention, the node on BFS path self correspondence wake up time slot arrive time, receive the emergency that the upper hop node on BFS sends, and emergency sent to the next-hop node on BFS path;
In the embodiment of the present invention, on BFS path, node is after receiving emergency, all can send emergency to the next-hop node on BFS path by the arbitrary time slot in duty cycle.
Now illustrate the specific implementation process of above-mentioned steps, as follows:
WSN network as shown in Figure 3, the BFS path of what detection node a set up lead to Centroid C 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 present invention, the jumping figure that Centroid c reaches Centroid c is 0, total timeslot number L then in the duty cycle preset is 10, the time slot that wakes up assigned by detection node a is (10-2) τ=8 τ, the time slot that wakes up assigned by node b is (10-1) τ=9 τ, the time slot that wakes up assigned by Centroid c is (10-0) τ=10 (0) τ, here, why Centroid to wake time slot up be 0 is value because the span waking time slot up of each node in the embodiment of the present invention circulates between 0 to (10-1) τ.
So, establish each joint on the BFS path and BFS path being led to Centroid by detection node be all assigned with respective wake time slot up after, specifically describe the transmitting procedure of emergency on BFS path below, as follows:
Detection node a is after detection obtains emergency, the emergency detected is sent to Centroid along set up BFS path, first, the emergency detected can be sent to next-hop node on BFS path, namely node b by the arbitrary time slot in duty cycle by detection node a; Now, if node b is in running order, then node b receives the emergency that sends of detection node a, if node b is in resting state, then node b waits for the arrival self waking time slot up, and the emergency waking time slot reception detection node a up and send; Afterwards, the emergency received can be sent to next-hop node c on this BFS path by the arbitrary time slot in duty cycle by node b; Same, if node c is now in running order, then node c receives the upper hop node on BFS path, the namely emergency that sends of node b, if node c is in resting state, then node c waits for the arrival self waking time slot up, and the emergency waking time slot receiving node c up and send.
Step 204: set up the CCDS path being led to other nodes by Centroid;
In the embodiment of the present invention, the CCDS path that Centroid leads to other nodes just can be set up when WSN netinit, also can set up the CCDS path being led to other nodes by Centroid after Centroid receives emergency, set up the method for leading to the CCDS path of other nodes by Centroid and comprise the steps:
Step 1, respectively other nodes in WSN network are divided into N layer according to its jumping figure to Centroid, N be more than or equal to 1 natural number;
Particularly, determine that in WSN network, other nodes arrive the fewest number of hops of Centroid, are divided into one deck by node identical for the fewest number of hops arriving Centroid respectively;
In the embodiment of the present invention, using the fewest number of hops arriving Centroid in other nodes be each node of 1 as ground floor node, using the fewest number of hops reaching Centroid in other nodes be each node of 2 as second layer node, the like.
Step 2, the isolated node determining 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 MIS set as isolated node;
In the i-th node layer, search node non-conterminous with MIS interior joint, often find non-conterminous node in and MIS, the node just this found adds in MIS set as isolated node; Afterwards, continue to search in the i-th node layer with upgrade after the non-conterminous node of isolated node in MIS, and the node again found is added MIS set as isolated node; Then, continue to perform search in the i-th node layer with upgrade after the non-conterminous node of isolated node in MIS, and the node again found is added the operation of MIS set as isolated node, circulation like this performs, until search in the i-th node layer less than node non-conterminous with isolated node in MIS.
Wherein, i is the self-heating number of value from 1, is less than or equal to N.
Step 3, the connection node determined according to determined isolated node in WSN network;
Particularly, isolated node on K layer is formed an isolated node collection I_i, in the dependent node in the last layer or two-layer node of K layer isolated node collection, find out the Minimum covering set that can cover K layer isolated node collection I_i, the node in this Minimum covering set is connection node.
Step 4, employing IMC (Interactive Markov chains, interactive Markov chains) algorithm carry out process to determined isolated node and connection set of node and obtain CDS set;
The one preferred implementation of this step is:
Connection set of node is designated as W_i, 1, finds out a set U_i, 1, make this U_i in MIS set, 1 set interior joint all only has the adjacent node of a node at W_i, in 1;
At W_i, find out a subset in 1, make found out subset for can cover I_i-U_i, the minimal set of 1, is designated as W_i, and 2;
At I_i-U_i, find out a set U_i in 1,2, make this set U_i, 2 interior joint all only have the adjacent node of a node at W i, in 2;
At W_i, find out a subset in 2, make this subset for can cover I_i-U_i, I_i-U_i, the minimal set of 2, is designated as W_i, and 3;
Thus obtain CDS set U_i, j and W_i, j, 1 <=j <=3;
Can be known by the process building connected dominating set above, connected dominating set W_i, j and U_i, j interior joint is positioned at different layerings, therefore work as W_i, during node broadcasts emergency in j, the node in U_i, j can not be conflicted.
Step 5, be CDS concentrate peer distribution channel, form CCDS path;
The one preferential implementation of this step is:
Nodes all in CDS is divided into three set according to it in the minimum hop count of CDS centre to centre heart node C: isolated node collection (I), connection set of node (C) and dominate node collection (B), wherein, isolated node integrates jumping figure at CDS centre to centre heart node C as even number, 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, C5, Dominate node integrates the jumping figure of road Centroid C in CDS as even number, is designated as B0, B2, B4,
Each node in the CDS obtain above-mentioned steps 4 respectively allocated channel obtains connected dominating set path, in the embodiment of the present invention, each node connected in CDS being coloured to CCDS path with being no more than 12 channels, being specially:
Transmitting channel chs (channel send) and receive channel chr (channelreceive) is defined to each node nk in CDS collection, each node nk in isolated node collection I (Ii) and dominate node collection (B) according to it at Ui, color getter transmitting channel chs in j, each node nt in connected set according to its father node (Ii-1) at Wi, color in j (0≤j≤3) obtains receive channel chr, each node nk in independent sets I (Ii) according to it at Ui, color getter receive channel chr in j, each node nt in connected set according to its father node (Ii-1) at Wi, color in j (0≤j≤3) obtains receive channel chr, like this, each node just can separately transmit and receive data, thus make each node to produce broadcast collision.
Step 205: for each peer distribution on CCDS path wakes time slot up;
In the embodiment of the present invention, each node on CCDS path do not arrive its correspondence wake time slot up time dormancy, wherein, node can not receive any emergency being sent to self in the dormant state; Node on CCDS path arrive self correspondence wake time slot up time, just can receive the packet being sent to self.
Like this, by the mode of node dormancy can make node work when not changing battery longer time object, energy savings pay wages.
Particularly, comprise for each peer distribution on CCDS path wakes time slot up:
Determine that on CCDS path, each node is to the fewest number of hops of Centroid respectively;
Respectively by node each on CCDS path to the fewest number of hops of Centroid be multiplied by predetermined time slot obtain each node on CCDS path corresponding wake time slot up so that on CCDS path each node self do not arrive its correspondence wake time slot up time sleep.
Step 206: when Centroid receives emergency, along the emergency that the CCDS path broadcast reception of leading to other nodes of setting up is arrived;
In the embodiment of the present invention, when the node on CCDS path self correspondence wake up time slot arrive time, receive the emergency of the upper hop node broadcasts on CCDS path, and by emergency broadcasts to the next-hop node on CCDS path.
In the embodiment of the present invention, on BFS path, node is after receiving emergency, all can send emergency to the next-hop node on BFS path by the arbitrary time slot in duty cycle.
In the embodiment of the present invention, on CCDS path, node is after receiving emergency, all can arbitrary time slot in duty cycle to the next-hop node broadcasting emergency event on CCDS path.
Fig. 4 for when a kind of Centroid that the embodiment of the present invention provides receives emergency to the instance graph along CCDS path to other node broadcasts emergencies.
In addition, in the embodiment of the present invention, the distribution waking time slot up of the node on the distribution waking time slot up of the node on BFS path and CCDS path refers to table 1.
The Schedule of each node in table 1:WSN network
The embodiment of the present invention is by when detection node detects emergency, the emergency detected is sent to Centroid by the BFS path leading to Centroid by detection node set up, when Centroid receives emergency, emergency is broadcast to the realization of the technical scheme of other nodes along the CCDS path leading to other nodes by Centroid set up, effectively can reduce the propagation delay time of warning message in WSN network, the transmission collision of warning message in WSN network can be avoided.
Below, come by the result of emulation experiment the description embodiment of the present invention of visualize provide technical scheme to bring beneficial effect:
Adopt the experimental situation of NS-2 network simulation, wherein, the nodes in the NS-2 network that this experiment adopts is the area size 150*150m of 225, NS-2 network, and supposes that the success rate of two inter-node communications in NS-2 network is p=1-(d/20)
2, wherein, d is the distance of two nodes.
The embodiment of the present invention adopts technical scheme: duty cycle arranges and is 1s, time slot is set to 2ms, 10ms or 20ms respectively, and the number of times carrying out testing under each time slot is 10, detect respectively and emergency detected from detection node, issue Centroid along BFS path, Centroid is broadcast to the time delay of other nodes along CCDS path.
In contrast scheme 1:DW-MAC (MAC layer scheduling on demand algorithm), sensor node storing information forwards again, detects detection node and is detecting that an emergency is to the time delay known to whole net by this emergency transmissions.
In contrast scheme 2:ADB (asynchronous task periodic broadcasting), sensor node adopts asynchronous system, in the ideal case, each propagation delay time of jumping is the half of duty cycle, detects detection node and is detecting that an emergency is to the time delay known to whole net by this emergency transmissions.
When Fig. 5 is the time slot of technical solution of the present invention use 2ms, the simulation result of the propagation delay time of technical solution of the present invention and prior art contrasts schematic diagram;
When Fig. 6 is the time slot of technical solution of the present invention use 10ms, the simulation result of the propagation delay time of technical solution of the present invention and prior art contrasts schematic diagram;
When Fig. 7 is the time slot of technical solution of the present invention use 20ms, the simulation result of the propagation delay time of technical solution of the present invention and prior art contrasts schematic diagram;
Then as can be seen from Fig. 5,6 and 7, when adopting technical solution of the present invention, in wireless sensor network, the propagation delay time of emergency is significantly less than prior art.
Embodiment 3
See Fig. 8, the system of emergency transmissions in a kind of wireless sensor network, this system at least comprises: detection node 301 and Centroid 302,
Detection node 301, for when monitoring emergency, sends to Centroid by emergency along the breadth First path leading to Centroid by detection node set up;
Centroid 302, for when receiving emergency, is broadcast to other nodes by emergency along the coloured UNICOM's dominant set path leading to other nodes by Centroid set up.
See Fig. 9, in the embodiment of the present invention, in wireless sensor network, the system of emergency transmissions also comprises: range preferred path sets up that module 303, first wakes 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, range preferred path is set up module 303 and is comprised:
Delaminating units, for carrying out layering by node each in wireless sensor network according to its fewest number of hops to Centroid;
Breadth First tree sets up unit, is the breadth First tree of root for setting up according to internodal annexation each in wireless sensor and actor networks and layering result with Centroid;
Unit is established in breadth First path, in breadth First tree, determines the breadth First path being led to Centroid by detection node, so that detection node arrives Centroid jumping figure along breadth First path is minimum.
First wakes time slot allocation module 304 up comprises:
Determining unit, for determining that on breadth First path, each node is to the fewest number of hops of Centroid respectively;
Time slot allocating unit, for respectively the total timeslot number in predefined duty cycle is deducted breadth First path is multiplied by after each node to the fewest number of hops of Centroid predetermined time slot obtain each node on breadth First path corresponding wake time slot up so that each node on breadth First path do not arrive self correspondence wake time slot up time sleep.
Then correspondingly, see Fig. 9, in the wireless sensor network that the embodiment of the present invention provides, the system of emergency transmissions also comprises: the node 307 on breadth First path, for self correspondence wake up time slot arrive time, receive the emergency that the upper hop node on breadth First path sends, and emergency is sent to the next-hop node on breadth First path.
Module 305 is set up in coloured connected dominating set path, leading to coloured connected dominating set path of other nodes, comprising for setting up Centroid:
Delaminating units, for arriving the jumping figure layering of Centroid according to it by node each in wireless sensor network;
Isolated node determining unit, for determining the isolated node in each node layer successively;
Be communicated with node determining unit, for being communicated with node according in determined isolated node determination wireless sensor network;
Connected dominating set construction unit, carries out process for adopting interactive Markov chains algorithm to determined isolated node and determined connection node and obtains connected dominating set;
Channel-assignment unit, for being the peer distribution channel in connected dominating set, forms coloured connected dominating set path.
Second wakes time slot allocation module up comprises 306 and comprises:
Determining unit, for determining that in coloured connected dominating set, each node is to the fewest number of hops of Centroid respectively;
Time slot allocating unit, for respectively by each node on coloured connected dominating set path to the fewest number of hops of Centroid be multiplied 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 self do not arrive its correspondence wake time slot up time sleep.
Then correspondingly, see Fig. 9, in the wireless sensor network that the embodiment of the present invention provides, the system of emergency transmissions also comprises: the node 308 on coloured connected dominating set path, for when self correspondence wake up time slot arrive time, receive the emergency of the upper hop node broadcasts on coloured connected dominating set path, and give the next-hop node on coloured connected dominating set path by emergency broadcasts.
The embodiment of the present invention is by when detection node detects emergency, the emergency detected is sent to Centroid by the BFS path leading to Centroid by detection node set up, when Centroid receives emergency, emergency is broadcast to the realization of the technical scheme of other nodes along the CCDS path leading to other nodes by Centroid set up, effectively can reduce the propagation delay time of warning message in WSN network, the transmission collision of warning message in WSN network can be avoided.
The inventive method and system embodiment, can mutually with reference to quoting.Especially, owing to being described in detail whole flow process in method, some details in system embodiment have not been described in detail again, but all can reference method embodiment.
One of ordinary skill in the art will appreciate that all or part of step realizing above-described embodiment can have been come by hardware, the hardware that also can carry out instruction relevant by program completes, described program can be stored in a kind of computer-readable recording medium, the above-mentioned storage medium mentioned can be read-only memory, disk or CD etc.
The foregoing is only preferred embodiment of the present invention, not in order to limit the present invention, within the spirit and principles in the present invention all, any amendment done, equivalent replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (12)
1. the method for emergency transmissions in wireless sensor network, it is characterized in that, described method comprises:
When detection node monitors emergency, described emergency is sent to described Centroid along the breadth First path leading to Centroid by described detection node set up;
When described Centroid receives described emergency, described emergency is broadcast to other nodes described along the coloured UNICOM's dominant set path leading to other nodes by described Centroid set up;
Described described emergency is broadcast to other nodes described along the coloured UNICOM's dominant set path leading to other nodes by described Centroid set up before, described method also comprises:
Respectively other nodes in described wireless sensor network are arrived the jumping figure layering of described Centroid according to it;
Determine the isolated node in each node layer successively;
Determine to be communicated with node in described wireless sensor network according to determined isolated node;
Adopt interactive Markov chains algorithm to carry out process to determined isolated node and determined connection node and obtain connected dominating set;
For the peer distribution channel in described connected dominating set, form coloured connected dominating set path;
Wherein, the described isolated node determined successively in each node layer, comprising:
Set up maximum independent set to close, described Centroid is put into described maximum independent set as isolated node close, the non-conterminous node of node in closing with described maximum independent set is searched in the i-th node layer, the non-conterminous node of node in often finding one to close with described maximum independent set, the described node being about to find adds in the conjunction of described maximum independent set as isolated node, continue search in described i-th node layer with upgrade after described maximum independent set close in the non-conterminous node of isolated node, until search in described i-th node layer less than the non-conterminous node of isolated node in closing with described maximum independent set.
2. method according to claim 1, is characterized in that, described described emergency is sent to described Centroid along the breadth First path leading to Centroid by described detection node set up before, described method also comprises:
Node each in wireless sensor network is carried out layering according to its fewest number of hops to described Centroid;
Set with the breadth First that described Centroid is root according to internodal annexation foundation each in layering result and described wireless sensor and actor networks;
On described breadth First tree, determine the breadth First path being led to described Centroid by described detection node, so that the jumping figure that described detection node arrives described Centroid along described breadth First path is minimum.
3. method according to claim 1 and 2, it is characterized in that, described described emergency is sent to described Centroid along the breadth First path leading to Centroid by described detection node set up before, described method also comprises: determine that on described breadth First path, each node is to the fewest number of hops of described Centroid respectively; Respectively the total timeslot number in predetermined duty cycle is deducted described breadth First path is multiplied by after each node to the fewest number of hops of described Centroid predetermined time slot obtain each node on described breadth First path corresponding wake time slot up so that each node on described breadth First path do not arrive self correspondence wake time slot up time sleep.
4. method according to claim 3, it is characterized in that, described method also comprises: when the node on described breadth First path self correspondence wake up time slot arrive time, receive the described emergency that the upper hop node on described breadth First path sends, and described emergency is sent to the next-hop node on described breadth First path.
5. method according to claim 1, it is characterized in that, described described emergency is broadcast to other nodes described along the coloured UNICOM's dominant set path leading to other nodes by described Centroid set up before, described method comprises: determine that on described coloured connected dominating set path, each node is to the fewest number of hops of described Centroid respectively; Respectively by each node on described coloured connected dominating set path to the fewest number of hops of described Centroid be multiplied by predetermined time slot obtain each node on described coloured connected dominating set path corresponding wake time slot up so that on described coloured connected dominating set path each node its do not arrive self correspondence wake time slot up time sleep.
6. method according to claim 5, it is characterized in that, described method also comprises: when the node on described coloured connected dominating set path self correspondence wake up time slot arrive time, receive the described emergency of the upper hop node broadcasts on described coloured connected dominating set path, and give the next-hop node on described coloured connected dominating set path by described emergency broadcasts.
7. the system of emergency transmissions in wireless sensor network, it is characterized in that, described system at least comprises: detection node and Centroid,
Described detection node, for when monitoring emergency, sends to described Centroid by described emergency along the breadth First path leading to described Centroid by described detection node set up;
Described Centroid, for when receiving described emergency, is broadcast to other nodes described by described emergency along the coloured UNICOM's dominant set path leading to other nodes by described Centroid set up;
Described system also comprises coloured connected dominating set path and sets up module, and described coloured connected dominating set path is set up module and comprised:
Delaminating units, for arriving the jumping figure layering of described Centroid according to it by node each in described wireless sensor network;
Isolated node determining unit, for determining the isolated node in each node layer successively;
Being communicated with node determining unit, being communicated with node for determining according to determined isolated node in described wireless sensor network;
Connected dominating set construction unit, carries out process for adopting interactive Markov chains algorithm to determined isolated node and determined connection node and obtains connected dominating set;
Channel-assignment unit, for being the peer distribution channel in described connected dominating set, forms coloured connected dominating set path;
Wherein, described isolated node determining unit, close for setting up maximum independent set, described Centroid is put into described maximum independent set as isolated node close, the non-conterminous node of node in closing with described maximum independent set is searched in the i-th node layer, the non-conterminous node of node in often finding one to close with described maximum independent set, the described node being about to find adds in the conjunction of described maximum independent set as isolated node, continue search in described i-th node layer with upgrade after described maximum independent set close in the non-conterminous node of isolated node, until search in described i-th node layer less than the non-conterminous node of isolated node in closing with described maximum independent set.
8. system according to claim 7, is characterized in that, described system also comprises range preferred path and sets up module, and described breadth First path is set up module and comprised:
Delaminating units, for carrying out layering by node each in wireless sensor network according to its fewest number of hops to described Centroid;
Breadth First tree sets up unit, for setting with the breadth First that described Centroid is root according to internodal annexation each in described wireless sensor and actor networks and the foundation of layering result;
Unit is established in breadth First path, in described breadth First tree, determines the breadth First path being led to described Centroid by described detection node, so that the jumping figure that described detection node arrives described Centroid along described breadth First path is minimum.
9. the system according to claim 7 or 8, is characterized in that, described system also comprises first and wakes time slot allocation module up, and described first wakes time slot allocation module up comprises:
First determining unit, for determining that on described breadth First path, each node is to the fewest number of hops of described Centroid respectively;
First time slot allocating unit, for respectively the total timeslot number in predefined duty cycle is deducted described breadth First path is multiplied by after each node to the fewest number of hops of described Centroid predetermined time slot obtain each node on described breadth First path corresponding wake time slot up so that each node on described breadth First path do not arrive self correspondence wake time slot up time sleep.
10. system according to claim 9, it is characterized in that, described system also comprises: the node on breadth First path, for self correspondence wake up time slot arrive time, receive the described emergency that the upper hop node on described breadth First path sends, and described emergency is sent to the next-hop node on described breadth First path.
11. systems according to claim 7, is characterized in that, described system comprises: second wakes time slot allocation module up, and described second wakes time slot allocation module up comprises:
Second determining unit, for determining that in described coloured connected dominating set, each node is to the fewest number of hops of described Centroid respectively;
Second time slot allocating unit, for respectively by each node on described coloured connected dominating set path to the fewest number of hops of described Centroid be multiplied by predetermined time slot obtain each node on described coloured connected dominating set path corresponding wake time slot up so that on described coloured connected dominating set path each node self do not arrive its correspondence wake time slot up time sleep.
12. systems according to claim 11, it is characterized in that, described system also comprises: the node on coloured connected dominating set path, for when self correspondence wake up time slot arrive time, receive the described emergency of the upper hop node broadcasts on described coloured connected dominating set path, and give the next-hop node on described coloured connected dominating set path by described emergency broadcasts.
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 CN102497620A (en) | 2012-06-13 |
| CN102497620B true 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) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103280071B (en) * | 2013-06-09 | 2016-01-06 | 重庆邮电大学 | The judgement of urgent signal and efficient dispatching method in 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 |
| CN106878109A (en) * | 2017-03-13 | 2017-06-20 | 网宿科技股份有限公司 | Server detection method and server system |
| 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 |
| CN112566210B (en) * | 2020-12-08 | 2022-12-27 | 三维通信股份有限公司 | Data transmission method and device, storage medium and electronic device |
Citations (2)
| 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 |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8588119B2 (en) * | 2010-01-21 | 2013-11-19 | 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 (2)
| 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 |
Non-Patent Citations (2)
| Title |
|---|
| An adaptive energy-efficient and low-latency mac for data gathering in wireless sensor networks;L.G,K.B,R.C;《IEEE》;20040430;全文 * |
| Demo Abstract: Fast Alarm Broadcasting in Critical Event event monitoring using wireless sensor networks;Kui Zhang,N.Meratnia,P.J.M.Havinga,Peng Guo;《http://doc.utwente.nl/74236/》;20101105;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102497620A (en) | 2012-06-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102497620B (en) | Method and system of information transmission in wireless sensor network | |
| Rowe et al. | RT-Link: A time-synchronized link protocol for energy-constrained multi-hop wireless networks | |
| CN102057731B (en) | Method of establishing a wireless multi-hop network | |
| Gobriel et al. | TDMA-ASAP: Sensor network TDMA scheduling with adaptive slot-stealing and parallelism | |
| CN105934976B (en) | The method, apparatus and master-slave network electricity-saving system of master-slave network suspend mode and wake-up | |
| Jin et al. | A hierarchical data transmission framework for industrial wireless sensor and actuator networks | |
| CN101489275A (en) | Relay wireless sensor network routing method based on energy balance and distance cooperation | |
| Maitra et al. | A comparative study on popular MAC protocols for mixed Wireless Sensor Networks: From implementation viewpoint | |
| Algora et al. | Review and classification of multichannel MAC protocols for low-power and lossy networks | |
| Sarang et al. | Energy‐efficient asynchronous QoS MAC protocol for wireless sensor networks | |
| US20230155915A1 (en) | Adaptive time slot allocation to reduce latency and power consumption in a time slotted channel hopping wireless communication network | |
| Montero et al. | Neighbor discovery for industrial wireless sensor networks with mobile nodes | |
| Liang et al. | SW-MAC: A low-latency MAC protocol with adaptive sleeping for wireless sensor networks | |
| Liu et al. | CSMAC: A novel DS-CDMA based MAC protocol for wireless sensor networks | |
| CN103634913A (en) | Clustering-based multi-hop multi-channel cognitive wireless sensor network communication method | |
| Rehan et al. | Anatomizing the robustness of multichannel MAC protocols for WSNs: An evaluation under MAC oriented design issues impacting QoS | |
| CN115643595A (en) | Wide-band and narrow-band integrated ad hoc network communication device and control method thereof | |
| Venugopal et al. | QoS Routing Algorithms for Wireless Sensor Networks | |
| Tang et al. | SR-MAC: A low latency MAC protocol for multi-packet transmissions in wireless sensor networks | |
| Nourildean | ZigBee-Based wireless sensor network topologies using one and multiple coordinators | |
| CN105323817B (en) | Based on the TDMA dispatching method of cluster tree topology in heterogeneous sensor network | |
| Jiang et al. | Opportunistic direct interconnection between co-located wireless sensor networks | |
| Guimaraes et al. | Dynamic timed energy efficient and data collision free MAC protocol for wireless sensor networks | |
| Al Agha et al. | Cross-layering in an Industrial Wireless Sensor Network: Case Study of OCARI. | |
| Wang et al. | Keeping desired qos by a partial coverage algorithm for cluster-based wireless sensor networks |
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: 20150311 Termination date: 20161201 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |