CN102883400B - Method for forwarding data of hierarchal wireless sensor network based on semantic routing - Google Patents

Method for forwarding data of hierarchal wireless sensor network based on semantic routing Download PDF

Info

Publication number
CN102883400B
CN102883400B CN201210306088.0A CN201210306088A CN102883400B CN 102883400 B CN102883400 B CN 102883400B CN 201210306088 A CN201210306088 A CN 201210306088A CN 102883400 B CN102883400 B CN 102883400B
Authority
CN
China
Prior art keywords
node
data
semantic
network
event
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
CN201210306088.0A
Other languages
Chinese (zh)
Other versions
CN102883400A (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.)
SUZHOU LIANGJIANG TECHNOLOGY Co Ltd
Original Assignee
SUZHOU LIANGJIANG TECHNOLOGY Co Ltd
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 SUZHOU LIANGJIANG TECHNOLOGY Co Ltd filed Critical SUZHOU LIANGJIANG TECHNOLOGY Co Ltd
Priority to CN201210306088.0A priority Critical patent/CN102883400B/en
Publication of CN102883400A publication Critical patent/CN102883400A/en
Application granted granted Critical
Publication of CN102883400B publication Critical patent/CN102883400B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • YGENERAL 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
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE 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/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a method for forwarding data of a hierarchal wireless sensor network based on semantic routing, wherein the hierarchal wireless sensor network is a semantic network. The method comprises the steps of (1) a cluster member node collecting data in the data collection period; (2) the member node processing the collected data, comparing the collected data with a preset threshold, uploading the collected data to a cluster head node if the collected data is larger than the threshold, otherwise, discarding the data and waiting for the next data collection period to collect data; (3) the member node determining the semantic type according to the collected data, constructing related semantic frame of the data, and directly forwarding the constructed data packet to the cluster head node; (4) the cluster head node extracting data according to the data packet uploaded by the cluster member node in one data collection period to fuse the data, determining whether an event occurs according to the data fusion result, and determining whether or not to upload and forward the data packet of the related event; and (5) the cluster head node determining the semantic type, constructing an event semantic frame, writing semantic elements contained in the occurred event of the cluster into the event semantic frame, and the cluster head node carrying out data packet construction according to the generated event semantic frame, and directly injecting the constructed data packet to the network through the routing table.

Description

Level type wireless sense network carries out the method for data retransmission based on semantic route
Technical field
The invention belongs to radio sensing network route technology field, be specifically related to a kind of level type wireless sense network and carry out based on semantic route the method for data retransmission.
Background technology
In wireless sensor network architecture, the performance quality important of the route technology of network layer to wireless sensor network.Through the research of Chinese scholars, many Routing Protocols for wireless sensor network have been carried out.From the angle of network topology structure, these agreements substantially can be divided into two classes: plane Routing Protocol and clustering route protocol.
In plane Routing Protocol, the status of all-network node is equality, does not have grade and level difference.They feed back to generate route by partial operation and information each other.In this quasi-protocol, destination node (sink) is sent querying command to the node (source) of monitored area, and the node in monitored area is received after querying command, sends Monitoring Data to destination node.Plane road by advantage be simply, easily expansion, need not carry out any structural maintenance work, all-network node equal, is difficult for producing bottleneck effect, therefore has good robustness.Typical plane routing algorithm has DD (directed diffusion), SAR (sequential assignment routing), SPIN (sensor protocols for information via negotiation), Romor Routing etc.Plane road by disadvantage be: in network, without management node, lack optimum management to the communication resource, self-organizing collaborative work algorithm complexity, slower etc. to the reaction speed of network dynamic change.
In plane model, network configuration is fairly simple, and the status of all nodes is equality, does not have in principle bottleneck problem, and its shortcoming is poor expandability; In addition, Routing Protocol in areal model needs each node to maintain routing table, each node needs to know the route that arrives other all nodes, therefore in large scale network, this can consume memory spaces a large amount of on node, and simultaneously along with network energy state variation, the frequent variations of routing information also can cause a large amount of routing update calculating to communicate by letter with routing update, in addition owing to having comprised a large amount of routing iinformations in transmission information, therefore can cause increasing the weight of of communications burden in network.Plane model defect aspect network in general energy consumption is obvious in sum.
In clustering route protocol, network is divided into bunch conventionally.So-called bunch, there is exactly certain associated set of network nodes.Each bunch by member composition in a cluster head and multiple bunches, the cluster head of low primary network station be in high primary network station bunch in member, communicated by letter with base station BS (base station) by top cluster head.Whole network is divided into connected region by this class algorithm.Under the Topology Management mechanism of sub-clustering, the node in network can be divided into cluster head node and member node two classes.In each bunch, choose certain node as cluster head by certain mechanism, for management or control member node in whole bunch, coordinate the work between member node, be responsible for the collection of bunch internal information and the fusion treatment of data and bunch between forward.
Clustering routing mechanism has following advantage: 1. the member node most of the time can communication close module, forms the length that more connected network of last layer is responsible for data apart from routing forwarding by cluster head.So both ensure the data communication in original coverage, also saved to a great extent network energy; 2. cluster head forwards after having merged the data of member node again, has reduced data traffic, thereby has saved network energy; 3. the function of member node is fairly simple, need not safeguard complicated routing iinformation.The quantity that this has greatly reduced route control information in network, has reduced the traffic; 4. clustering topology is convenient to management, is conducive to the application of distributed algorithm, can make fast reaction to system change, has good extensibility, is applicable to large scale network; With plane road by compared with, more easily overcome sensor node and move the problem of bringing.The present invention therefore.
Summary of the invention
The object of the invention is to provide a kind of level type wireless sense network to carry out the method for data retransmission based on semantic route, has solved common wireless sensor network route data in prior art and has transmitted the problems of bringing.
In order to solve these problems of the prior art, technical scheme provided by the invention is:
Level type wireless sense network carries out a method for data retransmission based on semantic route, described level type wireless sense network is semantic network, it is characterized in that said method comprising the steps of:
(1) member node image data in data collection cycle intra-cluster;
(2) member node is processed the data that gather, and by the data that gather and default threshold value comparison; If be greater than threshold value, by the data upload leader cluster node gathering; Otherwise abandon data and wait for that next data collection cycle carries out image data;
(3) member node, according to the semantic affiliated type of the data judgement gathering, builds the relevant semantic frame of data, and the semantic feature that node is comprised is written in semantic frame; Then member node is carried out packet structure with the semantic frame generating, and the packet of having constructed will be directly transmitted to leader cluster node;
(4) leader cluster node is in a data collection cycle, and the packet of uploading according to this bunch of member node, extracts data and carry out data fusion; Judge according to the result of data fusion whether event occurs and judge whether to upload the packet forwarding about event;
(5) the semantic affiliated type of leader cluster node judgement, builds event semantics framework, and the semantic feature that this bunch of generation event comprised is written in event semantics framework; Then leader cluster node carries out packet structure with the event semantics framework generating, and the packet of having constructed will be directly in routing table injection network.
Preferably, in described method, semantic frame comprises network area, node type, the function type of node.
Preferably, in described method step (3), member node is carried out semantic frame structure in accordance with the following steps:
A1) network range of extraction member node, generates geographical location information;
A2) function of extraction member node, generates nodal function information;
A3) node type of extraction member node, generates node type information;
Then the content of generation is carried out to formalization processing and be built into semantic frame.
Preferably, in described method step (3), leader cluster node carries out event semantics framework structure in accordance with the following steps:
B1) network range of extraction leader cluster node, generates geographical location information;
The event type of event that B1) extraction occurs, generates event type information;
Then the content of generation is carried out to formalization processing and be built into event semantics framework.
Preferably, described method step (5) also comprises that leader cluster node uploads and forward after packet about event according to semantic routing table, and upper strata routing node judges whether to arrive sink node; When not reaching sink node, upper strata routing node is accepted semantic data, update semantics frame content, and tissue is from region and lower floor's data upload; Otherwise in the time that upper strata routing node reaches sink node, the process that end data forwards.
Preferably, described method step (4) leader cluster node carries out after data fusion, judges whether the result of data fusion is not inconsistent with former semanteme; Tectonic event semantic frame in the time not being inconsistent with former semanteme, uploads the packet forwarding about event; In the time conforming to former semanteme, upgrade the property value of leader cluster node.
The invention provides a kind of new WSN semantic routing algorithm, by incorporating semanteme, propose a kind of new routing algorithm, improve router efficiency, reach the object that extends network lifecycle.First algorithm establishes semantical definition and the expression-form in wireless sense network, in the time that data retransmission condition meets, the semanteme producing by wireless sense network semantical definition and sorting phase is as route foundation, semanteme in packet is mated to the direction that specified data forwards with network semanteme in router.In this algorithm, node only need be concerned about the neighbor node in own communication range, does not need to be concerned about the situation of network entirety, and algorithm redundant data is few, good energy saving property, network life cycle ideal.This algorithm also can provide certain basis for real-time, the interactive operation research of wireless sense network simultaneously.
With respect to scheme of the prior art, advantage of the present invention is:
Technical solution of the present invention level type wireless sense network carries out data retransmission method based on semantic route with respect to data forwarding method in prior art (as DD, LEACH) in energy consumption, the energy consumption of node reduces greatly, and the stability of transfer of data is greatly improved.
Brief description of the drawings
Below in conjunction with drawings and Examples, the invention will be further described:
Fig. 1 is level type wireless sense network carries out the method for data retransmission schematic flow sheet based on semantic route.
Fig. 2 is the diagrammatic representation example of semantic network of the present invention;
Fig. 3 is semantic meaning representation node storage content in semantic network of the present invention;
Fig. 4 is the network semantic frame system that semantic network of the present invention builds;
Fig. 5 is semantic network Under Layer Node Type Semantic semantic frame system of the present invention;
Fig. 6 is semantic network Under Layer Function Semantic semantic frame system of the present invention;
Fig. 7 is semantic network Under Layer Event Semantic semantic frame system of the present invention;
Fig. 8 is semantic network Self Node Type Semantic semantic frame system of the present invention;
Fig. 9 is semantic network Self Function Semantic semantic frame system of the present invention;
Figure 10 is semantic network Self Event Semantic semantic frame system of the present invention;
Figure 11 is the node death rate data comparative result of routing algorithm of the present invention and LEACH algorithm, DD algorithm.
Embodiment
Below in conjunction with specific embodiment, such scheme is described further.Should be understood that these embodiment are not limited to limit the scope of the invention for the present invention is described.The implementation condition adopting in embodiment can be done further adjustment according to the condition of concrete producer, and not marked implementation condition is generally the condition in normal experiment.
Embodiment
As shown in Figure 1, when the method that the present embodiment level type wireless sense network carries out data retransmission based on semantic route is specifically implemented, concrete steps are as follows:
S1) at a data collection cycle, each bunch of each node image data.
S2) node, by image data simple process, with threshold value comparison, needs to upload a bunch head if be greater than.
S3) if desired uploading data of node, the semantic affiliated type of judgement, sets up a new framework, and the semantic feature that node is comprised is written in framework.
S4) node carries out packet structure with the semantic frame generating, and the packet of having constructed will directly be transmitted to a bunch head.
S5) bunch head is in a data collection cycle, and the packet of uploading according to this bunch of ordinary node, extracts data and carry out data fusion, and whether judgement event occurs, and whether needs to forward this packet about event.
S6) if desired, the semantic affiliated type of judgement, sets up a new framework, and the semantic feature that this bunch of generation event comprised is written in framework.
S7) bunch head carries out packet structure with the event semantics framework generating, and the packet of having constructed will be directly in routing table injection network.
Below be specifically described, the method relates to two parts content, and a part is for determining network model and network semanteme; Another part is the data retransmission based on semantic route.
(1) determine network model and network semanteme:
1, determine network model
In level type network model, some node in network, can play the part of the forwarding person of different role, and whole network repeating person role has several ranks in data transfer procedure, therefore claims that this this model is level type.The example of a simple level type network is, has the sink node of some in wireless sense network, sink node can with user side direct communication; The node of sink node periphery according to distributed areas from several bunches of composition, a leader cluster node of every bunch of election, bunch interior nodes is only with leader cluster node communication, and communicated by letter with leader cluster node by sink node.We are denoted as S sink node set, and leader cluster node set is denoted as L, and common non-leader cluster node set is denoted as N, and between nodes, correspondence can two tuples be expressed as (S, L) and (L, N).In whole network | S|/| N| should be greater than 1,/50 0, and the sink node ratio in network can not be too small.Simultaneously in order to ensure the simplification of tightness and network integrated communication mode of Hierarchical network, node ni in same level, even if nj mutually in communication range, can communicate by letter mutually, should not set up correspondence, but will act on behalf of the communication between them by the inferior node of last layer yet.We,, this level type wireless sensing pessimistic concurrency control, become 2-level formula network.Comparatively complicated Hierarchical network is to expand on above-mentioned simple hierarchical.
In planarized structure and level type structure, in the process of data retransmission, the destination node quantity of packet can Fast Convergent, the energy that takies each transit node in the network bandwidth and consumption network that so just can minimum limitation.Simultaneously packet the path of process be also relatively short.And semantic route is a kind of Intelligent Dynamic route, its effect is also to reduce candidate lower floor roadbed also to need in network, there is hierarchical structure in semantic routing inquiry.Therefore our network model is selected hierarchical network model.
2, determine network semanteme
Be deployed in a certain area, can provide certain service wireless sense network we can with natural language description, it be disposed position, the function having, network in node type, also can be by the position of the deployment of this network part of natural language description, function, the node type etc. having.For example, when we can say " subnetwork being deployed in a-quadrant has sound and two kinds of nodes of image, and sound monitoring and the service of taking pictures can be provided ".In this sentence, " A district ", " sound ", " image ", " sound Monitoring Service ", " service of taking pictures ", the attribute feature of wireless sense network in a certain region described in these words from several angles.We can be called these words the semanteme that LAN shows, or the semanteme that has of network.
By definition semantic in wireless sense network, we can see semantic main source in network.The geographical location information of each localized network, function information, power status information, node type information etc.The geographical location information of each localized network in overall network, the wireless sense network of any wide-area deployment also covers large-area geographic range certainly, event in deployment region in a certain zonule or data must identify the region at its place, and this region is exist actually, localized network in this region has also just possessed zone name, or regional geography positional information is a kind of so semantic.Node in network may provide several different functions to user, and local network also may possess several functions and offer user, and the functional type information that node and localized network can provide is like this also a kind of semantic.Because wireless sensing net node uses powered battery, so to energy-sensitive, the power status information in network needs to show, therefore the energy state of node is a kind of semantic.In large scale deployment wireless sense network, have dissimilar sensing node, because network will provide many services, also, because network support can be expanded, can dispose dissimilar node at different time, so node type is also one of main semanteme.
A network will can be supported semantic route, and first network need to be the network of semantization.The network of semantization is that node is become to a multitiered network by semantic sorted group, every layer comprises multiple semantic subnets based on Chord agreement, each subnet represents a semantic type, there is the resource clustering of identical semantic type in same subnet, node is included into each subnet by the physical location principle close with ability, allow the large node of ability bear more workload, each subnet has higher level's subnet at last layer, in higher level's subnet, have again one or more superior nodes, subnet interior nodes has been acted on behalf of the work such as route and routing table maintenance by superior node.Fig. 2 is the diagrammatic representation of a semantic network, two, HeAB district of Tu2Zhong AA district round dot represents two subnets of the bottom, in actual network, they are two sensing nodes, and we say two temporary transient called after aa of node, ab, their sensing nodes around, taking them as router, form LiaoAA district, two, AB district subnet, the semantic content of two subnets is also stored in aa simultaneously, in two nodes of ab.Aa node is called to the semantic meaning representation node in A A district, the semantic meaning representation node in same ab node ShiAB district.AA district, AB district subnet (will have more subnet in real network) together and form A district subnet.In A district subnet, also done the semantic meaning representation node of this subnet by a sensor node a, simultaneously the router node in a Ye Shi A district.In node a, deposit the semanteme of AA district, A B district subnet, and deposit the route outlet pointer that points to AA district, AB district, and point to the route outlet pointer of top area.The semanteme of JiangAA district, AB district subnet carries out after comprehensive obtaining A district subnet semanteme, also deposits in node A, and node A finally also will semantically pass to A district subnet in the router of the semantic subnet of its last layer and go.Fig. 3 has shown the information of depositing in the semantic meaning representation node a in A district.As described above.
3, express in wireless sense network semantic with frame system
At present, conventional knowledge representation method has production representation method and frame representation.Production representation method has the features such as clarity, modularity, flexibility.But its weak point is: simple production system is because each rule is separate, and the ability to express of knowledge is poor, and retrieval in order, and in the solution procedure of challenge, efficiency is lower.And, if while realization by the form of " I F prerequisite TH EN conclusion ", knowledge base is realized with program coding, the versatility of system and user's maintainability are all very limited.Frame representation is a kind of structurized representation of knowledge form, is suitable for representing fixing concept, event and behavior.And it is a kind of multi-level data structure, can set up subframe below framework, between each framework, also can form frame network by the association of groove.Ability to express is very strong, is suitable for representing operation rules and system domain knowledge.Another advantage of frame representation is: for the knowledge of same type, can store by a general data structure, in the time that news occurs, as long as new data is inserted to framework, revise, expand very convenient.So in the time representing mode for user side semantic selection, we have selected frame representation, what value is that it manages knowledge of the same type by general data structure, and the extensibility of semantic content is had to good support.Fig. 4 is the main frame system in the frame system of expression network semanteme of structure.In Fig. 5, the basic structure of semantic frame comprises: the type (AKO) of semantic frame, the title of semantic frame, the localized network title in semantic frame source, the quantity of the type of node in localized network, the title of node type.Fig. 5 is Under Layer Node Type Semantic; Fig. 6 is Under Layer Function Semantic; Fig. 7 is Under Layer Event Semantic, is similar to Fig. 5, Fig. 6,7 be present in second layer router and more high-rise router for expressing bottom function that localized network provides, the semantic frame of event occurring.
Fig. 8 is Self Node Type Semantic; Fig. 9 is Self Function Semantic; Figure 10 is Self Event Semantic; Fig. 8 represents the localized network node type semanteme of acting on behalf of for expressing router.This Self Node Type Semantic framework is generated by the Under Layer Node Type Semantic of router node in router node, and then this framework is submitted to upper oneself level-1 router by router node.The generating mode of framework shown in Fig. 9, Figure 10 is identical with the semanteme of expression source, is equally also kept in router and submits to upper strata router.Different is that frame content derives from Under Layer Function Semantic, Under Event Semantic.
(2) data retransmission based on semantic route:
And have two-layer router (not comprising sink) hierarchical network physical structure be established as example, first carry out the foundation of bottom bunch, the selection of bunch head (being simultaneously also ground floor router).
In the time disposing node, residing node zone name is write to node.After nodes is disposed, all nodes start simultaneously, having in the node of same area title, and the sensing node self-organized clustering among a small circle that coexists, the initialization that the key of this process is bunch.Bunch head is selected by simulated annealing, and after bunch head is selected, bunch head is invited the request that adds its place bunch to periphery node broadcasts.Non-bunch of head's node, adds this bunch after receiving request, if receive the request of two leader cluster nodes simultaneously, selects its bunch that add of stronger bunch of head of signal of communication.Can complete thus bunch foundation of the network bottom.It should be noted that, leader cluster node is also defined as ground floor router.
Then carry out the selection of second layer router.Bunch setting up of the bottom is complete, after the router in the first level is all selected, starts the structure of the second level.First, all leader cluster nodes are all attempted same base station sink and are set up communication, can, with the leader cluster node of sink direct communication just as the router of secondary route layer, be denoted as S set R2.Establish after the second layer router status of oneself when these leader cluster nodes, they need to connect with other bunches of own place bunch extension direction separately, the lower level router using bunch head of these bunches as oneself.While connecting with extra-cluster, bunch head by select boundary node connect in all boundary nodes that can communicate by letter with extra-cluster with extra-cluster, selection node energy therewith node to the node of an extra-cluster bunch distance ratio maximum.
1, the foundation of the semantic statement of network and routing table
First stage, in network, basis is semantic is added up by leader cluster node.After bunch foundation above, bunch member node is by the function type of oneself and node type, power status information is submitted to leader cluster node, the above-mentioned information that leader cluster node is submitted bunch member to arranges, detailed process is first function of the same type to be merged, and obtaining result is all functions type of this bunch of support; Then same node type is merged, obtain node types all in this bunch; Last calculating energy state mean value.After completing, this process can produce local exchange domain-functionalities and two semantic frames of local exchange domain node type in leader cluster node.
Second stage, level network configuration has been set up complete, in the whole network, bunch head completes the semantic statistics in basis, leader cluster node starts two semantic frames of self to submit to higher level's routing node, leader cluster node is preserved the pointer that points to upper strata routing node simultaneously, and upper strata routing node is preserved the pointer of current communication bunch head.The semantic frame content of content update oneself in the semantic frame that higher level's routing node fusion subordinate routing node is uploaded.
Phase III, routing nodes at different levels are carried out second stage, until the complete semantic frame of sink node updates.
2, packet structure
The network area of fundamental surveillance node, node type, function type.These semantic features are exactly the substance of a semantic frame, then these substance formalization are set up to a semantic frame.
First fundamental surveillance node to obtain data and the threshold value comparison of oneself according to monitoring, and has if be greater than threshold value explanation necessity of uploading bunch head, the type under judgement is semantic, and set up a new framework according to type.Then semantic feature node being comprised is written in framework.
Its process is:
1), extract the network range of fundamental surveillance node, generate geographical location information.
2), extract the function of fundamental surveillance node, generate nodal function information
3), extract the node type of fundamental surveillance node, generate node type information.
With generate common monitoring node semantic frame carry out packet structure, the packet of having constructed will directly be transmitted to a bunch head.
Bunch head is in a data collection cycle, and the packet of uploading according to this bunch of ordinary node, extracts data and carry out data fusion, and whether judgement event occurs, and whether needs to forward this packet about event.If desired, set up a new framework, the semantic feature that this bunch of generation event comprised is written in framework, and its process is:
1) network range of extraction leader cluster node, generates geographical location information.
2) event type of event that extraction occurs, generates event type information.
On the basis of the above, with generate event semantics framework carry out packet structure, the packet of having constructed will be directly in routing table injection network.
As shown in figure 11, in the network of peer nodes scale, the time that the first node energy of this routing algorithm exhausts is 2 times of left and right of LEACH algorithm, is also 7 times of left and right of DD algorithm simultaneously.The time that all node energies exhaust, the chances are more than 2 times of LEACH algorithm, more excellent with respect to DD algorithm.This shows that this routing algorithm has extended the life cycle of network, makes the consumption of energy be undertaken by all nodes more uniformly simultaneously, has avoided single node because energy consumption too much causes too early death.2 times of the time of this algorithm half node survival, the chances are LACH algorithm, are 8 times of left and right of DD algorithm, and this explanation is along with the expansion of network area, and compared with traditional routing algorithm, the performance of this routing algorithm further improves.
In addition, this routing algorithm has reduced the redundant data in network by the semanteme mechanism of setting up, and makes energy utilization more effective, and identical energy can transmit more useful datas.
Above-mentioned example is only explanation technical conceive of the present invention and feature, and its object is to allow person skilled in the art can understand content of the present invention and implement according to this, can not limit the scope of the invention with this.All equivalent transformations that Spirit Essence does according to the present invention or modification, within all should being encompassed in protection scope of the present invention.

