CN106068027A - The system adaptive recognition method of Situation Awareness in chance intelligent perception network - Google Patents

The system adaptive recognition method of Situation Awareness in chance intelligent perception network Download PDF

Info

Publication number
CN106068027A
CN106068027A CN201610355279.4A CN201610355279A CN106068027A CN 106068027 A CN106068027 A CN 106068027A CN 201610355279 A CN201610355279 A CN 201610355279A CN 106068027 A CN106068027 A CN 106068027A
Authority
CN
China
Prior art keywords
node
network
situation
message
data transmission
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
Application number
CN201610355279.4A
Other languages
Chinese (zh)
Other versions
CN106068027B (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.)
KunTeng Technology Co.,Ltd.
Original Assignee
Chongqing University of Post and Telecommunications
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 Chongqing University of Post and Telecommunications filed Critical Chongqing University of Post and Telecommunications
Priority to CN201610355279.4A priority Critical patent/CN106068027B/en
Publication of CN106068027A publication Critical patent/CN106068027A/en
Application granted granted Critical
Publication of CN106068027B publication Critical patent/CN106068027B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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
    • 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)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The present invention relates to a kind of system adaptive recognition method of Situation Awareness in chance intelligent perception network, belong to wireless sensor network and mobile ad-hoc network technical field.In the method, node in network is according to own situation and the historical information of network, estimate self residue energy of node and the collision probability of destination node, the jumping figure of message transmission, then node utilizes the local topology information at its place, and the network environment being presently in judges and carries out the selection of suitable data transmission mechanism.Pass through this method, connection MANET subnet present in network can be identified accurately and utilizes fully in data transmission procedure, it is made to be not easily susceptible to node mobility, the time variation impact of network topology, while improving data transmission success reduction network overhead, improve the robustness of data transmission policies.

Description

The system adaptive recognition method of Situation Awareness in chance intelligent perception network
Technical field
The invention belongs to wireless sensor network and mobile ad-hoc network technical field, relate to a kind of chance intelligent perception The system adaptive recognition method of Situation Awareness in network.
Background technology
Along with developing rapidly of the information technology such as Internet of Things, big data is deepened with the continuous of applied research, communication network system Many nets of system, multi-technical fusion trend rise year by year, and Informatization Development will produce great change and new breakthrough utilizes Sensor rich and varied in mobile terminal, it is provided that perception focusing on people and calculating.In this context, intelligent perception technology Apply and give birth to.Intelligent perception is the novel perceptual model of Internet of Things " prosumer ", the fixed wireless disposed consciously with tradition " consumer " pattern of sensor network (Wireless sensor network, WSN) is different, it be by mass-rent thought with Mobile awareness combines, by the mobile device of domestic consumer, if mobile phone, pad, intelligent watch etc. are as basic perception unit, Carried out consciously by mobile Internet or unconscious cooperation, thus realize perception task distribution and grasp with perception data collection etc. Make, be finally completed large-scale, complicated social perception task.But along with the expansion of perception scale, due to node motion, sparse Property distribution, the network topology of time-varying and the feature such as resource-constrained so that traditional WSN or mobile ad-hoc network (Mobile Ad hoc Network, MANET) etc. need the communication pattern setting up end to end connection to be difficult to effectively to run.
At present, substantial amounts of mobile device is embedded with abundant wireless communication interface and sensing function device, and creates a large amount of Touch opportunity.Chance intelligent perception network is exactly to need not any communications infrastructure, utilizes chance between mobile device The multi-hop transmission that the contact of type is set up moves opportunistic network.In this network, mobile device can arrive anywhere or anytime appoints Where point, carries out perception anywhere or anytime, and produced data separate moves the communication opportunity brought and is transmitted with people, completes Perception task, is not affected in time domain or spatial domain non-interconnected characteristic by communication link.And intelligent perception network is extensive because of it Space-time covering, cheap cost, outstanding extensibility and thorough perception, once occur just rapidly be industrial circle Concern with business circles and great attention.At present, intelligent perception network is at health care, intelligent transportation, social networks, Yi Jihuan The different field such as border monitoring are developed and apply.But, intelligent perception, as a kind of new research field, on a large scale should A lot of problems demand is still had to solve with in research.Such as, owing to crowd moves, there is autonomy and randomness, be difficult to there is end and arrive The communication path of end.How to design lightweight, distributed opportunistic data transfer strategy, meet large-scale autonomous networking need Ask, be one of key scientific problems in the urgent need to address in current chance intelligent perception network research.
The factor such as closing and node resource is limited due to the mobility of node, radio frequency can cause network topology to be moved in real time State changes, and therefore, designs the most feasible system adaptive recognition strategy by no means easy.In chance intelligent perception, data pass at present Defeated strategy is divided into two kinds: one is to use data transfer mode end to end, and another kind is then to use " store-carry-forward " Hop-by-hop data transfer mode.I.e. network topology is set up to exist between any two nodes in end-to-end transmission path or network and is appointed Anticipate between two nodes on without the hypothesis basis of communication link, but this hypothesis is at real extensive intelligent perception network mould Type seldom exists, because due to node motion and the sparse diversity of Node distribution, network topology Real-time and Dynamic can be caused to become Change, so that whole network topology produces segmentation phenomenon, i.e. network topology and is made up of multiple connection subnets, inside connection subnet Communication mode end to end can be used, and between different subnets, cannot be carried out communication.It is to say, large-scale group Intelligence sensing network environment individually use data transfer mode end to end can produce " route cavity " problem, so that causing data The problem that successful delivery rate is relatively low；And individually use " store-carry-forward " biography can be increased in the robustness increasing network simultaneously Defeated time delay and the expense of network.
Summary of the invention
In view of this, it is an object of the invention to provide the self adaptation number of Situation Awareness in a kind of chance intelligent perception network According to transmission method, for solving " route cavity " problem in current intelligent perception network, to improve the successful delivery rate of message And reduce the expense of network.
For reaching above-mentioned purpose, the present invention provides following technical scheme:
A kind of system adaptive recognition method of Situation Awareness in chance intelligent perception network, in the method, in network Node according to own situation and the historical information of network, estimate the residue energy of node of self and meeting of destination node The jumping figure of probability, message transmission, then node utilizes the local topology information at its place, makes the network environment being presently in Judge and carry out the selection of suitable data transmission mechanism；Specifically include following steps:
S1: each node in network is held with meeting of other nodes in network by the acquisition network information, present node Continuous time ti,j, network operation total time ttotal, in combination with transitivity and time decline, estimate the phase of itself and destination node Meet probability；
S2: each node in network estimates own node dump energy according to the energy expenditure of following three aspects: turn Send out energy consumption Et, receive message energy consumption ErAnd route discovery energy consumption Ef；
S3: node carries out perception to the situation of network topology: mobile node first one Hello message of broadcast transmission, so After other mobile nodes in this region after receiving Hello message, update the neighbor list of oneself；Then mobile node system The information of meter neighbor node, including neighbor node number and the translational speed of neighbor node, according to node place local environment The topological situation of network is made by the relative moving speed of the phsyical density ρ of interior joint, connection density P (k-con) and node Judge；
S4: according to network topology situation judged result, data transmission policies is selected, if node is positioned at stable company Logical subnet, then use data transmission policies end to end；Otherwise use the data transmission policies of " store-carry-forward ".
Further, in step s3, node carries out perception and specifically includes following steps the situation of network topology:
S31: in network, all nodes broadcast the Hello message that life cycle is 1 one in the range of periodically jumping, Hello message comprises this node neighbor list and the translational speed of correspondence, residue energy of node, and purpose known to this node The delivery probability etc. that node is corresponding；
After S32: node receives Hello message, first carry out foundation and the maintenance of Link State；Then, node will receive Information (corresponding the meeting of destination node known to node motion speed, residue energy of node and this node of neighbor node Probability etc.) compare renewal with the information of neighbor nodes of node self maintained, and according to the Hello message being properly received, system Meter neighbor node number and the translational speed of corresponding node, judge current topological situation, it is judged that it is to meet MANET (Mobile Ad hoc Network) or DTN (Delay Tolerant Networks) network characteristic；
S33: if the node in network is not received by what its neighbor list interior joint was sent within 3 cycles of regulation Hello message, then it is assumed that link between the two is already off, then this node is deleted respective links from its neighbor list and broken The information opened.
Further, in the method, utilize optimum stopping theory to carry out the selection of via node, thus via node is selected The problem of selecting be converted into " for message m, node niIt is whether the node of best performance " problem, it is to avoid the frequent biography of " focus " Transmitting messages, solves " route cavity " problem.
The beneficial effects of the present invention is: the self adaptation number of Situation Awareness in the chance intelligent perception network that the present invention proposes According to transmission strategy, it is possible to take into full account each side factor between node and node, such that it is able to make full use of between node The diversity connected carries out adaptive routing mechanism conversion, improves the delivery ratio of message and reduces the expense of network；And When the underway node that continues selects, utilize optimum stopping theory to avoid the frequent transmission message of " focus ", thus well solve " route cavity " problem, extends the life-span of network.
Accompanying drawing explanation
In order to make the purpose of the present invention, technical scheme and beneficial effect clearer, the present invention provides drawings described below to carry out Illustrate:
Fig. 1 is chance intelligent perception network diagram；
Fig. 2 is source node S and destination node D is positioned at different segmentation subnet exemplary plot；
Fig. 3 be source node S be information island, destination node for segmentation subnet exemplary plot；
Fig. 4 is the system adaptive recognition strategy schematic diagram of Situation Awareness.
Detailed description of the invention
Below in conjunction with accompanying drawing, the preferred embodiments of the present invention are described in detail.
Fig. 4 is the system adaptive recognition strategy schematic diagram of Situation Awareness, and the present invention specifically includes following steps:
S1: each node in network is held with meeting of other nodes in network by the acquisition network information, present node Continuous time ti,j, network operation total time ttotal, in combination with transitivity and time decline, estimate the phase of itself and destination node Meet probability；
S2: each node in network estimates own node dump energy according to the energy expenditure of following three aspects: turn Send out energy consumption Et, receive message energy consumption ErAnd route discovery energy consumption Ef；
S3: node carries out perception to the situation of network topology: mobile node first one Hello message of broadcast transmission, so After other mobile nodes in this region after receiving Hello message, update the neighbor list of oneself；Then mobile node system The information of meter neighbor node, including neighbor node number and the translational speed of neighbor node, according to node place local environment The topological situation of network is made by the relative moving speed of the phsyical density ρ of interior joint, connection density P (k-con) and node Judge；
S4: according to network topology situation judged result, data transmission policies is selected, if node is positioned at stable company Logical subnet, then use data transmission policies end to end；Otherwise use the data transmission policies of " store-carry-forward ".
Fig. 1 is chance intelligent perception network diagram, is described in detail the present embodiment below:
1, the selection algorithm of message via node
The most each node continues with meeting of other nodes in network according to historical information, the present node of network Time ti,j, network operation total time ttotal, in combination with transitivity and time decline, calculate and safeguard between itself and destination node Collision probability.And, each node in network is endowed primary power Einit, residue energy of node EresTable Show.In the present embodiment, the energy expenditure of node is broadly divided into three aspects: forward message energy consumption Et, receive message energy consumption ErWith Route discovery energy consumption Ef, additionally have in the network studied it is assumed hereinafter that:
1)EtAnd ErCalculate according to receiving or send a packet every time, EfThe scanning of route discovery is carried out for each second Energy consumption, and when node energy exhausts, no longer it is scanned the transmitting-receiving with information.
2) node in network can not carry out power supply supply, i.e. can not carry out in participating in network development process the replacing of battery with And charging operations.
Wherein, forward message energy consumption to refer mainly to node and carry, by the forwarding of its node met, the energy that message is consumed；With Forwarding energy consumption is similar to, and the reception energy consumption of node refers mainly to node and receives the energy expenditure of message.Generally, it is considered that the forwarding energy of node Consumption and reception energy consumption receive to node and the message number of forwarding is directly proportional.Route discovery energy consumption then refers to save into sensing neighbor Point, carries out the energy that scan channel is consumed.Assuming that node sends the energy expenditure needed for unit byte is et, message size is Ci, have sent m data bag, then EtFor:
E i = e i × Σ i = 1 m C i - - - ( 1 )
Energy expenditure needed for assuming node recruiting unit byte is er, message size is Ci, have received n packet, that ErFor:
E r = e r × Σ i = 1 n C i - - - ( 2 )
The scanning energy consumption assuming the node unit interval is ef, a length of Δ t during scanning, then EfFor:
Ef=ef×Δt (3)
The total energy consumption E of nodecDump energy E with noderesFor:
E c = E t + E r + E f E r e s = E i n i t - E c - - - ( 4 )
In order to reduce expense further, need message is forwarded to propose higher requirement, i.e. guarantee that message is transmitted to system In there is the node of peak performance.From concept, it is simply that wish the message copy number generated in network lacking as far as possible, and The node selecting some optimum performances carries message.Optimum stopping theory is to study when to stop the most favourable mathematical theory, Utilize optimum stopping theory routing issue can be converted to " for message m, node NiIt it is the joint that performance is the highest Point？" problem.
The quality that message temporary band person selects in chance intelligent perception network is inversely proportional to jumping figure, with the residual energy of node Amount, the collision probability of node are directly proportional.Then the effect value of node is expressed as follows:
R = pE r e s T - - - ( 5 )
Wherein p represents the collision probability of node and destination node, and T represents the transmission jumping figure of packet, and the computing formula of p is such as Under:
p ( a , b ) = p ( a , b ) o l d + ( 1 - p ( a , b ) o l d ) × t i j t t o t a l - - - ( 6 )
p(a,b)=p(a,b)old×γk (7)
p(a,c)=p(a,c)old+(1-p(a,c)old)×p(a,b)×p(b,c)×β (8)
As node a, when b meets, update by formula (6) and calculate node a, the collision probability of b；Do not have when node a period of time When meeting, its probability presses formula (7) decline, and wherein γ is the decline factor, and k is total time and the decline cycle of distance decline last time Ratio；Node a updates its delivery probability by node b to node c by formula (8).
2, Situation Awareness method
According to different applications, Network Situation can be divided into again security postures, topology situation, transmission situation, existence state Gesture etc..In the present embodiment, what Situation Awareness referred to is then the perception of network topology situation, and its ultimate principle is: mobile node is first First one Hello message of broadcast transmission, then other mobile nodes in this region are after receiving Hello message, update certainly Oneself neighbor list.Detailed process is as follows:
A) in network, all nodes broadcast the Hello message that life cycle is 1, Hello one in the range of periodically jumping Message comprises this node neighbor list and the translational speed of correspondence, residue energy of node, and destination node known to this node Corresponding delivery probability etc.；
B), after node receives Hello message, foundation and the maintenance of Link State is first carried out；Then, node will receive The information of neighbor node (destination node known to node motion speed, residue energy of node and this node corresponding meet general Rate etc.) compare renewal with the information of neighbor nodes of node self maintained, and according to the Hello message being properly received, statistics Neighbor node number and the translational speed of corresponding node, judge current topological situation and (meet MANET or DTN Network characteristic)；
If the node c) in network is not received by what its neighbor list interior joint was sent within 3 cycles of regulation Hello message, then it is assumed that link between the two is already off, then this node is deleted respective links from its neighbor list and broken The information opened.
3, the self adaptation of data transmission policies is changed the mechanism
In order to improve the delivery ratio of message, reduce and deliver time delay, need MANET subnet (or the part path in network Fragment) make and identify accurately and judge.Owing to the node in chance collective intelligence network has height self-organization, dynamic, because of Complex environment is next important, the problem on basis is to safeguard internodal connectedness for this.Connectedness is that MANET carries out data The primary condition of transmission.Therefore, the present invention is on the mobility of node, neighbor node number and the basis with k-connected network On, it is proposed that MANET subnet dynamic testing method.
Network node density and node motion speed are the principal element affecting MSNET network performance, wherein network node Density can be divided into phsyical density and Connection Density.Phsyical density refers to the number of overlay area interior nodes；Connection Density refers to The interstitial content connected in overlay area.When, in specific region, when great deal of nodes is suffered close each other, phsyical density is recognized For being intensive, otherwise it is then sparse.But, when detecting MANET subnet in network, it should also be taken into account that in specific region The connectedness of network.
Counting based on communication range internal segment, network density is defined as follows:
Node surroundings nodes number represents the degree d of this node；
Node degree d=0 then thinks that this node is isolated with network；
dminRepresent node minimum node degree, and be considered the minima of all node degrees in network；
If network all exists between arbitrary node a link, then it is assumed that network is connection, otherwise it is assumed that network It it is segmentation；
The network of one connection always meets minimum node degree dmin＞ 0, on the contrary it is then incorrect；
If network all existing separate k bar link connect them between every pair of node, then it is assumed that network is k- Connection.
Shown in node density is calculated as follows:
P(k-con)≈(1-e-μ)n (9)
μ=ρ * π * r2 (10)
ρ=n/A (11)
Wherein:
P (k-con) represents k-connected probability；N represents neighbor node number；R is the communication radius of node；ρ represents node Density；A represents predefined size.K value is set to 1 in the present invention, it means that for any given network, if Meet P (k-con) >=0.95, wherein k=1, then it is assumed that network is intensive, and exist between given region interior joint Article 1, separate link, i.e. network are considered 1-connection.
Assume that each neighbor node speed in the range of node communication is vi, γthFor relative moving speed threshold value, then node Relative moving speed is calculated as follows:
v a v g = 1 n Σ i = 1 n v i - - - ( 12 )
| v i - v a v g | v a v g ≤ γ t h - - - ( 13 )
If meet P (k-con) >=0.95 andThen the network at node place meets and there is part path fragment, It is suitable for using the data-transmission mode of MANET；Otherwise, the DTN data-transmission mode of " store-carry-forward " is used.
4, route finding process
Utilize the thought of the temporary transient carrier of message: if destination node is unreachable, but other nodal distance destination nodes Relatively closely or frequently contact with destination node, then can forward messages to using these nodes as the temporary transient carrier of message The temporary transient carrier of message, then utilizes the touch opportunity between node, and message dilivery is to destination node the most at last.In the present invention Route finding process is divided into two kinds of situations: one is that source node uses MANET data transfer mode；Another kind is that source node uses DTN data transfer mode.
4.1 from the simultaneous asynchronous data transmissions strategy of MANET to DTN
As shown in Fig. 2 (a), when source node and destination node are positioned at different segmentation subnets, first source node S is initiated The RREQ of AODV searches out the path of destination node, simultaneously by delivery threshold value p to destination nodethIt is arranged between [0,1], as Fruit can find destination node, then carry out conventional route by AODV；Otherwise, the MANET subnet at source node place saves to purpose Point collision probability p is more than pthAll nodes reply RREP to source node, then according to formula (5), source node S judges that performance is The temporary transient carrier of excellent message, and forward the packet to this node, as shown in Fig. 2 (b), select R2Temporarily taking as message Band node, then by R2Node is converted to the DTN data-transmission mode of " store-carry-forward ".R2Carry message motion, and depend on Next message via node R is searched out according to optimum stopping theory3.As Fig. 2 (c) works as R3Message of carrying node achieves the goal node institute MANET subnet time, be again converted to the data-transmission mode of MANET.
4.2 from the simultaneous asynchronous data transmissions strategy of DTN to MANET
As shown in Fig. 3 (a), when source node S uses the DTN data transfer mode of " store-carry-forward ", and purpose joint When point is positioned at the MANET subnet of connection, first, S carries out the selection of via node according to formula (5), selects R4As relaying joint Point；As shown in Fig. 3 (b), work as R4When arriving the MANET subnet at destination node place, the node N that meets given by data delivery bag, then Node N initiates RREQ in the MANET subnet at its place and searches out the path of destination node, and it is backward that destination node D receives RREQ Node N replys RREP；As shown in Fig. 3 (c), node N finally sends data packets to destination node D.
Finally illustrate, preferred embodiment above only in order to technical scheme to be described and unrestricted, although logical Cross above preferred embodiment the present invention to be described in detail, it is to be understood by those skilled in the art that can be In form and it is made various change, without departing from claims of the present invention limited range in details.

Claims (3)

1. the system adaptive recognition method of Situation Awareness in a chance intelligent perception network, it is characterised in that: in the method In, the node in network, according to own situation and the historical information of network, estimates self residue energy of node and purpose joint The jumping figure of the collision probability of point, message transmission, then node utilizes the local topology information at its place, to the network being presently in Environment judges and carries out the selection of suitable data transmission mechanism；Specifically include following steps:
S1: each node in network is by obtaining the network information, present node and when meeting lasting of other nodes in network Between ti,j, network operation total time ttotal, in combination with transitivity and time decline, estimate that it is general with meeting of destination node Rate；
S2: each node in network estimates own node dump energy according to the energy expenditure of following three aspects: forward energy Consumption Et, receive message energy consumption ErAnd route discovery energy consumption Ef；
S3: node carries out perception to the situation of network topology: mobile node first one Hello message of broadcast transmission, then should Other mobile nodes in region, after receiving Hello message, update the neighbor list of oneself；Then mobile node statistics neighbour Occupy the information of node, including neighbor node number and the translational speed of neighbor node, save according in the local environment of node place The topological situation of network is judged by the relative moving speed of the phsyical density ρ of point, connection density P (k-con) and node；
S4: according to network topology situation judged result, select data transmission policies, if node is positioned at stable connection Net, then use data transmission policies end to end；Otherwise use the data transmission policies of " store-carry-forward ".
The system adaptive recognition method of Situation Awareness in a kind of chance intelligent perception network the most according to claim 1, It is characterized in that: in step s3, node carries out perception and specifically includes following steps the situation of network topology:
S31: in network, all nodes broadcast the Hello message that life cycle is 1 one in the range of periodically jumping, and Hello disappears Breath comprises this node neighbor list and the translational speed of correspondence, residue energy of node, and destination node pair known to this node The delivery probability etc. answered；
After S32: node receives Hello message, first carry out foundation and the maintenance of Link State；Then, the neighbour that node will receive Occupy the information (collision probability that destination node known to node motion speed, residue energy of node and this node is corresponding of node Deng) compare renewal with the information of neighbor nodes of node self maintained, and according to the Hello message being properly received, statistics neighbour Occupy the translational speed of node number and corresponding node, current topological situation is judged, it is judged that it is to meet MANET (Mobile Ad hoc Network) or DTN (Delay Tolerant Networks) network characteristic；
S33: if the node in network is not received by what its neighbor list interior joint was sent within 3 cycles of regulation Hello message, then it is assumed that link between the two is already off, then this node is deleted respective links from its neighbor list and broken The information opened.
The system adaptive recognition side of Situation Awareness in a kind of chance intelligent perception network the most according to claim 1 and 2 Method, it is characterised in that: in the method, utilize optimum stopping theory to carry out the selection of via node, thus via node is selected The problem of selecting be converted into " for message m, node niIt is whether the node of best performance " problem, it is to avoid the frequent biography of " focus " Transmitting messages, solves " route cavity " problem.
CN201610355279.4A 2016-05-25 2016-05-25 The system adaptive recognition method of Situation Awareness in chance intelligent perception network Active CN106068027B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610355279.4A CN106068027B (en) 2016-05-25 2016-05-25 The system adaptive recognition method of Situation Awareness in chance intelligent perception network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610355279.4A CN106068027B (en) 2016-05-25 2016-05-25 The system adaptive recognition method of Situation Awareness in chance intelligent perception network

Publications (2)

Publication Number Publication Date
CN106068027A true CN106068027A (en) 2016-11-02
CN106068027B CN106068027B (en) 2019-05-10

Family

ID=57420372

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610355279.4A Active CN106068027B (en) 2016-05-25 2016-05-25 The system adaptive recognition method of Situation Awareness in chance intelligent perception network

Country Status (1)

Country Link
CN (1) CN106068027B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106792838A (en) * 2017-03-14 2017-05-31 武汉理工大学 DTN via node Candidate Set systems of selection
CN108200610A (en) * 2018-02-26 2018-06-22 重庆邮电大学 Take the intelligent perception resource allocation methods of distributed game
CN111010720A (en) * 2019-12-18 2020-04-14 中国民航大学 Opportunity route transmission control method for parking apron non-communication network
CN113098945A (en) * 2021-03-26 2021-07-09 江西省能源大数据有限公司 5G energy Internet of things communication method based on compressed sensing theory

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102625292A (en) * 2012-03-02 2012-08-01 重庆邮电大学 Social intermittent connection network dynamic address allocation and network performance optimization method

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102625292A (en) * 2012-03-02 2012-08-01 重庆邮电大学 Social intermittent connection network dynamic address allocation and network performance optimization method

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
YONG LI: "Energy-Efficient Optimal Opportunistic Forwarding", 《IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY》 *
刘期烈: "基于混合策略的机会网络路由算法", 《北京联合大学学报》 *
李琴: "无线传感器网络中能量多路径路由算法的研究", 《科技视界》 *

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106792838A (en) * 2017-03-14 2017-05-31 武汉理工大学 DTN via node Candidate Set systems of selection
CN106792838B (en) * 2017-03-14 2020-04-03 武汉理工大学 DTN relay node candidate set selection method
CN108200610A (en) * 2018-02-26 2018-06-22 重庆邮电大学 Take the intelligent perception resource allocation methods of distributed game
CN111010720A (en) * 2019-12-18 2020-04-14 中国民航大学 Opportunity route transmission control method for parking apron non-communication network
CN111010720B (en) * 2019-12-18 2023-04-07 中国民航大学 Opportunity route transmission control method for parking apron non-communication network
CN113098945A (en) * 2021-03-26 2021-07-09 江西省能源大数据有限公司 5G energy Internet of things communication method based on compressed sensing theory

Also Published As

Publication number Publication date
CN106068027B (en) 2019-05-10

Similar Documents

Publication Publication Date Title
Wang et al. Bio-inspired ant colony optimization based clustering algorithm with mobile sinks for applications in consumer home automation networks
Liu et al. Design principles and improvement of cost function based energy aware routing algorithms for wireless sensor networks
CN103702387B (en) Social network-based vehicle-mounted self-organization network routing method
Lee et al. IEEE 802.15. 5 WPAN mesh standard-low rate part: Meshing the wireless sensor networks
CN104602302B (en) It is a kind of based on cluster structured ZigBee-network balancing energy method for routing
CN106068027A (en) The system adaptive recognition method of Situation Awareness in chance intelligent perception network
CN104394566A (en) Fuzzy decision-based low-power dissipation self-adaption clustering multihop wireless sensor network topology control method
CN102595550A (en) Self-adaptive wireless sensor network routing method based on cross-layer optimization
Krishna et al. Energy efficient data aggregation techniques in wireless sensor networks
CN105430708A (en) Wireless sensor routing method based on routing table node energy
CN103139073A (en) Cognitive routing method based on Ad Hoc network form
CN104113855A (en) Channel-based routing algorithm of wireless self-organizing network
CN102238683A (en) Routing information acquisition and transmission method for wireless mesh network
Xu et al. Study on WSN topology division and lifetime
Talapatra et al. Mobility based cluster head selection algorithm for mobile ad-hoc network
CN109803342A (en) A kind of unmanned plane method for self-organizing network routing towards balancing energy highly-reliable transmission
KR100915555B1 (en) Query-based ZigBee Mesh Routing Protocol
Onuora et al. A Comprehensive Review of Routing Protocols for Mobile Ad Hoc Networks (Manets)
Gharajeh A neural-MCDM-based routing protocol for packet transmission in mobile ad hoc networks
CN103067873A (en) Energy-saving multicast scheme for wireless sensor network (WSN) provided with rechargeable nodes and multiple sink nodes
Xu et al. A Novel Link Stability and Energy Aware Routing with Tradeoff Strategy in Mobile Ad Hoc Networks.
CN103096411A (en) Internet of things communication method based on reverse power restriction route protocol
Sudarmani et al. Minimum spanning tree for clustered heterogeneous sensor networks with mobile sink
CN103002536A (en) Energy efficient wireless multi-hop network routing mechanism based on random walks
Pantazis et al. Energy-efficient routing protocols in wireless sensor networks for health communication systems

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
TR01 Transfer of patent right

Effective date of registration: 20211229

Address after: 400050 No. 38-4, No. 49, XIEJIAWAN Main Street, Xiejiawan street, Jiulongpo District, Chongqing

Patentee after: KunTeng Technology Co.,Ltd.

Address before: 400065 Chongqing Nan'an District huangjuezhen pass Chongwen Road No. 2

Patentee before: CHONGQING University OF POSTS AND TELECOMMUNICATIONS

TR01 Transfer of patent right