CN104581750B - A kind of opportunistic network can the construction method of computation model - Google Patents

A kind of opportunistic network can the construction method of computation model Download PDF

Info

Publication number
CN104581750B
CN104581750B CN201510009467.7A CN201510009467A CN104581750B CN 104581750 B CN104581750 B CN 104581750B CN 201510009467 A CN201510009467 A CN 201510009467A CN 104581750 B CN104581750 B CN 104581750B
Authority
CN
China
Prior art keywords
node
communication
random
model
time
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
Application number
CN201510009467.7A
Other languages
Chinese (zh)
Other versions
CN104581750A (en
Inventor
李鹏
王小明
张丹
王艳娥
朱腾蛟
林亚光
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shaanxi Normal University
Original Assignee
Shaanxi Normal University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shaanxi Normal University filed Critical Shaanxi Normal University
Priority to CN201510009467.7A priority Critical patent/CN104581750B/en
Publication of CN104581750A publication Critical patent/CN104581750A/en
Application granted granted Critical
Publication of CN104581750B publication Critical patent/CN104581750B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W16/00Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/22Traffic simulation tools or models

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 opportunistic network can the construction method of computation model, described opportunistic network model comprises n node and foundation-free facility, described method is by quantizing the basic parameter feature of opportunistic network, utilize walk random model to portray the movement law of described node, and then calculate communication time and frequency, wherein said walk random model has following scene: each node moves in the region of area for S with random direction and fixing speed, when air line distance between any two nodes is less than or equal to communication distance, communication is started between node, and according to certain tactful forwarding data.

Description

A kind of opportunistic network can the construction method of computation model
Technical field
The present invention relates to field of wireless, particularly a kind of construction method of opportunistic network model.
Background technology
The video file that user terminal produces is not of uniform size, and in severe network environment, transmission has very large uncertainty.If video file small volume, under known node average communication duration and internodal communication bandwidth condition, effective transmission can be completed as a rule.But the size of video is often determined by multiple factor, as definition or resolution, the recording duration of video, the coding, compress mode etc. of video of video.When video file is larger, limited communication time and communication bandwidth are difficult to ensure that video completes in an internodal communication process, internodal connection may disconnect at any time, if video data is failed to transmit completely complete before disconnecting the connection, the data passed probably are caused to use, make inter-node communication failure, passed data and abandoned by node.In order to address this problem, video data can be divided into multiple deblockings that volume is identical, size is suitable, at the inter-node transmission producing opportunistic communication in units of piecemeal, when destination node is through a fixed response time, complete video can be merged into by correlation method after receiving all piecemeals, reach effective transmission.
In order to realize effective large transfer of data in the same area between social networks node, improve efficiency of transmission and Consumer's Experience, first the basic parameter feature of the opportunistic network quantizing to know is needed, as moving area area, number of nodes, node motion rule, node communication radius, node connect the duration and be connected interval duration, inter-node communication bandwidth etc.Subnetwork parameter easily obtains, as moving area area, number of nodes, communication bandwidth etc., and some parameters there is no fixing value, constantly change in time, Water demand its long time statistics and the regularity of distribution determine, as internodal communication time, node communication frequency.Affect the multiple because have of node communication duration, as node communication radius increases, node motion rate reduction can extend internodal communication time, even if these two features of all nodes are identical, the angle that node enters another one node still cannot ensure that all nodes have fixing communication time when meeting, because also can bring impact to communication time.Therefore it may be necessary the probabilistic model of defined node movement at random to portray the movement law of node, and then the core feature such as computing node communication time and frequency.
Summary of the invention
For above-mentioned subproblem, the invention provides a kind of construction method of opportunistic network model, the model built by described method can describe the mode of operation of opportunistic network more accurately, and the quantitative model that it provides describes the methods and strategies research contributing to improving opportunistic communication.
A construction method for opportunistic network model, described opportunistic network model comprises n node { N 0, N 1..., N n-1and foundation-free facility, described method, by quantizing the basic parameter feature of opportunistic network, utilizes walk random model to portray the movement law of described node, and then calculates communication time and frequency, wherein:
Described basic parameter feature comprises: joint movements region area S, total simulation time T, node communication radius R, joint movements speed V 0, inter-node communication bandwidth B, average nodal call duration time t a, size of data M, deblocking size m;
Described walk random model has following scene:
Each node moves in the region of area for S with random direction and fixing speed, when the air line distance between any two nodes is less than or equal to communication distance, starts communication between node, and according to certain tactful forwarding data.
Can be verified by emulation, emulate the communication time of node and number of communications that obtain and carry out by this model the communication time that calculates and number of communications close, the model that the inventive method provides can portray the movement law of opportunistic network interior joint effectively; Adopt the method for transmitting video data of piecemeal effectively can improve the utilance of opportunistic communication in Internet Transmission in described model, reduce propagation delay time, also for the large transfer of data research of other types provides basis.
Accompanying drawing explanation
The scenario simulation of Fig. 1 joint movements;
Fig. 2 communication time calculates;
Between two nodes that Fig. 3 speed is identical, relative velocity calculates;
Fig. 4 node communication Annual distribution;
Fig. 5 average communication duration block diagram;
The total number of communications block diagram of Fig. 6.
Embodiment
Provide a kind of construction method of opportunistic network model in one embodiment, described opportunistic network model comprises n node { N 0, N 1..., N n-1and foundation-free facility, described method is by quantizing the basic parameter feature of described opportunistic network, utilize walk random model to portray the movement law of described node, and then calculate communication time and frequency, wherein said basic parameter feature comprises: joint movements region area S, total simulation time T, node communication radius R, joint movements speed V 0, inter-node communication bandwidth B, average nodal call duration time t a, size of data M, deblocking size m;
Described walk random model has following scene:
Each node moves in the region of area for S with random direction and fixing speed, when the air line distance between any two nodes is less than or equal to communication distance, starts communication between node, and according to certain tactful forwarding data.
In this basic embodiment, by carrying out abstract to the movement of opportunistic network interior joint, for meeting of node has the feature calculation model of general significance with connection setup.Described opportunistic network model for describing the movement law of comprised node, and then calculates communication time and communication frequency; And definite network essential characteristic could provide basis for efficient transmission of messages and video block transmission method, described opportunistic network model also can be applied to other the large transfer of data research except video.
In opportunistic network, the status of all nodes is equality, and network configuration is non-hierarchical, is complanation.Node in chance net, except possessing basic communication capacity, also possesses certain storage capacity, computing capability and certain energy reserve.In addition, opportunistic network interior joint moves according to certain mode, facilitate storing-carrying-forward carrying out, realize opportunistic communication.Some special nodes are defined in some opportunistic networks, these special joints generally can not move, there is stable supply of electric power, be furnished with jumbo storage and stronger communication capacity, exist as " infrastructure " that strengthens inter-node communication, this method only relates to the internodal opportunistic communication relevant issues of foundation-free facility.
In one embodiment, the movement of the node in described opportunity model is walk random, with the model sport of model molecule Brownian movement, communication.
In another embodiment, described node is a random selected impact point in the region of S at area, then with constant speed, moves to described impact point, waits after arriving target, then select next impact point to move.
No matter which kind of move mode the node in described opportunity model adopts, in order to describe the mode of operation of opportunistic network more accurately, and research improves the methods and strategies of opportunistic communication under quantitative pattern description, needs to do necessarily abstract to opportunistic network model, and provide definition, definition N={N 0, N 1..., N n-1it is the opportunistic network with n node, each node all can move in given scenario, for the ease of modeling and calculating, the structure of arranging each node is identical, there is identical rate travel, identical energy reserve, identical spatial cache and identical communication range, and fix tentatively as energy is all enough large, the communication activity in the fixed time can be maintained.Definition opportunistic network correlated variables, parameter are as shown in the table.
Table 1:
Joint movements scene as shown in Figure 1.
Under walk random mobility model, each node moves in the scene of area for S with random direction and fixing speed, when the air line distance between any two nodes is less than communication distance, starts communication between node, and according to certain tactful forwarding data.
In large transmission of video, need video data to be divided into the identical deblocking of multiple volume in advance at source node, the scope of the value m of point block size can be reduced into:
M=α t ab, wherein 0 < α≤1 (1).
In order to quantitatively communication time can be calculated, in one embodiment, certain specific node can be selected, as N 0analyze.In order to simplify problem, facilitate modeling, can by N 0regard geo-stationary as, then, in S region, other nodes are all with between 0 ~ 2V 0between relative speed move according to random direction.
Further, described node N 0communication range arrive greatly and can see moving linearly by approximate for the motion of other node in described communication range.At node N 0communication range in, constantly have other nodes to enter and leave, when Nodes is in a larger scene, can by other nodes, such as N 3at N 0motion in communication range is approximate sees moving linearly, as shown in Figure 2.
In Fig. 2, circle N 0represent node N 0communication range, line segment AB represents node N 3at node N 0movement locus in communication range, line segment AB is with random angle and position and justify N 0intersect, always there is line segment x and be positioned on the radius vertical with AB, AB locality is random, so the length of x is between 0 ~ R, and is evenly distributed.Two node N 0and N 3speed identical are all V 0, two nodes are when starting to communicate, and the direction of motion is random, as shown in Figure 3.
The two relative velocity is:
V 03 = V 0 2 + V 0 2 - 2 V 0 2 Cos&theta; = 2 ( 1 - Cos&theta; ) &CenterDot; V 0 - - - ( 2 )
Wherein 0≤θ≤π
Calculate to obtain two node relative velocities, can N be obtained 0with N 3communication time be:
t 03 = AB &OverBar; V 03 = 2 R 2 - x 2 2 ( 1 - Cos&theta; ) &CenterDot; V 0 , - - - ( 3 )
Wherein 0≤x≤R; 0≤θ≤π
θ is N 3with N 0direction of motion angle, when θ goes to zero, represents N 0and N 3node geo-stationary, its communication time levels off to+∞, levels off to scene running time T in this example.Two node communication duration distribution situations are drawn as shown in Figure 4 after the span (0.2 ~ π) of restriction θ.
After described scene runs certain hour, the communication time of node presents stable statistical law, known, x ~ U (0, R).
AB = 2 R 2 - x 2
Calculate line segment AB length to expect:
E ( AB ) = &Integral; - &infin; + &infin; 2 R 2 - x 2 &CenterDot; f ( x ) dx = &Integral; 0 R 1 R &CenterDot; 2 R 2 - x 2 dx = 2 R &Integral; 0 R R 2 - x 2 dx = 2 R ( R 2 2 arcsin x R + x 2 R 2 - x 2 ) | x = 0 R = &pi;R 2 - - - ( 4 )
Further, for convenience of calculating the expectation of relative speed, distribute assuming that the random moving direction of n node in described opportunistic network model obeys U (0 ~ 2 π).Assuming that N 0the random direction of movement is θ 1, θ 1~ U (0,2 π), N 3movable random direction θ 2, θ 2~ U (0,2 π), the two moving direction angle theta=θ 12, make θ 2'=-θ 2, then θ 2' ~ U (-2 π, 0), density function is:
And θ=θ 1+ θ 2', θ again 1density function be
Then the probability density function of θ is:
f ( &theta; ) = &Integral; - &infin; &infin; f 1 ( &theta; 1 ) f 2 &prime; ( &theta; - &theta; 1 ) d &theta; 1
Due to f 11) f 2' (θ-θ 1) non-zero region is:
&theta; 1 &Element; ( 0,2 &pi; ) &theta; - &theta; 1 &Element; ( - 2 &pi; , 0 )
Therefore,
And then calculate two node relative velocities expectations:
E ( v 03 ) = &Integral; - &infin; &infin; v 0 2 ( 1 - Cos&theta; ) &CenterDot; f ( &theta; ) d&theta; = &Integral; - 2 &pi; 0 v 0 2 ( 1 - Cos&theta; ) &CenterDot; 1 4 &pi; 2 ( &theta; + 2 &pi; ) d&theta; + &Integral; 0 2 &pi; v 0 2 ( 1 - Cos&theta; ) &CenterDot; 1 4 &pi; 2 ( 2 &pi; - &theta; ) d&theta; = 4 &pi; &CenterDot; v 0
Therefore, average communication duration should be:
t 03 = E ( AB ) E ( V 03 ) = &pi;R 2 4 &pi; &CenterDot; v 0 = &pi; 2 R 8 v 0 - - - ( 5 )
Can find out that average communication duration affects by node communication radius and translational speed by formula (5).
In order to calculate communication frequency, when applying described opportunity model and calculating, the described node N of supposition further 0geo-stationary, the position of other node in the region of area S is even random distribution.
Long data block is divided into some piecemeals and is propagated by opportunistic network, consider the size of piecemeal, also will analyze its propagation delay time simultaneously.In opportunistic network, the transmission of data relies on internodal opportunistic communication, increases the chance communicated between node and effectively can shorten propagation delay time.Qualitative analysis, node motion speed is higher, and number of nodes is more, and node communication radius is larger, and place scene area is less, and the chance of communication is more.
Particularly, during all-network running time T, still suppose specified node N 0be in relative static conditions, then for any specified node, such as N 3, or be in N 0communication context in, or be in N 0communication context outside.
If by N 3movement locus be depicted as circuit, then some circuit is in the communication radius of N0, and all the other circuits are in N 0communication radius outside, and N 3velocity attitude be random, speed, between 0 ~ 2V0, obtains thus, when scene running time is longer, N 3the position being positioned at zone of action S is even random distribution.Namely in T time, N 3with N 0accumulative communication time mean value be
t 03 &prime; = T &CenterDot; &pi; &CenterDot; R 2 S
Obtain the total average communication duration of two nodes and single average communication duration thus, can N be calculated 3with N 0total number of communications expect, total number of communications formula is as follows:
i 03 &prime; = t 03 &prime; t 03 = T &CenterDot; &pi; &CenterDot; R 2 S &pi; 2 R 8 v 0 = 8 v 0 &CenterDot; T &CenterDot; R &pi; &CenterDot; S
N 3with N 0for arbitrary node, if total n node in scene, then global communication number of times is:
C = n &CenterDot; ( n - 1 ) 2 &CenterDot; 8 v 0 &CenterDot; T &CenterDot; R &pi; &CenterDot; S
In another embodiment, by the calculating utilizing model to carry out communication time and communication frequency, and carry out emulation experiment, the validity of verification model simultaneously.In l-G simulation test, the checking of communication time and number of communications can use opportunistic network environment (OpportunisticNetworkEnvironment, ONE) simulator to build simulated scenario and complete, and the design parameter of ONE simulator arranges as shown in table 2.
Table 2:
In ONE simulator, build corresponding scene by above-mentioned parameter, node diagnostic and quantity are set, obtain concrete node communication daily record through emulation, can add up and obtain communication time and number of communications, simultaneously according to above-mentioned formulae discovery analog value, as shown in the table.
Table 3:
By Plotting data block diagram in table 3 as illustrated in Figures 5 and 6, in legend, " ONE " represents simulation result, and in legend, " formula " represents that above use, corresponding formula carries out the result calculated.As can be seen from Fig. 5 and 3,6 experiments of 6 associative lists, the formulae discovery result of average communication duration and total number of communications is close with corresponding simulation result, and meanwhile, due to node motion and the randomness communicated, experimental result and formulae results also exist difference among a small circle.In addition, it should be noted that, what total number of communications represented is the number of times that node enters communication range mutually, in actual applications, there is node with the situation of single-channel communication, as Imote2, CSIR O, the communication pattern of the nodes such as Mica2 is single-channel communication, namely when two nodes are all within the scope of the 3rd node communication, 3rd node can only communicate with in the first two node, at this moment, enter in multiple nodes of same node communication scope, a node can only be had to communicate with, be limited to this situation, actual node communication number of times can be less than notional result.
In this specification, each embodiment adopts the mode of going forward one by one to describe, and what stress is all the difference with other embodiments, part identical, similar between each embodiment mutually see.For system embodiment, due to itself and embodiment of the method basic simlarity, so description is fairly simple, relevant part illustrates see the part of embodiment of the method.
Above to the capable detailed introduction of the construction method of a kind of opportunistic network model that the disclosure provides, apply specific case herein to set forth principle of the present disclosure and execution mode, the explanation of above embodiment just understands method of the present invention and core concept thereof for helping; Meanwhile, for those skilled in the art, according to thought of the present disclosure, all will change in specific embodiments and applications, in sum, this description should not be construed as limitation of the present invention.

Claims (7)

1. opportunistic network can the construction method of computation model, and it is characterized in that, described opportunistic network model comprises n node { N 0, N 1..., N n-1, and foundation-free facility, described method, by quantizing the basic parameter feature of opportunistic network, utilizes walk random model to portray the movement law of described node, and then calculates communication time and frequency, wherein:
Described basic parameter feature comprises: joint movements region area S, total simulation time T, node communication radius R, joint movements speed V 0, inter-node communication bandwidth B, average nodal call duration time t a, size of data M, deblocking size m;
Described walk random model has following scene:
Each node moves in the region of area for S with random direction and fixing speed, when the air line distance between any two nodes is less than or equal to communication distance, starts communication between node, and according to certain tactful forwarding data;
Described method hypothesis n node structure is identical, and have identical energy deposit, spatial cache and communication range, described energy can maintain the communication activity in the fixed time;
Described node N 0communication range arrive greatly and can see moving linearly by approximate for the motion of other node in described communication range; By node N 0regard geo-stationary as, then communication range is with node N 0for center of circle communication radius is the circle of R, and then the communication time of two nodes can be calculated by the relation between movement angle, Distance geometry speed three;
Except described node N 0the outer position of other node in the S of zone of action is even random distribution, then in T time, and other individual node and described node N 0accumulative communication time mean value be two internodal total number of communications can be tried to achieve in conjunction with described average communication duration, and then can in the hope of the global communication number of times of n node.
2. method according to claim 1, is characterized in that, the direction of motion of a described n node is random, and speed is identical.
3. method according to claim 1, is characterized in that, the random moving direction of n node in described opportunistic network model obeys the random distribution in U (0 ~ 2 π) scope.
4. method according to claim 3, it is characterized in that, by the desired value of the desired value of calculating communication distance length, the relative speed of two nodes, can be that the desired value of communication distance length solves average communication duration with the ratio of the desired value of the relative speed of two nodes by average communication duration.
5. method according to claim 1, is characterized in that, by data in advance piecemeal when carrying out transfer of data between two nodes communicated, the scope of point block size meets: m=α t ab, wherein 0 < α≤1.
6. method according to claim 1, is characterized in that, the movement of described node is walk random, and the mobility model of described node is model molecule Brownian movement.
7. method according to claim 1, is characterized in that, described node is a random selected impact point in the region of S at area, then with constant speed, move to described impact point, wait after arriving target, wait for a period of time, and then select next impact point to move.
CN201510009467.7A 2015-01-08 2015-01-08 A kind of opportunistic network can the construction method of computation model Expired - Fee Related CN104581750B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510009467.7A CN104581750B (en) 2015-01-08 2015-01-08 A kind of opportunistic network can the construction method of computation model

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510009467.7A CN104581750B (en) 2015-01-08 2015-01-08 A kind of opportunistic network can the construction method of computation model

Publications (2)

Publication Number Publication Date
CN104581750A CN104581750A (en) 2015-04-29
CN104581750B true CN104581750B (en) 2015-12-02

Family

ID=53096734

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510009467.7A Expired - Fee Related CN104581750B (en) 2015-01-08 2015-01-08 A kind of opportunistic network can the construction method of computation model

Country Status (1)

Country Link
CN (1) CN104581750B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109068337A (en) * 2018-07-13 2018-12-21 中南大学 For moving the Energy-aware time of opportunistic network up to drawing method
CN110366126B (en) * 2019-06-17 2020-08-04 上海交通大学 Optimal decision-making method and system for waiting time of off-node in mobile ad hoc network

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102917385A (en) * 2012-10-26 2013-02-06 西安电子科技大学 Mobile perception clustering method based on statistical mobile scale
CN103595623A (en) * 2013-11-28 2014-02-19 中国科学技术大学 Opportunistic routing behavioral modeling method based on mobile social network node social characteristics

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102917385A (en) * 2012-10-26 2013-02-06 西安电子科技大学 Mobile perception clustering method based on statistical mobile scale
CN103595623A (en) * 2013-11-28 2014-02-19 中国科学技术大学 Opportunistic routing behavioral modeling method based on mobile social network node social characteristics

Also Published As

Publication number Publication date
CN104581750A (en) 2015-04-29

Similar Documents

Publication Publication Date Title
Groenevelt et al. Message delay in manet
CN102118450B (en) Betweenness centrality-based opportunistic network P2P (peer-to-peer) information query method
Almutairi et al. Delay-optimal task offloading for UAV-enabled edge-cloud computing systems
CN103298009B (en) The modeling of complicated wireless network control system and fault propagation method
Alam et al. A new optimistic mobility model for mobile ad hoc networks
CN109067482A (en) Reconfigurable network channel simulation method and device towards car networking communication
Wang et al. An intelligent UAV based data aggregation algorithm for 5G-enabled internet of things
CN104581750B (en) A kind of opportunistic network can the construction method of computation model
CN102065446B (en) Topology control system and method orienting group mobile environment
Uchida et al. Evaluation of wireless network communication by autonomous flight wireless nodes for resilient networks
CN104010329A (en) Distributed load balancing method based on quantified unbiased broadcast Gossip algorithm
Xiao et al. Learning while offloading: Task offloading in vehicular edge computing network
Matsumoto et al. A V2X task offloading method considering automobiles' behavior in urban area
Peyravi et al. Link modeling and delay analysis in networks with disruptive links
Ren et al. Joint spectrum allocation and power control in vehicular communications based on dueling double DQN
Dubosarskii et al. Evolution of vehicle network on a highway
CN105183692A (en) Method and system for data communication between cluster system devices
Wang et al. Multi-agent reinforcement learning based coded computation for mobile ad hoc computing
CN103745049A (en) Novel multi-factor tactical internet connection reliability simulation method
CN103634923B (en) Scheduling decision-making method for maximizing effective transmission times of bus in-vehicle network
Xiong et al. Minimum node degree of k-connected vehicular ad hoc networks in highway scenarios
CN110366126B (en) Optimal decision-making method and system for waiting time of off-node in mobile ad hoc network
CN109756284B (en) Rapid construction method of vehicle-mounted node communication model for dynamic topology Internet of vehicles
Chetlur et al. Spatial models for networks on roads: Bridging the gap between industry and academia
Mittal et al. Edge computing based resource supplementation for software defined vehicular 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: 20151202

Termination date: 20210108

CF01 Termination of patent right due to non-payment of annual fee