CN102202372B - Chain routing method of wireless sensor network based on fuzzy theory - Google Patents
Chain routing method of wireless sensor network based on fuzzy theory Download PDFInfo
- Publication number
- CN102202372B CN102202372B CN2011101610010A CN201110161001A CN102202372B CN 102202372 B CN102202372 B CN 102202372B CN 2011101610010 A CN2011101610010 A CN 2011101610010A CN 201110161001 A CN201110161001 A CN 201110161001A CN 102202372 B CN102202372 B CN 102202372B
- Authority
- CN
- China
- Prior art keywords
- node
- chain
- membership function
- base station
- fic
- 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
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
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a chain routing method of a wireless sensor network based on a fuzzy theory in the communication technical field of communication of wireless sensor networks. The method is characterized by comprising the following steps of: constructing a network node into a chain with a branch; establishing a membership function that node surplus energy and the node become the chain fistpossibility and a membership function that the distance between the node and the node base station and the node become the chain fist possibility; after performing fusion of the two membership functions, selecting the maximum node as the chain first; and then establishing the routing. According to the invention, long-chain generation and uncertainty of threshold definition can be avoided; the defect of an EEPB (Energy-Efficient PEGASIS-Based) protocol is improved; energy consumption of the whole network node is balanced; and the life cycle of the network is further improved.
Description
Technical field
The invention belongs to the network communication of wireless sensor technical field, relate in particular to a kind of chain routing method of wireless sensor network based on fuzzy theory.
Background technology
The develop rapidly of MEMS (micro electro mechanical system), SOC (system on a chip), radio communication and low-power-consumption embedded technology is pregnant with wireless sensor network, the change that its low-power consumption, low cost, characteristics distributed and self-organizing have been brought information Perception.But, the wireless sensor network of design high energy efficiency is still one of significant challenge that we face, because the energy of node is extremely limited in wireless sensor network, node is placed in the complex environment, in case running down of battery, can't carry out power supply supplies with, simultaneously communication and the computing capability of node are all limited, thus how the optimize communicate path, improve the important issue that the problems such as energy efficiency and energy consumption balance, maximization network life cycle just become the design Wireless Sensor Network Routing Protocol.
Effectively Routing Protocol can be realized the equilibrium use of node energy, and many Wireless Sensor Network Routing Protocols are suggested.According to network topology structure, they can be divided into plane Routing Protocol and hierarchical routing, and wherein the hierarchy type route has higher energy efficiency, it is divided into the efficient forwarding data of different sub-network with sensor node, has avoided the overlapping energy dissipation that causes of neighbor node transmission message in the plane formula route.
The PEGASIS agreement is a kind of typical hierarchy type Routing Protocol based on chain structure, and its core concept is to utilize greedy algorithm to generate a strand that is comprised of all nodes, and node is only communicated by letter with the neighbor node of oneself on the chain.Except end node, the data that each node is received oneself merge with the data that oneself produces, and then the data after will merging pass to adjacent node on the chain along the first-in-chain(FIC) node direction, until data arrive the first-in-chain(FIC) node, the first-in-chain(FIC) node is responsible for data are sent to the base station of far-end.This method for routing is compared cluster routing method and has been obtained to a certain extent the equilibrium of node energy consumption and the prolongation of network life, produces the impact that the factors such as long-chain and base station position information are brought network performance between node but ignored.
The EEPB agreement is improved on the PEGASIS basis, and it avoids producing between adjacent node long-chain by introducing distance threshold value.Choose the first-in-chain(FIC) node and according to the gravity treatment frequency of nodes surplus ratio decision first-in-chain(FIC) node by considering residue energy of node and node to the distance of base station.This agreement has more superior performance than the PEGASIS agreement aspect balance node energy consumption and the prolong network lifetime, but because the uncertainty of definition threshold value, threshold value is chosen the improper long-chain that then is difficult to avoid, although and the choosing method of first-in-chain(FIC) considers residue energy of node and node to these 2 factors of base station distance but fails to disclose more accurately both and the first-in-chain(FIC) relation between choosing, and promotes limited to network performance.
Summary of the invention
Be difficult to avoid long-chain, threshold value to be difficult to the deficiencies such as selection for mentioning existing method in the above-mentioned background technology, the present invention proposes a kind of chain routing method of wireless sensor network based on fuzzy theory.
Technical scheme of the present invention is based on the chain routing method of wireless sensor network of fuzzy theory, to it is characterized in that the method may further comprise the steps:
Step 1: netinit is built into a chain that branch is arranged with nodes;
Step 2: set up the membership function that residue energy of node and node become the first-in-chain(FIC) possibility;
Step 3: set up node becomes the first-in-chain(FIC) possibility to the distance of base station and node membership function;
Step 4: two membership functions in step 2 and the step 3 are merged;
Step 5: choose node maximum after merging as first-in-chain(FIC), finish the foundation of route.
Described step 1 specifically may further comprise the steps:
Step 1.1: base station broadcast sends initial message, obtains current network survival node ID tabulation and node to the distance tabulation of base station;
Step 1.2: will be apart from base station node farthest as end node, nodal scheme is 1;
Step 1.3: the end node of chain arrives its range information by obtaining the node that does not enter chain in the network, find from the node i of its nearest node as chain to be added;
Step 1.4: node i is obtained i-1 node adding on the chain to its range information, find from its nearest node j and with its adding chain that directly links to each other, node i becomes end node new on the chain;
Step 1.5: repeating step 1.3 and step 1.4, until all nodes all add chain, build up a chain that branch is arranged.
The computing formula of the membership function of described step 2 is:
Wherein:
μ
e(i) be node i is under the jurisdiction of first-in-chain(FIC) based on dump energy membership function value;
F
e(i) be the dump energy normalized value of node i.
Described F
e(i) computing formula is:
Wherein:
E
Res(i) be the current dump energy of node i;
E
0Primary power for node.
The computing formula of the membership function of described step 3 is:
Wherein:
μ
d(i) be node i is under the jurisdiction of first-in-chain(FIC) based on the distance to the base station membership function value;
F
d(i) be the range normalization value of node i to the base station;
σ is for regulating the parameter of membership function;
C is for regulating the parameter of membership function.
Described F
d(i) computing formula is:
Wherein:
d
ToBS(i) be the distance of node i to the base station;
d
MAXBe the distance to the base station of node farthest.
The value of described σ is:
σ=1.0。
The value of described c is:
c=0。
The fusion formula of described step 4 is:
Wherein:
μ (i) is under the jurisdiction of the membership function value of first-in-chain(FIC) for node i.
Definite step of first-in-chain(FIC) is in the described step 5:
Step 5.1: each node calculates the membership function value μ (i) of oneself on the chain;
Step 5.2: the node with maximum μ (i) value becomes the first-in-chain(FIC) that this is taken turns by the base station broadcast notice.
Beneficial effect of the present invention is: in the link setup stage, and the distance between twice comparison node, and connect the node with shortest path and enter chain, avoided the uncertainty of generation and the threshold value definition of long-chain; Simultaneously, choose the stage at first-in-chain(FIC) and set up membership function based on fuzzy theory, utilize Triangle Module to merge operator and consider residue energy of node and node to 2 factors of distance of base station, characterizing node becomes the possibility of first-in-chain(FIC), thereby balance the energy consumption of whole network node, finally improve the whole life cycle of network.
Description of drawings
Fig. 1 is based on the flow chart of the chain routing method of wireless sensor network of fuzzy theory;
Fig. 2 is the flow chart of node link setup in the wireless sensor network;
Fig. 3 is the illustraton of model after utilizing chain routing method of wireless sensor network based on fuzzy theory with the sensor network nodes link setup;
Fig. 4 is node survival number comparative graph;
Fig. 5 is every average energy consumption comparative graph of taking turns.
Embodiment
Below in conjunction with accompanying drawing, preferred embodiment is elaborated.Should be emphasized that following explanation only is exemplary, rather than in order to limit the scope of the invention and to use.
The present invention has overcome the deficiency of existing chain routing method of wireless sensor network, a kind of chain routing method of wireless sensor network based on fuzzy theory has been proposed, by adopting new link constructing method, avoided the generation of long-chain, and when the first-in-chain(FIC) node selection by introducing fuzzy theory, consider residue energy of node and node to 2 factors of distance of base station, guarantee the harmony of node energy consumption, improve network lifecycle.
Below in conjunction with accompanying drawing, the method for the invention is elaborated.Should be emphasized that following explanation only is exemplary, rather than in order to limit the scope of the invention and to use.
The present invention includes following step:
1: netinit is built into a chain that branch is arranged with nodes;
2: set up the membership function that residue energy of node and node become the first-in-chain(FIC) possibility;
3: set up node becomes the first-in-chain(FIC) possibility to the distance of base station and node membership function;
4: utilize the Generalized Triangular Norm that two membership functions in step 2 and the step 3 are merged;
5: choose node maximum after merging as this first-in-chain(FIC) of taking turns, Route establishment is finished, beginning data acquisition and transmission.
Figure 1 shows that specific implementation process of the present invention.
Initialization network environment: at random, uniform broadcasting is a plurality of has an identical primary power E
0, same communication ability and sensing ability sensor node, sensor node is known the geographical position of oneself and should be had unique ID, each node can both perception oneself dump energy, the sensor node of spreading adds up to 100 (disregarding aggregation node), and the area of overlay area is 100 meters * 100 meters; Base station (aggregation node) is deployed in the position away from meshed network, and coordinate is made as (50,300); Sensor node can be directly and base station communication; The power of base station and data-handling capacity will far be better than general sensor nodes.
The beginning link setup, its process may further comprise the steps as shown in Figure 2:
1) base station broadcast sends initial message " hello ", obtains the positional information of all nodes of network;
2) will be apart from base station node farthest as end node, nodal scheme is 1;
3) end node is by obtaining the residue of network organization node to its range information and seeking from the node of its nearest node as i chain to be added, and i represents that node adds the order of chain;
4) node i is obtained i-1 the node that adds on the chain and is arrived its range information, finds from its nearest node j and coupled, and node i adds chain also becomes new end node;
5) repeat above-mentioned steps until the residue node set is judged as empty set, namely all nodes have entered chain, build up a chain that branch is arranged.
Figure 3 shows that the chain that branch is arranged that 100 nodes of random distribution in the network obtain by above-mentioned link constructing method.The open circles node is apart from base station node farthest, and first adds chain, so label is 1.
Choose the stage at first-in-chain(FIC), it is close to the distance relation of base station whether node becomes first-in-chain(FIC) and residue energy of node and it.We preferentially choose dump energy high and apart from the near node in base station as first-in-chain(FIC), but because this relation is difficult to definite statement, the present invention adopts the membership function of variable to characterize the possibility that node becomes first-in-chain(FIC), set up respectively the membership function that these two characteristic parameters and node become the first-in-chain(FIC) possibility based on fuzzy theory, utilize at last the Generalized Triangular Norm that judgement is unified in its fusion, choose first-in-chain(FIC) according to the maximum principle of degree of membership value.
Setting up residue energy of node situation and node becomes the membership function of first-in-chain(FIC) possibility:
Wherein:
μ
e(i) be node i is under the jurisdiction of first-in-chain(FIC) based on dump energy membership function value;
F
e(i) be the dump energy normalized value of node i,
Wherein, E
Res(i) be the current dump energy of node i; E
0Primary power for node.
Set up node and become the membership function of first-in-chain(FIC) possibility to the base station apart from situation and node:
Wherein:
μ
d(i) be node i is under the jurisdiction of first-in-chain(FIC) based on the distance to the base station membership function value;
F
d(i) be the range normalization value of node i to the base station,
d
ToBS(i) be the distance of node i to the base station; d
MAXBe the distance to the base station of node farthest;
σ is for regulating the parameter of membership function, σ=1.0;
C is for regulating the parameter of membership function, c=0.
Use fuzzy theory, utilize the Generalized Triangular Norm that above-mentioned two membership functions are merged:
Wherein:
μ (i) is under the jurisdiction of the membership function value of first-in-chain(FIC) for node i, chooses the node of μ (i) value maximum as this first-in-chain(FIC) node of taking turns according to the maximum principle of membership function value.
Definite step of first-in-chain(FIC) is:
(1) each node calculates the membership function value μ (i) of oneself on the chain;
(2) node that has maximum μ (i) value becomes the first-in-chain(FIC) that this is taken turns by the base station broadcast notice.
Base station broadcast was notified all nodes after the first-in-chain(FIC) node selection was finished, and sent Beacon information and triggered this Data Collection of taking turns and transmission, and adopt the TDMA mode to distribute the time slot of each node.By the end node log-on data transmission course of the control token packet after the process first-in-chain(FIC) node initializing from chain, end node is passed to adjacent node with its data along the first-in-chain(FIC) node direction, until data arrive the first-in-chain(FIC) node, the first-in-chain(FIC) node sends telepoint base station to after with data fusion, and one takes turns data transfer procedure finishes.
For the performance based on the chain routing method of wireless sensor network of fuzzy theory of checking that the present invention proposes, itself and EEPB agreement are carried out emulation and relatively under the identical network environment.
Adopt Matlab as emulation tool, the system emulation environmental parameter arranges as follows:
1) base station is away from sensor node, and static, and coordinate is (50,300);
2) all node isomorphisms in the network, primary power is the identical erg-ten that is also, and sensor node does not have mobility;
3) 100 nodes are randomly dispersed in 100 meters * 100 meters the zone, abscissa scope (0,100), ordinate scope (0,100);
4) transmitting and receiving dynamo-electric road, to process the energy that 1 Bit data consumes be 50 joules
-9, i.e. E
Elec=50 joules
-9/ bit;
5) adopting the free space model to transmit and receive dynamo-electric road direction unit are, to launch the energy that 1 Bit data consumes be 100 joules
-12, i.e. ε
Fs=100 joules
-12/ bit/rice
2
6) adopt the Multipath Transmission model transmit and receive dynamo-electric road direction unit are square the zone in the energy that consumes of emission 1 Bit data be 0.0013 joule
-12, i.e. ε
Mp=0.0013 joule
-12/ bit/rice
4
7) length L of each packet=3000 bits;
8) EEPB agreement middle distance threshold value coefficient value is α=1.2;
Above parameter is also non-constant, can change as required some parameter for different emulation contents.
Fig. 4 is the simulation result of survival node number in the network, and wherein, dotted line is the EEPB agreement; Solid line is the chain type Routing Protocol based on fuzzy theory.
EEPB agreement first node when the 383rd takes turns is dead, and 50% node is dead when 1864 take turns, and 100% node is dead when 1916 take turns.And dead based on chain type Routing Protocol first node when the 1596th takes turns of fuzzy theory, 50% node is dead when 1981 take turns, and 100% node is dead when taking turns to 2063.Can find out that the method among the present invention can improve the life cycle of network effectively.
Fig. 5 uses two kinds of agreements at every afterwards average residual energy simulation result of node of transfer of data of taking turns under the equivalent environment, dotted line is the EEPB agreement; Solid line is the chain type Routing Protocol based on fuzzy theory.
Can find out that use can remain more energy based on the node of the chain type Routing Protocol of fuzzy theory than the node that uses the EEPB agreement, and along with the increase of taking turns number, its advantage is more and more obvious.
Simulation result shows, method for routing among the present invention has been avoided the generation of long-chain between node and has been reduced transmission range sum between the whole network node, reduced the energy consumption of the whole network the transmission of data, optimized choosing of first-in-chain(FIC) node, the energy consumption that guarantees node is more balanced, thereby has effectively improved the life cycle of wireless sensor network.
The above; only for the better embodiment of the present invention, but protection scope of the present invention is not limited to this, anyly is familiar with those skilled in the art in the technical scope that the present invention discloses; the variation that can expect easily or replacement all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the protection range of claim.
Claims (4)
1. based on the chain routing method of wireless sensor network of fuzzy theory, it is characterized in that the method may further comprise the steps:
Step 1: netinit, nodes is built into a chain that branch is arranged, specifically may further comprise the steps:
Step 1.1: base station broadcast sends initial message, obtains current network survival node ID tabulation and node to the distance tabulation of base station;
Step 1.2: will be apart from base station node farthest as end node, nodal scheme is 1;
Step 1.3: the end node of chain arrives its range information by obtaining the node that does not enter chain in the network, find from the node i of its nearest node as chain to be added;
Step 1.4: node i is obtained i-1 node adding on the chain to its range information, find from its nearest node j and with its adding chain that directly links to each other, node i becomes end node new on the chain;
Step 1.5: repeating step 1.3 and step 1.4, until all nodes all add chain, build up a chain that branch is arranged;
Step 2: set up node is under the jurisdiction of first-in-chain(FIC) based on dump energy membership function; The computing formula of described membership function is:
Wherein:
μ
e(i) be node i is under the jurisdiction of first-in-chain(FIC) based on dump energy membership function value;
F
e(i) be the dump energy normalized value of node i;
Step 3: set up node is under the jurisdiction of first-in-chain(FIC) based on the distance to the base station membership function; The computing formula of described membership function is:
Wherein:
μ
d(i) be node i is under the jurisdiction of first-in-chain(FIC) based on the distance to the base station membership function value;
F
d(i) be the range normalization value of node i to the base station;
σ is for regulating the parameter of membership function; The value of described σ is:
σ=1.0;
C is for regulating the parameter of membership function; The value of described c is:
c=0;
Step 4: two membership functions in step 2 and the step 3 are merged; Described fusion formula is:
Wherein:
μ (i) is under the jurisdiction of the membership function value of first-in-chain(FIC) for node i;
Step 5: choose the node of fusion membership function value maximum as first-in-chain(FIC), finish the foundation of route.
2. the chain routing method of wireless sensor network based on fuzzy theory according to claim 1 is characterized in that described F
e(i) computing formula is:
Wherein:
E
Res(i) be the current dump energy of node i;
E
0Primary power for node.
3. the chain routing method of wireless sensor network based on fuzzy theory according to claim 1 is characterized in that described F
d(i) computing formula is:
Wherein:
d
ToBS(i) be the distance of node i to the base station;
d
MAXBe the distance to the base station of node farthest.
4. the chain routing method of wireless sensor network based on fuzzy theory according to claim 1 is characterized in that definite step of first-in-chain(FIC) is in the described step 5:
Step 5.1: each node calculates the membership function value μ (i) of oneself on the chain;
Step 5.2: the node with maximum μ (i) value becomes the first-in-chain(FIC) that this is taken turns by the base station broadcast notice.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN2011101610010A CN102202372B (en) | 2011-06-15 | 2011-06-15 | Chain routing method of wireless sensor network based on fuzzy theory |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN2011101610010A CN102202372B (en) | 2011-06-15 | 2011-06-15 | Chain routing method of wireless sensor network based on fuzzy theory |
Publications (2)
Publication Number | Publication Date |
---|---|
CN102202372A CN102202372A (en) | 2011-09-28 |
CN102202372B true CN102202372B (en) | 2013-10-16 |
Family
ID=44662680
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN2011101610010A Expired - Fee Related CN102202372B (en) | 2011-06-15 | 2011-06-15 | Chain routing method of wireless sensor network based on fuzzy theory |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN102202372B (en) |
Families Citing this family (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103188758B (en) * | 2013-03-25 | 2015-09-02 | 电子科技大学 | A kind of power-economizing method of radio sensing network |
CN104853365B (en) * | 2015-05-11 | 2019-01-22 | 浙江理工大学 | It is a kind of based on damage link state prediction wireless sense network topological construction method |
CN105188084B (en) * | 2015-06-08 | 2018-10-26 | 华北电力大学 | A kind of wireless sensor network routing optimization method based on congestion control |
CN105636052B (en) * | 2016-01-25 | 2018-12-04 | 华北电力科学研究院有限责任公司 | Detection method, node apparatus and the system of wireless sensor network malicious node |
CN112188584B (en) * | 2020-09-16 | 2022-09-16 | 中山火炬职业技术学院 | Wireless sensor network multi-hop clustering method and system based on gravity center method |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101252543A (en) * | 2008-04-11 | 2008-08-27 | 北京交通大学 | Rapid data anastomosing algorithm used for wireless sensor network |
CN101594281A (en) * | 2008-05-27 | 2009-12-02 | 华为技术有限公司 | Collecting network data of wireless sensor method, system and relevant device |
Family Cites Families (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
KR100709964B1 (en) * | 2005-01-18 | 2007-04-25 | 삼성전자주식회사 | Routing method in wireless sense network |
-
2011
- 2011-06-15 CN CN2011101610010A patent/CN102202372B/en not_active Expired - Fee Related
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101252543A (en) * | 2008-04-11 | 2008-08-27 | 北京交通大学 | Rapid data anastomosing algorithm used for wireless sensor network |
CN101594281A (en) * | 2008-05-27 | 2009-12-02 | 华为技术有限公司 | Collecting network data of wireless sensor method, system and relevant device |
Also Published As
Publication number | Publication date |
---|---|
CN102202372A (en) | 2011-09-28 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Katiyar et al. | Improvement in LEACH protocol for large-scale wireless sensor networks | |
Beiranvand et al. | I-LEACH: An efficient routing algorithm to improve performance & to reduce energy consumption in Wireless Sensor Networks | |
CN101895956B (en) | Data transmission method of multilayer distributed wireless sensor network | |
Abad et al. | Modify LEACH algorithm for wireless sensor network | |
Sharifi et al. | A method for routing and data aggregating in cluster‐based wireless sensor networks | |
CN102202372B (en) | Chain routing method of wireless sensor network based on fuzzy theory | |
KR101658736B1 (en) | Wsn clustering mehtod using of cluster tree structure with low energy loss | |
Rady et al. | Energy‐efficient routing protocol based on sink mobility for wireless sensor networks | |
CN103906245A (en) | Distributed rate control method for wireless sensor network | |
Oudani et al. | Comparative study and simulation of flat and hierarchical routing protocols for wireless sensor network | |
Latiff et al. | Dynamic clustering using binary multi-objective particle swarm optimization for wireless sensor networks | |
Massad et al. | Data aggregation in wireless sensor networks | |
Alnaham et al. | Improving QoS in WSN based on an optimal path from source to sink node routing algorithm | |
CN108307471B (en) | Energy balance cluster head node selection method | |
Sah | Performance evaluation of energy efficient routing in wireless sensor networks | |
Suresh et al. | Improving network lifetime and reducing energy consumption in wireless sensor networks | |
Sajedi et al. | A hybrid structure for data aggregation in wireless sensor network | |
Gupta et al. | Research on energy balance in hierarchical clustering protocol architecture for WSN | |
Zheng et al. | Chain routing based on coordinates-oriented clustering strategy in WSNS | |
Shelke et al. | Energy saving techniques in wireless sensor networks | |
Sundaran et al. | Energy efficient wireless sensor networks using dual cluster head with sleep/active mechanism | |
Kumar et al. | MEEP: multihop energy efficient protocol for heterogeneous wireless sensor network | |
Poonam et al. | A comparative study of clustering routing protocols in underwater wireless sensor networks | |
Pandey et al. | Performance Evaluation of Various Routing Protocols and quality of service for Wireless Sensor Network | |
Anitha et al. | Dynamic Tree Routing Protocol with Convex Hull Optimization for Optimal Routing Paths |
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: 20131016 Termination date: 20140615 |
|
EXPY | Termination of patent right or utility model |