CN102413539A - Geographical position-based large-scale wireless distribution type network self-adaptive cooperative routing method - Google Patents
Geographical position-based large-scale wireless distribution type network self-adaptive cooperative routing method Download PDFInfo
- Publication number
- CN102413539A CN102413539A CN2011103187105A CN201110318710A CN102413539A CN 102413539 A CN102413539 A CN 102413539A CN 2011103187105 A CN2011103187105 A CN 2011103187105A CN 201110318710 A CN201110318710 A CN 201110318710A CN 102413539 A CN102413539 A CN 102413539A
- Authority
- CN
- China
- Prior art keywords
- node
- cooperation
- friend
- present
- oneself
- 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.)
- Granted
Links
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a geographical position-based large-scale wireless distribution type network self-adaptive cooperative routing method, mainly aiming at solving the problems that the large-scale wireless distribution type network routing method is large in end-to-end time delay, multiple in route hop count, low in route success probability and hard to realize the practical application of small-world long-range connection. The method comprises the realization process: a node builds a neighbor node table, a friend node table and a friend route table according to a geographical position information and small-world theory; when a business is achieved, the node finds out a node which is nearest to a target node from the neighbor node and the friend node to be taken as a next hop node, wherein a data packet is directly transmitted if the found next hop node is the neighbor node, and the data packet is cooperatively transmitted to the friend node if the found next hop node is the friend node, and the process is repeated till that the target node is achieved. The performance of the large-scale wireless distribution type network is improved, and the method is applicable to the rousting process of the large-scale wireless distribution type network.
Description
Technical field
The present invention relates to wireless communication technology field, a kind of specifically adaptive cooperation method for routing based on the geographical position can be used for large-scale wireless distribution network.
Background technology
In wireless distributed network, solve the problem of route, several kinds of routing policies such as active, passive type and geographical location information assist type are arranged usually.Yet when the scale phenomenal growth of network, the method mutual or broadcast addressing of routing iinformation will exhaust Internet resources very soon.
Continuous increase along with the wireless network scale; The limiting factor of design Routing Protocol is more and more; Each item route index of network more and more is difficult to reach, and along with the development of satellite positioning tech, and it is more and more easier that node will seek out the geographical location information of other node in own or the net.Under a kind of like this background, the suitable geographical location information of node that utilizes in the network is sought route, can avoid the blindness of pathfinding and the adverse effects of bringing thus such as network storm to a great extent, thereby greatly improve the efficient of path finding.
Solve the problem that the large scale network pathfinding is difficult and hop count is many, proposed a kind of pathfinding strategy in the document " Contact-based architecture for resource discovery in large scale MANets " based on the worldlet phenomenon.Exist six degree separating phenomenons according to the study in the large scale network, can be familiar with each other by being no more than six friends for each person for promptly any two.So only need each node in the network is selected friend's node of one or more far-ends, can dwindle the average number of hops of route in the whole network greatly, make whole large scale network become a network with worldlet characteristic.
But because the worldlet phenomenon is just desirable abstract after all, it is applicable to relational network, and in the spacing wireless network owing to lack the effective support that connects for long-range, be connected in the jumping and can't directly realize to the long-range of friend's node.Therefore this routing algorithm has been introduced the collaboration communication technology and has been solved this problem, and makes the long-range connection of worldlet network become pratical and feasible with the cooperation way that continues.The introducing of collaboration communication technology simultaneously also help to improve the path of when network size increases, causing easily around with tediously long, path on too much, the route failure probability increase of node cause problems such as poor robustness.
Summary of the invention
The objective of the invention is deficiency to traditional large-scale wireless distribution network method for routing; A kind of large-scale wireless distribution network adaptive cooperation method for routing based on the geographical position is proposed; In this method for routing, realized that through introducing the collaboration communication technology long-range in the worldlet network connects; Effectively reduced the average number of hops and the end-to-end time delay of route in the large scale network, reduced the routing failure probability, between network performance and routing cost, traded off better; In cooperating process, added simultaneously the dump energy of node and the adaptive technique of cooperation distance B; Avoid the too fast self-energy that exhausts of the overweight node of load, and make node ability basis number what and the suitable cooperation distance B of busy-idle condition selection of neighbor node on every side, thereby adapt to the demand of large-scale wireless distribution network better.
The technical scheme that realizes the object of the invention comprises the steps:
(1) initialization step, promptly each node in the network is set up neighbor node table, friend's node table and the friend's routing table of oneself respectively;
(2) present node u has packets need to send; Present node u is directly according to geographical location information, from oneself neighbor node table and friend's node table, finds out apart from the nearest node of destination node as next-hop node, if the next-hop node of finding out is the neighbor node of present node u; To transmit depth minus 1; Execution in step (3) if the node of finding out is friend's node t of present node, will be transmitted depth minus 1; Execution in step (4) is wherein transmitted the degree of depth and is also allowed the number of times that is forwarded for this packet;
(3) present node u directly sends to this neighbor node with packet, and this neighbor node judges oneself to be the destination node of this route after receiving packet, if; Whole routing procedure finishes; Otherwise this neighbor node becomes present node u, returns step (2);
(4) present node u carries out the cooperation transmission first time:
(4a) to find with node t in the friend's routing table of oneself be the friend path of friend's node to present node u; From this path, find out all nodes in the cooperation distance B of present node u; And with the destination node d1 that cooperates as the first time from present node u node farthest in these nodes; Execution in step (4b), wherein the value of D is the estimated value that present node u passes through the maximum distance that can transmit after the cooperation;
(4b) present node u passes to cooperation destination node d1 through cooperation transmission with packet, and this process is divided into two stages:
Phase I, present node u sends packet to cooperation destination node d1, the neighbor node of present node u based on self rest energy the ratio decision of gross energy when initial whether participate in the cooperation bag to the cooperation destination node d1 request of sending; If this ratio is less than 1/5; Do not send, participate in the cooperation bag if this ratio, then sends the request that has the energy label more than or equal to 1/5 and less than 1/3; Show that this neighbor node energy is not abundant; If this ratio more than or equal to 1/3, does not then send and participates in the cooperation bag with the request of energy label, show that this neighbor node energy is abundant;
Second stage; Cooperation destination node d1 preferentially allows the neighbor node of the abundant present node u of energy to participate in cooperation; Postback request cooperation response packet, the packet of the node of cooperation with cooperation transmission u participated in the permission that indicates in the request cooperation response packet, carries out afterwards (4c);
(4c) cooperation destination node d1 judges whether cooperation for the first time is successful, and judged result is returned to present node u, and u handles judged result by present node, carries out afterwards (5);
(5) after present node u receives the judged result that cooperation destination node d1 transmits, carry out operation as follows:
If cooperation failure for the first time, then present node u adds 1 with the cooperation frequency of failure of oneself, and the cooperation total degree adds 1, calculates the cooperation probability of failure p=cooperation frequency of failure/cooperation total degree of oneself, then the cooperation distance B of oneself is pressed
Adjust, return step (4) afterwards, wherein R is that present node u one jumps the distance that can transmit, D
MaxFor the cooperation of present node u apart from the upper bound, ε is an adjustable parameter, it is big or small to be used to adjust the p value of D after stable;
If cooperate successfully for the first time; Then present node u adds 1 with the cooperation total degree of oneself; Calculate the cooperation probability of failure p=cooperation frequency of failure/cooperation total degree of oneself; Cooperation distance B to oneself is adjusted by
, then execution in step (6);
(6) the destination node d1 of cooperation judges whether oneself is friend's node t for the first time, if then the whole cooperative transmit stage from present node u to friend's node t finishes, friend's node t becomes present node u; Execution in step (7) afterwards, otherwise, continue to adopt with step (4) and (5) in identical collaboration method completion from node d1 to node d2, from node d2 to node d3;, the back from node dn to friend's node t is the cooperation transmission process several times, and until packet being passed to friend's node t, friend's node t becomes present node u; Execution in step (7) afterwards, node d2 wherein, d3 ... Dn is respectively the 2nd, the 3 ..., the destination node of the n time cooperation;
(7) present node u judges whether oneself is the destination node of this route, if whole routing procedure finishes, otherwise, return step (2);
Be reduced to zero if transmit the degree of depth between transmission period, execution in step (8), if friend's path failure between transmission period, execution in step (9);
(8) according to the business need of the type packet, if allow to lose this bag, then abandon continuing to transmit this bag, the report packet loss if do not allow to lose this bag, then continues to transmit for this packet is provided with the numerical value of transmitting the degree of depth again;
(9) initiate the local process of reselecting friend's node earlier at friend's path failure place,, return step (1) if failure is reselected in the part.
The present invention compared with prior art has following advantage:
1) the present invention does not need route finding process; After packet arrives; Directly the geographical location information according to neighbor node, friend's node and the destination node of present node u just can calculate next-hop node; Save routing procedure and sent out the process on pathfinding detective road in earlier stage, thereby dwindled end-to-end time delay largely.
2) the present invention is according to the characteristics of large scale network; Introduce the worldlet phenomenon and select far-end friend node; Through using the worldlet long-range to connect, reduce hop count greatly when carrying out route, reduced end-to-end time delay; When having guaranteed certain route probability of success, greatly reduce network overhead.
3) the present invention is through introducing the cooperation transmission mode; Solve the worldlet long-range and be connected the problem that lacks effective support in the spacing wireless network; Cooperation transmission has increased the distance that once can transmit simultaneously; Make possibly exist in the route around non-optimal path become a longer jumping, thereby effectively alleviated the path around etc. phenomenon, play the effect of optimizing the path.
4) the present invention has added the adaptive technique of node to self rest energy in cooperating process; Reduced the heavier too fast self-energy that exhausts of node of load in the network effectively; Cause network topology that more cataclysmal probability takes place; Thereby under the prerequisite that does not influence whole network routing performance, prolonged the life cycle of whole network effectively.
5) the present invention has introduced the adaptive technique of node to the cooperation distance B in cooperating process; The number of neighbor node and the actual change situation of busy-idle condition around the node ability basis in the network; Regulate the value of cooperation distance B adaptively; Thereby when having guaranteed certain cooperation success rate, reduced the number of times of cooperation as much as possible, reduced the end-to-end time delay of the whole network route; Make the cooperation distance B have the ability of self adaptation adjustment simultaneously, also be convenient between gain that cooperation brings and overhead, weigh adjustment.
Description of drawings
Fig. 1 is overall flow figure of the present invention;
Fig. 2 is the sub-process figure that present node u selects friend's node t among the present invention;
Fig. 3 is that present node u carries out the sub-process figure of cooperation transmission for the first time among the present invention;
Fig. 4 is that present node u adjusts sub-process figure to the self adaptation of cooperation distance B among the present invention;
Fig. 5 is the sketch map of the cooperating process that repeatedly continues from present node u to friend's node t among the present invention;
Fig. 6 is based on the technological propagation path sketch map of cooperation transmission among the present invention;
Fig. 7 be among the present invention cooperation transmission to the sketch map that improves in path.
Embodiment
With reference to Fig. 1, concrete performing step of the present invention is following:
Step 1, each node is found out oneself neighbor node based on geographical location information, sets up the neighbor node table of oneself and safeguards.
(1a) system is carried out initialization, each node moment of random choose in short time period is sent the hello bag towards periphery, indicates node IP and the geographical position of oneself in the hello bag;
(1b) after a node is received hello bag, that in oneself neighbor node table, searches this hello bag sends node whether in the neighbor node table of oneself, as if; Then upgrade the timestamp of this list item; Otherwise a newly-built list item adds node IP and the geographical position that this hello wraps in list item; And in the neighbor node table with this list item insertion oneself, the node in the neighbor node table is that a jumping can reach;
(1c) each node periodically sends the hello bag, and the hello bag of sending through the neighbor node of regularly receiving is simultaneously safeguarded the neighbor node table of oneself.
Step 2, each node are selected far-end friend node, set up friend's node table and friend's routing table.
With reference to Fig. 2, the concrete realization of this step is following:
(2a) selecting friend's node t with present node u is example, and present node u selects a direction at random from its East, West, South, North four direction, be example with choice direction east, calculate present node u arrive eastwards network boundary apart from k, L=k then
Q/Q, wherein L is friend's node t that will select estimated value to the distance of present node u,
Q is interval [0; Q-1] on an integer selecting at random; With reference to the direction of selecting with to the distance L of present node u, determine the tentative position W of friend's node t that will select, the friend's node t that selects like this can make large scale network have the characteristic of worldlet network; Present node u issues the tentative nearest neighbor node v of position W of distance, execution in step (2b) with friend's request package then;
After (2b) nearest neighbor node v receives friend's request package, judge the own distance R that whether can transmit to the distance of fixing tentatively position W earlier less than a jumping, if; Then present node u selects the friend node t of node v as oneself, friend's node t is added in the friend's node table of oneself, simultaneously; In the process of selecting friend's node t, will obtain a friend path; Each node on this friend path all is the neighbor node of previous node on this path, and each node in this friend path is all deposited this friend path in the friend's routing table of oneself then, and whole process finishes; Otherwise, execution in step (2c);
(2c) whether fix tentatively the nearer node of position W in the neighbor node of nearest neighbor node v judgement oneself than oneself leaving; If have, friend's request package is issued this node, this node becomes new nearest neighbor node v; And return step (2b); Otherwise this selects friend's node failure present node u, returns step (2a).
Step 3, present node u selects next-hop node according to geographical location information.
When packet will send, present node u was directly according to geographical location information, from oneself neighbor node table and friend's node table, found out apart from the nearest node of destination node as next-hop node; If the next-hop node of finding out is the neighbor node of present node u, will transmit depth minus 1, execution in step 4; If the node of finding out is friend's node t of present node; To transmit depth minus 1, execution in step 5 is wherein transmitted the degree of depth and is also allowed the number of times that is forwarded for this packet.
Step 4, the neighbor node judging of present node u oneself are the destination node of this route.
Present node u directly sends to this neighbor node with packet, and this neighbor node judges oneself to be the destination node of this route after receiving packet, if whole routing procedure finishes, if not, this neighbor node becomes present node u, returns step 3.
Step 5, present node u carries out the cooperation transmission first time.
With reference to Fig. 3, the step that present node u carries out the cooperation transmission first time is following:
(5a) to find with node t in the friend's routing table of oneself be the friend path of friend's node to present node u; From this path, find out all nodes in the cooperation distance B of present node u; And with the destination node d1 that cooperates as the first time from present node u node farthest in these nodes; Execution in step (5b), wherein the value of D is the estimated value that present node u passes through the maximum distance that can transmit after the cooperation;
(5b) present node u passes to cooperation destination node d1 through cooperation transmission with packet, and this process is divided into two stages:
Phase I, send packet by present node u to cooperation destination node d1, the neighbor node of present node u based on self rest energy the ratio decision of gross energy when initial whether participate in the cooperation bag to the cooperation destination node d1 request of sending; If this ratio is less than 1/5; Do not send, participate in the cooperation bag if this ratio, then sends the request that has the energy label more than or equal to 1/5 and less than 1/3; Show that this neighbor node energy is not abundant; If this ratio more than or equal to 1/3, does not then send and participates in the cooperation bag with the request of energy label, show that this neighbor node energy is abundant;
Second stage preferentially allows the neighbor node of the abundant present node u of energy to participate in cooperation by cooperation destination node d1, and detailed process is:
After (5b1) cooperation destination node d1 receives that the neighbor node sent request of present node u is participated in the cooperation bag; Select the bag of not being with the energy label, if not with the number of the bag of energy label more than or equal to m, execution in step (5b2); Otherwise; Execution in step (5b3), wherein the value of m is set according to network condition, gets 2-3;
(5b2) cooperation destination node d1 never selects m the highest bag of signal to noise ratio in the bag with the energy label; A newly-built form is the sky bag of request cooperation response packet; Name with the m that selects the pairing neighbor node of bag adds in the sky bag of newly-built request cooperation response packet then; Expression allows these neighbor nodes to participate in cooperation, execution in step (5b4);
(5b3) cooperation destination node d1 participates in picking out the highest bag of several signal to noise ratios the cooperation bag from the request that has the energy label; Gather together enough m with not participating in the cooperation bag with the request of energy label; A newly-built form is the sky bag of request cooperation response packet; Name with this m the pairing neighbor node of bag adds in the sky bag of newly-built request cooperation response packet then, and expression allows these neighbor nodes to participate in cooperation, execution in step (5b4);
(5b4) cooperation destination node d1 postbacks request cooperation response packet, and the packet of the node of cooperation with cooperation transmission u, execution in step (5c) are afterwards participated in the permission that indicates in the request cooperation response packet;
(5c) cooperation destination node d1 judges whether success of cooperation for the first time, with the neighbor node data sent bag of present node u, with cooperating process in the phase I present node u data sent bag carry out high specific and merge; If the signal to noise ratio after merging reaches the thresholding of correct reception, then judge this and cooperate successfully, otherwise; Judge this cooperation failure,, all judged result is returned to present node u regardless of judged result; U handles judged result by present node, execution in step 6.
Step 6, present node u carries out the self adaptation adjustment to the judged result that cooperation destination node d1 transmits.
With reference to Fig. 4, present node u handles after receiving the judged result that cooperation destination node d1 transmits as follows:
If cooperation failure for the first time, then present node u adds 1 with the cooperation frequency of failure of oneself, and the cooperation total degree adds 1, calculates the cooperation probability of failure p=cooperation frequency of failure/cooperation total degree of oneself, then the cooperation distance B of oneself is pressed
Adjust, return step 5 afterwards, wherein R is that present node u one jumps the distance that can transmit, D
MaxFor the cooperation of present node u apart from the upper bound, ε is an adjustable parameter, it is big or small to be used to adjust the p value of D after stable;
If cooperate successfully for the first time; Then present node u adds 1 with the cooperation total degree of oneself; Calculate the cooperation probability of failure p=cooperation frequency of failure/cooperation total degree of oneself; Cooperation distance B to oneself is adjusted by
, and execution in step 7 then.
Step 7, after packet arrived the destination node d1 of cooperation for the first time, whether the destination node d1 of cooperation was friend's node t according to oneself for the first time, handles as follows according to shown in Figure 5:
If cooperation destination node d1 is friend's node t, then the whole cooperative transmit stage from present node u to friend's node t finishes, and friend's node t becomes present node u, execution in step 8;
If cooperation destination node d1 is not friend's node t, continue to adopt with step 5 and step 6 in identical collaboration method completion from node d1 to node d2, from node d2 to node d3 ... Back from node dn to friend's node t is the cooperation transmission process several times, and until packet being passed to friend's node t, friend's node t becomes present node u, execution in step 8; Node d2 wherein, d3 ..., dn is respectively the 2nd; The 3rd ..., the destination node of the n time cooperation.
Whether step 8 is the destination node of this route according to present node u, does to handle as follows:
If present node u is the destination node of this route, whole routing procedure finishes;
If present node u is not the destination node of this route, return step 3.
Be reduced to zero if transmit the degree of depth between transmission period, execution in step 9, if friend's path failure between transmission period, execution in step 10.
Whether step 9 is reduced to zero situation for transmitting the degree of depth between transmission period, allow to be dropped based on this packet, does to handle as follows:
If this packet allows to be lost, then abandon continuing to transmit this packet, the report packet loss;
If this packet does not allow to be lost, then, continue to transmit this packet again for this packet is provided with the numerical value of transmitting the degree of depth.
Step 10, for the situation of friend's path failure between transmission period, do to handle as follows:
(10a) as if friend's path failure between transmission period; Launch maintenance process earlier in the part; This maintenance process is: the node x of inefficacy place tells all neighbor nodes with the geographical position of the next-hop node z that needs are sent to, if receive the neighbor node y of route maintenance information the path that arrives this next-hop node z is arranged, and then route maintenance information is sent to the next-hop node z that this need be sent to; After node z receives the route maintenance information of node y; Rebulid with the node x of inefficacy place and to get in touch, and that node y of the many processes in centre is increased in the path, promptly route recovery is accomplished;
(10b) in the process of route recovery; Data transmission procedure is owing to adopt the cooperation transmission mode; Can obtain longer path, so failure node still can intercom with the next-hop node that need send to mutually on the very big probability, cooperation transmission makes the robustness of route increase; As shown in Figure 6; If the node A during transmission in the path lost efficacy to node H, node A still can send to destination node P with packet through this paths of node A-node F-node L-node P, so cooperation transmission can reduce the influence of friend's path failure;
If step 2 is then returned in (10c) local recovery's failure, initiate to select the process of friend's node again by the source node in this friend path.
The cooperation transmission mode that the present invention adopts in the packet process of transmitting can be optimized the path effectively; Reduce time delay, as shown in Figure 7, adopting the preceding path of cooperation transmission mode is node A-Node B-node C-node D-node E-node F-node G; Because cooperation transmission makes one to jump the distance increase that can reach; Adopt cooperation transmission mode posterior nodal point A can directly send packet to node G, thus effectively alleviated the path around etc. phenomenon, play the effect in optimization path.
Claims (5)
1. large-scale wireless distribution network adaptive cooperation method for routing based on the geographical position comprises:
(1) initialization step, promptly each node in the network is set up neighbor node table, friend's node table and the friend's routing table of oneself respectively;
(2) present node u has packets need to send; Present node u is directly according to geographical location information, from oneself neighbor node table and friend's node table, finds out apart from the nearest node of destination node as next-hop node, if the next-hop node of finding out is the neighbor node of present node u; To transmit depth minus 1; Execution in step (3) if the node of finding out is friend's node t of present node, will be transmitted depth minus 1; Execution in step (4) is wherein transmitted the degree of depth and is also allowed the number of times that is forwarded for this packet;
(3) present node u directly sends to this neighbor node with packet, and this neighbor node judges oneself to be the destination node of this route after receiving packet, if; Whole routing procedure finishes; Otherwise this neighbor node becomes present node u, returns step (2);
(4) present node u carries out the cooperation transmission first time:
(4a) to find with node t in the friend's routing table of oneself be the friend path of friend's node to present node u; From this path, find out all nodes in the cooperation distance B of present node u; And with the destination node d1 that cooperates as the first time from present node u node farthest in these nodes; Execution in step (4b), wherein the value of D is the estimated value that present node u passes through the maximum distance that can transmit after the cooperation;
(4b) present node u passes to cooperation destination node d1 through cooperation transmission with packet, and this process is divided into two stages:
Phase I, present node u sends packet to cooperation destination node d1, the neighbor node of present node u based on self rest energy the ratio decision of gross energy when initial whether participate in the cooperation bag to the cooperation destination node d1 request of sending; If this ratio is less than 1/5; Do not send, participate in the cooperation bag if this ratio, then sends the request that has the energy label more than or equal to 1/5 and less than 1/3; Show that this neighbor node energy is not abundant; If this ratio more than or equal to 1/3, does not then send and participates in the cooperation bag with the request of energy label, show that this neighbor node energy is abundant;
Second stage; Cooperation destination node d1 preferentially allows the neighbor node of the abundant present node u of energy to participate in cooperation; Postback request cooperation response packet, the packet of the node of cooperation with cooperation transmission u participated in the permission that indicates in the request cooperation response packet, carries out afterwards (4c);
(4c) cooperation destination node d1 judges whether cooperation for the first time is successful, and judged result is returned to present node u, and u handles judged result by present node, carries out afterwards (5);
(5) after present node u receives the judged result that cooperation destination node d1 transmits, carry out operation as follows:
If cooperation failure for the first time, then present node u adds 1 with the cooperation frequency of failure of oneself, and the cooperation total degree adds 1, calculates the cooperation probability of failure p=cooperation frequency of failure/cooperation total degree of oneself, then the cooperation distance B of oneself is pressed
Adjust, return step (4) afterwards, wherein R is that present node u one jumps the distance that can transmit, D
MaxFor the cooperation of present node u apart from the upper bound, ε is an adjustable parameter, it is big or small to be used to adjust the p value of D after stable;
If cooperate successfully for the first time, then present node u adds 1 with the cooperation total degree of oneself, calculates the cooperation probability of failure p=cooperation frequency of failure/cooperation total degree of oneself, and the cooperation distance B of oneself is pressed
(6) the destination node d1 of cooperation judges whether oneself is friend's node t for the first time, if then the whole cooperative transmit stage from present node u to friend's node t finishes, friend's node t becomes present node u; Execution in step (7) afterwards, otherwise, continue to adopt with step (4) and (5) in identical collaboration method completion from node d1 to node d2, from node d2 to node d3;, the back from node dn to friend's node t is the cooperation transmission process several times, and until packet being passed to friend's node t, friend's node t becomes present node u; Execution in step (7) afterwards, node d2 wherein, d3 ... Dn is respectively the 2nd, the 3 ..., the destination node of the n time cooperation;
(7) present node u judges whether oneself is the destination node of this route, if whole routing procedure finishes, otherwise, return step (2);
Be reduced to zero if transmit the degree of depth between transmission period, execution in step (8), if friend's path failure between transmission period, execution in step (9);
(8) according to the business need of the type packet, if allow to lose this bag, then abandon continuing to transmit this bag, the report packet loss if do not allow to lose this bag, then continues to transmit for this packet is provided with the numerical value of transmitting the degree of depth again;
(9) initiate the local process of reselecting friend's node earlier at friend's path failure place,, return step (1) if failure is reselected in the part.
2. method for routing according to claim 1, wherein each node in the described network of step (1) is set up oneself neighbor node table, friend's node table and friend's routing table respectively, carries out as follows:
(1a) in network, each node is at first according to geographical location information, with all to oneself distance less than one jump the distance R that can transmit node elect own neighbor node as, and according to the neighbor node table of the neighbor node foundation of finding out oneself;
(1b) each node is selected the friend's node of oneself according to geographical location information and worldlet theory; Friend's node according to selecting is set up friend's node table; In the process of selecting friend's node, will obtain a friend path; Each node on this friend path all is the neighbor node of previous node in this path, and each node in this path is all deposited this friend path in the friend's routing table of oneself.
3. method for routing according to claim 2, wherein described each node of step (1b) is selected oneself friend's node according to geographical location information and worldlet theory, carries out as follows:
(1b1) selecting friend's node t with present node u is example, and present node u selects a direction at random from its East, West, South, North four direction, be example with choice direction east, calculate present node u arrive eastwards network boundary apart from k, L=k then
Q/Q, wherein L is friend's node t that will select estimated value to the distance of present node u,
Q is interval [0; Q-1] on an integer selecting at random; With reference to the direction of selecting with to the distance L of present node u, determine the tentative position W of friend's node t that will select, the friend's node t that selects like this can make large scale network have the characteristic of worldlet network; Present node u issues the tentative nearest neighbor node v of position W of distance, execution in step (1b2) with friend's request package then;
After (1b2) nearest neighbor node v receives friend's request package, judge the own distance R that whether can transmit to the distance of fixing tentatively position W earlier less than a jumping, if; Then present node u selects the friend node of node v as oneself; Select friend's node process to finish, otherwise, execution in step (1b3);
(1b3) whether fix tentatively the nearer node of position W in the neighbor node of nearest neighbor node v judgement oneself than oneself leaving; If have, friend's request package is issued this node, this node becomes new nearest neighbor node v; And repeating step (1b2); Otherwise this selects friend's node failure, execution in step (1b1) again present node u.
4. method for routing according to claim 1, wherein the described cooperation destination node of step (4b) d1 preferentially allows the neighbor node of the abundant present node u of energy to participate in cooperation, carries out as follows:
After (4b1) cooperation destination node d1 receives that the neighbor node sent request of present node u is participated in the cooperation bag; Select the bag of not being with the energy label, if not with the number of the bag of energy label more than or equal to m, execution in step (4b2); Otherwise; Execution in step (4b3), wherein the value of m is set according to network condition, gets 2-3;
(4b2) cooperation destination node d1 never selects m the highest bag of signal to noise ratio in the bag with the energy label; A newly-built form is the sky bag of request cooperation response packet; Name with the m that selects the pairing neighbor node of bag adds in the sky bag of newly-built request cooperation response packet then, and expression allows these neighbor nodes to participate in cooperation;
(4b3) cooperation destination node d1 participates in picking out the highest bag of several signal to noise ratios the cooperation bag from the request that has the energy label; Gather together enough m with not participating in the cooperation bag with the request of energy label; A newly-built form is the sky bag of request cooperation response packet; Name with this m the pairing neighbor node of bag adds in the sky bag of newly-built request cooperation response packet then, and expression allows these neighbor nodes to participate in cooperation.
5. method for routing according to claim 1, wherein the described cooperation destination node of step (4c) d1 judges that whether cooperation for the first time is successful, carries out as follows:
(4c1) cooperation destination node d1 is the neighbor node data sent bag of present node u, with cooperating process in the phase I present node u data sent bag carry out high specific and merge execution in step (4c2);
(4c2), then judge this and cooperate successfully if the signal to noise ratio after merging reaches the thresholding of correct reception, otherwise, judge this cooperation failure.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110318710.5A CN102413539B (en) | 2011-10-19 | 2011-10-19 | Geographical position-based large-scale wireless distribution type network self-adaptive cooperative routing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110318710.5A CN102413539B (en) | 2011-10-19 | 2011-10-19 | Geographical position-based large-scale wireless distribution type network self-adaptive cooperative routing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102413539A true CN102413539A (en) | 2012-04-11 |
| CN102413539B CN102413539B (en) | 2014-04-16 |
Family
ID=45915306
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110318710.5A Expired - Fee Related CN102413539B (en) | 2011-10-19 | 2011-10-19 | Geographical position-based large-scale wireless distribution type network self-adaptive cooperative routing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102413539B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103501526A (en) * | 2013-09-29 | 2014-01-08 | 北京天公瑞丰科技有限公司 | Wireless sensor node and wireless sensor network |
| CN104168191A (en) * | 2014-08-31 | 2014-11-26 | 西安电子科技大学 | Routing method for meeting multiple constrained parameter conditions in large-scale software-defined network |
| CN105142196A (en) * | 2015-08-20 | 2015-12-09 | 北京邮电大学 | Wireless network node cooperative routing method |
| CN108495249A (en) * | 2018-02-05 | 2018-09-04 | 西安电子科技大学 | Ad hoc network method for routing based on location information low-power consumption |
| CN109068336A (en) * | 2018-07-05 | 2018-12-21 | 青岛智能产业技术研究院 | A kind of parallel car networking modeling method based on small-world network theory |
| CN111917868A (en) * | 2020-07-29 | 2020-11-10 | 数网金融有限公司 | Addressing method and device for block chain node, routing equipment and storage medium |
| CN112821937A (en) * | 2020-12-31 | 2021-05-18 | 广州大学 | Data transmission method through satellite network, device and medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101715225A (en) * | 2009-11-20 | 2010-05-26 | 西安电子科技大学 | Routing method of self-adapting self-organized network in cognitive network |
| CN101521926B (en) * | 2009-04-08 | 2010-12-29 | 西安电子科技大学 | Cooperative routing method for large-scale wireless distribution network |
| CN102076050A (en) * | 2010-12-28 | 2011-05-25 | 重庆邮电大学 | Routing method based on guarantee of fusion information safety of wireless sensor network |
| CN102137463A (en) * | 2011-03-09 | 2011-07-27 | 无锡泛联物联网科技股份有限公司 | Energy-based multi-path routing method for wireless network |
-
2011
- 2011-10-19 CN CN201110318710.5A patent/CN102413539B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101521926B (en) * | 2009-04-08 | 2010-12-29 | 西安电子科技大学 | Cooperative routing method for large-scale wireless distribution network |
| CN101715225A (en) * | 2009-11-20 | 2010-05-26 | 西安电子科技大学 | Routing method of self-adapting self-organized network in cognitive network |
| CN102076050A (en) * | 2010-12-28 | 2011-05-25 | 重庆邮电大学 | Routing method based on guarantee of fusion information safety of wireless sensor network |
| CN102137463A (en) * | 2011-03-09 | 2011-07-27 | 无锡泛联物联网科技股份有限公司 | Energy-based multi-path routing method for wireless network |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103501526A (en) * | 2013-09-29 | 2014-01-08 | 北京天公瑞丰科技有限公司 | Wireless sensor node and wireless sensor network |
| CN104168191A (en) * | 2014-08-31 | 2014-11-26 | 西安电子科技大学 | Routing method for meeting multiple constrained parameter conditions in large-scale software-defined network |
| CN105142196A (en) * | 2015-08-20 | 2015-12-09 | 北京邮电大学 | Wireless network node cooperative routing method |
| CN105142196B (en) * | 2015-08-20 | 2016-11-16 | 北京邮电大学 | A kind of wireless network node cooperative routing method |
| CN108495249A (en) * | 2018-02-05 | 2018-09-04 | 西安电子科技大学 | Ad hoc network method for routing based on location information low-power consumption |
| CN108495249B (en) * | 2018-02-05 | 2019-12-03 | 西安电子科技大学 | Ad hoc network method for routing based on location information low-power consumption |
| CN109068336A (en) * | 2018-07-05 | 2018-12-21 | 青岛智能产业技术研究院 | A kind of parallel car networking modeling method based on small-world network theory |
| CN109068336B (en) * | 2018-07-05 | 2021-11-02 | 青岛智能产业技术研究院 | Parallel Internet of vehicles modeling method based on small world network theory |
| CN111917868A (en) * | 2020-07-29 | 2020-11-10 | 数网金融有限公司 | Addressing method and device for block chain node, routing equipment and storage medium |
| CN112821937A (en) * | 2020-12-31 | 2021-05-18 | 广州大学 | Data transmission method through satellite network, device and medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102413539B (en) | 2014-04-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102413539B (en) | Geographical position-based large-scale wireless distribution type network self-adaptive cooperative routing method | |
| CN101415248B (en) | Method for establishing layer-striding dynamic source route protocol based on load balance | |
| CA3107919A1 (en) | Vinetm: zero-control routing using data packet inspection for wireless mesh networks | |
| CN101420379B (en) | Low consumption multi-path routing method for mobile ad hoc network | |
| CN102821437B (en) | Ad-hoc on-demand distance vector routing method | |
| CN103945484A (en) | Farmland wireless self-organizing network topology density correlation path selecting and optimizing method | |
| CN108337166A (en) | A kind of highly reliable Routing Protocol of low time delay of Aviation cluster network | |
| CN107318146B (en) | Topology control method of mobile cluster ad hoc network | |
| CN101674630A (en) | Implementation method of cross-layer routing capable of perceiving congestion | |
| CN110324877A (en) | Relaying robot method for routing based on servo backbone network Yu Vikor multi-standard decision | |
| JP2011223419A (en) | Multihop wireless ad hoc network, communication system, information collection and setting device, information terminal, and route search method | |
| CN104539542B (en) | A kind of low energy consumption based on mobile Sink Data Collections route tree shears method | |
| CN101521926B (en) | Cooperative routing method for large-scale wireless distribution network | |
| CN102984781B (en) | Neighbor node judgment method for wireless ad hoc network route | |
| CN108449271A (en) | A kind of method for routing of monitoring path node energy and queue length | |
| Jaiswal et al. | An optimal QoS-aware multipath routing protocol for IoT based wireless sensor networks | |
| CN109548112A (en) | A kind of wireless sense network distributed routing method based on the various dimensions path quality factor | |
| CN102857989B (en) | Self-adaptive routing method oriented to mobile sensor network | |
| CN105025545A (en) | A route method based on competed forwarding and applicable to a wireless network | |
| CN102083164A (en) | Method for opportunistic routing of wireless sensor network (WSN) based on energy perception | |
| CN101867993B (en) | Multi-path routing method based on route correlation degree | |
| CN110933676A (en) | Method for multi-objective optimization opportunistic routing of underwater sensor network | |
| CN102685917A (en) | Capacity expansion-oriented wireless sensor network multi-channel scheduling method | |
| Kiki et al. | Improved AOMDV Routing Protocol in Manet UAV Based on Virtual Hop | |
| CN105142182A (en) | Communication method for multipath routing optimization sensor and actor nodes |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20140416 Termination date: 20191019 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |