CN102802205A - Load balancing routing method for wireless sensor network - Google Patents
Load balancing routing method for wireless sensor network Download PDFInfo
- Publication number
- CN102802205A CN102802205A CN2012103209132A CN201210320913A CN102802205A CN 102802205 A CN102802205 A CN 102802205A CN 2012103209132 A CN2012103209132 A CN 2012103209132A CN 201210320913 A CN201210320913 A CN 201210320913A CN 102802205 A CN102802205 A CN 102802205A
- Authority
- CN
- China
- Prior art keywords
- node
- packet
- routing
- execution
- edge
- 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.)
- Pending
Links
Images
Abstract
The invention relates to a load balancing routing method for a wireless sensor network. In a routing method on the basis of the geographic position, when one data packet enters a greedy forwarding local minimum, the data packet is propelled by the edge of an original routing void according to an original routing mode, nodes on a path of the data packet are set into an unavailable state, the nodes do not participate in subsequent work of forwarding the packet in an edge mode, a virtual routing void is formed and the expansion and the shrinkage of the routing void are controlled by a DLBM (Distributed Load Balancing Mechanism) on the basis of a timer and a DLBM on the basis of a counter; and a next packet can be forwarded along the edge of the newly formed virtual routing void, so that the load of the nodes on the inner layer is reduced. The invention solves a problem of excessively high load of the nodes at the edge of the void only by exchange of simple control information, so that the life cycle of the integral network is prolonged; and the load balancing routing method for the wireless sensor network has excellent portability and expandability and is suitable for any known routing protocol on the basis of the geographic position.
Description
Technical field
The present invention relates to a kind of method for routing of wireless sensor network based on the load balancing in geographical position, be used to solve the problem of route cavity fringe node load too high, we are called DLBM (Distributed Load Balancing Mechanism).
Background technology
Wireless sensor network (Wireless Sensor Networks) is made up of the sensor node of a large amount of cheapnesss, low-power consumption, the self-organizing network of the multi-hop that the mode through wireless telecommunications forms.Wireless sensor network can be used for monitoring in real time, some environmental informations in perception and the collection overlay area, and sends to the data after handling to its users interest.
The energy of each node is limited in the wireless sensor network, and this just requires in the design routing policy simple as far as possible, avoids complicated calculating.In Routing Protocol based on the geographical position; Each node is only preserved some positional informations of its neighbor node; Wrap these information of safeguarding through regular transmission HELLO; Therefore node just need not safeguarded huge routing iinformation, when selecting the path, generally transmits through greediness and just can find suitable next-hop node easily.
Because the greedy characteristic of selecting optimal solution according to local message of transmitting; Such category node possibly appear during the course; In its all neighbor node the neither one node than oneself more near destination node; At this moment data can't continue to be forwarded, and we claim that this phenomenon is route cavity (routing hole), and this category node is local smallest point (local minimum).Some Routing Protocols (like the GPSR agreement) can adopt the edge to transmit along edge, route cavity and push ahead, and when many routes cross at edge, route cavity, can cause the edge in cavity to bear heavier load.This part node can be very fast the energy of battery, cause the route cavity to become big, the performance of whole network can sharply descend.Mainly contain the problem of following several kinds of strategy solution route cavity fringe node load too high at present:
People such as Jia have proposed HAIR (Hole Avoiding In advance Routing) agreement in document " Hole avoiding in advance routing in wireless sensor networks ".In the HAIR agreement, if one encapsulates and has been forwarded to local smallest point, will and notify its neighbor node to this mark, just can not transmit to the node that has been labeled next time.The final like this routing state that can converge to without the route cavity.HAIR adopts and avoids getting into the problem that the empty strategy of route has solved route cavity fringe node load too high.
Yu and Tian respectively in document " Efficient hole detour scheme for geographic routing in wireless sensor networks " and " Energy-efficient data dissemination protocol for detouring routing holes in wireless sensor networks " the similar thought of utilization walk around the route cavity.At first, their thinking depends on the detection in route cavity, and after finding the cavity, they have adopted a virtual circle or ellipse to go to cover fully this hole respectively.When a packet is transferred on this round or oval border, can the direction of this bag along tangent line be continued transmit certain distance forward, so just can walk around the route cavity.Continue then to adopt greedy the forwarding, bag is delivered to the sink node.
In HobyCan (the HOle-BYpassing routing with Context-AwareNess) agreement that document " Context-aware geographic routing for sensor networks with routing holes " proposes, adopted the method for multipath to solve the problem of load balancing.In the network design stage, HobyCan write down and get into the mulitpath that arrives the sink node behind the route cavity, and it is numbered.During the network normal operation, can utilize this mulitpath to realize load balancing.But HobyCan has the limitation of oneself, and it only is applicable to the situation of single sink node.
In sum, the mechanism of having taked complicacy that these agreements have around the hole, what have depends on the empty detection of route, and the needs that have are preserved a large amount of routing iinformations, and this has just consumed a large amount of computational resource and the storage resources of node.
Summary of the invention
The objective of the invention is to seek the problem that a kind of method effectively solves route cavity fringe node load too high.
The objective of the invention is to realize through following technical scheme:
A kind of method for routing of wireless sensor network load balancing may further comprise the steps:
One, in method for routing based on the geographical position, when a packet gets into the local smallest point of greedy forwarding, can find to lay oneself open to the edge in route cavity, this bag can be according to the edge propelling of former routing mode through the primary routing cavity;
When two, packet advances through edge, route cavity; Node on its path is set to down state; The node that is set to down state will not participate in transmitting under the follow-up edge pattern work of bag, so, and from the angle of integral body; One deck has outwards been expanded in this route cavity, forms a virtual route cavity;
Three, according to rule, next bag will be transmitted along the empty edge of the virtual route of new formation, has so just alleviated the load of underlay nodes.
When the node of a packet process was transmitted one time, one deck will be outwards expanded in the route cavity, and next packet will be transmitted along new edge, route cavity.But unrestrictedly expanded outwardly by the cavity if give way, can make the path of route long, the node of participating in forwarding is too much, causes the deterioration of network performance.In order not allow virtual route cavity to expand too greatly, a kind of prioritization scheme of the present invention is for each node is provided with a controller, after controller reaches preset threshold value, through changing the upstate of node in the network, the contraction and the expansion in control route cavity.
The present invention has provided the instance of two use controller control route cavity scales, is based on the DLBM of timer respectively and based on the DLBM of counter.
DLBM based on timer comprises following steps:
1) for each node is provided with a timer, establishing timer effective time is T, and R is the rate of giving out a contract for a project of source node, and N is the expansion number of plies, and the relation between them is:
T=R×N；
Timer initialization zero setting.
When 2) node u receives a packet, if packet is in the edge forward mode and timer is effective, execution in step 3), otherwise forward step 4) to;
3) to neighbor node broadcasting controlling packet, oneself is set to down state, forwards step 5) to;
4) timer zero clearing, to neighbor node broadcasting controlling packet, oneself is set to upstate;
5) transmit packet.
DLBM based on counter comprises following steps:
1) for each node is provided with a counter, counter initialization zero setting;
When 2) node u receives a packet, if packet is in the edge forward mode, execution in step 3), otherwise forward step 14) to;
3) be in expansion mode, execution in step 4 if find it), otherwise execution in step 9);
4) counter adds 1;
5) judge whether counter reaches threshold value, does not reach threshold value execution in step 14), otherwise execution in step 6);
6) judge the outermost layer that whether is in expansion, if not execution in step 7), otherwise execution in step 8);
7) send controlling packet oneself and be set to down state, forward step 14) to;
8) mark gets into the contraction phase, forwards step 14) to;
9) counter subtracts 1;
10) judge whether counter is 0, if be not 0 execution in step 14), otherwise execution in step 11);
11) judge whether be in the contraction innermost layer, if not execution in step 12), otherwise execution in step 13);
12) send controlling packet, notify next node layer oneself to be set to upstate;
13) mark gets into the expansionary phase;
14) transmit packet.
Beneficial effect
The present invention only relies on the exchange of some simple control informations just can dynamically control the expansion and the contraction in virtual route cavity; Thereby solve the problem of its empty fringe node load too high; Load transfer with primary routing cavity fringe node has arrived its node on every side effectively; Thereby reached effect of load balance, and then prolonged the life cycle of whole network.Because the present invention does not rely on certain definite Routing Protocol, and be easy to realize having good transplantability and extensibility, be applicable to any known Routing Protocol based on the geographical position.
Description of drawings
When Fig. 1 node u receives a packet, carry out DLBM flow chart based on timer.
When Fig. 2 node u receives a packet, carry out DLBM flow chart based on counter.
The ceiling capacity consumption figure of Fig. 3 GPSR-DLBM1, GPSR-DLBM2 and standard GPSR agreement.
The average energy consumption figure of Fig. 4 GPSR-DLBM1, GPSR-DLBM2 and standard GPSR agreement.
The average retardation figure of Fig. 5 GPSR-DLBM1, GPSR-DLBM2 and standard GPSR agreement.
The ceiling capacity consumption figure of Fig. 6 GPSR-DLBM1, GPSR-DLBM2 and HobyCan agreement.
The average energy consumption figure of Fig. 7 GPSR-DLBM1, GPSR-DLBM2 and HobyCan agreement.
The average retardation figure of Fig. 8 GPSR-DLBM1, GPSR-DLBM2 and HobyCan agreement.
Embodiment
Specify preferred implementation of the present invention below in conjunction with accompanying drawing.
This execution mode adopts controller to be used for controlling the expansion in route cavity.Two embodiment have adopted respectively based on the DLBM of timer with based on the DLBM of counter.
One, based on the DLBM of timer
The structure of using based on the DLBM of timer:
1.On_Off flag bit.The present invention has made simple modification to neighbor list, on original basis, for each neighbour has added a status indicator position, is designated as On_Off.Under the clear forward mode on the edge of of this state table, whether this node can be used for doing next-hop node: if On_Off is true, next jumping can be selectedly done in explanation; If false then cannot.The initial condition of all node On_Off is made as true.
2.Not_Send_To_Me controlling packet.This is that the present invention defines a kind of bag that is used for transmitting control information.When node is received the Not_Send_To_Me controlling packet, can in the neighbor list of oneself, be set to false by controlling packet sender's (being designated as the u node) On_Off flag bit, so just can not be in the packet under the edge pattern to the forwarding of u node.
3.Send_To_Me controlling packet.Similar but act on just the opposite with the Not_Send_To_Me controlling packet.When node was received the Send_To_Me controlling packet, controlling packet sender's in the neighbor list of oneself (being designated as the u node) On_Off flag bit was set to true.
DLBM method flow based on timer of the present invention is as shown in Figure 1, and concrete technology implementation scheme is following:
1) for each node is provided with a timer, establishing timer effective time is T, and R is the rate of giving out a contract for a project of source node, and N is the expansion number of plies, and the relation between them is:
T=R×N；
Timer initialization zero setting.
When 2) receiving a packet, if packet is in the edge forward mode and timer is effective, execution in step 3), otherwise forward step 4) to;
3) to neighbor node broadcasting Not_Send_To_Me controlling packet, oneself is set to down state, forwards step 5) to;
4) timer zero clearing, to neighbor node broadcasting Send_To_Me controlling packet, oneself is set to upstate;
5) transmit packet.
Two, based on the DLBM of counter
The structure of using based on the DLBM of counter:
1.On_Off flag bit.With identical based on the On_Off flag bit among the DLBM of timer.
2.EorS flag bit.Be used for writing down present node and be in expansion mode or collapsed mode.
3.Not_Send_To_Me controlling packet.With basic identical, be used for notifying neighbor node to revise the On_Off flag bit, from true to false based on the Not_Send_To_Me controlling packet effect among the DLBM of timer.Also contain the nextLayer parameter in addition, be used for noting the number of plies that a node layer should belong to.
4.Wake_Up controlling packet.This type of controlling packet can be used in the route cavity contraction phase, was used for waking up next node layer, and such controlling packet also has a nextLayer parameter.Generally speaking, receive that the node of Wake_Up controlling packet can send a Send_To_Me controlling packet at once, let its neighbor node in neighbor list separately, revise the On_Off flag bit.
5.Send_To_Me controlling packet.Similar but act on just the oppositely with the Not_Send_To_Me controlling packet, cooperate the Wake_Up controlling packet to make together and be used for notifying neighbor node to revise the On_Off state, from false to true.
DLBM method flow based on counter is as shown in Figure 2, and concrete technology implementation scheme is following:
1) for each node is provided with a counter, counter initialization zero setting;
When 2) receiving a packet, if packet is in the edge forward mode, execution in step 3), otherwise forward step 14) to;
3) be in expansion mode execution in step 4 if find it), otherwise execution in step 9);
4) counter adds 1;
5) judge whether counter reaches threshold value, does not reach threshold value execution in step 14), otherwise execution in step 6);
6) judge the outermost layer that whether is in expansion, if not execution in step 7), otherwise execution in step 8);
7) send the Not_Send_To_Me controlling packet, forward step 14) to;
Receive the node of Not_Send_To_Me controlling packet can judge whether the own number of plies of living in is empty, if empty words oneself number of plies of living in is set to the nextLayer value in the Not_Send_To_Me controlling packet.Next can oneself EorS be set to the expansionary phase, and the On_Off position that Not_Send_To_Me controlling packet sender is set is false.
8) revise the EorS flag bit, get into the contraction phase, forward step 14) to;
9) counter subtracts 1;
10) judge whether counter is 0, if be not 0 execution in step 14), otherwise execution in step 11);
11) judge whether be in the contraction innermost layer, if not execution in step 12), otherwise execution in step 13);
12) send the Wake_Up controlling packet;
The node of receiving the Wake_Up controlling packet at first can check the own number of plies of living in whether to equal the nextLayer value in the controlling packet, unequal end, otherwise can oneself EorS be set to the contraction phase, and transmission Send_To_Me controlling packet.The On_Off flag bit that the node of receiving the Send_To_Me controlling packet can be revised controlling packet sender in oneself the neighbor list is true, and it is participated in during the edge transmits again.
13) revise the EorS flag bit, get into the expansionary phase;
14) transmit packet.
Through said process, the route cavity with regard to complete execution the process of once expanding, shrinking.
The present invention is through dynamically changing the fringe node in route cavity; Make it form route virtual, that an enlarge cavity; Follow-up packet will be transmitted via virtual edge, route cavity, thereby solve the problem of primary routing cavity fringe node load too high.In the present invention; Need not safeguard many fixed path; Do not need to carry out in advance the detection in route cavity yet; Do not rely on certain definite Routing Protocol simultaneously, and only dynamically form the problem that its fringe node load too high is solved in virtual route cavity, have good transplantability and extensibility through controlling simply.
In order to specify effect of the present invention, the present invention comes the effect of invention is verified through the analog simulation test.
Network lifetime is a core index of weighing the wireless sensor network routing method performance.Ceiling capacity consumes (Maximum Energy Consumption) when finishing for analog simulation, the energy that the node that consumed energy is maximum in the network consumes.This is a very important index, and ceiling capacity consumption is big more, mean this part node in this network can be more early the energy that exhausts oneself.If these nodes are some key nodes in the network just, the life cycle of so whole network will finish very soon, so this index can have been represented network lifetime well.This experiment also is provided with two other index and investigates as auxiliary: one is average energy consumption (AverageEnergy Consumption), has shown when simulation finishes the average energy that all nodes of whole network consume; Another is average retardation (Average Delay), shown packet from source node to sink node mean transit delay.
In order to verify the validity of DLBM method; This experiment is carried out emulation from ceiling capacity consumption, average energy consumption and the average delay of sensor node to the DLBM method that is proposed, and with standard GPSR algorithm and adopt the HobyCan algorithm of multipath route balance load to compare analysis.What use is the NS2 emulation tool that emulation tool is generally acknowledged by industry.
The deployment scenario of emulation is following: 400 nodes are evenly distributed on 400*400m
2The network plane zone in, the cavity of a rectangle is arranged in the middle of the zone.The transmission range of each sensor node is set to 25m.The primary power of each node is set to 300 units, and revolution is sent out a packet and consumed a unit energy.Because controlling packet is very little, ignore the energy that the controlling packet transmission consumes in the test.Adopted two pairs of communication nodes: two source nodes are on the left side in route cavity, and two sink nodes are positioned at the right in cavity.DLBM note based on timer in the test is made GPSR-DLBM1; DLBM note based on counter is made GPSR-DLBM2.The expansion number of plies in the DLBM algorithm is set to 2.The sum of giving out a contract for a project of two nodes is increased to 250 from 50.
The variation tendency that Fig. 3 increases progressively with the number of giving out a contract for a project for ceiling capacity consumption.The DLBM of two kinds of control modes is all little than the ceiling capacity consumption of standard GPSR agreement, and along with several increase of giving out a contract for a project, this advantage is more obvious.Contrast GPSR-DLBM1 and GPSR-DLBM2, the ceiling capacity consumption of GPSR-DLBM1 is littler, and this is that the switching between level is faster, makes the ectonexine load more balanced because in the strategy based on timer.This point can promote its performance through the counter that reduces among the GPSR-DLBM2, and when counter was 1, both performances were about the same.
The variation tendency that Fig. 4 increases progressively with the number of giving out a contract for a project for average energy consumption.GPSR-DLBM1 is similar with the GPSR-DLBM2 performance, and all the average energy consumption than standard GPSR agreement is little.This is because DLBM has introduced the forwarding that more node is participated in bag.Along with the increase of the quantity of giving out a contract for a project, the gap between them shows enlarging greatly thus, the well balance cavity load of node on every side of DLBM.
Fig. 5 has explained that the packet average transfer delay of DLBM of two kinds of control modes is slightly longer than standard GPSR agreement, main cause be DLBM when walking around the route cavity, may walk farther path, caused its average retardation bigger.But the gap between the three is very little, almost in several milliseconds scope.
In order to verify the validity of DLBM method, this experiment also compares analysis with the HobyCan algorithm that adopts the load on every side of multipath route balance cavity.The deployment scenario of experiment is tested much at one with preceding group, unique different be choosing of communication node.In the experiment of this group; Two source nodes have been chosen; They are placed on the left side in route cavity; Consider that the HobyCan agreement has the limitation that is only applicable to single Sink node, a sink node that is positioned at the right, route cavity has only been chosen in experiment, and two source nodes send information to the sink node simultaneously.
Fig. 6 explains that HobyCan consumes performance at the less stage ceiling capacity of the number of giving out a contract for a project and slightly is worse than GPSR-DLBM2; This is because HobyCan is provided with energy residue threshold value; Have only the dump energy of working as on certain paths to be lower than certain limit and just understand the starting load equilibrating mechanism, but both ceiling capacity consumption all are higher than the GPSR-DLBM1 based on timer.Fig. 7 shows by the same token, is giving out a contract for a project the less stage of number, and the HobyCan average energy consumption is a little more than DLBM, and when the number of giving out a contract for a project increased, three's average energy consumption much at one.Fig. 8 has showed that the average retardation of HobyCan be higher than DLBM far away, and this is because HobyCan adopts mulitpath balanced cavity load on every side, and mechanism is complicated than DLBM, so its performance is not as simple DLBM.
In sum; Through to based on DLBM, standard GPSR and the HobyCan of GPSR agreement in the contrast experiment's emulation aspect ceiling capacity consumption, average energy consumption and the average delay of node; Show that DLBM has prolonged the life cycle of network effectively with less cost; Reached the purpose of load balancing in the network, compared, reached the performance similar even more superior with it through simpler control with HobyCan.
The DLBM strategy is through dynamically changing the size in route cavity, and the load transfer with primary routing cavity fringe node has arrived its node on every side effectively, thereby has reached effect of load balance, and then has prolonged the life cycle of whole network.
Compare around the algorithm in hole with more existing making a circulation, DLBM has own some unique advantages:
(1) DLBM does not rely on certain definite Routing Protocol, and only solves the problem of its fringe node load too high through the virtual route cavity of dynamic formation, has good transplantability and extensibility.
(2) DLBM realizes load balancing through multipath; But it can't pay too much extra cost for the information of safeguarding these paths, only relies on the exchange of some simple control informations just can reach expansion and the contraction of dynamically controlling virtual route cavity.
(3) compare with HobyCan, DLBM can be used for existing the network (HobyCan only is applicable to single sink meshed network) of a plurality of sink nodes, has good adaptability.
Above-described instantiation is further to explain to of the present invention, and is not used in qualification protection scope of the present invention, and is all within principle of the present invention and spirit, the change of being done and to be equal to replacement all should be within protection scope of the present invention.
Claims (4)
1. the method for routing of a wireless sensor network load balancing may further comprise the steps:
One, in method for routing based on the geographical position, when a packet gets into the local smallest point of greedy forwarding, can find to lay oneself open to the edge in route cavity, this bag can be according to the edge propelling of former routing mode through the primary routing cavity;
When two, packet advances through edge, route cavity; Node on its path is set to down state; The node that is set to down state will not participate in transmitting under the follow-up edge pattern work of bag, so, and from the angle of integral body; One deck has outwards been expanded in this route cavity, forms a virtual route cavity;
Three, according to rule, next bag will be transmitted along the empty edge of the virtual route of new formation, has so just alleviated the load of underlay nodes.
2. the method for routing of a kind of wireless sensor network load balancing according to claim 1; It is characterized in that, for each node is provided with a controller, after controller reaches preset threshold value; Through changing the upstate of node in the network, the contraction and the expansion in control route cavity.
3. the method for routing of a kind of wireless sensor network load balancing according to claim 2 is characterized in that, controller adopts timer, comprises following steps:
1) for each node is provided with a timer, establishing timer effective time is T, and R is the rate of giving out a contract for a project of source node, and N is the expansion number of plies, and the relation between them is:
T=R×N；
Timer initialization zero setting;
When 2) node u receives a packet, if packet is in the edge forward mode and timer is effective, execution in step 3), otherwise forward step 4) to;
3) to neighbor node broadcasting controlling packet, oneself is set to down state, forwards step 5) to;
4) timer zero clearing, to neighbor node broadcasting controlling packet, oneself is set to upstate;
5) transmit packet.
4. the method for routing of a kind of wireless sensor network load balancing according to claim 2 is characterized in that, controller adopts counter, comprises following steps:
1) for each node is provided with a counter, counter initialization zero setting;
When 2) node u receives a packet, if packet is in the edge forward mode, execution in step 3), otherwise forward step 14) to;
3) be in expansion mode, execution in step 4 if find it), otherwise execution in step 9);
4) counter adds 1;
5) judge whether counter reaches threshold value, does not reach threshold value execution in step 14), otherwise execution in step 6);
6) judge the outermost layer that whether is in expansion, if not execution in step 7), otherwise execution in step 8);
7) send controlling packet oneself and be set to down state, forward step 14) to;
8) mark gets into the contraction phase, forwards step 14) to;
9) counter subtracts 1;
10) judge whether counter is 0, if be not 0 execution in step 14), otherwise execution in step 11);
11) judge whether be in the contraction innermost layer, if not execution in step 12), otherwise execution in step 13);
12) send controlling packet, notify next node layer oneself to be set to upstate;
13) mark gets into the expansionary phase;
14) transmit packet.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012103209132A CN102802205A (en) | 2012-09-01 | 2012-09-01 | Load balancing routing method for wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012103209132A CN102802205A (en) | 2012-09-01 | 2012-09-01 | Load balancing routing method for wireless sensor network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102802205A true CN102802205A (en) | 2012-11-28 |
Family
ID=47201146
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2012103209132A Pending CN102802205A (en) | 2012-09-01 | 2012-09-01 | Load balancing routing method for wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102802205A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103501546A (en) * | 2013-10-13 | 2014-01-08 | 北京理工大学 | Method for reducing power consumption of wireless sensor network based on minimum cost spanning tree |
| CN110831067A (en) * | 2019-10-21 | 2020-02-21 | 阳光学院 | Method and device based on balanced routing and hybrid transmission |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102131269A (en) * | 2011-04-29 | 2011-07-20 | 南京邮电大学 | Geographical-position-based routing method in wireless mesh network |
| EP2437428A1 (en) * | 2010-10-01 | 2012-04-04 | Koninklijke Philips Electronics N.V. | Device and method for load balancing for data packet transmissions in wireless networks |
| CN102413537A (en) * | 2010-09-26 | 2012-04-11 | 中国科学院上海微系统与信息技术研究所 | Routing method for load balancing between multiple sink nodes of wireless sensor network |
| CN102595505A (en) * | 2012-03-12 | 2012-07-18 | 中国科学技术大学苏州研究院 | Distributed routing method based on node load balancing for wireless sensor network |
-
2012
- 2012-09-01 CN CN2012103209132A patent/CN102802205A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102413537A (en) * | 2010-09-26 | 2012-04-11 | 中国科学院上海微系统与信息技术研究所 | Routing method for load balancing between multiple sink nodes of wireless sensor network |
| EP2437428A1 (en) * | 2010-10-01 | 2012-04-04 | Koninklijke Philips Electronics N.V. | Device and method for load balancing for data packet transmissions in wireless networks |
| CN102131269A (en) * | 2011-04-29 | 2011-07-20 | 南京邮电大学 | Geographical-position-based routing method in wireless mesh network |
| CN102595505A (en) * | 2012-03-12 | 2012-07-18 | 中国科学技术大学苏州研究院 | Distributed routing method based on node load balancing for wireless sensor network |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103501546A (en) * | 2013-10-13 | 2014-01-08 | 北京理工大学 | Method for reducing power consumption of wireless sensor network based on minimum cost spanning tree |
| CN103501546B (en) * | 2013-10-13 | 2016-05-25 | 北京理工大学 | Reduction wireless sensor network power consumption method based on minimum cost spanning tree |
| CN110831067A (en) * | 2019-10-21 | 2020-02-21 | 阳光学院 | Method and device based on balanced routing and hybrid transmission |
| CN110831067B (en) * | 2019-10-21 | 2022-03-29 | 阳光学院 | Method and device based on balanced routing and hybrid transmission |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Zhang et al. | A new method of mobile ad hoc network routing based on greed forwarding improvement strategy | |
| Sharma et al. | Energy efficient device discovery for reliable communication in 5G-based IoT and BSNs using unmanned aerial vehicles | |
| TWI248738B (en) | Method for managing and controlling the discovery and maintenance for routes in a mobile ad hoc network and the mobile ad hoc network therein | |
| Jia et al. | Effective information transmission based on socialization nodes in opportunistic networks | |
| Tan et al. | Power and mobility aware routing in wireless ad hoc networks | |
| Kafhali et al. | Effect of Mobility and Traffic Models on the energy consumption in MANET Routing Protocols | |
| Malek et al. | Improved the energy of Ad Hoc on-demand distance vector routing protocol | |
| CN108307470A (en) | A kind of network cluster dividing method based on node group relationship degree | |
| Jabbar et al. | Designing an energy-aware mechanism for lifetime improvement of wireless sensor networks: a comprehensive study | |
| Kiamansouri et al. | A two-level clustering based on fuzzy logic and content-based routing method in the internet of things | |
| Punriboon et al. | Fuzzy logic-based path planning for data gathering mobile sinks in WSNs | |
| Liu et al. | A virtual uneven grid-based routing protocol for mobile sink-based WSNs in a smart home system | |
| Tayeb et al. | Cluster head energy optimization in wireless sensor networks | |
| Tabatabaei et al. | Fuzzy-based routing protocol to increase throughput in mobile ad hoc networks | |
| CN102802205A (en) | Load balancing routing method for wireless sensor network | |
| Tewari et al. | Optimized hybrid ant colony and greedy algorithm technique based load balancing for energy conservation in WSN | |
| Gharajeh | A neural-MCDM-based routing protocol for packet transmission in mobile ad hoc networks | |
| Torres et al. | Improving lifetime and availability for ad hoc networks to emergency and rescue scenarios | |
| Hu et al. | Automatic parameter selection for the ZigBee distributed address assignment mechanism | |
| Yu et al. | DMGR: a Multipath Geographic Routing Strategy with the On-demand Mobile Sink in WSN. | |
| Varun et al. | Hierarchical energy efficient routing in wireless sensor networks and its challenges | |
| Niewiadomska-Szynkiewicz | Energy aware communication protocols for wireless sensor networks | |
| Rahman et al. | An efficient position based power aware routing algorithm in mobile ad-hoc networks | |
| Ahmad et al. | COME: cost optimisation with multi-chaining for energy efficient communication in wireless sensor networks | |
| CN103595657B (en) | Layer-stepping network route method based on distributed context aware |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20121128 |