Claims (6)

1. level type wireless sense network carries out a method for data retransmission based on semantic route, and described level type wireless sense network is semantic network, it is characterized in that said method comprising the steps of:
(1) member node image data in data collection cycle intra-cluster;
(2) member node is processed the data that gather, and by the data that gather and default threshold value comparison; If be greater than threshold value, by the data upload leader cluster node gathering; Otherwise abandon data and wait for that next data collection cycle carries out image data;
(3) member node, according to the semantic affiliated type of the data judgement gathering, builds the relevant semantic frame of data, and the semantic feature that node is comprised is written in semantic frame; Then member node is carried out packet structure with the semantic frame generating, and the packet of having constructed is directly transmitted to leader cluster node;
(4) leader cluster node is in a data collection cycle, and the packet of uploading according to this bunch of member node, extracts data and carry out data fusion; Judge according to the result of data fusion whether event occurs and judge whether to upload the packet forwarding about event;
(5) the semantic affiliated type of leader cluster node judgement, builds event semantics framework, and the semantic feature that this bunch of generation event comprised is written in event semantics framework; Then leader cluster node carries out packet structure with the event semantics framework generating, and the packet of having constructed will be directly in routing table injection network.
2. method according to claim 1, is characterized in that semantic frame in described method comprises network area, node type, the function type of node.
3. method according to claim 1, is characterized in that in described method step (3), member node is carried out semantic frame structure in accordance with the following steps:
A1) network range of extraction member node, generates geographical location information;
A2) function of extraction member node, generates nodal function information;
A3) node type of extraction member node, generates node type information;
Then the content of generation is carried out to formalization processing and be built into semantic frame.
4. method according to claim 1, is characterized in that in described method step (5), leader cluster node carries out event semantics framework structure in accordance with the following steps:
B1) network range of extraction leader cluster node, generates geographical location information;
The event type of event that B1) extraction occurs, generates event type information;
Then the content of generation is carried out to formalization processing and be built into event semantics framework.
5. method according to claim 1, is characterized in that described method step (5) also comprises that leader cluster node uploads and forward after packet about event according to semantic routing table, and upper strata routing node judges whether to arrive sink node; When not reaching sink node, upper strata routing node is accepted semantic data, update semantics frame content, and tissue is from region and lower floor's data upload; Otherwise in the time that upper strata routing node reaches sink node, the process that end data forwards.
6. method according to claim 1, is characterized in that described method step (4) leader cluster node carries out after data fusion, judges whether the result of data fusion is not inconsistent with former semanteme; Tectonic event semantic frame in the time not being inconsistent with former semanteme, uploads the packet forwarding about event; In the time conforming to former semanteme, upgrade the property value of leader cluster node.
CN201210306088.0A 2012-08-27 2012-08-27 Method for forwarding data of hierarchal wireless sensor network based on semantic routing Expired - Fee Related CN102883400B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201210306088.0A CN102883400B (en) 2012-08-27 2012-08-27 Method for forwarding data of hierarchal wireless sensor network based on semantic routing

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201210306088.0A CN102883400B (en) 2012-08-27 2012-08-27 Method for forwarding data of hierarchal wireless sensor network based on semantic routing

Publications (2)

Publication Number Publication Date
CN102883400A CN102883400A (en) 2013-01-16
CN102883400B true CN102883400B (en) 2014-11-05

Family

ID=47484494

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201210306088.0A Expired - Fee Related CN102883400B (en) 2012-08-27 2012-08-27 Method for forwarding data of hierarchal wireless sensor network based on semantic routing

Country Status (1)

Country Link
CN (1) CN102883400B (en)

Families Citing this family (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103118097A (en) * 2013-01-25 2013-05-22 电子科技大学 Data transmission method in wireless sensor network
CN103748842B (en) * 2013-06-26 2017-04-12 华为技术有限公司 Method, device and route device for forwarding data packages
CN103702384B (en) * 2014-01-14 2017-01-25 北京航空航天大学 Application-oriented clustering routing method of wireless sensor network
CN103702385B (en) * 2014-01-14 2016-10-26 北京航空航天大学 The task diffusion allocation algorithm that wireless sensor network semanteme is sensitive
CN105101333B (en) * 2015-06-30 2018-06-29 广东海洋大学 A kind of wireless sensor network clustering routing using living space evolution intelligent algorithm
CN107801207B (en) * 2017-09-28 2020-12-22 上海交通大学 Data transmission method and system in wireless multimedia sensor network
US11196669B2 (en) 2018-05-17 2021-12-07 At&T Intellectual Property I, L.P. Network routing of media streams based upon semantic contents
CN108810843A (en) * 2018-06-08 2018-11-13 深圳源广安智能科技有限公司 Urban air-quality intelligent monitor system
CN117395273B (en) * 2023-09-25 2024-05-17 湖北华中电力科技开发有限责任公司 Security detection method and system based on cloud data comparison

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101494919A (en) * 2009-02-27 2009-07-29 深圳先进技术研究院 Route switching method for implementing wireless sensor network data query
CN102291714A (en) * 2011-09-01 2011-12-21 西安电子科技大学 Wireless sensor network safety management system
CN102547693A (en) * 2012-02-17 2012-07-04 南京邮电大学 Secure clustering routing method for wireless sensor network

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8364786B2 (en) * 2005-01-20 2013-01-29 The Regents Of The University Of California Synthesizing a scalable and incrementally updatable system software infrastructure for sensor networks

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101494919A (en) * 2009-02-27 2009-07-29 深圳先进技术研究院 Route switching method for implementing wireless sensor network data query
CN102291714A (en) * 2011-09-01 2011-12-21 西安电子科技大学 Wireless sensor network safety management system
CN102547693A (en) * 2012-02-17 2012-07-04 南京邮电大学 Secure clustering routing method for wireless sensor network

Also Published As

Publication number Publication date
CN102883400A (en) 2013-01-16

Similar Documents

Publication Publication Date Title
CN102883400B (en) Method for forwarding data of hierarchal wireless sensor network based on semantic routing
Lv et al. Infrastructure monitoring and operation for smart cities based on IoT system
CN100471153C (en) High-efficiency controlling method of wireless sensor network topology
CN102185916B (en) Method for establishing sensor network with small world and scale-free properties
CN101119372B (en) Cooperation energy-saving routing chart constructing method for mobile wireless sensor network
Anupama et al. Survey of cluster based routing protocols in mobile adhoc networks
CN101237366B (en) Realization method of wireless sensor network for collaborative energy sensing
CN103052130B (en) A kind of wireless multimedia sensor network data fusion method based on rough set
CN106550422B (en) A kind of wireless sensor network clustering routing based on harmonic search algorithm
CN101420463A (en) Wireless sensor network address allocation mechanism
CN104469879B (en) A kind of dynamic k value cluster routing methods
CN101420445A (en) Fast routing protocol of wireless sensor network
CN105246117B (en) A kind of implementation method of the energy-saving routing protocol suitable for mobile wireless Sensor Network
CN102740395A (en) Self-organizing routing method facing mobile sensor network
Manzoor et al. Enhanced TL-LEACH routing protocol for large-scale WSN applications
CN108566664A (en) A kind of WSN clustering routing optimization methods of distribution high energy efficiency
Mir et al. Collaborative topology control for many-to-one communications in wireless sensor networks
CN103095577A (en) Context-dependent non-uniform clustering routing algorithm
Zhou Research on wireless sensor network access control and load balancing in the industrial digital twin scenario
Erciyes et al. Graph theoretic clustering algorithms in mobile ad hoc networks and wireless sensor networks
CN109309944B (en) A kind of wireless multi-hop network topology discovery method
Huo et al. Design of layered and heterogeneous network routing algorithm for field observation instruments
CN107040884A (en) A kind of mobile ad hoc network data transmission method based on neighborhood strong connectedness
Tang et al. Energy‐efficient multicast routing scheme for wireless sensor networks
CN106412935B (en) A kind of network topology structure method for building up based on Complex Networks Theory

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: 20141105

Termination date: 20150827

EXPY Termination of patent right or utility model