CN103313340B - The routing resource of node-routing in a kind of wireless sensor network - Google Patents
The routing resource of node-routing in a kind of wireless sensor network Download PDFInfo
- Publication number
- CN103313340B CN103313340B CN201310183276.3A CN201310183276A CN103313340B CN 103313340 B CN103313340 B CN 103313340B CN 201310183276 A CN201310183276 A CN 201310183276A CN 103313340 B CN103313340 B CN 103313340B
- Authority
- CN
- China
- Prior art keywords
- node
- routing
- wireless sensor
- sensor network
- adjacent
- 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
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
- Arrangements For Transmission Of Measured Signals (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention relates to wireless sensor network technology field, specifically disclose the routing resource of node-routing in a kind of wireless sensor network; Comprise: based on dijkstra's algorithm, the information distribution pattern of node-routing in wireless sensor network is converted into orientation node figure from non-directed graph, obtains pheromones initial value; Diversity based on ant group algorithm and the characteristic of positive feedback, the routing resource of structure node-routing; According to the relative energy factor, the relative distance factor and pheromones intensity, determine shift direction, obtain selected path. The present invention has improved operation efficiency, has reached energy-saving effect; Realized in wireless senser networking that each node energy is balanced to be consumed, the life cycle that has extended whole wireless sensor network, has met the application requirements of the wireless sensor network to energy-sensitive.
Description
Technical field
The present invention relates to wireless sensor network technology field, especially relate in a kind of wireless sensor networkThe routing resource of node-routing.
Background technology
MEMS (Micro-Electro-MechanismSystem, MEMS), SOC(system on a chip) (SystemOnChip, SoC), the develop rapidly of radio communication and low-power-consumption embedded technology, be pregnant with wireless senserNetwork (WirelessSensorNetworks, WSN) technology, wireless sensor network technology with its low-power consumption,The change that low cost, feature distributed and self-organizing have been brought information Perception. Wireless sensor networkBy being deployed in cheap microsensor nodes a large amount of in monitored area, forming by communicationA multihop self-organizing network. Wireless sensor network has been realized collection, processing and transmission three kinds of informationFunction, three large pillars of it and the communication technology and the common configuration information technology of computer technology.
Wireless sensor network is the mode structure with self-organizing and multi-hop by a large amount of static or mobile sensorsThe wireless network becoming, perceived in the reason region covering with the perception, collection, processing and the transmission network that cooperateThe information of object, and finally these information are sent to the owner of network.
The eurypalynous sensor of crowd that wireless sensor network has, the detectable shake comprising, electromagnetism, temperature,The peripheries such as size, speed and the direction of humidity, noise, luminous intensity, pressure, soil constituent, mobile objectDiversified phenomenon in environment. Potential application can be summarized as: military affairs, aviation, explosion-proof, rescueThe various fields such as calamity, environment, medical treatment, health care, household, industry and business.
Path selection TSP problem in wireless sensor network between each node-routing, at present most employing antsGroup's algorithm solves. TSP problem, traveling salesman problem (TravellingSalesmanProblem) againBeing translated into travelling salesman problem, traveling salesman problem, is one of famous problem in art of mathematics. Suppose to have oneDrummer will visit n city, and he must select the path that will walk, and the restriction in path is each cityCan only visit once, and finally will get back to the city of originally setting out. The select target in path will be tried to achievePath distance is the minimum of a value among all paths. TSP problem is a combinatorial optimization problem. This problem canBe proved to be and there is NPC computational complexity. Therefore, any method that can make solving of this problem be simplified,All evaluation and the concern of height will be received.
Ant group algorithm is a kind of swarm intelligence, is equaled to propose for 1991, for solving TSP by M.DorigoProblem. Ant group algorithm can have a preferably result to challenge within a rational time. Due to itThe self-organizing, automatic optimal and the dynamic characteristic that have, be particularly suitable for having equally dynamic, Self-organizationWireless ad hoc network, the wireless sensor network etc. of ad hoc mode. So, the people such as KassabalidisThe Ant-Net algorithm proposing, by Front ant with return to ant and realize routing optimality, i.e. Front antCollector node information; Return to ant and utilize these information updating routing tables. The people such as Schoonderwoerd useABC (AntBasedControl) algorithm is selected and new route more in the mode of probability, in this algorithm, only has onePlant the ant discharging from source node, just dead after these ants arrival destination nodes. Like this when ant arrives nodeTime, the routing table of node has just been updated.
The drawback that ant group algorithm exists: because ant group algorithm initial stage pheromones extremely lacks, cause Algorithm for Solving speedDegree is slow, thereby has affected overall performance. In the model of ant group algorithm, all nodes formed one undirectedNode diagram. At the initial stage, the pheromones intensity on each limit is basic identical, can cause path numerous and diverse, wastes a large amount of energyAmount. Classical ant group algorithm, according to the volatilization factor in path, is found short path, path, carries out the biography of informationSend. But this method is easy to make local nodes energy to consume fast, finally causes the fracture of link, letterBreath cannot transmit, and overall network life cycle is short. For solving deficient this problem of ant group algorithm initial stage pheromones,XuanZeng etc. have proposed the path choosing of the node-routing based on heredity-ant group algorithm in wireless sensor networkSelection method, but be subject to the quantity of node and the restriction of relationships between nodes, after intersecting, making a variation, path transmissionFracture most probably.
At present, in prior art, also there is no effective solution. Cannot meet existing wireless sensor networkThe wireless sensor network of application requirements, especially energy-sensitive, as humiture collection, unattendedThe wireless sensor network of the aspects such as warning, farmland detection.
Summary of the invention
Technical problem solved by the invention is to provide the path choosing of node-routing in a kind of wireless sensor networkSelection method, the present invention is directed to the feature of wireless sensor network work, by dijkstra's algorithm thought with classicalAnt group algorithm thought combines, and considers the energy consumption of the whole network, and energy factors is joined to probability selection mouldIn type and information updating mechanism, construct optimum routed path, make ant group algorithm jump out locally optimal solution. ThisBright undirected node diagram is converted into orientation node figure, has improved the initial stage operation efficiency of ant group algorithm, and introduceEnergy factors is determined routed path, thereby has reached energy-saving effect; Meanwhile, balance of the present invention distance and energyThe relation of amount, has realized the balanced consumption of each node energy in wireless senser networking, thereby has extended wholeThe life cycle of wireless sensor network, has met the application requirements of the wireless sensor network to energy-sensitive.
In order to solve the problems of the technologies described above, the invention provides node-routing in a kind of wireless sensor networkRouting resource, comprising:
S1: based on dijkstra's algorithm, by the information distribution pattern of node-routing in wireless sensor network fromNon-directed graph is converted into orientation node figure, obtains pheromones initial value; Concrete steps are as following S1.1 step, S1.2Step and S1.3 step;
S1.1: terminal node is adjacent node and communicates, described adjacent node records described terminal nodeNumbering, and upgrade each node coefficient; Described terminal node sends self node serial number, described adjacent nodeRecord number is in set, and to upgrade described adjacent node coefficient be 1;
S1.2: obtain the number of nodes of communicating by letter with described start node; Described start node is to described adjacent segmentsPoint transmission information, described adjacent node feedback information, described start node records the number of adjacent node described in itAmount;
S1.3: according to node coefficient value, described terminal node is communicated by letter successively, described terminal node phase described in itNeighbors upgrades described start node coefficient and records the numbering of described adjacent node; Until described start nodeWhile obtaining all numberings that can connected node, sign off; Described adjacent node coefficient becomes 1 from 0Node sends self node serial number to its adjacent node successively, and described its adjacent node records node serial number, moreNew described its adjacent node coefficient; Until described start node obtains the volume of the adjacent node of all described quantityNumber time, circulation finish;
When classical ant group algorithm starts, node forms non-directed graph, because each node does not have initial information wasteA large amount of resources. In the present invention, before ant group algorithm, carry out from terminal node to start node carrying outCirculation, obtained Internet communication initial information. Initial information acts on ant group algorithm as pheromones initial value,Make information dissemination have restricted direction, make node non-directed graph become digraph, saved Internet resources,Improve route entirety spread speed.
S2: the diversity based on ant group algorithm and the characteristic of positive feedback, the Path selection of structure node-routingMethod; Concrete steps are as following S2.1 step and following S2.2 step;
S2.1: according to the relative energy factor, the relative distance factor and pheromones intensity, determine shift direction,Obtain selected path;
The relative energy factor is that the normalization of the dump energy of destination node represents, the relative distance factor is currentThe normalization of the distance of node and destination node represents. By two factors time, restriction, makes transmission pathSelect dynamically nearest and made the uniform route of network overall power consumption, the use that has improved networkLife-span.
S2.2: by described S1 institute in steps with described S2.1 step after, communication is complete, upgrade roadPheromones on footpath; Described pheromones is transferred to described terminal node from described start node, described informationElement update method is identical with traditional ant group algorithm.
Preferably, in described S1.3 step, described terminal node coefficient is less than described adjacent node coefficient, orDescribed adjacent node coefficient is 0.
Be more preferably, the dump energy that the value of the described relative energy factor equals terminal node saves divided by eachPoint primary power is multiplied by 1.2, and the primary power of described each node is identical.
Be more preferably, the value of the described relative distance factor equals described start node to described terminal nodeThe inverse of distance is multiplied by node communication radius.
The present invention compared with prior art, has following beneficial effect:
The invention provides the routing resource of node-routing in a kind of wireless sensor network, the present invention willUndirected node diagram is converted into orientation node figure, has improved the initial stage operation efficiency of ant group algorithm, and has introduced energyThe factor is determined routed path, thereby has reached energy-saving effect; And the relation of energy equilibrium distance and energy, realizeIn wireless senser networking, each node energy is balanced consumes, thereby extended whole wireless sensor networkLife cycle, met the application requirements of the wireless sensor network to energy-sensitive.
Brief description of the drawings
The distribution map of what Fig. 1 was exemplary show node in wireless sensor network;
The routing resource flow chart of what Fig. 2 was exemplary show node-routing in wireless sensor network.
Detailed description of the invention
The technical problem that solved for a better understanding of the present invention, the technical scheme providing, below in conjunction withDrawings and Examples, are further elaborated to the present invention. Specific embodiment described herein is only usedTo explain enforcement of the present invention, but be not intended to limit the present invention.
The routing resource of node-routing of the present invention gets based on ant group algorithm.
First the several key concepts in the present invention are done to following simple declaration:
(1) dijkstra's algorithm
In dijkstra's algorithm solution digraph, single source point is to the shortest route problem on other summits. If O is formerPoint, T is fixed point.
1. initialize V={a}, ti ∈ T;
2. D (ti) is for a is to the beeline that does not comprise other nodes in T of ti. Calculate successively D (ti). According toThe value of D (ti) finds in T apart from the shortest node x of a, writes out the shortest path length D (x) of a to x;
3. make S=S ∪ { x}, T=T-{x}
IfT=Φ Then stops
2. Else returns.
(2) pheromones (pheromone)
Interactional chemical substance between former finger individuality of the same race, can affect behavior each other, habit and evenGrow and physiological activity; As during ant group looks for food, after an ant is found food, its can discharge to environmentA kind of volatile secretion, attracts other ant to come, and so increasing ant can be found food.Ant group algorithm simulation Food Recruiment In Ants process, by giving the pheromones of upgrading each node, determines that information sends outThe direction of sending. As time goes on, pheromones can reduce, and so just can obtain dynamically optimum routePath.
What in a preferred embodiment, Fig. 1 was exemplary has expressed node-routing in a kind of wireless sensor networkRouting resource flow process:
The 80*80m that selects a slice sky, arranges 48 temperature sensors, and node communication radius R is 30m; Node 42For start node i, node 48 is terminal node j, and information is transferred to terminal node j from start node i; And beEach node is numbered. If each node FACTOR PiBe initially 0, set V records last nodal value, Vi＝Φ，Φ represents null set, i=1,2 ..., m; dijFor the distance from node i to node j. Initial information element intensityBe zero.
I. based on dijkstra's algorithm thought, by the distribution pattern of node-routing in wireless sensor network from nothingBe converted into orientation node figure to figure, obtain pheromones initial value;
A. terminal node is adjacent node communication, adjacent node k end of record node serial number, and upgrade eachNode FACTOR P;
Terminal node j sends self node serial number, and described adjacent node k record number is at set VkIn, and moreNew adjacent node FACTOR Pk＝1；
B. obtain the number of nodes of communicating by letter with start node i;
Start node i sends information to adjacent node k, adjacent node k feedback information, and start node i records itThe quantity S of adjacent node k.
C. according to node FACTOR P value, terminal node j communicates by letter successively, its adjacent node of terminal node k (Pj＜PkOrPk=0) upgrade start node FACTOR PiAnd record the numbering of adjacent node k; Until start node obtain all canConnect node serial number time, sign off; Wherein terminal node FACTOR PjBe less than adjacent node FACTOR PkOr adjacentNode FACTOR PkBe 0;
Adjacent node FACTOR PkBecome 1 node from 0 and send self node serial number to its adjacent node k successively,Its adjacent node k records node serial number, upgrades adjacent node FACTOR Pk=1; Until start node obtains quantityWhen the numbering of S adjacent node k, circulation finishes.
Each node is recording its adjacent node numbering to terminal node by Information Communication smoothly; ThisSample, non-directional just having become of blindness that information transmits has direction to have object to have the propagation of reliability, nodeNon-directed graph become digraph, avoided ant group algorithm at the large energy of finding the waste of optimal path initial stage,Make the life of whole network, the speed quickening of determining optimal path and starting to diffuse information.
II: according to the relative energy factor, the relative distance factor and pheromones intensity, determine shift direction,Build routed path;
In improvement ant group algorithm, the transition probability that the ant in node i selects node j to conduct interviewsIts formula is:
α, β, χ represents respectively control information element track and apart from inspiration value, energy inspiration value is relatively importantThe parameter of property, is generally constant alpha=1, β=2, χ=2; K is the adjacent node of node i, allowedkForThe set of this adjacent node. τijFor node i is to the pheromones intensity of node j; In improvement ant group algorithm, increaseVariable ξ ' and η ' are added; ξ ' is the relative energy factor, and the dump energy that its value equals node j is divided by respectivelyIndividual node primary power is multiplied by 1.2; ηij' be the relative distance factor, its value equals start node i to stoppingThe inverse of the distance of node j is multiplied by node communication radius R. Use the relative factor, will apart from the factor and energy because ofSub-normalization plays a role both in the calculating of transition probability simultaneously, make these two of distance and energy because ofElement reaches optimal level simultaneously;
III: after pheromones end of transmission, the more pheromones on new route;
Node i forwards pheromones on node j path to and upgrades identically with traditional ant group algorithm, and its formula is:
τij(t+1)＝(1-ρ)·τij(t)+Δτij(t)
ρ ∈ [0,1] represents pheromones evaporation coefficient, and 1-ρ represents residual risk prime system number. Δ τijRepresent letterCease plain increment.
Wherein Q is constant, generally Q=100; LkBe the pass by length in path of k ant.
The renewal of pheromones, can affect the result of transition probability significantly. Utilize the change to transition probabilityChange and carry out dynamically updating of Path selection, keep at a distance in real time and the optimal solution of energy.
More than by the detailed description of preferred embodiment the present invention, but it will be understood by those skilled in the art thatThe present invention is not limited to the above embodiment, and all within general principle of the present invention, that does is anyRevise, combine and be equal to replacement etc., within being all included in protection scope of the present invention.
Claims (2)
1. a routing resource for node-routing in wireless sensor network, is characterized in that, comprising:
S1: based on dijkstra's algorithm, by the information distribution pattern of node-routing in wireless sensor network fromNon-directed graph is converted into orientation node figure, obtains pheromones initial value; Concrete steps are as following S1.1 step, S1.2Step and S1.3 step;
S1.1: terminal node is adjacent node and communicates, described adjacent node records described terminal nodeNumbering, and upgrade each node coefficient; Described terminal node sends self node serial number, described adjacent nodeRecord number is in set, and to upgrade described adjacent node coefficient be 1;
S1.2: obtain the number of nodes of communicating by letter with start node; Described start node is sent out to described adjacent nodeCarry information, described adjacent node feedback information, described start node records the quantity of adjacent node described in it;
S1.3: according to node coefficient value, described terminal node is communicated by letter successively, and described terminal node is to described in itAdjacent node upgrades described start node coefficient and records the numbering of described adjacent node; Until described initial jointWhen point obtains all numberings that can connected node, sign off; Described adjacent node coefficient becomes 1 from 0Node send self node serial number to its adjacent node successively, described its adjacent node records node serial number,Upgrade described its adjacent node coefficient; Until described start node obtains the adjacent node of all described quantityWhen numbering, circulation finishes;
S2: the diversity based on ant group algorithm and the characteristic of positive feedback, the Path selection of structure node-routingMethod; Concrete steps are as following S2.1 step and following S2.2 step;
S2.1: according to the relative energy factor, the relative distance factor and pheromones intensity, determine shift direction,Obtain selected path;
S2.2: by described S1 institute in steps with described S2.1 step after, communication is complete, upgradePheromones on path; Described pheromones is transferred to described terminal node from described start node, described letterCease plain update method identical with traditional ant group algorithm;
The value of the described relative energy factor equals the dump energy of described terminal node divided by the initial energy of each nodeAmount is multiplied by 1.2, and the primary power of described each node is identical;
The value of the described relative distance factor equals described start node and takes advantage of to the inverse of the distance of described terminal nodeWith node communication radius.
2. the routing resource of node-routing in wireless sensor network according to claim 1, its spyLevy and be, in described S1.3 step, described terminal node coefficient is less than described adjacent node coefficient, or described inAdjacent node coefficient is 0.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310183276.3A CN103313340B (en) | 2013-05-17 | 2013-05-17 | The routing resource of node-routing in a kind of wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310183276.3A CN103313340B (en) | 2013-05-17 | 2013-05-17 | The routing resource of node-routing in a kind of wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103313340A CN103313340A (en) | 2013-09-18 |
| CN103313340B true CN103313340B (en) | 2016-05-04 |
Family
ID=49138008
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310183276.3A Expired - Fee Related CN103313340B (en) | 2013-05-17 | 2013-05-17 | The routing resource of node-routing in a kind of wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103313340B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104702497A (en) * | 2015-03-01 | 2015-06-10 | 江西科技学院 | Sarsa algorithm and ant colony optimization-based route control algorithm |
| CN105430707B (en) * | 2015-11-03 | 2019-01-11 | 国网江西省电力科学研究院 | A kind of wireless sense network multiple-objection optimization method for routing based on genetic algorithm |
| CN106200599A (en) * | 2016-08-30 | 2016-12-07 | 孟玲 | A kind of intelligent home service system |
| CN106936892A (en) * | 2017-01-09 | 2017-07-07 | 北京邮电大学 | A kind of self-organizing cloud multi-to-multi computation migration method and system |
| CN108135016B (en) * | 2017-12-19 | 2021-06-29 | 国网辽宁省电力有限公司 | Wireless network path planning method and device |
| CN110505654B (en) * | 2019-07-04 | 2022-07-12 | 太原理工大学 | Ant colony optimization anycast routing method of wireless sensor network |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101083616A (en) * | 2007-07-05 | 2007-12-05 | 上海交通大学 | Ant algorithm based wireless self-organized network energy-saving routing method on demand |
| CN102523162A (en) * | 2011-12-15 | 2012-06-27 | 西安理工大学 | Ant colony-based QoS (Quality of Service) optimization routing method in ultraviolet wireless Mesh network |
| CN102932868A (en) * | 2012-10-24 | 2013-02-13 | 苏州两江科技有限公司 | Method for data transmission in wireless sensing network |
| CN103024856A (en) * | 2012-12-31 | 2013-04-03 | 上海交通大学 | Application method of location heuristic factor in establishment of wireless ad hoc network energy-saving routing |
-
2013
- 2013-05-17 CN CN201310183276.3A patent/CN103313340B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101083616A (en) * | 2007-07-05 | 2007-12-05 | 上海交通大学 | Ant algorithm based wireless self-organized network energy-saving routing method on demand |
| CN102523162A (en) * | 2011-12-15 | 2012-06-27 | 西安理工大学 | Ant colony-based QoS (Quality of Service) optimization routing method in ultraviolet wireless Mesh network |
| CN102932868A (en) * | 2012-10-24 | 2013-02-13 | 苏州两江科技有限公司 | Method for data transmission in wireless sensing network |
| CN103024856A (en) * | 2012-12-31 | 2013-04-03 | 上海交通大学 | Application method of location heuristic factor in establishment of wireless ad hoc network energy-saving routing |
Non-Patent Citations (2)
| Title |
|---|
| An Ant Colony System Based Energy Prediction Routing Algorithms For Wireless Sensor Networks;Zhen-wei Shen;《Wireless Communication,Networking and Mobile Computing》;20081014;P1-4 * |
| Data Aggegation and Routing in wireless Sensor Networks Using Improved Ant Colony Algorithm;Wang Jinghua;《Computer Science-Technology and Applications》;20091227;P215-218 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103313340A (en) | 2013-09-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103313340B (en) | The routing resource of node-routing in a kind of wireless sensor network | |
| Villas et al. | A spatial correlation aware algorithm to perform efficient data collection in wireless sensor networks | |
| Mills | A brief survey of self‐organization in wireless sensor networks | |
| Chatzigiannakis et al. | Efficient data propagation strategies in wireless sensor networks using a single mobile sink | |
| Razaque et al. | Energy-efficient boarder node medium access control protocol for wireless sensor networks | |
| Al-Turjman et al. | Towards prolonged lifetime for deployed WSNs in outdoor environment monitoring | |
| Kuila et al. | Energy efficient clustering and routing algorithms for wireless sensor networks: Particle swarm optimization approach | |
| Zhang et al. | A new constructing approach for a weighted topology of wireless sensor networks based on local-world theory for the Internet of Things (IOT) | |
| Dong et al. | Mobile agent-based energy-aware and user-centric data collection in wireless sensor networks | |
| Qureshi et al. | Nature-inspired algorithm-based secure data dissemination framework for smart city networks | |
| Aanchal et al. | Green computing for wireless sensor networks: Optimization and Huffman coding approach | |
| Huang et al. | Co-locating services in IoT systems to minimize the communication energy cost | |
| Boukerche et al. | A new energy efficient and fault-tolerant protocol for data propagation in smart dust networks using varying transmission range | |
| Boonma et al. | BiSNET: A biologically-inspired middleware architecture for self-managing wireless sensor networks | |
| Roy et al. | Self-servicing energy efficient routing strategy for smart forest | |
| da Costa Bento et al. | Bio-inspired routing algorithm for MANETs based on fungi networks | |
| Weng et al. | PEER: Proximity-Based Energy-Efficient Routing Algorithm for Wireless Sensor Networks. | |
| Khot et al. | Cellular automata-based optimised routing for secure data transmission in wireless sensor networks | |
| Galal et al. | Probability-based path discovery protocol for electromagnetic nano-networks | |
| Osamy et al. | A review on recent studies utilizing artificial intelligence methods for solving routing challenges in wireless sensor networks | |
| Asemani et al. | Learning automata based energy efficient data aggregation in wireless sensor networks | |
| Sediyono et al. | Leader election of dynamic wireless intelligent control machine in sensor network distributed processing | |
| Mansour et al. | Adaptive Parallel Seeker Optimization-based Route Planning for clustered WSN in smart cities | |
| Jebi et al. | Mitigation of coverage and connectivity issues in wireless sensor network by multi-objective randomized grasshopper optimization based selective activation scheme | |
| Rana et al. | Metaheuristic routing: a taxonomy and energy-efficient framework for internet of things |
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: 20160504 Termination date: 20190517 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |