CN100466624C - Routing method and device - Google Patents
Routing method and device Download PDFInfo
- Publication number
- CN100466624C CN100466624C CNB2003101172346A CN200610111960A CN100466624C CN 100466624 C CN100466624 C CN 100466624C CN B2003101172346 A CNB2003101172346 A CN B2003101172346A CN 200610111960 A CN200610111960 A CN 200610111960A CN 100466624 C CN100466624 C CN 100466624C
- Authority
- CN
- China
- Prior art keywords
- node
- routing
- routing table
- degree
- getting close
- 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.)
- Active
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The method comprises: a) building a routing table comprising the proximity between neighboring node and current node; b) according to the routing table, the data of source node is routed to the destination node. The invention also reveals a routing device.
Description
Technical field
The present invention relates to the communications field, more specifically, relate to method for routing and device.
Background technology
In recent years, because the development of microelectric technique, computing technique and wireless communication technology etc. makes movable self-organization (Ad Hoc) network become one of focus of countries in the world scientific research personnel concern.As the wireless sensor network that the typical case of mobile ad-hoc network uses, it is made up of numerous sensor node, and the self-organizing network by a multi-hop of communication composition carries out collection and treatment and it is sent to user or task management person data.It has boundless application prospect: environmental monitoring and forecast, medical treatment and nursing, Smart Home, monitoring, traffic, exploration and logistics management and safety monitoring etc.
Mobile ad-hoc network has significant limitation at aspects such as computing capability, energy and memory sizes, and its applied environment is all comparatively abominable usually, can't carry out conventional maintenance to the mobile terminal node that breaks down.It needs emphasis to consider the problem of network lifetime, and traditional route technology can't be applicable to mobile wireless self-organized network, and the research of route technology is one of emphasis of mobile ad-hoc network research.
The topmost purpose of mobile ad-hoc network route technology is exactly when guaranteeing data communication, prolongs network lifetime, adopts the management scheme with competition mechanism to reduce connection failure.In the design of agreement, must follow following basic demand: at first, because the terminal node number of mobile ad-hoc network is flexible and changeable, can be from up to a hundred to thousands of even up to ten thousand, so Routing Protocol must have extensibility; Secondly, the mobile ad-hoc network node distribution is dynamic, must consider its DYNAMIC DISTRIBUTION characteristics in the design of Routing Protocol, and Routing Protocol must guarantee the routing stability under the situation of movement; Once more, because applied environment is abominable, mobile terminal node is easy to break down or depleted of energy, thereby cause the variation of network topology structure, therefore Routing Protocol will have higher fault-tolerant ability, can carry out route and transmission adjustment according to actual conditions, reduce the network energy consumption, guarantee a network connections; At last, it also is the most important in the routing algorithm design, will set up the energy-efficient pattern in data processing and transmission, will select suitable manner according to actual needs on the mode of data report, this all has very big influence to the energy consumption of network and the stability of route.Certainly also need to guarantee certain service quality in some special applications, in most of application scenarioss of mobile ad-hoc network, energy consumption problem is to pay the utmost attention to one of key factor, and this directly has influence on the lifetime of network.
In the design of mobile ad-hoc network route technology, it is also to be noted that, because varying and the physical characteristics of mobile node self of applied environment makes the versatility of route technology become a difficult problem.Usually network designer is had at the real needs of each application, selects the routing mechanism that adapts with it.
Therefore the needs design is a kind of can pass through the balance factor self adaptation, chooses the route technology of the energy efficient of suitable route at different application tasks.
In view of this, a kind of EAR (Energy Awarerouting has been proposed in correlation technique, the fair route of energy) agreement (C.Rahul, J.Rabaey, " Energy AwareRouting for Low Energy Ad Hoc Sensor Networks; " IEEE WirelessCommunications and Networking Conference, vol.1, pp.350-355, March 17-21,2002.), this agreement is the Route Selection from energy consumption angle consideration network, but it is not to select route based on the minimum principle of energy consumption.Some of correlation technique according to energy consumption minimum principle select in the agreement of route, network just utilizes this paths to carry out transfer of data after having found out the minimum path of energy consumption always.But this energy that is very easy to cause this paths is by approach exhaustion apace, and causing the worst result is exactly network division, and can't continue operate as normal.Therefore the EAR agreement allows to use sub-optimal path to carry out the transmission of data for fear of the appearance of this situation.Agreement finds many paths that can use for transfer of data between destination node and source node, and gives every paths according to probable value of regular allocation.Agreement was just selected a paths randomly according to probable value when each source node sent data to destination node.Can not use a paths in the EAR agreement obviously always, the network energy consumption is distributed on the different paths comparatively liberally, guarantee that network can longer time ground normal operation.
Fig. 1 shows the flow chart of the EAR agreement of correlation technique, and the EA Routing Protocol is divided into three phases:
Establishment stage S102: adopt the mode flood to seek in the network node to the cost of energy that route and route spent of destination node, for transfer of data is set up routing table;
Data transfer phase S104: select the path that data are sent to destination node from source node randomly according to routing table; And
Route maintenance stage S106: the route of setting up is safeguarded.Because agreement does not often adopt the mode flood to guarantee the availability of route, so the cost of route maintenance is very little.
Yet, the EAR agreement is by safeguarding one group of path, and guarantee that in the different path of different selection of time the energy on any individual paths can not consume too fastly, to reach purpose with network energy consumption mean allocation and prolongation network lifecycle, therefore the EAR agreement needs the positional information of collector node, for each node distributes an address, this must make that the establishment stage of agreement can be very complicated.
In addition, a kind of GBR[2 has also been proposed in correlation technique] (Gradient-BasedRouting, based on the gradient route) agreement (C.Schurgers and M.B.Srivastava, " Energy efficient routing in wireless sensor networks; " MILCOMProceedings on Communications for Network-Centric Operations:Creating the Information Force, 2001.), attempt by the flow distribution in the balancing network, thereby arrive the equalizing network energy consumption, prolong the purpose of network normal operation time.
Fig. 2 shows the flow chart of the GBR agreement of correlation technique, as shown in the figure, may further comprise the steps:
S202 at first, destination node be to the inquiry of Web broadcast oneself, and the jumping figure information that node arrives destination node has been carried in inquiry;
Next S204, node can write down and find out the minimum hop count that oneself arrives destination node to jumping figure information after receiving inquiry.The difference of minimum hop count is called the gradient of the two between node and the neighbors;
Last S206, node is just selected when transfer of data and oneself is had the neighbors of greatest gradient to jump as next.
The GBR agreement has proposed three kinds of different flow expansion scheme, balanced distribution network energy consumptions as far as possible:
Scheme 1: node selects neighbors to jump as next when the transmission data at random.If have identical gradient between node and the two or more neighbors, then the agreement defining node selects a neighbors to jump as next from these several neighborss randomly.
Scheme 2: if when the energy of node is lower than the lower limit ratio of setting, node will improve oneself minimum hop count to destination node, and the notice neighbors, reduces or stops the chance of other node to own transmission data.Certainly this must force some neighborss also to change its minimum hop count and notify other neighbors till the gradient of all nodes is consistent.Because agreement will guarantee that minimum hop count from the farther neighbors of destination node is greater than present node.
Scheme 3: if node begins to receive data from certain neighbors, it will notify the minimum hop count of other neighbors oneself outside this neighbors to improve.Notified neighbors also can be made corresponding adjustment to guarantee the gradient unanimity of all nodes.Like this, new data will be selected other path to transmit and not influence the transmission of data with existing.
Yet, though the GBR agreement adopts flow extended method ratio method at random can prolong network lifetime better, but when adopting extended method, must avoid using the bottleneck node in the network as possible, and each node all to be safeguarded the gradient information between own and the neighbors.
Therefore, people need a kind of self adaptation route technology that is applicable to mobile ad-hoc network, can reach the purpose that prolongs network lifetime and the consumption of balance network energy, and solve the problem in the above-mentioned correlation technique.
Summary of the invention
The present invention aims to provide adaptive routing method and the device that is used for mobile ad-hoc network, with the equilibrium problem of network lifetime in the solution correlation technique and network energy consumption.
According to an aspect of the present invention, a kind of method for routing is provided, may further comprise the steps: step a, the mode that floods by the part is set up the routing table of the degree of getting close to that has comprised neighbors and present node, wherein, utilize distance and node maximum residual energy between the node to calculate described degree of getting close to; And step b, according to routing table, the data of source node are routed to destination node.A kind of method for routing also is provided, has may further comprise the steps: step a, set up the routing table of the degree of getting close to that comprises neighbors and present node in the part mode of flooding, wherein, utilize the longest and application oriented self adaptation route of the whole network life criterion to calculate degree of getting close to; And step b, according to routing table, the data of source node are routed to destination node.
According to a further aspect in the invention, a kind of route device is provided, comprise: routing table is set up module, be used for setting up the routing table of the degree of getting close to that has comprised neighbors and present node by the mode that the part floods, wherein, utilize distance and node maximum residual energy between the node to calculate described degree of getting close to; And routing module, be used for according to routing table, the data of source node are routed to destination node.
By technique scheme, the present invention has realized following technique effect:
In mobile ad-hoc network, the structure person can adjust balance factor according to the quality of service requirement of different application, chooses suitable path transmissioning data, to reach the prolongation network lifetime, the purpose of balancing network energy consumption.Specifically, the present invention
1) when selecting route, taken all factors into consideration euclidean distance between node pair and residue energy of node, avoided using that node energy consumes too fast phenomenon on this path that same path causes always;
2) for providing a convenience, task management person regulates window easily, by adjustment, can between averaging network energy consumption and prolongation network lifetime, find suitable equilibrium point according to the specific requirement of different application to balance factor in the route selection criterion function;
3) network is safeguarded one group of route, only selects suitable path but not optimal path when Route Selection, makes network topology keep stable as much as possible;
4) alleviated the have nothing for it but burden of the different routing plans of each application choice of network designer;
5) take into full account the energy limited of mobile ad-hoc network in this programme, can make full use of limited energy resource, can save unnecessary energy consumption again;
6) this programme has extensibility.Network designer can add other influencing factor, for example communication quality of hop count, transmission delay, Radio Link or the like according to the concrete needs of different application in the routing criterion function; And under future dissimilar radio network integrated environment based on the cognition wireless electric model according to the new route index end-to-end routing Design of reshuffling such as (as the channel-aware ability, channel switch number, channel switching frequency).
7) this programme can guarantee the routing stability under the non-frequent situation of movement by the nodal information that floods of part periodically.
Other features and advantages of the present invention will be set forth in the following description, and, partly from specification, become apparent, perhaps understand by implementing the present invention.Purpose of the present invention and other advantages can realize and obtain by specifically noted structure in the specification of being write, claims and accompanying drawing.
Description of drawings
Accompanying drawing described herein is used to provide further understanding of the present invention, constitutes the application's a part, and illustrative examples of the present invention and explanation thereof are used to explain the present invention, do not constitute improper qualification of the present invention.In the accompanying drawings:
Fig. 1 shows the flow chart of the EAR agreement of correlation technique;
Fig. 2 shows the flow chart of the GBR agreement of correlation technique;
Fig. 3 shows the flow chart according to the adaptive routing method of mobile ad-hoc network of the present invention;
Fig. 4 shows the block diagram according to the self adaptation route device of mobile ad-hoc network of the present invention;
Fig. 5 is the state transition diagram that node according to an embodiment of the invention is finished routing function and part access function;
Fig. 6 is the node relay state figure according to this embodiment;
Fig. 7 is the node route maintenance state diagram according to this embodiment;
Fig. 8 sets up state diagram according to the node route of this embodiment; And
Fig. 9 is the node extinction state diagram according to this embodiment.
Embodiment
Below with reference to the accompanying drawings and in conjunction with the embodiments, describe the present invention in detail.
In the EAR of correlation technique agreement, employing be that the mode that the overall situation floods is set up route, though can reach, cause very complexity of establishment stage with network energy consumption mean allocation and the purpose that prolongs network lifecycle.Though and the GBR agreement adopts flow extended method ratio method at random can prolong network lifetime better, but when adopting extended method, must avoid using the bottleneck node in the network as possible, and each node all to be safeguarded the gradient information between own and the neighbors.
In view of this, the present invention proposes the notion that a kind of part floods, proposing floods in the determined subrange of setting degree of getting close to sets up route.In order to set degree of getting close to, the present invention has designed a kind of adaptation function module, this functional module is included the dump energy and the distance between the node of network node in a routing criterion function, and it has considered the mean consumption of wireless self-organization network energy and the equilibrium between the network lifetime.Alternatively, this routing criterion function provides the adjustment interface: balance factor, can regulate the mean consumption of energy and the equilibrium between the network lifetime by regulating balance factor.
Fig. 3 shows the flow chart according to the adaptive routing method of mobile ad-hoc network of the present invention, and Fig. 4 shows the block diagram according to the self adaptation route device of mobile ad-hoc network of the present invention.
As shown in Figure 3, the adaptive routing method according to mobile ad-hoc network of the present invention may further comprise the steps:
Step S302, the route establishment stage, the mode that floods by the part is set up portion and has been comprised that the routing table of degree of getting close to of neighbors and present node is as the foundation of Route Selection.By expanding successively, network safeguards one group of route, sets up in the network each node to the path of destination node.The detection information that transmits in the network is mainly used in distance and the node maximum residual energy of determining between the node, calculates degree of getting close to this.
Alternatively, internodal degree of getting close to f
JiDescribe, its calculating formula is finished by following routing criterion function: f
Ji=(1/d
Ji)
K α(E
i)
(1-α)Wherein, α is a balance factor, and number range is the value between [0,1]; d
JiBe internodal distance, it bears the effect that prolongs network lifetime in criterion function; E
iBe the dump energy of the alternative node of next relaying, it bears the effect that the mean allocation network energy consumes in criterion function.K is the value difference in different wireless transmission environment, generally value between [2,4].
Degree of getting close to is and the closely-related amount of balance factor by changing balance factor, can make degree of getting close to reflect the influence of different reference factor more emphatically.For example, α trends towards the main standard of null representation dump energy as route selecting, and this moment, the network emphasis considered that the energy that will consume is evenly distributed.This point is very necessary than long application stable period for requiring the whole network.The application of being partial to each task low energy consumption then requires α to trend towards 1.These two kinds of tasks can reach requirement at the initial value of the whole network initial phase setting α, and need not change the concrete form of choosing function.Certainly, reference factor is not limited only to communication distance and dump energy, can replace as required or increase adapt to the requirement of different application.Calculate degree of getting close to such as utilizing the longest and application oriented self adaptation route of the whole network life criterion.
Step S304, data transfer phase according to routing table, is routed to destination node with the data of source node.Specifically, when source node need transmit data, it just selected in the routing table and the neighbors of degree of the getting close to maximum of oneself sends data.Via node also can select the neighbors of degree of getting close to maximum to continue to send data in routing table after receiving data, so repeatedly, arrives destination node up to data.
Step S306, in the route maintenance stage, the cost of route maintenance is very little in this programme, only needs periodically to carry out the message transmission by the part mode of flooding, and routing table is upgraded.Routing table is because the limited of node storage capacity must be limited in a certain size scope, and this can keep according to specified criteria selected part node in the process of routing table is set up in initialization.
Can learn by above description,, may further comprise the steps according to method for routing of the present invention: step S302, foundation comprises the routing table of the degree of getting close to of neighbors and present node; And step S304, according to routing table, the data of source node are routed to destination node.
Alternatively, step S302 may further comprise the steps: utilize distance and node maximum residual energy between the node to calculate degree of getting close to.
Alternatively, distance is big more, and then degree of getting close to is more little.
Alternatively, the maximum residual energy is big more, and then degree of getting close to is big more.
Alternatively, there is first functional relation between degree of getting close to and the distance, has second functional relation between degree of getting close to and the maximum residual energy, include same balance factor in first functional relation and second functional relation.
Alternatively, utilize following function calculation degree of getting close to: f
Ji=(1/d
Ji)
K α(E
i)
(1-α), wherein, α is a balance factor, number range is between [0,1]; Dji is a distance; Ei maximum residual energy; K comes value according to different wireless transmission environment.
Alternatively, step S302 may further comprise the steps: utilize the longest and application oriented self adaptation route of the whole network life criterion to calculate degree of getting close to.
Alternatively, step S302 comprises that the mode that floods by the part sets up routing table.
Alternatively, step S302 may further comprise the steps: node broadcasts information and etc. to be feedback, comprise the maximum residual energy information of neighbors in the feedback information; And node is judged neighbors and the distance of oneself by the received power of feedback information.
Alternatively, step S302 is further comprising the steps of: if the forward direction rrotue node set in the routing table is combined into sky, increase transmitting power so, continue broadcast message and etc. to be feedback, reach the upper limit up to transmitting power, the forward direction routing node still for empty, makes node change node extinction state over to so if transmitting power reaches the upper limit.
Alternatively, step S304 may further comprise the steps: source node select in the routing table and the neighbors of own degree of getting close to maximum as via node, and to its transmission data; And via node is after receiving data, also selects the neighbors of degree of getting close to maximum to continue to send data in routing table, so repeatedly, arrives destination node up to data.
Alternatively, method for routing according to the present invention is further comprising the steps of: step S306, periodically carry out the message transmission by the part mode of flooding, and routing table is upgraded.
Alternatively, step S306 may further comprise the steps: whether the energy level of at first checking node is lower than lower limit, if it is lower than the normal energy level, then according to other nodal information maintaining routing lists that receive, revises wherein relevant parameters; If the forward direction rrotue node set in the routing table is combined into sky, then node must be adjusted transmitting power, and rebulids routing table.
As shown in Figure 4, the self adaptation route device 400 that is used for mobile ad-hoc network according to the present invention comprises:
Routing table is set up module 402, is used for setting up the foundation of the routing table of the degree of getting close to that has comprised neighbors and present node as Route Selection by the mode that the part floods; And
Alternatively, routing table is set up module and is utilized distance and node maximum residual energy between the node to calculate degree of getting close to.
Alternatively, distance is big more, and then degree of getting close to is more little.
Alternatively, the maximum residual energy is big more, and then degree of getting close to is big more.
Alternatively, there is first functional relation between degree of getting close to and the distance, has second functional relation between degree of getting close to and the maximum residual energy, include same balance factor in first functional relation and second functional relation.
Alternatively, utilize following function calculation degree of getting close to: f
Ji=(1/d
Ji)
K α(E
i)
(1-α)Wherein, a is a balance factor, and number range is between [0,1]; Dji is a distance; Ei maximum residual energy; K comes value according to different wireless transmission environment.
Alternatively, k is between [2,4].
Alternatively, routing table is set up module and is utilized the longest and application oriented self adaptation route of the whole network life criterion to calculate degree of getting close to.
Alternatively, routing table is set up module and is comprised maximum residual energy information acquisition module (not shown), be used to make the node broadcast message and etc. to be feedback, comprise the maximum residual energy information of neighbors in the feedback information.
Alternatively, routing table is set up module and is also comprised apart from the judge module (not shown), and the received power that is used to make node pass through feedback information is judged neighbors and the distance of oneself.
Alternatively, routing table is set up module and is also comprised increase power model (not shown), be combined into sky if be used for the forward direction rrotue node set of routing table, increase transmitting power so, continue broadcast message and etc. to be feedback, reach the upper limit up to transmitting power, the forward direction routing node still for empty, makes node change node extinction state over to so if transmitting power reaches the upper limit.
Alternatively, routing module make source node select in the routing table and the neighbors of own degree of getting close to maximum as via node, and to its transmission data; And make via node after receiving data, and also in routing table, select the neighbors of degree of getting close to maximum to continue to send data, so repeatedly, arrive destination node up to data.
Alternatively, also comprise: route maintenance module 406, be used for periodically carrying out the message transmission by the part mode of flooding, routing table is upgraded.
Alternatively, route maintenance module checks at first whether the energy level of node is lower than lower limit, if it is lower than the normal energy level, then according to other nodal information maintaining routing lists that receive, revises wherein relevant parameters; If the forward direction rrotue node set in the routing table is combined into sky, then node must be adjusted transmitting power, and rebulids routing table.
Illustrate according to one embodiment of present invention below in conjunction with Fig. 5 to Fig. 9.
Fig. 5 is the state transition diagram that node according to an embodiment of the invention is finished routing function and part access function.Here, the purpose that indicates the part access function is that algorithm as far as possible intactly is described.
May further comprise the steps in the state diagram of Fig. 5: initialization (INI) step S502, route are set up (SETUP) step S504, route maintenance (MAINTEIN) step S506, wait (WAIT) step S508, relaying (RELAY) step S510, broadcasting (RADIO) step S512, node extinction (DIE) S514 and end (END) step S516.Switching flow between these steps repeats no more as shown in Figure 5 here.
Fig. 6 is the node relay state figure according to this embodiment; Fig. 7 is the node route maintenance state diagram according to this embodiment; Fig. 8 sets up state diagram according to the node route of this embodiment; Fig. 9 is the node extinction state diagram according to this embodiment.
According to Fig. 5 to Fig. 9, its detailed process is as follows:
1) initialization (INI) S502 and end (END) step S516:
Under the init state, node powers on, memory allocated unit as required, and be initial value with specification of variables; And after node enters done state, after data necessary preserved, powered-down.
2) route is set up (SETUP) step S504
Set up state in route, node at first will be determined power of communications.In init state, the power of communications of node is set to initial value.Node in communication range broadcast message and etc. to be feedback.The energy information that comprises neighbors in the feedback information, present node can be judged the distance of neighbors and present node by the received power of feedback information.The routing table of present node is set up by the energy and the internodal distance of neighbors.If the forward direction rrotue node set in the routing table is combined into sky, must increase transmitting power so, restart the process of setting up of front, reach the upper limit up to transmitting power.The forward direction routing node still for empty, illustrates that present node has been in isolated state if transmitting power reaches the upper limit, and present node changes node extinction state over to so.
3) route maintenance (MAINTEIN) step S506
The route maintenance state checks at first whether the energy level of present node is lower than lower limit, if present node is lower than the normal energy level, other nodal informations that then need to receive according to broadcast channel are safeguarded route list, revises relevant parameters in the tabulation.If the forward direction rrotue node set in the route list is combined into sky, this node must be adjusted transmitting power, and rebulids routing table.
4) relaying (RELAY) state step S510
When receiving relay request, node changes relay state over to by wait state.Node at first calculates the degree of getting close to of all forward direction nodes in the routing table according to choice function, and the forward direction routing node of therefrom choosing degree of getting close to maximum is as next via node.After selecting suitable next via node, present node receives data and Data transmission from source node.So repeatedly routing table is safeguarded.
5) node extinction (DIE) state step S514
When node energy exhausted or be in isolated state, node entered the extinction state.Node towards periphery after the node broadcasts, enters done state with this information.
6) wait for (WAIT) S508 and broadcasting (RADIO) state step S512
In these two states, node is periodically monitored the attribute information (comprising node extinction information, dump energy attribute etc.) of the control information or the neighbors broadcasting of broadcast channel.After receiving corresponding information, node changes corresponding processing procedure over to.
According to the above, carry out two-dimentional combined optimization with path and energy consumption, and provided embodiment and concrete decision rule function, it will be apparent to one skilled in the art that and can do some local modification, but this does not break away from spiritual scope of the present invention this.
There is part algorithm (as GBR algorithm of standard EAR algorithm and energy spread etc.) to consider shortest path and dump energy two aspects respectively in the existing wireless sensor network routing algorithm.When the energy of network node was all very sufficient, the selection of route should be tended to the path of consumed energy minimum; And after network operation a period of time, the selection of route will more and more tend to how to avoid to use node that dump energy is less.The combined optimization scheme that the present invention proposes is to weigh between the two at this path distance and energy.
As can be seen from the above description, the present invention has realized in mobile ad-hoc network, the structure person can adjust balance factor according to the quality of service requirement of different application, chooses suitable path transmissioning data, to reach the prolongation network lifetime, the purpose of balancing network energy consumption.Specifically, comprise following technique effect:
1) when selecting route, taken all factors into consideration euclidean distance between node pair and residue energy of node, avoided using that node energy consumes too fast phenomenon on this path that same path causes always;
2) for providing a convenience, task management person regulates window easily, by adjustment, can between averaging network energy consumption and prolongation network lifetime, find suitable equilibrium point according to the specific requirement of different application to balance factor in the route selection criterion function;
3) network is safeguarded one group of route, only selects suitable path but not optimal path when Route Selection, makes network topology keep stable as much as possible;
4) alleviated the have nothing for it but burden of the different routing plans of each application choice of network designer;
5) take into full account the energy limited of mobile ad-hoc network in this programme, can make full use of limited energy resource, can save unnecessary energy consumption again;
6) this programme has extensibility.Network designer can add other influencing factor, for example communication quality of hop count, transmission delay, Radio Link or the like according to the concrete needs of different application in the routing criterion function; And under future dissimilar radio network integrated environment based on the cognition wireless electric model according to the new route index end-to-end routing Design of reshuffling such as (as the channel-aware ability, channel switch number, channel switching frequency).
7) this programme can guarantee the routing stability under the non-frequent situation of movement by the nodal information that floods of part periodically.
Obviously, those skilled in the art should be understood that, above-mentioned each module of the present invention or each step can realize with the general calculation device, they can concentrate on the single calculation element, perhaps be distributed on the network that a plurality of calculation element forms, alternatively, they can be realized with the executable program code of calculation element, thereby, they can be stored in the storage device and carry out by calculation element, perhaps they are made into each integrated circuit modules respectively, perhaps a plurality of modules in them or step are made into the single integrated circuit module and realize.Like this, the present invention is not restricted to any specific hardware and software combination.Should be understood that the variation in these concrete enforcements is conspicuous for a person skilled in the art, do not break away from spiritual protection range of the present invention.
The above is the preferred embodiments of the present invention only, is not limited to the present invention, and for a person skilled in the art, the present invention can have various changes and variation.Within the spirit and principles in the present invention all, any modification of being done, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (19)
1. a method for routing is characterized in that, may further comprise the steps:
Step a, set up the routing table of the degree of getting close to that comprises neighbors and present node in the part mode of flooding, wherein, utilize distance and node maximum residual energy between the node to calculate described degree of getting close to, there is first functional relation between described degree of getting close to and the described distance, there is second functional relation between described degree of getting close to and the described maximum residual energy, includes same balance factor in described first functional relation and described second functional relation; And
Step b according to described routing table, is routed to destination node with the data of source node.
2. method for routing according to claim 1 is characterized in that described distance is big more, and then described degree of getting close to is more little.
3. method for routing according to claim 1 is characterized in that, described maximum residual energy is big more, and then described degree of getting close to is big more.
4. method for routing according to claim 1 is characterized in that, utilizes the described degree of getting close to of following function calculation:
f
ji＝(1/d
ji)
kα(E
i)
(1-α)
Wherein, α is described balance factor, and number range is between [0,1]; d
JiBe described distance; E
iBe described maximum residual energy; K comes value according to different wireless transmission environment, and scope is [2,4]; I and j are the numbering of described distance two end nodes.
5. method for routing according to claim 1 is characterized in that, described step a may further comprise the steps:
Node broadcasts information and etc. to be feedback, comprise the maximum residual energy information of neighbors in the feedback information; And
Described node is judged neighbors and the distance of oneself by the received power of feedback information.
6. method for routing according to claim 5 is characterized in that, described step a is further comprising the steps of:
If the forward direction rrotue node set in the described routing table is combined into sky, increase transmitting power so, continue broadcast message and etc. to be feedback, reach the upper limit up to transmitting power, the forward direction routing node still for empty, makes described node change node extinction state over to so if transmitting power reaches the upper limit.
7. method for routing according to claim 1 is characterized in that, described step b may further comprise the steps:
Step b1, described source node select in the described routing table and the neighbors of own degree of getting close to maximum as via node, and to its transmission data; And
Step b2, described via node also select the neighbors of degree of getting close to maximum to continue to send data in described routing table after receiving data, so repeatedly, arrive described destination node up to data.
8. method for routing according to claim 1 is characterized in that, and is further comprising the steps of:
Step c periodically carries out the message transmission by the part mode of flooding, and described routing table is upgraded.
9. method for routing according to claim 8 is characterized in that, described step c may further comprise the steps:
Whether the energy level of at first checking node is lower than lower limit, if it is lower than described lower limit, then safeguards described routing table according to other nodal informations that receive, and revises wherein relevant parameters; If the forward direction rrotue node set in the described routing table is combined into sky, then described node must be adjusted transmitting power, and rebulids described routing table.
10. according to each described method for routing in the claim 1 to 8, it is characterized in that, be applied in the mobile ad-hoc network.
11. a method for routing is characterized in that, may further comprise the steps:
Step a sets up the routing table of the degree of getting close to that comprises neighbors and present node in the part mode of flooding, and wherein, utilizes the longest and application oriented self adaptation route of the whole network life criterion to calculate described degree of getting close to; And
Step b according to described routing table, is routed to destination node with the data of source node.
12. method for routing according to claim 11 is characterized in that, described step b may further comprise the steps:
Step b1, described source node select in the described routing table and the neighbors of own degree of getting close to maximum as via node, and to its transmission data; And
Step b2, described via node also select the neighbors of degree of getting close to maximum to continue to send data in described routing table after receiving data, so repeatedly, arrive described destination node up to data.
13. method for routing according to claim 11 is characterized in that, and is further comprising the steps of:
Step c periodically carries out the message transmission by the part mode of flooding, and described routing table is upgraded.
14. method for routing according to claim 13 is characterized in that, described step c may further comprise the steps:
Whether the energy level of at first checking node is lower than lower limit, if it is lower than described lower limit, then safeguards described routing table according to other nodal informations that receive, and revises wherein relevant parameters; If the forward direction rrotue node set in the described routing table is combined into sky, then described node must be adjusted transmitting power, and rebulids described routing table.
15. according to each described method for routing in the claim 11 to 14, it is characterized in that, be applied in the mobile ad-hoc network.
16. a route device is characterized in that, comprising:
Routing table is set up module, be used for setting up the routing table of the degree of getting close to that comprises neighbors and present node in the part mode of flooding, wherein, described routing table is set up module and is utilized distance and node maximum residual energy between the node to calculate described degree of getting close to, there is first functional relation between described degree of getting close to and the described distance, there is second functional relation between described degree of getting close to and the described maximum residual energy, includes same balance factor in described first functional relation and described second functional relation; And
Routing module is used for according to described routing table, and the data of source node are routed to destination node.
17. route device according to claim 16 is characterized in that, utilizes the described degree of getting close to of following function calculation:
f
ji＝(1/d
ji)
ka(E
i)
(1-α)
Wherein, α is described balance factor, and number range is between [0,1]; d
JiBe described distance; E
iBe described maximum residual energy; K comes value according to different wireless transmission environment, and scope is [2,4]; I and j are the numbering of described distance two end nodes.
18. route device according to claim 17 is characterized in that, also comprises:
Route maintenance module is used for periodically carrying out the message transmission by the part mode of flooding, and described routing table is upgraded.
19. according to each described route device in the claim 16 to 18, it is characterized in that, be applied in the mobile ad-hoc network.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2003101172346A CN100466624C (en) | 2006-08-28 | 2006-08-28 | Routing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2003101172346A CN100466624C (en) | 2006-08-28 | 2006-08-28 | Routing method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1960329A CN1960329A (en) | 2007-05-09 |
| CN100466624C true CN100466624C (en) | 2009-03-04 |
Family
ID=38071827
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2003101172346A Active CN100466624C (en) | 2006-08-28 | 2006-08-28 | Routing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100466624C (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101119303B (en) * | 2007-08-30 | 2010-08-11 | 浙江工业大学 | Dynamic cluster based multi-objective programming wireless sensing network routing algorithm |
| CN101959279B (en) * | 2009-07-13 | 2013-01-30 | 华为技术有限公司 | Route establishing method and device, and data transmission method |
| CN102036335B (en) * | 2009-09-27 | 2015-07-01 | 北京邮电大学 | Route cognizing protocol for wireless network |
| CN101888682B (en) * | 2010-04-21 | 2012-12-19 | 东南大学 | Method for realizing wireless personal area network routing protocol based on ultra-wide band positioning assist |
| CN102045088B (en) * | 2011-01-26 | 2013-05-08 | 长沙威胜信息技术有限公司 | Low-voltage power line narrowband carrier communication routing method |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1691619A (en) * | 2004-04-27 | 2005-11-02 | 国家数字交换系统工程技术研究中心 | Method for implementing self-organizing network |
| WO2006032678A1 (en) * | 2004-09-22 | 2006-03-30 | International Business Machines Corporation | Method and systems for copying data components between nodes of a network |
| CN1764171A (en) * | 2004-10-22 | 2006-04-26 | 微软公司 | Rendezvousing resource requests with corresponding resources |
-
2006
- 2006-08-28 CN CNB2003101172346A patent/CN100466624C/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1691619A (en) * | 2004-04-27 | 2005-11-02 | 国家数字交换系统工程技术研究中心 | Method for implementing self-organizing network |
| WO2006032678A1 (en) * | 2004-09-22 | 2006-03-30 | International Business Machines Corporation | Method and systems for copying data components between nodes of a network |
| CN1764171A (en) * | 2004-10-22 | 2006-04-26 | 微软公司 | Rendezvousing resource requests with corresponding resources |
Non-Patent Citations (6)
| Title |
|---|
| 传感器网络中基于角度域的洪泛路由算法. 张锦，林亚平，李超，彭静.计算机工程与科学，第27卷第11期. 2005 |
| 传感器网络中基于角度域的洪泛路由算法. 张锦，林亚平，李超，彭静.计算机工程与科学，第27卷第11期. 2005 * |
| 在ad hoc网络中一种新的节能路由维护模型. 欧冬秀，董德存，张树京.铁道学报，第25卷第4期. 2003 |
| 在ad hoc网络中一种新的节能路由维护模型. 欧冬秀，董德存，张树京.铁道学报，第25卷第4期. 2003 * |
| 超宽带传感网的节能路由协议研究. 徐娟.计算机工程与应用，第33期. 2005 |
| 超宽带传感网的节能路由协议研究. 徐娟.计算机工程与应用，第33期. 2005 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1960329A (en) | 2007-05-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Younis et al. | Energy-aware routing in cluster-based sensor networks | |
| Agarwal et al. | Survey of clustering algorithms for MANET | |
| Pei et al. | Low power TDMA in large wireless sensor networks | |
| US7277414B2 (en) | Energy aware network management | |
| Banimelhem et al. | GMCAR: Grid-based multipath with congestion avoidance routing protocol in wireless sensor networks | |
| CN100442786C (en) | Tree structure based routing method | |
| Sheikhpour et al. | Comparison of energy efficient clustering protocols in heterogeneous wireless sensor networks | |
| CN101355517B (en) | Method for balancing network load based on wireless sensor energy information | |
| CN102340838B (en) | Medium access control method for prolonging network lifetime in wireless body area network | |
| CN101711048A (en) | Method for choosing gateway in integrating process of mobile self-organization network and Internet | |
| CN100466624C (en) | Routing method and device | |
| CN105873169A (en) | Wireless ad-hoc network communication method | |
| CN102291791A (en) | Self-adaptive router soft switching method for wireless sensor network | |
| CN102083164A (en) | Method for opportunistic routing of wireless sensor network (WSN) based on energy perception | |
| Shivaprakasha et al. | Energy efficient routing protocols for wireless sensor networks: A survey | |
| Jung et al. | Maximum power plus rssi based routing protocol for bluetooth low energy ad hoc networks | |
| Tan et al. | A distributed and dynamic data gathering protocol for sensor networks | |
| Bansal et al. | FTEP: A fault tolerant election protocol for multi-level clustering in homogeneous wireless sensor networks | |
| Vinh et al. | EMRP: Energy-aware mesh routing protocol for wireless sensor networks | |
| US9295105B2 (en) | Methods and devices for configuring simplified, static, multi-hop wireless networks | |
| Teixeira et al. | Wireless sensor network: Improving the network energy consumption | |
| KR100791627B1 (en) | Method for logical role exchange considering energy state | |
| JP2005295310A (en) | Radio communication method, radio communication system, radio terminal, program and recording medium | |
| EP2987308A1 (en) | Low power mobile communications through mesh network | |
| Liu et al. | Adaptive multi‐layer clustering strategies based on capacity weight 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 |