CN101494599A - Method for implementing multicast energy-saving routing protocol of Ad Hoc network based on layer-striding mechanism - Google Patents
Method for implementing multicast energy-saving routing protocol of Ad Hoc network based on layer-striding mechanism Download PDFInfo
- Publication number
- CN101494599A CN101494599A CNA2008101519528A CN200810151952A CN101494599A CN 101494599 A CN101494599 A CN 101494599A CN A2008101519528 A CNA2008101519528 A CN A2008101519528A CN 200810151952 A CN200810151952 A CN 200810151952A CN 101494599 A CN101494599 A CN 101494599A
- Authority
- CN
- China
- Prior art keywords
- node
- multicast
- energy
- route
- routing
- 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
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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention belongs to the technical field of network communication and relates to a method on the Ad Hoc network that realizes an energy-efficient multicast routing protocol based on a cross-layer mechanism. A node in the physical layer obtains energy information that is carried by data packages and uploads the energy information to the network layer, and the network layer calculates routing cost and optimal transmission power according to the energy information, wherein, a source-based multicast tree with approximate minimum energy consumption is constructed according to the routing cost. When a data package is sent, the network layer sends the optimal transmission power down to the physical layer, and the physical layer sets the optimal transmission power of a next routing hop according to the information, thus further effectively lowering the energy consumption of nodes. The method that realizes the energy-efficient multicast routing protocol based on the cross-layer mechanism can effectively reduce the energy consumption of nodes, prolong the working time of mobile nodes and realize the performance improvement and the service life extension of the whole Ad Hoc network.
Description
Technical field
Present invention relates in general to network communications technology field, relate more specifically on a kind of Ad Hoc network based on multicast route computing method cross-layer mechanism, Energy Efficient.
Background technology
Ad Hoc network is a kind of wireless network that is constituted, typically do not had static infrastructure by mobile node.Mobile node wherein is that main frame possesses routing function again, is responsible for finding and safeguarding the path that leads to other nodes.This class network does not rely on the support of infrastructure, can be more flexible, set up more easily, and also source node can arrive destination node by the intermediate node multi-hop, greatly enlarge communication range.Rely on these advantages, in recent years, Ad Hoc network is widely used in various types of communication services.
Radio node in the Ad Hoc network is battery-powered mostly, and the energy content of battery is limited, and the charging of battery or change in application scenes be inconvenience or even cannot.In the period of 30, the battery manufacturing technology is achieving no breakthrough property progress all the time in the past.Simultaneously, along with the reinforcement of mobile terminal function and the lifting of performance, the demand of electric energy is improved constantly.Therefore, in Ad Hoc network, use power-saving mechanism to become a kind of important means that prolongs working time of node.
Some network applications require data are delivered to a winding receiving end from a transmitting terminal.These application comprise Streaming Media, interactive entertainment, batch data transmission etc.Multicast service is an a kind of efficient business model of supporting multi-party communication.Use this service, a multicast grouping is consigned to a subclass of network node.Its basic characteristics are that the data of transmit leg are not to transmit in many ways by sending realization to recipient one by one, but transmit leg only sends a example of data in network.This example duplicates and finally sends to a plurality of recipients via the node in the network.Multicast had both alleviated the processing load of transmitting terminal system when the data of transmission multi-party communication, reduced the use of the network bandwidth again.For the extremely limited mobile Ad Hoc network of communication bandwidth, adopt multicast mechanism to realize that multi-party communication is very favorable selection.
The performance of Routing Protocol has influenced the performance of network to a great extent.Current Routing Protocol for the design of the multi-casting communication in the Ad Hoc network can be divided into based on tree with based on grid two classes by structure.In the multicast route based on tree, the topological structure that participates in the node of multicast route is tree.Multicast route based on tree is divided into two classes again: the multicast route of lone tree and the multicast route of shared tree.In the multicast route based on grid, the topological structure that participates in the multicast node is a grid network.MAODV (Multicast Ad Hoc On-Demand Distance Vector), ODMRP (On-Demand Multicast RoutingProtocol), LAM (Lightweight Adaptive Multicast Protocol) etc. are current Ad Hoc multicast route protocols relatively more commonly used.
Current these at the multicast route protocol of Ad Hoc mostly based on the consideration of jumping figure or delay, between source node and purpose multicast group, seek and have the route in fewest number of hops or minimum delay, do not consider the relation between distance and energy consumption, the energy consumption of agreement is very big.In addition, node adopts same maximum transmit power to send the mode of packet in the network, makes the inter-node communication of close together also consume very big energy, causes the lot of energy waste.Therefore, need carry out the improvement of Energy Efficient to the route agreement.
The multicast tree problem that structure has a minimum gross energy is a NP-hard problem, and it is unpractical traveling through the broadcasting tree that all possible broadcasting tree goes to seek a gross energy minimum, so this problem can only be solved with didactic method.
Research method at the effective route of Ad Hoc network energy can be summarized as by level at present: the power control of physical layer; The power control and the energy management of MAC layer; The power control of network layer and the routing algorithm of Energy Efficient.These methods are finished at certain one deck mostly, do not have to consider to combine with the energy-efficient mode of other layers of network protocol stack, fail to maximize energy-saving effect.
Summary of the invention
In view of this, purpose of the present invention provides on a kind of Ad Hoc network the multicast route computing method based on the Energy Efficient of cross-layer mechanism.This method calculates minimum essential transmitting power by the power information of obtaining from physical layer in the network layer utilization and utilizes the multicast tree with approximate minimal energy consumption of this value structure based on the source, at the cross-layer mechanism of physical layer, saved energy for radio node effectively according to minimum essential transmitting power dynamic adjustments node transmitting power.The present invention adopts following technical scheme:
A kind of realize on the Ad Hoc network comprises the following steps: based on the method for the multicast energy-saving routing protocol of cross-layer mechanism
(1) initiated by source node, one of the singlecast router algorithm construction that utilizes Energy Efficient is based on the source, the multicast tree of overlay multicast group membership node, and the satisfied route from source node to all members of multicast group of this tree all is energy-conservation route;
(2) adopt heuritic approach,, multicast tree is optimized, total energy consumption is reduced, set up the energy-conservation route of node to the multicast group by attempting changing the father node of some node in the tree;
(3) destination address with packet is made as the multicast group address, and inquiry multicast routing table, sends packet.
As preferred implementation, step wherein (1) is specifically carried out according to following manner:
(11) source node sends routing information request, and this routing information request comprises required total least energy consumption totalPower from the source node to the present node, and comprises target multicast group address;
(12) intermediate node is received the minimum transmit power bestTxPower that calculates a hop node behind the routing information request, and upgrading source node must transmitted power cost to total minimum of present node, handles the reverse route of source node;
(13) be in the member node of target multicast group after receiving routing information request, selection has the reverse route of least energy consumption and replys route replies information to source node, this replys the minimum transmit power minTxPower that routing iinformation covers next jumping, and the total minimum transmit power totalPower from the destination node to the present node, but not the member's of target multicast group node then continues to transmit routing information request;
(14) intermediate node receive route should information after, if there is not the singlecast router of the node that sends this route replies information, then set up it, otherwise, judge whether a last jumping address of this route replies information concentrates at the next-hop node of multicast routing table, if do not exist, whether the minimal power values minTxPower that carries in the more current route replies information of receiving is greater than the best power bestPower in the multicast routing table, if greater than would replace best power in multicast routing table with this value, join next-hop node simultaneously and concentrate.
When node adds the multicast group, if there is no arrive the multicast routing table of multicast address, then newly-built multicast routing table; If exist, then revise the node state sign, and transmission comprises the deck label of self and the broadcasting of address.
Described step (2) further comprises following content of operation:
(21) structure multicast tree prefix is determined internodal set membership;
(22) will not be present node descendants's neighbor node as the candidate parent node, the gross energy that calculates all candidate parent nodes changes GAIN value, mark is new father node according to the maximum just both candidate nodes of GAIN value is arranged, and as not existing, then goes to step (24).
(23) change father node.
(24) by the order of depth-first search next node is proceeded to optimize;
(25) when one take turns optimize to finish after, source node judges that this takes turns and whether have node updates to cross father node in the optimization.If have, then begin next round optimization; Otherwise, finish optimizing process.
Described step (3) further comprises following content of operation:
(31) in network layer, use is based on source structure and adopt heuritic approach to optimize, and the approximate minimum multicast tree of energy consumption sends data;
(32) when data packet delivery arrived physical layer, node was according to the best power bestPower field dynamic adjustments transmitted power in the multicast routing table.
The present invention be on a kind of Ad Hoc network based on the multicast route computing method of the Energy Efficient of cross-layer mechanism, have following advantage:
● distributed
In this method, each node only need be recognized the information (minimum transmit power) of neighbor node in the one jumping scope, and unlike centralized algorithms such as BIP, node needs all information in the maintaining network.
● good energy-conserving effect
Current, for the Routing Protocol of Ad Hoc network comparative maturity, the standard of routing does not fully take into account the problem that reduces the communication energy consumption into the radio node of finite energy mostly based on the consideration of jumping figure or delay.This method is not only chosen the best singlecast router of each destination node, also utilizes optimisation strategy further to reduce the energy consumption of node.
● stride layer and realize
The present invention is based on cross-layer mechanism realizes, broken through current great majority and only realized there is not to consider to combine, fail to maximize the limitation of energy-saving effect with the energy-efficient mode of other layer of protocol stack at network protocol stack one deck at the power-economizing method of Ad Hoc network.Not only the power information of obtaining from physical layer in the network layer utilization calculate minimum essential transmitting power, and structure have the multicast tree of approximate least energy consumption, and, in energy-conservation, also reduced Communication Jamming in the transmitted power of physical layer adjusting node.
● clean culture and the combination of multicast route
When the destination address of packet was unicast address, this method directly deteriorated to the routing algorithm of supporting the Energy Efficient unicast communication.
Description of drawings
Fig. 1 is the schematic diagram of basic boom principle of the present invention.
Fig. 2 is the JGQ packet format figure that the present invention uses.
Fig. 3 is group membership's sheet format figure that the present invention uses.
Fig. 4 is the multicast tree schematic diagram based on the source that the present invention makes up.
Fig. 5 is the neighbor table format chart that the present invention uses.
Fig. 6 is the unicast routing table format chart that the present invention uses.
Fig. 7 is the multicast routing table format chart that the present invention uses.
Fig. 8 is the multicast tree prefix exemplary plot that the present invention uses.
Fig. 9 is an algorithm sequential chart of the present invention.
Figure 10 is the schematic diagram that among the present invention multicast tree is carried out beta pruning.
Embodiment
For making purpose of the present invention, implementation and advantage more clear, the present invention is described in further detail below in conjunction with accompanying drawing.
Referring to Fig. 1, basic boom principle-application cross-layer mechanism of introducing the inventive method is realized the multicast route computing method of Energy Efficient.Node obtains the entrained energy information of bag and is uploaded to network layer in physical layer, and network layer calculates route cost and best transmitted power by these energy informations, wherein makes up based on the multicast tree source, that have approximate least energy consumption according to the route cost.When packet sent, network layer will be passed to physical layer under the best transmitted power, and physical layer further effectively reduces the energy consumption of node according to the best transmitted power of this information setting to route next jump.
Referring to Fig. 2 to Figure 10, introduce on a kind of Ad Hoc of the present invention network multicast route computing method in detail based on the Energy Efficient of cross-layer mechanism, this method comprises following several stages:
(1) construct initial multicast tree: initiated by source node, one of the singlecast router algorithm construction that utilizes Energy Efficient is based on the source, the multicast tree of overlay multicast group membership node.
(2) optimize multicast tree: adopting the initial multicast tree of the singlecast router algorithm construction of Energy Efficient is a multicast tree based on link.Though what safeguard to each member node of multicast group is energy-conservation route, because the broadcast characteristic of wireless network, the total energy consumption of multicast tree is not necessarily optimum.Therefore on the basis that takes into full account the node broadcasts characteristic, adopt heuritic approach,, multicast tree is optimized, make total energy consumption be reduced by attempting changing the father node of some node in the tree.
(3) data send: after optimization was finished, node had been set up the energy-conservation route of multicast group, began to send packet to target multicast group.Node is made as the multicast group address with the destination address of packet, and inquiry multicast routing table, adopts maximum transmit power value suitable, non-acquiescence to send packet, further reduces the energy consumption of node.
Introduce before the particular content, provide several possibilities of node state earlier:
A) ON_GROUP: node is the member of multicast group.
B) ON_TREE: node is not the member of multicast group, but it participates in the forwarding of bag, is the member of multicast tree.
C) NOT_ON_TREE: node neither the multicast group neither multicast tree the member.
Below the content of operation of this method various piece is done further concrete the introduction:
In the stage (1), construct initial multicast tree and mainly comprise the following aspects:
(11) node adds the multicast group.When node adds the multicast group, if there is no arrive the multicast routing table of multicast address, then newly-built multicast routing table, and node state is designated ON_GROUP; If exist, then revise the node state sign.At last, node is outwards broadcasted the JGQ bag, the deck label and the address of information explanation self in the bag.Figure 2 shows that the form of JGQ bag.After other nodes are received the JGQ bag, corresponding information is added in group membership's table.Fig. 3 is group membership's sheet format.
(12) utilize the initial multicast tree of singlecast router algorithm construction of Energy Efficient.The route that this tree is satisfied from source node to all members of multicast group all is energy-conservation route.The multicast tree of posttectonic Energy Efficient is made of the node with ON_GROUP and ON_TREE state.Data are only transmitted via these nodes, and other nodes in the network do not participate in communication.What Fig. 4 showed is the multicast tree exemplary plot of having built up.
Each node all needs to safeguard four tables: neighbor table, group membership's table, unicast routing table and multicast routing table are used for writing down neighbor information, respective sets information about firms, singlecast router information and the multicast routing iinformation of node respectively.Fig. 5-7 has shown the format chart of neighbor table, unicast routing table and the multicast routing table used in the method respectively.The process of constructing initial multicast tree is made of the following step:
I. send routing information request ERREQ.
When source node need arrive the routing iinformation of a certain target multicast group, it outwards broadcasted ERREQ (route requests of expansion) information.Be characterized as ERREQ information head and comprise the totalPower field, be used for writing down required total least energy consumption from the source node to the present node.In the ERREQ transmittance process, this value is added up, as the reference of route criterion.
II. receive and transmit routing information request ERREQ.
Intermediate node is judged it after receiving ERREQ.If for invalid repetition or overtime Bao Ze abandon it, otherwise except that the record necessary information, also need calculate the minimum transmit power bestTxPower of a hop node.Upgrade source node to the essential transmitted power cost of total minimum of present node, its value equals totalPower sum among bestTxPower and the ERREQ.Afterwards, be updated to the reverse route of source node.The singlecast router tableau format is seen Fig. 6.Processing for the reverse route that arrives source node has following two kinds of situations:
A:, then in routing table, add the reverse route of source node to if node is received this ERREQ information for the first time.In routing table shown in Figure 6, this routing iinformation of totalTxPower field record arrives the destination node (destination node on the reverse route, be the source node of ERREQ message) the essential transmitted power of minimum, bestTxPower records (oppositely on the route), and next jumps the essential transmitted power of the minimum that needs;
B:, then may need to upgrade the reverse routing iinformation in the routing table if node is received the reverse route that has had source node when ERREQ wraps in the routing table.The condition of routing table update is:
● the serial number that the ERREQ bag carries is greater than the serial number in the existing route information; Or
● the serial number that the ERREQ bag carries equals the serial number in the existing route information, but the cost value is less than the totalTxPower value in the routing table.
Based on the judgement of these two conditions, what safeguard in the routing table is to arrive the routing iinformation that source node is up-to-date, have minimal energy consumption.After upgrading routing table, node changes to cost with the totalPower among the ERREQ, and intermediate node continues to transmit ERREQ, up to arriving multicast group membership node.
If intermediate node does not upgrade reverse route after receiving the ERREQ bag, then this bag is abandoned, no longer transmit.
III. send route replies information ERREP.
The condition that sends ERREP in this method is that node is the member of target multicast group.Node is after receiving ERREQ message, and as itself being target multicast group membership through judging, then the reverse route of selecting to have least energy consumption in the back of waiting for a period of time is replied route replies message to source node; Otherwise, continue to transmit ERREQ message.
Carry the id information of the node of current answer ERREP message in the ERREP bag, so that whether the source node statistics receives the return information from all members of target multicast group.
In addition, comprise minTxPower and totalPower field among the ERREP.MinTxPower records the minimum transmit power of next jumping of ERREP, the total minimum transmit power of totalPower record from the destination node to the present node.The multicast group node is initialized as 0 with totalPower when sending the ERREP bag, minTxPower is made as the bestTxPower value in the reverse routing table.Then according to the source node that the ERREP clean culture is sent to ERREQ to the reverse routing iinformation of source node.
IV. receive route replies information ERREP.
After node receives ERREP,, then set up it as there not being the singlecast router of ERREP source node.Otherwise, judge whether that according to the total power consumption situation needs upgrade existing route.The condition of routing table update is:
● the serial number that the ERREP bag carries is greater than the serial number in the existing route information; Or
● the serial number that the ERREP bag carries equals the serial number in the existing route information, but the cost value is less than the totalTxPower value in the routing table.
When upgrading:
● node is set to ON_TREE to the node state of target group address entries in the multicast table;
● judge whether next is jumped in nodal set at the multicast table in (ERREP message) last jumping address.If do not exist, whether the minimal power values (minTxPower) that the more current ERREP that receives carries is greater than the best power in the multicast table (bestPower), if greater than would replace best power in multicast table with this value, join next-hop node simultaneously and concentrate.
If source node is received ERREP message, also need the flags sign of corresponding ERREP source node item in the group membership table is changed to 1, and all members that inquire about respective sets in group membership's table whether have replied ERREP (promptly all flags of Dui Ying list item are 1).If still have the member not reply ERREP message, then continue to wait for.
Using the multicast tree of said method structure is a multicast tree based on link, though all be the least energy consumption route to the route of each multicast group membership node, owing to the broadcast characteristic of wireless network, the total energy consumption of multicast tree is optimum not necessarily but.
In the stage (2), the multicast tree of structure is optimized to the stage (1).Adopt heuritic approach in the optimizing process, take into full account the broadcast characteristic of node.By attempting changing the father node of some node in the tree, make total energy consumption reduce.Fig. 9 has shown the sequential chart of optimizing process.For the better operating process of explanation optimization multicast tree, at first provide the definition of two related notions that hereinafter will use:
● gross energy changes GAIN
In the example depicted in fig. 4, suppose that the father node of node i changes to the k node by current j node, then the multicast tree total energy consumption that therefore causes be changed to GAIN (i, j, k).Obviously, the energy consumption influence that father node changes node in the multicast tree only exists on j and the k, and then the variation of total energy consumption can be obtained by following formula.
GAIN(i，j，k)＝(E
j+E
k)-(E′
j+E′
k)
E wherein
jAnd E
kBe the least energy that change front nodal point j and k need consume, E '
jAnd E '
kIt is the least energy that changes father node posterior nodal point j and k consumption.
● the multicast tree prefix
For guaranteeing that the multicast tree behind the execution optimizing process still is communicated with, node in the candidate parent set of node can not be descendants's node (descendants's node be defined as node next jump and descendants's node of next jumping) of present node, therefore before formal execution optimizing process, need to determine the internodal set membership of multicast tree.
Defined node branch prefix is: by the multicast tree root node arrive child node through the composition structure of branch.In example shown in Figure 8, the prefix of node H is: 1-2, the prefix of node J is: 1-1, the prefix of node D is: 0-0, the prefix of node C is: 1.
For the identical node of prefix length, if their prefix value is identical, represent same node (can not occur), if value is different, show that these two nodes not in same branch, are the brotgher of node.
For the different node of prefix length, if short prefix is w (node is C), long prefix is z (node is H), at first z is cut into z ' (node of giving up the back) with w prefix equal length, if the value of prefix w and z ' is identical, node C is former generation's node of node H so, otherwise shows these two nodes (node C is the uncle generation node of node H) not in same branch.
Hereinafter introduce the concrete operations content that the stage (2) comprises:
(21) structure multicast tree prefix is determined internodal set membership
After source node is received the ERREP that the all-multicast group membership responds, begin to construct the multicast tree prefix, send the controlling packet that the multicast tree member sets prefix, and initialization timing device, wait timeout.After the overtime generation, carry out the optimizing process of multicast tree according to the order of DFS.
When node received the controlling packet of upgrading the tree prefix, it upgraded the neighbor node chained list.If the destination address of controlling packet is this node, the tree prefix of new node more, and send this controlling packet to each downstream next-hop node; Otherwise node abandons controlling packet.
(22) select new father node
When according to the DFS order present node carry out being optimized, node is chosen the node that satisfies following condition as the candidate parent set of node from the neighbor node table:
A) node state is ON_TREE or ON_GROUP;
B) node is not descendants's node (being judged by the multicast tree prefix) of present node;
Calculate the GAIN of all candidate parent nodes, if there is no positive GAIN value, or the candidate parent set of node is empty, then changes step (24) over to; Otherwise choose the new father node of candidate parent node conduct, change father node sign with maximum positive GAIN value;
(23) change father node
If find the candidate parent node in step (23), then the father node to new selection sends the request that substitutes father node; Start timer, wait for the response of new father node.If in time-out time, receive and reply, then send the father node request of leaving to original father node; Otherwise return.
When new father node is received the request of replacement father node, upgrade its multicast routing table, requesting node is added to the next-hop node of corresponding group address and concentrate, and upgrade the minimum essential transmitted power and the second little transmitted power, return to the requesting node replacement simultaneously and reply.In addition, iteration is upgraded the multicast tree prefix of its child node.
Receive when former father node and to leave when request, upgrade its multicast table.Concentrate deletion to send the node of the request of leaving at the next-hop node of corresponding group address routing iinformation, upgrade minimum essential transmitted power, judge simultaneously whether the next-hop node collection is empty.When set of node is sky:
● if node state is ON_TREE, illustrate that this node only is an intermediate node of being responsible for transmitting data, no next-hop node.Because of no longer needing to use this node for data forwarding, then it can be deleted from multicast tree.And send to its father node and to leave request, beginning multicast tree is carried out beta pruning, this operating process is as shown in figure 10;
● if node state is ON_GROUP, then do not need to carry out beta pruning.
(24) by the DFS order next node is proceeded to optimize.
(25) many wheels are optimized.
When optimization proceeds to source node,, therefore need not to carry out the replacement judgement of father node because source node does not have father node.One takes turns not necessarily optimum of optimization back energy-efficient performance, in order to obtain better energy-saving effect, adopts the optimisation strategy of taking turns in this method more.
One take turns optimize to finish after, judge that at the source node place this takes turns and whether have node to carry out the replacement of father node in the optimization, if (replacement is identified in the step (23) and is provided with) arranged, then begin next round optimization; Otherwise, finishing optimizing process, source node begins to send packet according to the multicast table.
In the stage (3), further comprise following content of operation:
(31) in network layer, use is based on source structure and adopt heuritic approach to optimize, and the approximate minimum multicast tree of energy consumption sends data.
(32) when data packet delivery when the physical layer, node further reduces node energy consumption according to the bestPower field dynamic adjustments transmitted power of multicast routing table but not use the acquiescence maximum transmit power value.
The above only is preferred embodiment of the present invention, not in order to restriction the present invention, all any modifications of being done within the spirit and principles in the present invention, is equal to and replaces and improvement etc., all should be included within protection scope of the present invention.
Claims (5)
1. realize on the Ad Hoc network comprising the following steps: for one kind based on the method for the multicast energy-saving routing protocol of cross-layer mechanism
(1) initiated by source node, one of the singlecast router algorithm construction that utilizes Energy Efficient is based on the source, the multicast tree of overlay multicast group membership node, and the satisfied route from source node to all members of multicast group of this tree all is energy-conservation route;
(2) adopt heuritic approach,, multicast tree is optimized, total energy consumption is reduced, set up the energy-conservation route of node to the multicast group by attempting changing the father node of some node in the tree;
(3) destination address with packet is made as the multicast group address, and inquiry multicast routing table, sends packet.
2. based on the method for the multicast energy-saving routing protocol of cross-layer mechanism, it is characterized in that step wherein (1) is specifically carried out according to following manner on the realization according to claim 1 Ad Hoc network
(11) source node sends routing information request, and this routing information request comprises required total least energy consumption totalPower from the source node to the present node, and comprises target multicast group address;
(12) intermediate node is received the minimum transmit power bestTxPower that calculates a hop node behind the routing information request, and upgrading source node must transmitted power cost to total minimum of present node, handles the reverse route of source node;
(13) be in the member node of target multicast group after receiving routing information request, selection has the reverse route of least energy consumption and replys route replies information to source node, this replys the minimum transmit power minTxPower that routing iinformation covers next jumping, and the total minimum transmit power totalPower from the destination node to the present node, but not the member's of target multicast group node then continues to transmit routing information request;
(14) intermediate node receive route should information after, if there is not the singlecast router of the node that sends this route replies information, then set up it, otherwise, judge whether a last jumping address of this route replies information concentrates at the next-hop node of multicast routing table, if do not exist, whether the minimal power values minTxPower that carries in the more current route replies information of receiving is greater than the best power bestPower in the multicast routing table, if greater than would replace best power in multicast routing table with this value, join next-hop node simultaneously and concentrate.
3. based on the method for the multicast energy-saving routing protocol of cross-layer mechanism, it is characterized in that on the realization according to claim 1 Ad Hoc network, when node adds the multicast group, if there is no arrive the multicast routing table of multicast address, then newly-built multicast routing table; If exist, then revise the node state sign, and transmission comprises the deck label of self and the broadcasting of address.
4. based on the method for the multicast energy-saving routing protocol of cross-layer mechanism, it is characterized in that described step (2) further comprises following content of operation on the realization according to claim 1 Ad Hoc network:
(21) structure multicast tree prefix is determined internodal set membership;
(22) will not be present node descendants's neighbor node as the candidate parent node, the gross energy that calculates all candidate parent nodes changes GAIN value, mark is new father node according to the maximum just both candidate nodes of GAIN value is arranged, and as not existing, then goes to step (24).
(23) change father node.
(24) by the order of depth-first search next node is proceeded to optimize;
(25) when one take turns optimize to finish after, source node judges that this takes turns and whether have node updates to cross father node in the optimization.If have, then begin next round optimization; Otherwise, finish optimizing process.
5. based on the method for the multicast energy-saving routing protocol of cross-layer mechanism, it is characterized in that described step (3) further comprises following content of operation on the realization according to claim 1 Ad Hoc network:
(31) in network layer, use is based on source structure and adopt heuritic approach to optimize, and the approximate minimum multicast tree of energy consumption sends data;
(32) when data packet delivery arrived physical layer, node was according to the best power bestPower field dynamic adjustments transmitted power in the multicast routing table.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2008101519528A CN101494599A (en) | 2008-09-28 | 2008-09-28 | Method for implementing multicast energy-saving routing protocol of Ad Hoc network based on layer-striding mechanism |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2008101519528A CN101494599A (en) | 2008-09-28 | 2008-09-28 | Method for implementing multicast energy-saving routing protocol of Ad Hoc network based on layer-striding mechanism |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101494599A true CN101494599A (en) | 2009-07-29 |
Family
ID=40925014
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA2008101519528A Pending CN101494599A (en) | 2008-09-28 | 2008-09-28 | Method for implementing multicast energy-saving routing protocol of Ad Hoc network based on layer-striding mechanism |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101494599A (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102209362A (en) * | 2010-03-31 | 2011-10-05 | 财团法人资讯工业策进会 | Mobile ad-hoc network system and routing setup method |
| CN101662842B (en) * | 2009-10-09 | 2012-01-11 | 天津大学 | TCP parameter adjusting method applicable to wireless self-organized network |
| CN102710596A (en) * | 2012-04-16 | 2012-10-03 | 同济大学 | Routing selecting method based on QoE (Quality of Experience) |
| CN106330731A (en) * | 2016-09-12 | 2017-01-11 | 北京交通大学 | Wireless Ad hoc network multicast tree establishing method |
| CN106792912A (en) * | 2017-01-13 | 2017-05-31 | 国家电网公司 | A kind of improvement method for routing and device based on AODV |
| US20180288563A1 (en) * | 2015-09-02 | 2018-10-04 | Estimote Polska Sp. Z O. O. | System and method for lower power data routing |
| CN112910779A (en) * | 2021-03-03 | 2021-06-04 | 盐城工学院 | Ad Hoc network-based cross-layer routing optimization protocol |
| US11218492B2 (en) | 2018-08-22 | 2022-01-04 | Estimote Polska Sp. Z .O.O. | System and method for verifying device security |
-
2008
- 2008-09-28 CN CNA2008101519528A patent/CN101494599A/en active Pending
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101662842B (en) * | 2009-10-09 | 2012-01-11 | 天津大学 | TCP parameter adjusting method applicable to wireless self-organized network |
| CN102209362A (en) * | 2010-03-31 | 2011-10-05 | 财团法人资讯工业策进会 | Mobile ad-hoc network system and routing setup method |
| CN102710596A (en) * | 2012-04-16 | 2012-10-03 | 同济大学 | Routing selecting method based on QoE (Quality of Experience) |
| CN102710596B (en) * | 2012-04-16 | 2015-04-08 | 同济大学 | Routing selecting method based on QoE (Quality of Experience) |
| US11006237B2 (en) | 2015-09-02 | 2021-05-11 | Estimote Polska Sp z o.o. | System and method for low power data routing |
| US20180288563A1 (en) * | 2015-09-02 | 2018-10-04 | Estimote Polska Sp. Z O. O. | System and method for lower power data routing |
| US10136250B2 (en) * | 2015-09-02 | 2018-11-20 | Estimote Polska Sp. Z O. O. | System and method for lower power data routing |
| US10616709B2 (en) * | 2015-09-02 | 2020-04-07 | Estimote Polska Sp z o.o. | System and method for lower power data routing |
| US10771917B2 (en) | 2015-09-02 | 2020-09-08 | Estimote Polska Sp z o.o. | System and method for low power data routing |
| CN106330731B (en) * | 2016-09-12 | 2019-05-28 | 北京交通大学 | A kind of multicast tree method for building up of wireless self-networking |
| CN106330731A (en) * | 2016-09-12 | 2017-01-11 | 北京交通大学 | Wireless Ad hoc network multicast tree establishing method |
| CN106792912A (en) * | 2017-01-13 | 2017-05-31 | 国家电网公司 | A kind of improvement method for routing and device based on AODV |
| CN106792912B (en) * | 2017-01-13 | 2018-06-19 | 国家电网公司 | A kind of improvement method for routing and device based on AODV |
| US11218492B2 (en) | 2018-08-22 | 2022-01-04 | Estimote Polska Sp. Z .O.O. | System and method for verifying device security |
| CN112910779A (en) * | 2021-03-03 | 2021-06-04 | 盐城工学院 | Ad Hoc network-based cross-layer routing optimization protocol |
| CN112910779B (en) * | 2021-03-03 | 2023-10-13 | 盐城工学院 | Ad Hoc network-based cross-layer route optimization protocol realization method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101494599A (en) | Method for implementing multicast energy-saving routing protocol of Ad Hoc network based on layer-striding mechanism | |
| KR100915276B1 (en) | System and method to support multicast routing in large scale wireless mesh metworks | |
| CN101489276B (en) | Multicast routing method for Ad Hoc network | |
| CN106817738B (en) | Routing method based on alliance game | |
| CN100499541C (en) | Process for generating and updating a hierarchical tree in a manet multicast routing protocol ad hoc network | |
| CN101534520B (en) | Reliable routing method of mobile Ad hoc network | |
| CN1731760A (en) | Ad Hoc network routing method based on flooding mechanism | |
| CN101364945A (en) | Method for realizing unicast energy-saving routing protocol based on cross-layer mechanism on Ad Hoc network | |
| CN102148756A (en) | IPv6 over low power wireless personal area network (6LoWPAN) neighbor discovery-based tree routing method | |
| CN100536429C (en) | Method and system for data transmission in wireless net-like network | |
| CN101800701A (en) | Multicasting route control method based on centralized control | |
| CN104219156A (en) | Multicast routing method applicable for hierarchical air ad hoc network | |
| CN102916876A (en) | Routing method for one-way link environment of principal and subordinative construction network | |
| Zhang et al. | LocalTree: An efficient algorithm for mobile peer-to-peer live streaming | |
| CN102075864A (en) | MCDS (minimum connected dominating set)-based method for constructing delay limit multicast forwarding structure | |
| Cheng et al. | GMZRP: Geography-aided multicast zone routing protocol in mobile ad hoc networks | |
| Raghavendra et al. | Congestion adaptive routing in ad hoc networks | |
| Su et al. | An efficient multi-source multicast routing protocol in mobile ad hoc networks | |
| Agrawal et al. | Emerging trends in energy efficient routing protocols | |
| CN103581838B (en) | A kind of Ad Hoc network information sharing method | |
| CN101437304B (en) | Loose virtual cluster division method for power heterogeneous point Ad Hoc network | |
| Banerjee et al. | A power aware multicast on-demand routing with load balancing | |
| Patil et al. | Intelligent Energy Efficient Routing Protocol based on Biological Agents for MANETS | |
| Feng et al. | Performance analysis of IEEE 802.11 s wireless mesh network on RM-AODV path selection protocol | |
| Shekhar et al. | Mobile agents aided multicast routing in mobile ad hoc networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Open date: 20090729 |