CN102883400A - 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 PDFInfo
- Publication number
- CN102883400A CN102883400A CN2012103060880A CN201210306088A CN102883400A CN 102883400 A CN102883400 A CN 102883400A CN 2012103060880 A CN2012103060880 A CN 2012103060880A CN 201210306088 A CN201210306088 A CN 201210306088A CN 102883400 A CN102883400 A CN 102883400A
- 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.)
- Granted
Links
Images
Classifications
-
- 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
- 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
Technical field
The invention belongs to radio sensing network route technology field, be specifically related to the method that a kind of level type wireless sense network semantic-based route is carried out data retransmission.
Background technology
In the wireless sensor network architecture, the route technology of network layer is to the performance quality important of 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 the Routing Protocol of plane, the status of all-network node is equality, does not have grade and level difference.They feed back to generate route by each other partial operation and information.In this quasi-protocol, destination node (sink) is sent querying command to the node (source) of monitored area, after the node in the monitored area is received querying command, sends Monitoring Data to destination node.Plane road by advantage be simple, easily expansion, need not carry out any structural maintenance work, all-network node equal is difficult for producing bottleneck effect, therefore has preferably 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: without management node, lack the optimum management to the communication resource in the network, self-organizing collaborative work algorithm is complicated, and the reaction speed of network dynamic change is waited more slowly.
In the 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 the areal model needs each node to keep 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 the node, and simultaneously along with the 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, therefore in addition owing to having comprised a large amount of routing iinformations in the transmission information, can cause increasing the weight of of communications burden in the network.Plane model defective aspect the network in general energy consumption is apparent in view in sum.
In clustering route protocol, network is divided into bunch usually.So-called bunch, has exactly certain related set of network nodes.Each bunch be by member composition in a cluster head and a plurality of bunches, the cluster head of low primary network station be in the high primary network station bunch in the member, communicated by letter with base station BS (base station) by top cluster head.This class algorithm is divided into continuous zone with whole network.Under the Topology Management mechanism of sub-clustering, the node in the 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, be used for management or control member node in whole bunch, coordinate the work between the member node, be responsible for the collection of bunch internal information and data fusion treatment and bunch between transmit.
Clustering routing mechanism has following advantage: 1. the member node most of the time can the communication close module, by cluster head consist of one more the connected network of last layer be responsible for the length of data apart from routing forwarding.So both guarantee the data communication in original coverage, also saved to a great extent network energy; 2. cluster head is transmitted 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 the 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 preferably extensibility, is fit to large scale network; With plane road by comparing, 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 semantic-based route to carry out the method for data retransmission, has solved the problems that common wireless sensor network route data transmission brings in the prior art.
In order to solve these problems of the prior art, technical scheme provided by the invention is:
A kind of level type wireless sense network semantic-based route is carried out the method for data retransmission, 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 the data collection cycle intra-cluster;
(2) member node is processed the data that gather, and with the data that gather and the threshold ratio of presetting; If greater than threshold value then with the data upload leader cluster node that gathers; Otherwise abandon data and wait for that next data collection cycle carries out image data;
(3) member node is judged semantic affiliated type according to the data that gather, and makes up the relevant semantic frame of data, and the semantic feature that node is comprised is written in the semantic frame; Then member node is carried out the packet structure with the semantic frame that generates, and the packet that structure is good will directly be transmitted to leader cluster node;
(4) leader cluster node according to the packet that this bunch member node is uploaded, extracts data and carries out data fusion in a data collection period; Judge whether event occurs and judge whether that needs upload the packet of transmitting relevant event according to the result of data fusion;
(5) leader cluster node is judged semantic affiliated type, makes up the event semantics framework, and the semantic feature that this bunch generation event is comprised is written in the event semantics framework; Then leader cluster node carries out the packet structure with the event semantics framework that generates, and the packet that structure is good will be directly in the routing table injection network.
Preferably, semantic frame comprises network area, node type, the function type of node in the described method.
Preferably, member node is carried out the semantic frame structure in accordance with the following steps in the described method step (3):
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 that generates is carried out the formalization processing and be built into semantic frame.
Preferably, leader cluster node carries out event semantics framework structure in accordance with the following steps in the described method step (3):
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 that generates is carried out the formalization processing and be built into the event semantics framework.
Preferably, after described method step (5) comprised that also leader cluster node is uploaded the packet of transmitting relevant event according to semantic routing table, the upper strata routing node judged whether to arrive the sink node; When not reaching the sink node, the upper strata routing node is accepted semantic data, the update semantics frame content, and tissue is from zone and lower floor's data upload; Otherwise when the upper strata routing node reaches the sink node, the process that end data is transmitted.
Preferably, after described method step (4) leader cluster node carries out data fusion, judge whether the result of data fusion is not inconsistent with former semanteme; Tectonic event semantic frame when not being inconsistent with former semanteme is uploaded the packet of transmitting relevant event; When 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 purpose that prolongs network lifecycle.Algorithm is at first established semantical definition and the expression-form in the wireless sense network, when the data retransmission condition satisfies, the semanteme that produces by wireless sense network semantical definition and sorting phase is as the route foundation, semanteme in the data grouping is mated the direction that specified data is transmitted with network semanteme in the router.In this algorithm, node only need be concerned about the neighbor node in the own communication range, does not need to be concerned about the situation of network integral body, and the algorithm redundant data is few, good energy saving property, and network life cycle is desirable.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:
The method that technical solution of the present invention level type wireless sense network semantic-based route is carried out data retransmission with respect to data forwarding method in the prior art (such as DD, LEACH) on energy consumption, the energy consumption of node reduces greatly, and the stability of transfer of data is greatly improved.
Description of drawings
The invention will be further described below in conjunction with drawings and Examples:
Fig. 1 is the schematic flow sheet that level type wireless sense network semantic-based route is carried out the method for data retransmission.
Fig. 2 is the diagrammatic representation example of semantic network of the present invention;
Fig. 3 is semantic meaning representation node memory contents in the semantic network of the present invention;
Fig. 4 is the network semantic frame system that semantic network of the present invention makes up;
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 explanation the present invention.The implementation condition that adopts among the embodiment can be done further adjustment according to the condition of concrete producer, and not marked implementation condition is generally the condition in the normal experiment.
Embodiment
Concrete steps were as follows when as shown in Figure 1, the present embodiment level type wireless sense network semantic-based route was carried out the method implementation of data retransmission:
S1) at a data collection period, each node image data of each bunch.
S2) node is the image data simple process, with threshold ratio, if greater than then uploading a bunch head.
S3) if node needs uploading data, then judge semantic affiliated type, set up a new framework, the semantic feature that node is comprised is written in the framework.
S4) node carries out the packet structure with the semantic frame that generates, and the packet that structure is good will directly be transmitted to a bunch head.
S5) bunch head according to the packet that this bunch ordinary node is uploaded, extracts data and carries out data fusion in a data collection period, and whether the judgement event occurs, and whether needs to transmit the packet of this relevant event.
S6) if need, then judge semantic affiliated type, set up a new framework, the semantic feature that this bunch generation event is comprised is written in the framework.
S7) bunch head carries out the packet structure with the event semantics framework that generates, and the packet that structure is good will be directly in the routing table injection network.
Below carry out specific description, the method relates to two parts content, and a part is semantic for determining network model and network; Another part is the data retransmission of semantic-based route.
(1) determine that network model and network are semantic:
1, determines network model
In level type network model, some node in the network can play the part of the forwarding person of different role in data transfer procedure, and whole network repeating person role has several ranks, therefore claims that this this model is the level type.The example of a simple level type network is, the sink node of some is arranged in the wireless sense network, the sink node can with the user side direct communication; The node of sink node periphery according to distributed areas from forming several bunches, leader cluster node of every bunch of election, bunch interior nodes is only with leader cluster node communication, and by the sink node with leader cluster node communication.We are denoted as S to the sink node set, and the leader cluster node set is denoted as L, and common non-leader cluster node set is denoted as N, and then correspondence can two tuples be expressed as (S, L) and (L, N) between nodes.In the whole network | S|/| N| should be greater than 1/500, and the sink node ratio in the network can not be too small.Simultaneously for the tightness that guarantees Hierarchical network and the simplification of network integrated communication mode, node ni in the same level is even nj mutually in communication range, can communicate by letter mutually, should not set up correspondence yet, but will act on behalf of communication between them by the node of last layer time.We become 2-level formula network to this level type wireless sensing pessimistic concurrency control.Comparatively complicated Hierarchical network then is to expand at 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 the consumption network that so just can minimumly limit the quantity of.Simultaneously packet the path of process also be relatively short.And semantic route is a kind of Intelligent Dynamic route, and its effect also is to reduce candidate lower floor roadbed to need also that in the routing inquiry of semanteme hierarchical structure is arranged in the network.Therefore our network model is selected the hierarchical network model.
2, determine that network is semantic
Be deployed in a certain area, can provide certain service wireless sense network we can it be disposed with natural language description position, the function that has, network in node type, also can be with the position of the deployment of this network part of natural language description, the function that has, node type etc.For example work as us and can say " subnetwork that is deployed in the 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 characteristics of wireless sense network in a certain zone 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.
We can see semantic main source in the network by definition semantic in the wireless sense 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 the 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 zone at its place, and this zone is exist actually, localized network in this zone has also just possessed zone name, or a kind of like this semanteme of regional geography positional information.Node in the network may provide several different functions to the user, and local network also may possess several functions and offer the user, and node and the localized network functional type information that can provide also is a kind of semanteme like this.Because wireless sensing net node uses powered battery, so to energy-sensitive, the power status information in the network needs and can show, so the energy state of node is a kind of semanteme.In the 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 also is one of main semanteme.
A network will can be supported semantic route, and at first network need to be the network of semantization.The network of semantization is that node is become a multitiered network by semantic sorted group, every layer comprises a plurality of semantic subnets based on the Chord agreement, each subnet represents a semantic type, has 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, one or more superior nodes are arranged again in higher level's subnet, and the subnet interior nodes is finished the work such as route and routing table maintenance by the superior node agency.Fig. 2 is the diagrammatic representation of a semantic network, two round dots in AA district and AB district represent two subnets of the bottom among Fig. 2, in the network of reality, they are two sensing nodes, and we say two temporary transient called after aa of node, ab, sensing node around them has formed the AA district, two subnets in AB district take them as router, the semantic content of two subnets also is stored in aa simultaneously, in two nodes of ab.The semantic meaning representation node that the aa node is called A A district, same ab node is the semantic meaning representation node in AB district.The AA district, AB district subnet (will have more subnet in the real network) together and consist of A district subnet.Also done the semantic meaning representation node of this subnet in the A district subnet by a sensor node a, a also is the router node in A district simultaneously.Deposit the semanteme of AA district, AB district subnet among the node a, and deposit the route outlet pointer that points to AA district, AB district, and the route outlet pointer that points to top area.The semanteme of AA district, AB district subnet is carried out obtaining A district subnet after comprehensive semantic, also deposit among the node A, node A also will semantically pass to A district subnet at last in the router of its last layer semanteme subnet and go.Fig. 3 has shown the information of depositing among the semantic meaning representation node a in A district.As indicated above.
3, express in the wireless sense network semantic with frame system
At present, knowledge representation method commonly used has production representation method and frame representation.The production representation method has the characteristics 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 relatively poor, and in order retrieval, and efficient is lower in the solution procedure of challenge.And, if when realizing with the form of " IF prerequisite TH EN conclusion ", knowledge base is realized with program coding, the versatility of system and user's maintainability all are very limited.Frame representation is a kind of structurized representation of knowledge form, is suitable for representing concept, event and the behavior fixed.And it is a kind of multi-level data structure, can set up subframe below the framework, also can consist of frame network by the association of groove between each framework.Ability to express is very strong, is suitable for representing operation rules and system's domain knowledge.Another advantage of frame representation is: for the knowledge of same type, can store with a general data structure, when news occurs, as long as new data is inserted framework, revise, expand very convenient.So when representing mode for the user side semantic selection, we have selected frame representation, what value is that it manages knowledge of the same type with general data structure, and the extensibility of semantic content is had good support.Fig. 4 is the main frame system in the frame system of expression network semanteme of structure.The basic structure of semantic frame comprises among Fig. 5: the type of semantic frame (AKO), the title of semantic frame, the localized network title in semantic frame source, the quantity of the type of node in the 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, and Fig. 6,7 is present in the semantic frame that is used for expression bottom function that localized network provides, generation event in second layer router and the more high-rise router.
Fig. 8 is Self Node Type Semantic; Fig. 9 is Self Function Semantic; Figure 10 is Self Event Semantic; Fig. 8 represents that the localized network node type of acting on behalf of for the expression router is semantic.This Self Node Type Semantic framework is generated by the Under Layer Node Type Semantic of router node in router node, and then router node is submitted to upper oneself level-1 router with this framework.The generating mode of Fig. 9, framework shown in Figure 10 and the semanteme of expression source is identical, equally also is kept in the router and submits to the upper strata router.Different is that frame content derives from Under Layer Function Semantic, Under Event Semantic.
(2) data retransmission of semantic-based route:
With the example that is established as of the hierarchical network physical structure of (not comprising sink) with two-layer router, at first carry out the foundation of bottom bunch, the selection of bunch head (also being the ground floor router simultaneously).
When disposing node, the residing zone name of node has been write node.Nodes dispose complete after, all nodes start simultaneously, in the node with same area title, 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, bunch head selected complete after, bunch head is invited the request that adds its place bunch to peripheral node broadcasts.Non-bunch of head's node adds this bunch after the request of receiving, if receive simultaneously the request of two leader cluster nodes, then select its bunch of adding of stronger bunch of head of signal of communication.Then can finish thus bunch foundation of the network bottom.Need to prove, leader cluster node also is defined as the 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, begins the structure of the second level.At first, all leader cluster nodes are all attempted setting up communication with base station sink, can just be used as with the leader cluster node of sink direct communication the router of secondary route layer, are denoted as S set R2.After these leader cluster nodes were established own second layer router status, their needs connected with other bunches of own place bunch extension direction separately, with bunch head of these bunches lower level router as oneself.When connecting with extra-cluster, bunch head by select boundary node and extra-cluster connect all can with boundary node that extra-cluster is communicated by letter in, the 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
Phase I, the basis is semantic in the network is added up by leader cluster node.After bunch foundation of preamble, bunch member node is with oneself function type and node type, power status information is submitted to leader cluster node, leader cluster node is put the above-mentioned information that bunch member submits in order, detailed process is at first function of the same type to be merged, and obtaining the result is all functions type of this bunch support; Then same node type is merged, obtain node types all in this bunch; Last calculating energy state mean value.After finishing, this process can produce local exchange domain-functionalities and two semantic frames of local exchange domain node type in the leader cluster node.
Second stage, the level network configuration has been set up complete, bunch head is finished the semantic statistics in basis in the whole network, leader cluster node begins two semantic frames of self are submitted to higher level's routing node, leader cluster node is preserved the pointer that points to the upper strata routing node simultaneously, and the 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 a semantic frame are set up in these substance formalization.
At first the fundamental surveillance node according to monitor data and own threshold ratio, if greater than the threshold value explanation necessity of uploading bunch head is arranged, judge semantic affiliated type, and set up a new framework according to type.Then the semantic feature that node is comprised is written in the 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.
Carry out the packet structure with the common monitoring node semantic frame that generates, the packet that structure is good will directly be transmitted to a bunch head.
Bunch head according to the packet that this bunch ordinary node is uploaded, extracts data and carries out data fusion in a data collection period, and whether the judgement event occurs, and whether needs to transmit the packet of this relevant event.If need, set up a new framework, the semantic feature that this bunch generation event is comprised is written in the framework, and its process is:
1) network range of extraction leader cluster node generates geographical location information.
The event type of event that 2) extraction occurs generates event type information.
On the basis of the above, carry out the packet structure with the event semantics framework that generates, the packet that structure is good will be directly in the routing table injection network.
In the network of peer nodes scale, the time that the first node energy of this routing algorithm exhausts is about 2 times of LEACH algorithm, also is simultaneously about 7 times of DD algorithm.All the chances are time of exhausting of node energies more than 2 times of LEACH algorithm, more excellent with respect to the DD algorithm.This shows that this routing algorithm has prolonged the life cycle of network, so that the consumption of energy is undertaken by all nodes more uniformly, has avoided single node because energy consumption too much causes too early death simultaneously.2 times of the time of half node of this algorithm survival, the chances are LACH algorithm are about 8 times of DD algorithm, and this explanation is compared with traditional routing algorithm along with the expansion of network area, and the performance of this routing algorithm further improves.
In addition, this routing algorithm has reduced the redundant data in the network by the semantic mechanism of setting up, so that the energy utilization is more effective, identical energy can transmit more useful datas.
Above-mentioned example only is explanation technical conceive of the present invention and characteristics, and its purpose is to allow the people who is familiar with technique can understand content of the present invention and according to this enforcement, can not limit protection scope of the present invention with this.All equivalent transformations that Spirit Essence is done according to the present invention or modification all should be encompassed within protection scope of the present invention.
Claims (6)
1. a level type wireless sense network semantic-based route is carried out the method for data retransmission, 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 the data collection cycle intra-cluster;
(2) member node is processed the data that gather, and with the data that gather and the threshold ratio of presetting; If greater than threshold value then with the data upload leader cluster node that gathers; Otherwise abandon data and wait for that next data collection cycle carries out image data;
(3) member node is judged semantic affiliated type according to the data that gather, and makes up the relevant semantic frame of data, and the semantic feature that node is comprised is written in the semantic frame; Then member node is carried out the packet structure with the semantic frame that generates, and the packet that structure is good will directly be transmitted to leader cluster node;
(4) leader cluster node according to the packet that this bunch member node is uploaded, extracts data and carries out data fusion in a data collection period; Judge whether event occurs and judge whether that needs upload the packet of transmitting relevant event according to the result of data fusion;
(5) leader cluster node is judged semantic affiliated type, makes up the event semantics framework, and the semantic feature that this bunch generation event is comprised is written in the event semantics framework; Then leader cluster node carries out the packet structure with the event semantics framework that generates, and the packet that structure is good will be directly in the routing table injection network.
2. method according to claim 1 is characterized in that semantic frame in the described method comprises network area, node type, the function type of node.
3. method according to claim 1 is characterized in that in the described method step (3) that member node carries out in accordance with the following steps semantic frame and make up:
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 that generates is carried out the formalization processing and be built into semantic frame.
4. method according to claim 1 is characterized in that in the described method step (3) that leader cluster node carries out in accordance with the following steps the event semantics framework and makes up:
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 that generates is carried out the formalization processing and be built into the event semantics framework.
5. method according to claim 1, it is characterized in that described method step (5) comprises that also leader cluster node is uploaded the packet of transmitting relevant event according to semantic routing table after, the upper strata routing node judges whether to arrive the sink node; When not reaching the sink node, the upper strata routing node is accepted semantic data, the update semantics frame content, and tissue is from zone and lower floor's data upload; Otherwise when the upper strata routing node reaches the sink node, the process that end data is transmitted.
6. method according to claim 1, it is characterized in that described method step (4) leader cluster node carries out data fusion after, judge whether the result of data fusion is not inconsistent with former semanteme; Tectonic event semantic frame when not being inconsistent with former semanteme is uploaded the packet of transmitting relevant event; When conforming to former semanteme, upgrade the property value of leader cluster node.
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 true CN102883400A (en) | 2013-01-16 |
| CN102883400B 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) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103118097A (en) * | 2013-01-25 | 2013-05-22 | 电子科技大学 | Data transmission method in wireless sensor network |
| CN103748842A (en) * | 2013-06-26 | 2014-04-23 | 华为技术有限公司 | Method, device and route device for forwarding data packages |
| CN105101333A (en) * | 2015-06-30 | 2015-11-25 | 广东海洋大学 | Wireless sensor network cluster-based routing method adopting living space evolution (LSE) intelligent algorithm |
| CN103702385B (en) * | 2014-01-14 | 2016-10-26 | 北京航空航天大学 | The task diffusion allocation algorithm that wireless sensor network semanteme is sensitive |
| CN103702384B (en) * | 2014-01-14 | 2017-01-25 | 北京航空航天大学 | Application-oriented clustering routing method of wireless sensor network |
| CN107801207A (en) * | 2017-09-28 | 2018-03-13 | 上海交通大学 | Data transmission method and system in radio multimedia sensor network network |
| CN108810843A (en) * | 2018-06-08 | 2018-11-13 | 深圳源广安智能科技有限公司 | Urban air-quality intelligent monitor system |
| US11196669B2 (en) | 2018-05-17 | 2021-12-07 | At&T Intellectual Property I, L.P. | Network routing of media streams based upon semantic contents |
| CN117395273A (en) * | 2023-09-25 | 2024-01-12 | 湖北华中电力科技开发有限责任公司 | Security detection method and system based on cloud data comparison |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060161909A1 (en) * | 2005-01-20 | 2006-07-20 | Raju Pandey | Synthesizing a scalable and incrementally updatable system software infrastructure for sensor networks |
| 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 |
-
2012
- 2012-08-27 CN CN201210306088.0A patent/CN102883400B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060161909A1 (en) * | 2005-01-20 | 2006-07-20 | Raju Pandey | Synthesizing a scalable and incrementally updatable system software infrastructure for sensor networks |
| 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 |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103118097A (en) * | 2013-01-25 | 2013-05-22 | 电子科技大学 | Data transmission method in wireless sensor network |
| CN103748842A (en) * | 2013-06-26 | 2014-04-23 | 华为技术有限公司 | Method, device and route device for forwarding data packages |
| CN103748842B (en) * | 2013-06-26 | 2017-04-12 | 华为技术有限公司 | Method, device and route device for forwarding data packages |
| CN103702385B (en) * | 2014-01-14 | 2016-10-26 | 北京航空航天大学 | The task diffusion allocation algorithm that wireless sensor network semanteme is sensitive |
| CN103702384B (en) * | 2014-01-14 | 2017-01-25 | 北京航空航天大学 | Application-oriented clustering routing method of wireless sensor network |
| CN105101333B (en) * | 2015-06-30 | 2018-06-29 | 广东海洋大学 | A kind of wireless sensor network clustering routing using living space evolution intelligent algorithm |
| CN105101333A (en) * | 2015-06-30 | 2015-11-25 | 广东海洋大学 | Wireless sensor network cluster-based routing method adopting living space evolution (LSE) intelligent algorithm |
| CN107801207A (en) * | 2017-09-28 | 2018-03-13 | 上海交通大学 | Data transmission method and system in radio multimedia sensor network network |
| 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 |
| CN117395273A (en) * | 2023-09-25 | 2024-01-12 | 湖北华中电力科技开发有限责任公司 | Security detection method and system based on cloud data comparison |
| CN117395273B (en) * | 2023-09-25 | 2024-05-17 | 湖北华中电力科技开发有限责任公司 | Security detection method and system based on cloud data comparison |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102883400B (en) | 2014-11-05 |
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 | |
| Baronti et al. | Wireless sensor networks: A survey on the state of the art and the 802.15. 4 and ZigBee standards | |
| CN103916942B (en) | LEACH protocol improvement method capable of lowering energy consumption | |
| CN102497679B (en) | Static clustering algorithm for wireless sensor network | |
| CN101119372B (en) | Cooperation energy-saving routing chart constructing method for mobile wireless sensor network | |
| CN101013987A (en) | High-efficiency controlling method of wireless sensor network topology | |
| CN100536476C (en) | Mixed mobile agent-based wireless sensor network data transmission method | |
| CN103052130B (en) | A kind of wireless multimedia sensor network data fusion method based on rough set | |
| CN104093188B (en) | Novel cluster head election method for wireless sensor networks | |
| CN105246117B (en) | A kind of implementation method of the energy-saving routing protocol suitable for mobile wireless Sensor Network | |
| CN104469879B (en) | A kind of dynamic k value cluster routing methods | |
| CN106550422B (en) | A kind of wireless sensor network clustering routing based on harmonic search algorithm | |
| CN106304234A (en) | A kind of wireless sensor network energy consumption optimization method based on clustering routing agreement | |
| CN102158927A (en) | Efficient inhomogeneous clustering routing method of wireless sensor network | |
| CN103269507A (en) | Routing method of double-cluster head wireless sensor network | |
| CN102333321B (en) | Layered-structure-based topology control method for dynamic wireless sensor network | |
| CN108566664A (en) | A kind of WSN clustering routing optimization methods of distribution high energy efficiency | |
| CN106211258B (en) | A kind of cluster tree route method and device based on cluster head rotation mechanism | |
| CN101170499A (en) | A selection method for combined service execution path in self-organized network | |
| CN107404745A (en) | A kind of fire detector remote detecting system based on MANET | |
| CN103582065A (en) | Efficient ad hoc network routing method for wireless sensor network | |
| Mir et al. | Collaborative topology control for many-to-one communications in wireless sensor networks | |
| Ahmed et al. | Cluster head selection using decision trees for wireless sensor networks | |
| CN109640283A (en) | A kind of low-consumption wireless sensing network design method based on self energizing technology |
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 |