CN108337711A - The mobile awareness data routing method of mobile wireless Sensor Network - Google Patents
The mobile awareness data routing method of mobile wireless Sensor Network Download PDFInfo
- Publication number
- CN108337711A CN108337711A CN201810244874.XA CN201810244874A CN108337711A CN 108337711 A CN108337711 A CN 108337711A CN 201810244874 A CN201810244874 A CN 201810244874A CN 108337711 A CN108337711 A CN 108337711A
- Authority
- CN
- China
- Prior art keywords
- node
- mobile sensor
- data
- routing
- mobile
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
- H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention relates to a kind of mobile awareness data routing methods of mobile wireless Sensor Network, the data routing step of data collection step and mobile sensor node including static Sink node.By using the present invention, when mobile sensor node is near Sink node, can search out the path of Sink node, converge tree by data by multi-hop by way of be sent to Sink node；When mobile sensor node is found less than to the path of Sink node, the two kinds of situations whether analysis Sink node position is known, the method for proposing different transmission probability calculation formula and relaying other mobile sensor node datas sends the data to Sink node by chance routing；The present invention solves the problems, such as that the data of mobile sensor node report, and improves volume of transmitted data, reduces the redundancy rate and node energy consumption of data, reduces the system cost of method application.
Description
Technical field
The present invention relates to the mobile awareness data routing sides of field of communication technology, in particular to a kind of mobile wireless Sensor Network
Method.
Background technology
In the wireless sense network of some practical applications, the sensing node for considering all to move is needed, such as out of office lively
In object monitoring, sensing node is mounted on animal and acquires its data, analyzes its behavior and custom.In volcano, earthquake, there are toxic
In the adverse circumstances of gas, sensing node is mounted on moving trolley or aircraft, acquires environmental data, and convergence is reported to save
Point.But traditional static wireless sense network considers the static situation of sensing node, therefore in the base of traditional static wireless sense network
On plinth, need further to develop mobile wireless Sensor Network (mobile wireless sensor networks, MWSNs).
MWSNs is made of the sensing node and aggregation node moved in monitoring region, and the shifting of self-position can be controlled by installation
The dynamic mobile objects such as element or vehicle, animal, robot realize the movement of sensing node and aggregation node, are a kind of new nothings
Line Sensor Network.Currently, MWSNs develops comparatively fast in the fields such as environmental monitoring, intelligent medical, also cause academia and industrial quarters
Extensive concern.
In MWSNs, sensing node is small, has storage on limited plate, processing, power and communication ability.Therefore,
It needs effective method to use limited resource, reduces node energy consumption, extends network lifetime and improve data transmission rate.Its
In, routing is one of the effective ways for reducing communication energy consumption and extending network lifetime.Therefore, some scholars study mobile nothing
The data routing method of line Sensor Network, and obtain certain achievement.For example, Jinman Jung et al. consideration static sensors node,
Mobile sensor node and static Sink node, propose the high usage router method of mobile awareness.Adel A.Ahmed et al. propose one
Real-time Routing Protocol of the kind without node location information, i.e. Sink node Broadcasting Control packet (corona control packet,
CCP), each sensing node is allowed to calculate the weights based on link RSSI value, battery capacity and data transmission delay.The biography of high weight
Node is felt to sensing node transmission data same or less than its value.But these methods only consider monitoring region memory compared with
There is the connection to Sink node in more mobile nodes, each node, but do not account for network caused by node motion and divide,
It is not suitable for sparse network.Therefore bear Yongping et al. proposes opportunistic data collection method.There are one forwardings to survey for each node
Degree forwards greatly the sensing node estimated to be transmitted to the sensing node that small forwarding is estimated when two sensing nodes meet.Jiang Lingyun etc.
People proposes a kind of adaptive routing method of energy time delay constraint.In the method, if the sensing node for possessing token encounters
Aggregation node then directly forwards, otherwise to the high node for data forwarding of dump energy.Saifullah Khalid et al. propose one
The method for routing of kind load balance.This method considers the transition counting of node motion, remote degree, pace of change, proposes to be based on
The weight function of shifter factor, dump energy and node load, the sensing node selection neighbours that weights are big and hop count is small sensing
Node is as forward node.Although some scholars consider sparse network, data are forwarded using chance routing mode, arrive Sink
For the data transmission of node there are blindness, transmission performance is poor.
In short, the data routing method of more mobile wireless Sensor Network only considers monitoring region memory in more biography at present
Feel node, do not account for network caused by node motion and divide, do not account for sparse network, and needs a large amount of sensing node perception
Region is monitored, which greatly enhances the hardware costs of method application.Some data routing methods for being suitable for sparse network simultaneously
There are the blindness of data transmission, transmission performance is poor.
Invention content
The present invention is in order to solve the above technical problems, consider that monitoring region memory in a certain amount of mobile sensor node, carries
For a kind of mobile awareness data routing method of mobile wireless Sensor Network.The data of this method solution mobile sensor node, which report, asks
Topic, improves volume of transmitted data, reduces the redundancy rate and node energy consumption of data, reduces the system cost of method application.
To achieve the goals above, the present invention has following constitute：
The mobile awareness data routing method of the mobile wireless Sensor Network, includes the following steps：
The data routing step of data collection step and mobile sensor node including static Sink node, the static state
The data collection of Sink node includes that Sink node timing sends the routing iinformation comprising self ID, packet serial number and position coordinates
Packet sets the perception data for receiving mobile sensor node by converging；The data routing of the mobile sensor node includes following step
Suddenly：
(1) parameters are initialized, the self-position coordinate of mobile sensor node is obtained；
(2) if receiving the routing iinformation packet of Sink node, then it represents that the mobile sensor node is jumped the 1 of Sink node
In communication range, continue step (3), otherwise continues step (4)；
(3) read information in the routing iinformation packet of Sink node, judge in information of neighbor nodes table with the presence or absence of ID number and
Identical Sink node routing iinformation continues step (4) to packet serial number if it is present directly abandoning simultaneously, and otherwise calculating is to working as
The link desired value of preceding Sink node, it is its routing power that setting, which selects current Sink node as the routing desired value of father node,
Value records the position coordinates of receiving time and Sink node, updates information of neighbor nodes table, forwards the routing iinformation of Sink node
Packet continues step (4)；
(4) if receiving the routing iinformation packet of neighbours' mobile sensor node, the routing iinformation of neighbours' sensing node is read
Packet, calculate to neighbours' sensing node link metric and select neighbours' sensing node as the routing desired value of father node,
The position coordinates of receiving time and Sink node are recorded, information of neighbor nodes table is updated, continues step (5), otherwise continues step
(7)；
(5) if there are the information of Sink node in information of neighbor nodes table, it is 100% that self transmission probability, which is arranged,
Select the Sink node of routing desired value minimum as father node, it is Minimal routing desired value, broadcast that itself routing metric, which is arranged,
Transmission includes self ID, self-position coordinate, Sink node position coordinates, self rest energy, itself routing metric and data
The routing iinformation packet of the mobile sensor node of transmission probability, and to father node send perception data, continue step (7), otherwise after
Continuous step (6)；
(6) if there are the information of neighbours' mobile sensor node in information of neighbor nodes table, selection neighbours' sensing is calculated
Routing desired value of the node as father node updates information of neighbor nodes table, and setting self transmission probability is 100%, broadcast hair
It send including self ID, self-position coordinate, Sink node position coordinates, self rest energy, itself routing metric and data pass
The routing iinformation packet of the mobile sensor node of defeated probability, the neighbours of selection routing desired value minimum move from information of neighbor nodes table
Dynamic sensing node sends perception data as father node, continues step (7), otherwise continues step (8)；
(7) the state-of-the-art record time of each node routing information in information of neighbor nodes table is judged, if node road
By 5 minutes more early than current time of state-of-the-art record time of information or more, then it represents that be not received by Sink node or neighbours in the recent period
The routing iinformation packet of mobile sensor node deletes the routing iinformation of the node in information of neighbor nodes table, continues step (8)；
(8) if information of neighbor nodes table is empty table, then it represents that itself mobile sensor node is isolated node, calculates itself
Transmission probability, send route discovery packet, continue step (9), otherwise continue step (2)；
(9) if finding Sink node in moving process, information of neighbor nodes table is updated, the Sink node is directly selected
For father node, setting self transmission probability is 100%, and the routing iinformation packet of broadcast transmission mobile sensor node continues step
(2), otherwise continue step (10)；
(10) if receiving the route discovery packet of neighbours' mobile sensor node in moving process, the routing of itself is sent
Packet continues step (11), otherwise continues step (11)；
(11) if receiving the routing iinformation packet of neighbours' mobile sensor node in moving process, judge that the neighbours move
The transmission probability of sensing node whether 100%, if it is, indicate the neighbours move pass node Sink node convergence tree
In, information of neighbor nodes table is updated, it is father node to select the neighbours to move biography node, and setting self transmission probability is 100%, extensively
The routing iinformation packet for sending mobile sensor node is broadcast, step (2) is continued, otherwise, continues step (12)；
(12) transmission probability of neighbours' mobile sensor node is known and compares, if self transmission probability is moved more than neighbours
There are data in the transmission probability and caching of sensing node, then data in caching are sent to neighbours' mobile sensor node, the number
According to the number of transmissions add 1, and record the number of transmissions of data, if the transmission times of the data is equal to 3, delete the data,
Otherwise the data are still preserved, if self transmission probability is not more than the transmission probability of neighbours' mobile sensor node, neighbours is received and moves
The data of dynamic sensing node, and be saved in caching, continue step (2).
Optionally, the data collection of the static Sink node further includes following steps：
The perception data for receiving mobile sensor node is set by converging, judges whether perception data repeats, if repeated,
It directly abandons, otherwise stores perception data.
Optionally, current Sink node is selected in the step (3) as the routing desired value of father node and is arrived current
The specific formula for calculation of the link metric of Sink node is as follows：
Wherein, RisIndicate that the mobile sensor node i jumped in communication range the 1 of current Sink node selects current Sink sections
Routing desired value of the point as father node, wisIndicate that the mobile sensor node i in 1 jump communication range of current Sink node arrives
The link metric of current Sink node, disIndicate mobile sensor node i to the distance of current Sink node, giSIt indicates mobile to pass
Sense node i needs the data volume for being transferred to current Sink node, EelecIndicate the electricity of circuit when wireless receiving and dispatching per bit data
Sub- energy consumption, εfsIndicate the electronics energy consumption of signal amplifier when amplification per bit signal.
Optionally, the calculation formula of the link metric in the step (4) to neighbours' sensing node is as follows：
Wherein, wijIndicate mobile sensor node i to the link metric of its neighbours' mobile sensor node j, disIt indicates mobile to pass
Node i is felt to the distance of its neighbours' mobile sensor node j, gijIndicate that mobile sensor node i needs to be sent to neighbours' mobile sensor
The data volume of node j, Ere(j) dump energy of mobile sensor node j, y are indicated1Indicate Energy consumption factor, y2It indicates to receive remaining
Energy factors, y3It indicates apart from the factor.
Optionally, select neighbours' sensing node public as the calculating of the routing desired value of father node in the step (4)
Formula is as follows：
Rij=wij+Rj (3)
Wherein, RijIndicate that mobile sensor node i selects neighbours' sensing node as the routing desired value of father node, RjTable
Show the routing metric of mobile sensor node i；
Optionally, the self transmission method for calculating probability is as follows：
(a1) it if mobile sensor node is not known by the position coordinates of Sink node, is directly calculated certainly by formula (4)
Body transmission probability terminates, and otherwise continues step (a2)；
Wherein, PitExpression mobile sensor node i is in t by information Successful transmissions to the probability of Sink node, k1It indicates just
Beginning parameter, k2Indicate memory capacity parameter, DiIndicate the idle storage space of mobile sensor node i, DtIndicate the total of sensing node
Memory space；
(a2) it if mobile sensor node knows the position coordinates of Sink node, is calculated certainly according to formula (5) and formula (6)
Body transmission probability；
Wherein, xitIndicate the abscissa of the position of movement sensing node i when moment t, yitIndicate mobile sensor when moment t
The ordinate of the position of node i, xsIndicate the abscissa of the position of Sink node, ysIndicate the ordinate of the position of Sink node,
dmaxIndicate Sink node to the distance of monitoring zone boundary, k3Indicate memory capacity parameter, k4Indicate that mobile sensor node arrives
The distance parameter of Sink node, k5Indicate moving direction parameter, s5Indicate moving direction designated symbol, s5=0 indicates mobile sensor
Node motion is close to Sink node, s5=1 indicates mobile sensor node motion far from Sink node.
Optionally, the moving direction designated symbol s5Calculation formula it is as follows：
Wherein, θ indicates the folder in mobile sensor node motion direction and mobile sensor node to the directed line segment of Sink node
Angle.
The mobile awareness data routing method for using the mobile wireless Sensor Network in the invention, when mobile sensor node exists
Near Sink node, when can search out the path of Sink node, converge tree by data by multi-hop by way of be sent to
Sink node；When mobile sensor node is found less than to the path of Sink node, whether know two kinds of analysis Sink node position
Situation, the method for proposing different transmission probability calculation formula and relaying other mobile sensor node datas, is route by chance
Send the data to Sink node；The present invention solves the problems, such as that the data of mobile sensor node report, and improves volume of transmitted data, drop
The low redundancy rate and node energy consumption of data reduces the system cost of method application.
Description of the drawings
Fig. 1 is the work flow diagram of the mobile awareness data routing method of the mobile sensor node of the present invention；
Fig. 2 is that the chance of the present invention route schematic diagram.
Specific implementation mode
In order to more clearly describe the technology contents of the present invention, carried out with reference to specific embodiment further
Description.
Referring to Fig.1-2, the present invention provides a kind of mobile awareness data routing method of mobile wireless Sensor Network, including it is quiet
The data routing method of the method for data capture and mobile sensor node of state Sink node.The data collection side of static Sink node
Method is that Sink node timing sends the routing iinformation packet for including the information such as self ID, packet serial number, position coordinates, is connect by converging tree
The perception data for receiving mobile sensor node, judges whether perception data repeats, if repeated, directly abandons, otherwise storage sense
Primary data.
Referring to Fig.1, the data routing method of mobile sensor node is as follows：
(1) parameters are initialized, itself position coordinates is obtained；
(2) if receiving the routing iinformation packet of Sink node, then it represents that the mobile sensor node is jumped the 1 of Sink node
In communication range, continue step (3), otherwise continues step (4)；
(3) read information in the routing iinformation packet of Sink node, judge in information of neighbor nodes table with the presence or absence of ID number and
Identical Sink node routing iinformation continues step (4) to packet serial number if it is present directly abandoning simultaneously, and otherwise calculating is to working as
The link desired value of preceding Sink node, it is its routing power that setting, which selects current Sink node as the routing desired value of father node,
Value records the position coordinates of receiving time and Sink node, updates information of neighbor nodes table, forwards the routing iinformation of Sink node
Packet continues step (4)；Select routing desired value of the current Sink node as father node and the link weight to current Sink node
The specific formula for calculation of value is as follows：
Wherein, RisIndicate that the mobile sensor node i jumped in communication range the 1 of current Sink node selects current Sink sections
Routing desired value of the point as father node, wisIndicate that the mobile sensor node i in 1 jump communication range of current Sink node arrives
The link metric of current Sink node, disIndicate mobile sensor node i to the distance of current Sink node, giSIt indicates mobile to pass
Sense node i needs the data volume for being transferred to current Sink node, EelecIndicate the electricity of circuit when wireless receiving and dispatching per bit data
Sub- energy consumption, εfsIndicate the electronics energy consumption of signal amplifier when amplification per bit signal；
(4) if receiving the routing iinformation packet of neighbours' mobile sensor node, the routing iinformation of neighbours' sensing node is read
Packet, calculate to neighbours' sensing node link metric and select neighbours' sensing node as the routing desired value of father node,
The position coordinates of receiving time and Sink node are recorded, information of neighbor nodes table is updated, continues step (5), otherwise continues step
(7)；Wherein, the calculation formula for arriving the link metric of neighbours' sensing node is as follows：
Wherein, wijIndicate mobile sensor node i to the link metric of its neighbours' mobile sensor node j, disIt indicates mobile to pass
Node i is felt to the distance of its neighbours' mobile sensor node j, gijIndicate that mobile sensor node i needs to be sent to neighbours' mobile sensor
The data volume of node j, Ere(j) dump energy of mobile sensor node j, y are indicated1Indicate Energy consumption factor, y2It indicates to receive remaining
Energy factors, y3It indicates apart from the factor；
Select neighbours' sensing node as follows as the calculation formula of the routing desired value of father node：
Rij=wij+Rj (3)
Wherein, RijIndicate that mobile sensor node i selects neighbours' sensing node as the routing desired value of father node, RjTable
Show the routing metric of mobile sensor node i；
(5) if there are the information of Sink node in information of neighbor nodes table, it is 100% that self transmission probability, which is arranged,
For the Sink node of direct routing desired value minimum as father node, it is Minimal routing desired value that itself routing metric, which is arranged,
Broadcast transmission includes self ID, self-position coordinate, Sink node position coordinates, self rest energy, itself routing metric, number
Perception data is sent according to the routing iinformation packet of the mobile sensor node of the information such as transmission probability, and to father node, continues step
(7), otherwise continue step (6).
(6) if there are the information of neighbours' mobile sensor node in information of neighbor nodes table, selection neighbours' sensing is calculated
Routing desired value of the node as father node updates information of neighbor nodes table, and setting self transmission probability is 100%, broadcast hair
It send including self ID, self-position coordinate, Sink node position coordinates, self rest energy, itself routing metric, data transmission
The routing iinformation packet of the mobile sensor node of the information such as probability, the neighbour of selection routing desired value minimum from information of neighbor nodes table
It occupies mobile sensor node and sends perception data as father node, continue step (7), otherwise continue directly to step (8)；
(7) the state-of-the-art record time of each node routing information in information of neighbor nodes table is judged, if node road
By 5 minutes more early than current time of state-of-the-art record time of information or more, then it represents that be not received by Sink node or neighbours in the recent period
The routing iinformation packet of mobile sensor node deletes the routing iinformation of the node in information of neighbor nodes table, continues step (8)；
(8) if information of neighbor nodes table is empty table, then it represents that itself mobile sensor node is isolated node, calculates itself
Transmission probability, send route discovery packet, continue step (9), otherwise continue step (2)；The computational methods of self transmission probability
It is as follows：
(a1) it if mobile sensor node is not known by the position coordinates of Sink node, is directly calculated certainly by formula (4)
Body transmission probability terminates, and otherwise continues step (a2)；
Wherein, PitExpression mobile sensor node i is in t by information Successful transmissions to the probability of Sink node, k1It indicates just
Beginning parameter, k2Indicate memory capacity parameter, DiIndicate the idle storage space of mobile sensor node i, DtIndicate the total of sensing node
Memory space.
(a2) it if mobile sensor node knows the position coordinates of Sink node, is calculated certainly according to formula (5) and formula (6)
Body transmission probability；
Wherein, xitIndicate the abscissa of the position of movement sensing node i when moment t, yitIndicate mobile sensor when moment t
The ordinate of the position of node i, xsIndicate the abscissa of the position of Sink node, ysIndicate the ordinate of the position of Sink node,
dmaxIndicate Sink node to the distance of monitoring zone boundary, k3Indicate memory capacity parameter, k4Indicate that mobile sensor node arrives
The distance parameter of Sink node, k5Indicate moving direction parameter, s5Indicate moving direction designated symbol, s5=0 indicates mobile sensor
Node motion is close to Sink node, s5=1 indicates mobile sensor node motion far from Sink node, moving direction designated symbol s5
Calculation formula it is as follows：
Wherein, θ indicates the folder in mobile sensor node motion direction and mobile sensor node to the directed line segment of Sink node
Angle.
(9) if finding Sink node in moving process, information of neighbor nodes table is updated, the Sink node is directly selected
For father node, setting self transmission probability is 100%, and the routing iinformation packet of broadcast transmission mobile sensor node continues step
(2), step (10) is otherwise continued directly to；
(10) if receiving the route discovery packet of neighbours' mobile sensor node in moving process, the routing of itself is sent
Packet continues step (11), otherwise continues directly to step (11)；
(11) if receiving the routing iinformation packet of neighbours' mobile sensor node in moving process, judge that the neighbours move
The transmission probability of sensing node whether 100%, if it is, indicate the neighbours move pass node Sink node convergence tree
In, information of neighbor nodes table is updated, it is father node to directly select the neighbours and move biography node, and setting self transmission probability is
100%, the routing iinformation packet of broadcast transmission mobile sensor node continues step (2), otherwise, continues step (12)；
(12) transmission probability of neighbours' mobile sensor node is known and compares, if self transmission probability is moved more than neighbours
There are data in the transmission probability and caching of sensing node, then data in caching are sent to neighbours' mobile sensor node, the number
According to the number of transmissions add 1, and record the number of transmissions of data, if the transmission times of the data is equal to 3, delete the data,
Otherwise the data are still preserved, if self transmission probability is not more than the transmission probability of neighbours' mobile sensor node, neighbours is received and moves
The data of dynamic sensing node, and be saved in caching, continue step (2), with reference to shown in Fig. 2, moment t1＜ moment t2, at the moment
t1, mobile sensor node 1 finds that its stored data from height, is then sent to shifting by the transmission probability ratio of mobile sensor node 2
Dynamic sensing node 2, in moving process, mobile sensor node 2 is in moment t2It was found that thering is one to arrive by mobile sensor node 3
The path of Sink node 0 then forwards the data to mobile sensor node 3, finally by 1 → 2,2 → 3 → 0 forward-path, moves
The data of dynamic sensing node 1 are successfully transferred to Sink node 0.
The mobile awareness data routing method for using the mobile wireless Sensor Network in the invention, when mobile sensor node exists
Near Sink node, when can search out the path of Sink node, converge tree by data by multi-hop by way of be sent to
Sink node；When mobile sensor node is found less than to the path of Sink node, whether know two kinds of analysis Sink node position
Situation, the method for proposing different transmission probability calculation formula and relaying other mobile sensor node datas, is route by chance
Send the data to Sink node；The present invention solves the problems, such as that the data of mobile sensor node report, and improves volume of transmitted data, drop
The low redundancy rate and node energy consumption of data reduces the system cost of method application.
In this description, the present invention is described with reference to its specific embodiment.But it is clear that can still make
Various modifications and alterations are without departing from the spirit and scope of the invention.Therefore, the description and the appended drawings should be considered as illustrative
And not restrictive.
Claims (7)
1. a kind of mobile awareness data routing method of mobile wireless Sensor Network, which is characterized in that including static Sink node
The data collection of the data routing step of data collection step and mobile sensor node, the static state Sink node includes Sink sections
Point timing sends the routing iinformation packet for including self ID, packet serial number and position coordinates, and mobile sensor node is received by converging to set
Perception data；The data routing of the mobile sensor node includes the following steps：
(1) parameters are initialized, the self-position coordinate of mobile sensor node is obtained；
(2) if receiving the routing iinformation packet of Sink node, then it represents that the mobile sensor node jumps communication the 1 of Sink node
In range, continue step (3), otherwise continues step (4)；
(3) information in the routing iinformation packet of Sink node is read, judges to whether there is ID number and Bao Xu in information of neighbor nodes table
Number simultaneously identical Sink node routing iinformation, if it is present directly abandon, continue step (4), otherwise calculate to currently
The link desired value of Sink node, it is its routing metric that setting, which selects current Sink node as the routing desired value of father node,
The position coordinates of receiving time and Sink node are recorded, information of neighbor nodes table is updated, forwards the routing iinformation packet of Sink node,
Continue step (4)；
(4) if receiving the routing iinformation packet of neighbours' mobile sensor node, the routing iinformation packet of neighbours' sensing node, meter are read
It calculates the link metric of neighbours' sensing node and selects neighbours' sensing node as the routing desired value of father node, record connects
Continue step (5) with the position coordinates of Sink node, update information of neighbor nodes table between time receiving, otherwise continue step (7)；
(5) if there are the information of Sink node in information of neighbor nodes table, it is 100% that self transmission probability, which is arranged, selection
The Sink node of desired value minimum is route as father node, it is Minimal routing desired value, broadcast transmission that itself routing metric, which is arranged,
Including self ID, self-position coordinate, Sink node position coordinates, self rest energy, itself routing metric and data transmission
The routing iinformation packet of the mobile sensor node of probability, and perception data is sent to father node, continue step (7), otherwise continues to walk
Suddenly (6)；
(6) if there are the information of neighbours' mobile sensor node in information of neighbor nodes table, selection neighbours' sensing node is calculated
As the routing desired value of father node, information of neighbor nodes table is updated, setting self transmission probability is 100%, broadcast transmission packet
Self ID, self-position coordinate are included, Sink node position coordinates, self rest energy, itself routing metric and data transmission are general
The routing iinformation packet of the mobile sensor node of rate, the neighbours of selection routing desired value minimum, which move, from information of neighbor nodes table passes
Feel node and send perception data as father node, continue step (7), otherwise continues step (8)；
(7) the state-of-the-art record time of each node routing information in information of neighbor nodes table is judged, if node-routing is believed
5 minutes more early than current time of state-of-the-art record time of breath or more, then it represents that be not received by Sink node or neighbours' movement in the recent period
The routing iinformation packet of sensing node deletes the routing iinformation of the node in information of neighbor nodes table, continues step (8)；
(8) if information of neighbor nodes table is empty table, then it represents that itself mobile sensor node is isolated node, calculates the biography of itself
Defeated probability sends route discovery packet, continues step (9), otherwise continues step (2)；
(9) if finding Sink node in moving process, information of neighbor nodes table is updated, it is father to directly select the Sink node
Node, setting self transmission probability are 100%, and the routing iinformation packet of broadcast transmission mobile sensor node continues step (2), no
Then continue step (10)；
(10) if receiving the route discovery packet of neighbours' mobile sensor node in moving process, the routing iinformation of itself is sent
Packet continues step (11), otherwise continues step (11)；
(11) if receiving the routing iinformation packet of neighbours' mobile sensor node in moving process, judge neighbours' mobile sensor
The transmission probability of node whether 100%, if it is, indicate the neighbours move pass node in the convergence tree of Sink node, more
New neighbor informational table of nodes, it is father node to select the neighbours to move biography node, and setting self transmission probability is 100%, broadcast hair
The routing iinformation packet of mobile sensor node is sent, step (2) is continued, otherwise, continues step (12)；
(12) transmission probability of neighbours' mobile sensor node is known and compares, if self transmission probability is more than neighbours' mobile sensor
There are data in the transmission probability and caching of node, then data in caching are sent to neighbours' mobile sensor node, the data
The number of transmissions adds 1, and records the number of transmissions of data, if the transmission times of the data is equal to 3, deletes the data, otherwise
The data are still preserved, if self transmission probability is not more than the transmission probability of neighbours' mobile sensor node, neighbours is received and moves biography
Feel the data of node, and be saved in caching, continues step (2).
2. the mobile awareness data routing method of mobile wireless Sensor Network according to claim 1, which is characterized in that described
The data collection of static Sink node further includes following steps：
The perception data for receiving mobile sensor node is set by converging, judges whether perception data repeats, if repeated, directly
It abandons, otherwise stores perception data.
3. the mobile awareness data routing method of mobile wireless Sensor Network according to claim 1, which is characterized in that described
The tool of link metric of the current Sink node as the routing desired value of father node and to current Sink node is selected in step (3)
Body calculation formula is as follows：
Wherein, RisIndicate that the mobile sensor node i jumped in communication range the 1 of current Sink node selects current Sink node to make
For the routing desired value of father node, wisIndicate the mobile sensor node i in 1 jump communication range of current Sink node to currently
The link metric of Sink node, disIndicate mobile sensor node i to the distance of current Sink node, giSIndicate mobile sensor section
Point i needs the data volume for being transferred to current Sink node, EelecIndicate the electronics energy of circuit when wireless receiving and dispatching per bit data
Consumption, εfsIndicate the electronics energy consumption of signal amplifier when amplification per bit signal.
4. the mobile awareness data routing method of mobile wireless Sensor Network according to claim 3, which is characterized in that described
The calculation formula of link metric in step (4) to neighbours' sensing node is as follows：
Wherein, wijIndicate mobile sensor node i to the link metric of its neighbours' mobile sensor node j, disIndicate mobile sensor section
Point i is to the distance of its neighbours' mobile sensor node j, gijIndicate that mobile sensor node i needs to be sent to neighbours' mobile sensor node j
Data volume, Ere(j) dump energy of mobile sensor node j, y are indicated1Indicate Energy consumption factor, y2Indicate receive dump energy because
Son, y3It indicates apart from the factor.
5. the mobile awareness data routing method of mobile wireless Sensor Network according to claim 4, which is characterized in that described
Select neighbours' sensing node as follows as the calculation formula of the routing desired value of father node in step (4)：
Rij=wij+Rj (3)
Wherein, RijIndicate that mobile sensor node i selects neighbours' sensing node as the routing desired value of father node, RjIt indicates to move
The routing metric of dynamic sensing node i.
6. the mobile awareness data routing method of mobile wireless Sensor Network according to claim 1, which is characterized in that described
Self transmission method for calculating probability is as follows：
(a1) if mobile sensor node is not known by the position coordinates of Sink node, itself is directly calculated by formula (4) and is passed
Defeated probability terminates, and otherwise continues step (a2)；
Wherein, PitExpression mobile sensor node i is in t by information Successful transmissions to the probability of Sink node, k1Indicate initial ginseng
Number, k2Indicate memory capacity parameter, DiIndicate the idle storage space of mobile sensor node i, DtIndicate total storage of sensing node
Space；
(a2) if mobile sensor node knows the position coordinates of Sink node, itself is calculated according to formula (5) and formula (6) and is passed
Defeated probability；
Wherein, xitIndicate the abscissa of the position of movement sensing node i when moment t, yitIndicate movement sensing node i when moment t
Position ordinate, xsIndicate the abscissa of the position of Sink node, ysIndicate the ordinate of the position of Sink node, dmaxTable
Show Sink node to the distance of monitoring zone boundary, k3Indicate memory capacity parameter, k4Indicate mobile sensor node to Sink node
Distance parameter, k5Indicate moving direction parameter, s5Indicate moving direction designated symbol, s5=0 indicates mobile sensor node motion
Close to Sink node, s5=1 indicates mobile sensor node motion far from Sink node.
7. the mobile awareness data routing method of mobile wireless Sensor Network according to claim 6, which is characterized in that described
Moving direction designated symbol s5Calculation formula it is as follows：
Wherein, θ indicates the angle in mobile sensor node motion direction and mobile sensor node to the directed line segment of Sink node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810244874.XA CN108337711B (en) | 2018-03-23 | 2018-03-23 | Mobile sensing data routing method of mobile wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810244874.XA CN108337711B (en) | 2018-03-23 | 2018-03-23 | Mobile sensing data routing method of mobile wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108337711A true CN108337711A (en) | 2018-07-27 |
| CN108337711B CN108337711B (en) | 2021-08-20 |
Family
ID=62931325
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810244874.XA Active CN108337711B (en) | 2018-03-23 | 2018-03-23 | Mobile sensing data routing method of mobile wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108337711B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109673033A (en) * | 2019-02-22 | 2019-04-23 | 浙江树人学院（浙江树人大学） | The data routing method of the mobile sparse wireless sense network of three-dimensional |
| CN109874145A (en) * | 2019-02-20 | 2019-06-11 | 浙江树人学院（浙江树人大学） | Weigh the 3-D wireless Sensor Network method of data capture of life span and packet loss |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120134347A1 (en) * | 2010-11-26 | 2012-05-31 | Snu R&Db Foundation | Routing method for wireless mesh networks and wireless mesh network system using the same |
| CN103327518A (en) * | 2013-06-24 | 2013-09-25 | 中国科学院信息工程研究所 | Node dormancy scheduling method based on link quality |
-
2018
- 2018-03-23 CN CN201810244874.XA patent/CN108337711B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120134347A1 (en) * | 2010-11-26 | 2012-05-31 | Snu R&Db Foundation | Routing method for wireless mesh networks and wireless mesh network system using the same |
| CN103327518A (en) * | 2013-06-24 | 2013-09-25 | 中国科学院信息工程研究所 | Node dormancy scheduling method based on link quality |
Non-Patent Citations (2)
| Title |
|---|
| 关建峰: "基于IPv6的移动组播关键技术研究", 《中国博士论文全文数据库》 * |
| 秦智超: "无线传感器网络中节能关键技术的研究", 《中国博士论文全文数据库》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109874145A (en) * | 2019-02-20 | 2019-06-11 | 浙江树人学院（浙江树人大学） | Weigh the 3-D wireless Sensor Network method of data capture of life span and packet loss |
| CN109874145B (en) * | 2019-02-20 | 2022-03-25 | 浙江树人学院（浙江树人大学） | Three-dimensional wireless sensor network data collection method for balancing survival time and packet loss rate |
| CN109673033A (en) * | 2019-02-22 | 2019-04-23 | 浙江树人学院（浙江树人大学） | The data routing method of the mobile sparse wireless sense network of three-dimensional |
| CN109673033B (en) * | 2019-02-22 | 2020-10-16 | 浙江树人学院（浙江树人大学） | Data routing method of three-dimensional mobile sparse wireless sensor network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108337711B (en) | 2021-08-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Sarkar et al. | Enhanced-Ant-AODV for optimal route selection in mobile ad-hoc network | |
| He et al. | SPEED: A stateless protocol for real-time communication in sensor networks | |
| Bitam et al. | HyBR: A hybrid bio-inspired bee swarm routing protocol for safety applications in vehicular ad hoc networks (VANETs) | |
| US7957355B1 (en) | Swarm autonomous routing algorithm for mobile ad hoc network communications | |
| Camp et al. | An adaptive mesh-based protocol for geocast routing | |
| CN112954769B (en) | Underwater wireless sensor network routing method based on reinforcement learning | |
| Zhang et al. | A virtual coordinate-based bypassing void routing for wireless sensor networks | |
| Manjhi et al. | Signal strength based route selection in MANETs | |
| Sivakumar et al. | A survey of routing algorithms for MANET | |
| CN114339936A (en) | Aircraft self-organizing network optimization link state routing mechanism based on Q learning | |
| CN108337711A (en) | The mobile awareness data routing method of mobile wireless Sensor Network | |
| Akbar et al. | Evaluation of AODV and DSR routing protocols of wireless sensor networks for monitoring applications | |
| Huo et al. | A UAV mobile strategy in mobile ad hoc networks | |
| Shi | Semi-Probabilistic Routing in Intermittently Connected Mobile Ad Hoc Networks. | |
| Wang et al. | Mobility support enhancement for RPL | |
| Shen et al. | Trajectory control of mobile access points in MANET | |
| CN110167095A (en) | A kind of mobile Ad-Hoc algorithm network routing based on Fermat point | |
| Singh et al. | A study on energy efficient routing protocols in MANETs with effect on selfish behaviour | |
| Farzana et al. | Ant based mobility aided routing in mobile Wireless Sensor Networks | |
| CN103561444A (en) | Method and device for collecting data in sensor network | |
| Al Sawafi et al. | Context-Aware RPL-based mobile crowd sensing and routing protocol for smart city networks | |
| Deng et al. | LPAR: Link Stability Prediction-based Adaptive Routing Protocol for Flying Ad Hoc Networks | |
| GOUMIRI et al. | A novel approach for enhancing routing in wireless sensor networks using ACO algorithm | |
| Terami et al. | A method of mobile core network load reduction using autonomous clustering-based two-layered structure for information dissemination in wireless networks | |
| Zhang et al. | Contention-based adaptive position update for intermittently connected VANETs |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |