CN104602255A - Delay-tolerant mobile sensor network node transmitting probability dynamic calculation method under RWP (Random Way-Point) model - Google Patents
Delay-tolerant mobile sensor network node transmitting probability dynamic calculation method under RWP (Random Way-Point) model Download PDFInfo
- Publication number
- CN104602255A CN104602255A CN201510052864.2A CN201510052864A CN104602255A CN 104602255 A CN104602255 A CN 104602255A CN 201510052864 A CN201510052864 A CN 201510052864A CN 104602255 A CN104602255 A CN 104602255A
- Authority
- CN
- China
- Prior art keywords
- node
- value
- nodes
- delay
- sensor network
- 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
- 238000004364 calculation method Methods 0.000 title claims abstract description 14
- 238000000034 method Methods 0.000 claims abstract description 26
- 238000004891 communication Methods 0.000 claims abstract description 16
- 238000006073 displacement reaction Methods 0.000 claims abstract description 15
- 230000008569 process Effects 0.000 claims abstract description 15
- 238000000205 computational method Methods 0.000 claims description 5
- 230000003750 conditioning effect Effects 0.000 claims description 5
- 230000008859 change Effects 0.000 claims description 2
- 230000007246 mechanism Effects 0.000 claims description 2
- 230000033001 locomotion Effects 0.000 abstract description 21
- 230000005540 biological transmission Effects 0.000 abstract description 8
- 238000012546 transfer Methods 0.000 description 15
- 238000012935 Averaging Methods 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 239000002699 waste material Substances 0.000 description 2
- 208000035473 Communicable disease Diseases 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 208000015181 infectious disease Diseases 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 230000008447 perception Effects 0.000 description 1
- 230000001737 promoting effect Effects 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 239000007858 starting material Substances 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/22—Traffic simulation tools or models
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention belongs to the technical field of wireless network communication and relates to a delay-tolerant mobile sensor network node transmitting probability dynamic calculation method under an RWP (Random Way-Point) model. The delay-tolerant mobile sensor network node transmitting probability dynamic calculation method under the RWP model comprises that nodes record the number Ni of encountered other nodes within the unit displacement distance during the movement process; the nodes record the number M of encountered other nodes of a base station within the unit displacement distance when the base station moves within a communication radius covering range; the nodes mutually interact M and solve an average value to serve as a new M; the nodes calculate a ratio between Ni and Ni-1; the nodes calculate a ratio of the current Ni and the M; the nodes calculate respective transmitting probability through the ratios and corresponding ratio calculation formulas. The delay-tolerant mobile sensor network node transmitting probability dynamic calculation method under the RWP model can accurately reflect the size of the node transmitting probability under the condition that the priori knowledge is limited and plays an important role in improving the delay-tolerant mobile sensor network data transmission success rate.
Description
Technical field: the invention belongs to wireless network communication technique field, the node related under a kind of random waypoint (RWP) mobility model in delay-tolerant mobile sensor network forwards probability Dynamic calculation method.
Technical background: delay-tolerant mobile sensor network is the sparse wireless network of a kind of node motion integrating wireless sensor network and delay-tolerant network feature.In the network, two kind equipments are generally included: base station and node.The collection of base station primary responsibility data, static in a network, be generally in network center; Node is responsible for the data perceived to be transferred to base station, and node is kept in motion in a network.The data of perception being transferred to base station is also the topmost communication pattern of delay-tolerant mobile sensor network.Due to reasons such as the mobility of nodes or the dispersivenesses of deployment, network is made to have the feature of intermittent communication, namely scarcely there is communication path end to end between nodes, more typical application example is as the devices communicating, car networking etc. of remote districts.
Different from typical Ad-hoc and traditional wireless sensor network, in delay-tolerant mobile sensor network, the transmission of data adopts the asynchronous transfer mode of " storing-carry-forwarding ", namely node wants that the data collected are transferred to base station often needs by data retransmission to other appropriate node of meeting in motion process, forwards by other nodes are auxiliary.This use storage resources of delay-tolerant mobile sensor network overcomes the data-transmission mode of network intermittent communication, extends the range of application of wireless sensor network to a great extent.
In delay-tolerant mobile sensor network, node lacks the connection continued, and nodes moves, it is sparse to distribute, finite energy, such that the delay of inter-node communication transfer of data is large, link packet drop rate is high.Therefore for these problems, the research at present about delay-tolerant mobile sensor network needs to consider following problem:
1) effective utilization of memory space
Sensor node limited storage space, and delay-tolerant mobile sensor network transfer of data is the basic thought based on " storing-carry-forwarding ", the assistance of internodal data forwards can improve delivery ratio, reduce transmission delay, but also consumes the memory space of node.
2) bandwidth of link
The mobility of node limits the time span of inter-node communication, and same data waste bandwidth copying of different Nodes, and bandwidth limits the data volume of communication when every minor node meets, and is also related to the policy selection of transfer of data.
3) energy ezpenditure of node
Delay-tolerant mobile sensor network node device often energy constraint, the forwarding of data requires the expenditure of energy again especially, therefore desirable transfer of data should be selectable, the node that data more likely can be transferred to base station be selected to carry out data retransmission, instead of arbitrarily forward.
For network configuration and the transfer of data feature of delay-tolerant mobile sensor network, existing general standard is mostly based on the consideration of delivery ratio or time delay, between source node and base station, choose multiple intermediate node preserve the copy of data to be transmitted, by the movement of source node and intermediate node by data delivery waiting for transmission to base station.Wherein the most typically " infectious disease routing algorithm ", this method for routing, based on flooding mechanism, does not need to make any hypothesis to network topology structure and connection situation.This algorithm can copy this packet in a network to greatest extent before completing transfer of data.Data can be passed to other nodes met in moving process by source node, the node of also not these data that Message Transmission can meet to other again by node further that obtain data, final data can constantly copy in a network, and when base station obtains this message, data transmission procedure terminates.This method does not consider node storage space and energy quantitative limitation, is not suitable for practical application.And in concrete data transmission procedure, we often transfer data to those nodes be more likely connected with base station selectively, more effectively can reduce the expense of transfer of data like this, also can reduce the waste of node storage resources, also contribute to the success rate promoting transfer of data.
Summary of the invention
In view of this, the object of this invention is to provide one and forward probability Dynamic calculation method at delay-tolerant mobile sensor network interior joint.For this reason, the present invention adopts following technical scheme:
Under a kind of RWP model, delay-tolerant mobile sensor network node forwards probability Dynamic calculation method, is following the possibility be connected with base station in RWP model sport process, comprising for accurate response with measurement node:
(1) set node unit displacement d, be generally 2 to 4 times of node communication radius;
(2) each node moves according to RWP model, and record in moving process nearest Moving Unit distance meet node quantity Ni with on to meet in a unit displacement number of nodes Ni-1;
(3) when node is connected with base station, meet in mean unit displacement when node calculate self is within the scope of base station communication number of nodes M;
(4) node exchanges respective M value each other in mobile process of meeting, and recalculates the M value of self according to the M value of other nodes received, and computational methods are:
When () two or more node meets and occurs to connect a, if when node does not all have a M value, then without the need to exchange, also need not recalculate;
When () two or more node meets and occurs to connect b, when only having a node to have M value, this M is using the M value as other nodes;
When () two or more node meets and occurs to connect c, when there being more than one node to have M value, the M of multiple node is added divided by the number of node with M value after suing for peace, as the M value of these nodes after averaging;
D () node calculate has gone out up-to-date Ni, and Ni is greater than M, then change M value into Ni;
(5) node is according to Ni-1, Ni, M information recorded or calculate, and according to the forwarding Probability p of probability calculation formula dynamic conditioning node self, the moment forwarding probability dynamic conditioning is:
A () node obtains new Ni value;
B () node exchanges M value each other after;
C () node is connected with base station after;
(6) concrete forwarding Probability p computational methods are:
Wherein random (0,0.5) is the random number between 0 to 0.5; K=N
i/ M; α is less than 1 constant being greater than 0; The value of x is as follows:
Delay-tolerant mobile sensor network interior joint, when carrying out transfer of data, can carry out data retransmission with reference to forwarding probability each other, transfer data to and forward the higher node of probability, thus reduction blindly forwards the unnecessary expense brought.
Substantive distinguishing features of the present invention is: the quantity of the node that meets in unit displacement in nodes records displacement process, when the number of nodes that meets occurs comparatively fast to increase, according to the probability of RWP model lower node distribution, the probability that the nearlyer node in distance base station occurs is larger, illustrate to move in node convergence base station, the possibility be connected with base station increases; Idea, when the data of the node that meets in Moving Unit distance decline, illustrate to move in node principle base station, the possibility be connected with base station reduces.
The present invention forwards method for calculating probability as a kind of what known conditions that substantially do not need as the node in the delay-tolerant mobile sensor network of prerequisite, a kind ofly effectively can reflect that node forwards little, the practical technical scheme of probability size, computing cost relatively, reference can be made to the selection of forward node in delay-tolerant mobile sensor network data transmission procedure, and then effectively reduce cost on network communication, promote the success rate of transfer of data.
Accompanying drawing illustrates:
Fig. 1 is delay-tolerant mobile sensor network basic network topology schematic diagram in the present invention.
Fig. 2 follows the joint movements process of RWP motion model
Embodiment:
In order to achieve the above object, the invention provides the Dynamic calculation method that a kind of delay-tolerant mobile sensor network interior joint forwards probability, in order to make object of the present invention, implementation and advantage more clear, below in conjunction with accompanying drawing, the present invention is described in further detail.
See Fig. 1, comprise two kind equipments in the present invention in data acquisition environment a-quadrant, one is the actionless base station being in regional center, and a class is the node carrying out data acquisition, and the data collected are transferred to base station by node.
In the network, the characteristics of motion of all nodes all meets RWP motion model, and its characteristics of motion is described as: node is random selecting starting point S and point of destination D in the A of region, and random selecting v belongs to (v
minv
max) as this motion speed, and along S to D straight line uniform motion to put a D, belong to (T at D random selecting stand-by period Tpause
min, T
max) keeping static, such motion process terminates, using this destination of moving as the starting point of moving next time, the repeating motion like this of the next point of destination of Stochastic choice.In network, all nodes all follow the above-mentioned characteristics of motion and separate, and the motion process of node as shown in Figure 2.
Each node is from the moment of setting in motion, the timer of starter node inside, according to the movement velocity v of self, the distance that computing node runs, and the number of nodes Ni met under being recorded in unit displacement d condition, N0 represents first unit displacement and to meet the quantity of node, the number of nodes that the i-th+1 unit displacement is met; Each nodes records Ni-1 and Ni two value.
Be connected when there occurs with base station in node motion process, then need to record the number of nodes M being that in base station generation connection procedure, mean unit displacement is met.M value is generally relatively large, because base station is in center, occurs that the probability of node is larger around it.After node meets in motion process, first carry out the mutual of M value between node, and recalculate the M value of self according to the M value of other nodes received, computational methods are:
1), when two or more node meets and occurs to connect, if when node does not all have a M value, then without the need to exchange, also need not recalculate;
2), when two or more node meets and occurs to connect, when only having a node to have M value, this M is using the M value as other nodes;
3) when two or more node meets and occurs to connect, when there being more than one node to have M value, the M of multiple node is added divided by the number of node with M value after suing for peace, as the M value of these nodes after averaging;
4) counted up-to-date Ni in joint movements process, and Ni is greater than M, then changes M value into Ni;
Node is according to Ni-1, Ni, M information recorded or calculate, and according to the forwarding Probability p of probability calculation formula dynamic conditioning node self, the moment forwarding probability dynamic conditioning is:
1) node obtains new Ni value;
2) after node exchanges M value each other;
3) after node is connected with base station;
The computational methods of concrete forwarding Probability p are:
Wherein random (0,0.5) is the random number between 0 to 0.5; K=N
i/ M; α is less than 1 constant being greater than 0; The value of x is as follows:
Before node carries out transfer of data, node will self forwarding probability mutual each other, and compares.Data retransmission that self is stored is given and is forwarded the high node of probability by node, thus improves the success rate of transfer of data, also reduces the expense of data communication further.
The foregoing is only preferred embodiment of the present invention, not in order to limit the present invention, all any amendments done within the spirit and principles in the present invention, equivalent and improvement etc., all should be included within protection scope of the present invention.
Claims (3)
1. the delay-tolerant mobile sensor network node based on RWP model forwards a probability dynamic adjustment mechanism, forwards probability and accurately reflects the size forwarding probability between node, comprising for dynamic calculation node:
(1) set node unit displacement d, be generally 2 to 4 times of node communication radius;
(2) node moves according to RWP model, and the quantity Ni recording in current one displacement the node that meets in moving process with on to meet in a unit displacement number of nodes Ni-1;
(3) meet in mean unit displacement when nodes records self is within the scope of base station communication number of nodes M;
(4) node exchanges M value each other in the process of meeting, and recalculates the M value of self;
(5) node is according to Ni-1, Ni, M information of record, and according to the forwarding probability of probability calculation formula dynamic conditioning node self, the moment forwarding probability adjustment is:
A () node obtains new Ni value;
B () node exchanges M value each other after;
C () node is connected with base station after.
2. method as claimed in claim 1, the method that node recalculates self M value is as follows:
(1) two or more node meets, when node does not all have a M value, without the need to exchanging;
(2) two or more node meets, and when only having a node to have M value, this M is using the M value as multiple node;
(3) two or more node meets, when there being more than one node to have M value, using the M value as multiple node after the M of multiple node averages.
(4) node obtains new Ni, and Ni is greater than M, then change M value into Ni.
3., as claim 1 and method according to claim 2, the computational methods that node self forwards Probability p are:
Wherein random (0,0.5) is the random number between 0 to 0.5; K=N
i/ M, α are less than 1 constant being greater than 0; The value of x is as follows:
。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510052864.2A CN104602255B (en) | 2015-02-03 | 2015-02-03 | Delay-tolerant mobile sensor network node forwards probability Dynamic calculation method under a kind of RWP model |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510052864.2A CN104602255B (en) | 2015-02-03 | 2015-02-03 | Delay-tolerant mobile sensor network node forwards probability Dynamic calculation method under a kind of RWP model |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104602255A true CN104602255A (en) | 2015-05-06 |
| CN104602255B CN104602255B (en) | 2019-02-15 |
Family
ID=53127668
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510052864.2A Expired - Fee Related CN104602255B (en) | 2015-02-03 | 2015-02-03 | Delay-tolerant mobile sensor network node forwards probability Dynamic calculation method under a kind of RWP model |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104602255B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107318145A (en) * | 2017-08-17 | 2017-11-03 | 成都信息工程大学 | A kind of epidemic situation monitoring method and system based on delay-tolerant network |
| WO2023168824A1 (en) * | 2022-03-07 | 2023-09-14 | 北京工业大学 | Mobile edge cache optimization method based on federated learning |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080002640A1 (en) * | 2006-06-30 | 2008-01-03 | Nokia Corporation | Opportunistic routing protocol in ad hoc networks |
| CN101695179A (en) * | 2009-10-16 | 2010-04-14 | 天津大学 | Method for forwarding messages on DTN or ICN network in way of self-adoption changeable probability |
| CN102118450A (en) * | 2011-03-25 | 2011-07-06 | 北京航空航天大学 | Betweenness centrality-based opportunistic network P2P (peer-to-peer) information query method |
-
2015
- 2015-02-03 CN CN201510052864.2A patent/CN104602255B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080002640A1 (en) * | 2006-06-30 | 2008-01-03 | Nokia Corporation | Opportunistic routing protocol in ad hoc networks |
| CN101695179A (en) * | 2009-10-16 | 2010-04-14 | 天津大学 | Method for forwarding messages on DTN or ICN network in way of self-adoption changeable probability |
| CN102118450A (en) * | 2011-03-25 | 2011-07-06 | 北京航空航天大学 | Betweenness centrality-based opportunistic network P2P (peer-to-peer) information query method |
Non-Patent Citations (1)
| Title |
|---|
| 杨奎武: "延迟容忍移动传感器网络数据传输关键技术研究", 《中国博士学位论文》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107318145A (en) * | 2017-08-17 | 2017-11-03 | 成都信息工程大学 | A kind of epidemic situation monitoring method and system based on delay-tolerant network |
| CN107318145B (en) * | 2017-08-17 | 2020-10-09 | 成都信息工程大学 | Epidemic situation monitoring method and system based on delay tolerant network |
| WO2023168824A1 (en) * | 2022-03-07 | 2023-09-14 | 北京工业大学 | Mobile edge cache optimization method based on federated learning |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104602255B (en) | 2019-02-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102833160B (en) | Contact predication based large-scale mobile delay tolerant network cluster-based routing method and system thereof | |
| Rahman et al. | A survey on energy efficient routing techniques in wireless sensor network | |
| CN101695179B (en) | Method for forwarding messages on DTN or ICN network in way of self-adoption changeable probability | |
| CN103200598A (en) | Wireless sensor network clustering method based on particle swarm optimization | |
| Hu et al. | An adaptive and energy-efficient routing protocol based on machine learning for underwater delay tolerant networks | |
| Mottahedi et al. | IBCAV: Intelligent based clustering algorithm in VANET | |
| CN102209029B (en) | Grouping strategy based opportunistic network routing algorithm | |
| Yu et al. | TTL-based efficient forwarding for the backhaul tier in nanonetworks | |
| CN104602255A (en) | Delay-tolerant mobile sensor network node transmitting probability dynamic calculation method under RWP (Random Way-Point) model | |
| CN102123472A (en) | Clustering-based data acquisition method of strip wireless sensor network | |
| Ali et al. | Three hops reliability model for underwater wireless sensor network | |
| CN104394074A (en) | Energy-efficiency based message forwarding method for tolerant network | |
| CN104010339A (en) | WSN clustering method based on packet loss probability measurement | |
| CN104994464A (en) | Mobile social network data forwarding method based on hierarchical community structure | |
| CN103179631B (en) | A kind of choose the method that optimal angle carries out sub-clustering | |
| Zhongyi et al. | GOSR: geographical opportunistic source routing for VANETs | |
| CN103685038A (en) | Broadcast route selecting method based on relative node movement speed and node intensity in wireless Ad-hoc network | |
| Vijayalakshmi et al. | Mobile agent based optimal data gathering in wireless sensor networks | |
| Bachir et al. | Localized max-min remaining energy routing for wsn using delay control | |
| Onwuegbuzie et al. | Shortest Path Priority-based RPL (SPPB-RPL): The Case of a Smart Campus | |
| CN104469791B (en) | Suitable for the maximum hop count preparation method of star-like wireless multi-hop relay network | |
| CN103825840B (en) | Traffic scheduling method and traffic scheduling equipment | |
| Anand et al. | Comparison of routing protocols in wireless sensor networks: a detailed survey | |
| CN103227996B (en) | The underwater wireless sensor network topology control method of demand is covered towards variation | |
| CN103607749B (en) | A direction perception guided data collection method in an opportunity mobile sensor network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20180528 Address after: 226661 No. 123 South Street, Qu Tang Town, Haian, Nantong, Jiangsu Applicant after: Jing Zhuqiang Address before: 450001 Information Engineering University No. 62, science Avenue, Zhengzhou 404, Henan Applicant before: Yang Kuiwu |
|
| TA01 | Transfer of patent application right | ||
| CB03 | Change of inventor or designer information | ||
| CB03 | Change of inventor or designer information |
Inventor after: Hu Boxia Inventor after: Yang Kuiwu Inventor after: Guo Yuanbo Inventor after: Jia Hongyong Inventor after: Ma Jun Inventor after: Ju Ankang Inventor after: Sui Lei Inventor after: Jiang Wenbo Inventor before: Yang Kuiwu Inventor before: Guo Yuanbo Inventor before: Jia Hongyong Inventor before: Ma Jun Inventor before: Ju Ankang Inventor before: Sui Lei Inventor before: Jiang Wenbo |
|
| TA01 | Transfer of patent application right |
Effective date of registration: 20181228 Address after: 421008 No. 165 Huangbai Road, Yanfeng District, Hengyang City, Hunan Province Applicant after: Hengyang Normal University Address before: 226661 No. 123 South Street, Qu Tang Town, Haian, Nantong, Jiangsu Applicant before: Jing Zhuqiang |
|
| TA01 | Transfer of patent application right | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190215 Termination date: 20200203 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |