CN101521926B - Cooperative routing method for large-scale wireless distribution network - Google Patents
Cooperative routing method for large-scale wireless distribution network Download PDFInfo
- Publication number
- CN101521926B CN101521926B CN200910021908XA CN200910021908A CN101521926B CN 101521926 B CN101521926 B CN 101521926B CN 200910021908X A CN200910021908X A CN 200910021908XA CN 200910021908 A CN200910021908 A CN 200910021908A CN 101521926 B CN101521926 B CN 101521926B
- Authority
- CN
- China
- Prior art keywords
- node
- path
- information
- friend
- 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.)
- Expired - Fee Related
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 cooperative routing method for a large-scale wireless distribution network, which relates to a routing protocol of an ad hoc network. The process comprises the following steps that: in a cluster-based wireless ad hoc network, an active routing table is maintained within a cluster, a plurality of remote friend nodes are maintained outside the cluster, and the clusters in which the friend nodes are and the cluster are friend clusters; during service transmission, a route is searched in a intra-cluster routing table and a route cache table, a packet is sent to a the friend node for query if the route is not found, and the query process adopts a cooperative transmission mode; the friend node receiving the query information immediately feeds a routing to a target node back to a home node if the friend node has the routing to the target node; if the query depth is not reached, the friend node continues to select other friends for inquiring the route; and after the route is found, service information is transmitted in a cooperative transmission mode. The method improves the problem of high cost of large-scale network routing by introducing clustering and a small world phenomenon, obviously enhances network performance by using cooperative transmission to optimize routing and reduce transmission delay, and applies to large-scale distribution networks.
Description
Technical field
The present invention relates to wireless communication technology field, a kind of specifically cooperated routing method can be used for large-scale wireless distribution network.
Background technology
In wireless self-networking, solve the problem of route, have usually active, several strategies such as route that passive type and geographical location information are auxiliary.Yet when the increase in size of network, the method mutual or broadcast addressing of routing iinformation will exhaust Internet resources very soon.
Zone Routing Protocol ZRP is a kind of MANET Routing Protocol that uses active routing policy and passive routing policy that mixes.All nodes in the network all have one oneself to be the virtual region at center, and the interstitial content in the zone is relevant with the zone radius of setting, so the region overlapping degree of ZRP is very high.This also is the difference of ZRP and the explicit route of hiving off.Use priori formula routing algorithm in the zone, a routing table to interior other member node in zone is safeguarded in Centroid use initiatively Routing Protocol.Route for regional exterior node is then used passive routing policy.
This method has the following disadvantages:
Owing to will adopt the mode of broadcasting, still be easy to exhaust Internet resources when (1) outside the group, communicating by letter, adapt to the poor-performing of network growth.
(2) relatively more responsive to the size of hiving off, when network size increased, the excessive then protocol capabilities that hives off deteriorated to suitable with active route, and the too small then protocol capabilities that hives off deteriorates to suitable with the passive type route.
Solve the broadcast issue of large scale network, proposed a kind of resource discovering strategy in the document " Contact-based architecture for resourcediscovery 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 mutually by being no more than six friends for each person for promptly any two.So only need friend's node, and do not need the active information of safeguarding all nodes of the whole network the several far-ends of each node maintenance in the network.In the route discovery stage, inquiry work will be by broadcasting, but inquire about to friend's node by the existing path of safeguarding, when failing to obtain required route, inquire about to other friend of oneself again by friend's node, jump the almost sure destination node that finds according to worldlet theoretical average six.Obtain just can send business information after the route.
This method has the following disadvantages:
(1) owing to the worldlet phenomenon is just desirable abstract after all, it is applicable to relational network, and the support that connects for length owing to shortage in spatial network is jumped the path that may become a lot of jumpings in the large scale network to one of friend's node, causes delay performance relatively poor.
(2) because not broadcasting and full mesh topology can only obtain sub-optimal path, when network size increases, be easy to cause the path around with problem such as tediously long, and node is too much on the path, the increase of route failure probability, robustness is relatively poor.
When (3) the node number increases in network, the number that must restricted passage friend node and the time delay of inquiry, the searching probability and will reduce of destination node this moment.
Summary of the invention
The objective of the invention is deficiency at traditional method for routing, a kind of cooperated routing method that is used for large-scale wireless distribution network is proposed, with more effective compromise between delay performance and routing cost, reduce route failure probability and time delay, that improves destination node searches probability to adapt to the demand of large scale network.
The technical scheme that realizes purpose of the present invention comprises the steps:
(1) in the large-scale wireless Packet Based Network of hiving off, safeguard active routing table with the DSDV agreement in group, the communication between the group is finished by the neighbors table of gateway node maintenance oneself;
(2) several gateway nodes of each group are sought the friend node of the node of some distinct groups as far-end, friend's node place group of this far-end is as groups of friends, after searching out groups of friends, the information of this new groups of friends is included in the DSDV updating message, each gateway node is safeguarded and the mutual unduplicated groups of friends information of other gateway nodes;
(3) when business will send, earlier search the path in the DSDV routing table with by eavesdroping in the cache table that information sets up, as find the path, directly send business datum by this path, as do not find the path, give each gateway node with the multicast path solicited message, each gateway node is selected one arbitrarily in the friend's node that is had, and sends an information that comprises request destination address and query depth according to the path to this friend's node with collaborative transmission means;
(4) send in the process of the information of asking destination address and query depth, if all nodes of this information of hearing have the path of destination node, give source node with returning this path by collaborative transmission means immediately to destination node, in returning to the process of source node, if other gateway node is eavesdroped the routing information that has destination node, this routing information of eavesdroping of cache table buffer memory will be set up in view of the above, after source node is received the return information that comprises the path, comprise the source routing business data packet with collaborative transmission means transmission;
(5) if the information of request destination address that sends and query depth still fails to find the path of destination node when arriving friend's node, and query depth is greater than 0, then query depth is subtracted 1, select friend's node in addition, repeating step (4), continue the pathfinding process, be reduced to till zero up to query depth.
(6) as if finally still fail to find destination node through the pathfinding process, according to the requirement of Network,, then to select to abandon searching if allow to lose this bag, the report packet loss as if not allowing to lose this bag, then strengthens query depth and continues to search;
(7) if find that route lost efficacy when safeguarding the friend path, initiate the local process of seeking friend again in inefficacy place earlier, if the part is sought failure again, repeating step (2) is initiated the process that the overall situation is sought friend's node again by source node again.
The present invention compared with prior art has following advantage:
1) the present invention is according to the characteristics of large scale network, based on worldlet phenomenon maintenance of far end friend node, to far-end friend node request path, can evade broadcast issue during pathfinding, in the pathfinding success rate that guarantees certain probability, greatly reduce network overhead.
2) the present invention introduces the strategy that hives off, and the business of part is directly sent by searching the DSDV routing table, and the business that the group is outer is utilized cache table information searching path earlier, and again by the pathfindings simultaneously of a plurality of gateways, the time delay that makes route obtain is shorter during failure.
3) the present invention searches destination node and can utilize the information of hiving off to search by the group in the pathfinding process outside the group, and the probability of success of searching the destination node path increases greatly.
4) the present invention is directed to the long and path of the time delay that may exist in the worldlet route around etc. phenomenon, by introducing collaborative transmission means, can become a longer jumping around non-optimal path by collaborative on the one hand, collaboratively on the other hand itself also help to reduce propagation delay time, can play path optimization and dwindle the effect of time delay.
5) the collaborative transmission of the present invention's use can reach farther transmission range, and making increases the probability that finds destination node by the routing information that more node can be eavesdroped pathfinding and return.
Description of drawings
Fig. 1 is overall flow figure of the present invention;
Fig. 2 is the workflow diagram that node of the present invention is sought friend;
Fig. 3 is the workflow diagram of the collaborative transmission of node of the present invention;
Fig. 4 is the propagation path schematic diagram that the present invention is based on the worldlet phenomenon;
Fig. 5 is the collaborative schematic diagram that improves that transmits the path among the present invention.
Embodiment
With reference to Fig. 1, specific implementation step of the present invention is as follows:
Step 1 is carried out in the group, communication between the group.
In the large-scale wireless Packet Based Network, earlier node is hived off.Each group has a group address owing to be distributed network, can not guarantee two group addresses anything but with, use the method that hash is carried out in group's interior nodes address to guarantee that the group address is inequality.Adopt the DSDV agreement to safeguard active routing table in the group, DSDV is a driven algorithm based on traditional Bellman-Ford routing mechanism, it obtains the topology of network and calculates corresponding route by regular interactive refreshing information between adjacent node, and each node is all known group routing iinformation of interior all nodes in the group.Can be chosen as gateway node with the boundary node that other group communicates in each group, gateway node is safeguarded the neighbors table of oneself, comprising the node address of other group that can communicate by letter and group number, the neighbors table upgrades by the DSDV updating message of the regular update heard.Communication the time must pass through gateway node between the group, by their need in neighbors table to select to communicate by letter group respective nodes communicate.
Step 2 is sought far-end friend node.
With reference to Fig. 2, the step of seeking far-end friend node is as follows:
When (2a) seeking friend,, comprise the group's who becomes this group friend group number tabulation and request package life span in this bag, in the neighbors table, select a neighbors at random and send this request package by gateway node structure friend request package.After node is received request package, if node place group is in the group who becomes groups of friends number tabulation, then certainly not as friend's node, if not in the group who becomes groups of friends number tabulation, then according to the decision of Probability p=(d-2R)/(r-2R) whether as friend's node, wherein 2R is the jumping figure apart from start node, and d and r are respectively the shortest jumping figure and the restriction of the longest jumping figure that the friend's node that will look for should satisfy.If not as friend, then at first upgrade time-out time, own address is attached to the back, path, in this group, select a gateway node, the searching process above this gateway node sends the request package continuation then;
(2b) when the arrival network boundary is not successfully chosen friend's node yet, press original route backtracking one and jump, and select other next-hop node and send bag, whether proceed probabilistic determination as friend's node.Finally like this can select friend's node, perhaps wrap life span and surpass the life cycle of setting, bag is dropped;
(2c) find this group records after the groups of friends to initiate the source group that seeks for own friend and write down the whole piece path in friend's routing table, return a message to confirm friend's identity each other to the source group simultaneously.Also in friend's routing table, write down the whole piece path after the source group receives, regularly send message afterwards and safeguard this route;
(2d) initiate gateway node that friend seeks process after the information that obtains the far-end friend, during transmission DSDV routing update information, friend covers in the update package with this far-end in group next time.Other gateway node is received updating message in the group, and these group records that found are got off, and can not look for the groups of friends of identical group as oneself later on again, so that gateway node always has different groups of friends.
Step 3, business datum sends.
(3a) when business produces, search the DSDV routing table earlier to determine whether that destination node is just in the group, if can directly be sent by DSDV routing table acquisition path in the group.If not, search the path cache table, then directly send if can obtain the path;
(3b) if fail to find the path, in the DSDV routing table, search the path that arrives each gateway node, with the multicast mode send one comprise the information of destination node address and query depth of asking to gateway node.After each gateway node is received this information, will in the far-end friend node that is had, select one and send the routing inquiry bag arbitrarily to it.If m gateway node arranged in the group, each gateway node has n friend, and each in m node all can be chosen a friend wantonly and send in n friend, will have sending that m solicited message walk abreast this moment and carry out parallel query;
Step 4, path searching is carried out in collaborative transmission.
With reference to Fig. 3, the step that path searching is carried out in collaborative transmission is as follows:
When (4a) searching, node to be sent selects several one to jump neighborss and invite it collaborative at random, agrees to participate in collaborative node and will work in coordination with transmission information, comprises on the worldlet path node address within several jumpings in this information;
(4b) collaborative transmission obtains longer transmission path, makes that the node within several jumpings can both be received information on the path, and the node on other non-path also can be eavesdroped this information.If source routing after own address being attached to a last jumping sending node when finding, and is blocked whether in the group of oneself in the path of all node search request destination addresses of receiving information, returns the path of finding immediately.The node that does not search on the non-path in destination node path is no longer transmitted bag, simply it is abandoned, and has avoided the flooded broadcast in the network;
(4c) on the path, receive the node of information, then start and the timing that is inversely proportional to apart from the sending node jumping figure that timing is 2 if do not find the path of destination address
-i* k, wherein i is the jumping figure apart from sending node, k is according to network condition, the constant that transmitted power is selected.Promptly send ACK information after being timed to, and the node nearer apart from sending node will send no longer to ACK information owing to receiving than node far away.Guarantee correctly to receive on the path bag like this, and apart from the maximum node of sending node jumping figure loopback ACK information at first;
After (4d) node to be sent is received ACK information, the bag that contains request destination address and query depth to be sent is issued the node that returns ACK information at first.Process of transmitting is for carrying out the transmission of a jumping scope earlier, and cooperative nodes is worked in coordination with the information that sends this request destination address and query depth after receiving this information, and destination address is for returning the node of ACK information at first.This node continues repeating step 4 after receiving information, up to finding destination node or arriving far-end friend node.
Step 5 arrives friend's node, continues search procedure.
When arriving friend's node, still do not find destination node, friend's node is judged query depth earlier, if query depth then subtracts 1 with query depth greater than zero, and another one friend's node of selection oneself, repeating step 4 continues to inquire about to this friend who reselects.According to the worldlet theory, friend's node is inquired about to the friend of oneself again, as long as almost always can find destination node through six times.If query depth equals zero, discarded packets then, this friend fails to help to find destination node.When all friends failed to help to find destination node, source node, was then selected to abandon searching if allow to lose this bag according to the requirement of Network, and the report packet loss if do not allow to lose this bag, then strengthens query depth and continues to search.
Step 6 finds the path, returns to source node.
(6a) find the path after, after the node that obtains the path will be attached to path from source node to oneself from own path to destination node, and return by original route, original route is promptly as return path;
(6b) node to be sent selects several one to jump neighborss and invite it collaborative at random, agrees to participate in collaborative node and will work in coordination with transmission information, comprises on the return path node address within several jumpings in this information;
(6c) collaborative transmission obtains longer transmission path, makes that the node within several jumpings can both be received information on the path, receives that the node of information starts and the timing that is inversely proportional to apart from the sending node jumping figure, and timing is 2
-i* k, wherein i is the jumping figure apart from sending node, and k is according to network condition, and the constant that transmitted power is selected promptly sends ACK information after being timed to, and the node nearer apart from sending node will no longer send to ACK information owing to receiving than node far away.Guarantee so correctly to receive on the path bag apart from the maximum node of sending node jumping figure loopback ACK information at first;
After (6d) node to be sent is received ACK information, the information to the destination node path that finds is issued the node that returns ACK information at first, arrive the source node of initiating the pathfinding process up to this information at last.
(6e) all nodes of hearing return information in the process of return path, the clauses and subclauses in the routing information that will hear and the own cache table compare.If the cache table clauses and subclauses do not reach then this routing information of buffer memory of the entry number upper limit,, and write down the up-to-date arrival routing information of eavesdropping if reaching the upper limit then deletes clauses and subclauses overtime in the cache table.If all not overtime then the deleting of all clauses and subclauses contained the minimum path of node number, write down the up-to-date routing information of eavesdroping.The cache table of setting up like this and upgrading can increase so that directly obtain the probability of destination node route.
Step 7, route maintenance procedure.
(7a) carry out friends when safeguarding if finding route lost efficacy, then next-hop node is unreachable, at this moment will launch maintenance process in the part earlier.This maintenance process is: the next-hop node address that the node of inefficacy place is sent to needs tell can reach one jump neighbors, the path that arrives this next-hop node that need send to is arranged then information is sent to the next-hop node that this need be sent to if receive the neighbors of information.After receiving information, this next jumping neighbors and inefficacy place node rebulid gets in touch, and the node that passes through between it is increased in the path, and promptly route recovery is finished.
(7b) in the process of route recovery, the pathfinding process can obtain longer path owing to adopt collaborative transmission means, so failure node still can intercom mutually with the next-hop node that need send on the very big probability, collaborative transmission makes the robustness of route increase.With reference to Fig. 4, if A lost efficacy to H in when transmission initial path, but A still can pass through A, F, and L, the path Jiang Bao of P sends to destination node, and collaborative transmission can be avoided the influence of route inefficacy among a small circle.
If (7c) local recovery's failure, then repeating step 2, initiated to seek far-end friend's process again by source node.
With reference to Fig. 5, the collaborative transmission means that the present invention adopts in pathfinding and professional process of transmitting can the effective optimization path, reduces time delay.In Fig. 5, adopting the preceding path of this mode is A, B, and C, D, E, F, G, H increases because collaborative transmission makes a jumping can reach distance, and the path after the improvement is that A can directly send traffic to H, has shortened the jumping figure of route, has reduced time delay.
Terminological interpretation
ZRP:Zone Routing Protocol, regional Routing Protocol;
MANET:Mobile Ad hoc network, mobile ad-hoc network;
DSDV:Destination-Sequenced Distance-Vector, destination node sequence distance vector protocol;
ACK:ACKnowledge Character, acknowledge character.
Claims (6)
1. a cooperated routing method that is used for large-scale wireless distribution network comprises the steps:
(1) in the large-scale wireless Packet Based Network of hiving off, safeguard active routing table with the DSDV agreement in group, the communication between the group is finished by the neighbors table of gateway node maintenance oneself;
(2) several gateway nodes of each group are sought the friend node of the node of some distinct groups as far-end, friend's node place group of this far-end is as groups of friends, after searching out groups of friends, the information of new groups of friends is included in the DSDV updating message, each gateway node is safeguarded and the mutual unduplicated groups of friends information of other gateway nodes;
(3) when business will send, earlier search the path in the DSDV routing table with by eavesdroping in the cache table that information sets up, as find the path, directly send business datum by this path, as do not find the path, give each gateway node with the multicast path solicited message, each gateway node is selected one arbitrarily in the friend's node that is had, and sends an information that comprises request destination address and query depth according to the path to this friend's node with collaborative transmission means;
(4) send in the process of the information of asking destination address and query depth, if all nodes of this information of hearing have the path of destination node, give source node with returning this path by collaborative transmission means immediately to destination node, in returning to the process of source node, if other gateway node is eavesdroped the routing information that has destination node, this routing information of eavesdroping of cache table buffer memory will be set up in view of the above, after source node is received the return information that comprises the path, send the business data packet that comprises source routing with collaborative transmission means;
(5) if the information of request destination address that sends and query depth still fails to find the path of destination node when arriving friend's node, and query depth is greater than 0, then query depth is subtracted 1, select friend's node in addition, repeating step (4), continue the pathfinding process, be reduced to till zero up to query depth.
(6) as if finally still fail to find destination node through the pathfinding process, according to the requirement of Network,, then to select to abandon searching if allow to lose this bag, the report packet loss as if not allowing to lose this bag, then strengthens query depth and continues to search;
(7) if find that route lost efficacy when safeguarding the friend path, initiate the local process of seeking friend again in inefficacy place earlier, if the part is sought failure again, repeating step (2) is initiated the process that the overall situation is sought friend's node again by source node again.
2. method for routing according to claim 1, wherein several gateway nodes of described each group of step (2) are sought the friend node of the node of some distinct groups as far-end, carry out as follows:
(2a) by gateway node structure friend request package, comprise the group number tabulation and the request package life span that become this group friend in this bag, in the neighbors table, select a neighbors at random and send this request package, after node is received request package, if node place group is in the group who becomes groups of friends number tabulation, then, continue to be transmitted to the neighbors of oneself scarcely as friend's node;
(2b) if node place group is not in having list of friends, by Probability p=(d-2R)/(r-2R) whether the alternative node of decision can be used as friend, wherein 2R is the jumping figure apart from start node, and d and r are respectively the shortest jumping figure and the restriction of the longest jumping figure that the friend's node that will look for should satisfy;
When (2c) not finding friend's node yet, press original route backtracking one and jump, select other next-hop node and send bag, whether proceed probabilistic determination as friend's node as if the arrival network boundary.
3. method for routing according to claim 1, wherein described each gateway node of step (3) is selected one arbitrarily in the friend's node that is had, and, carry out as follows according to the information of safeguarding that sends request destination address and query depth to the path of this friend's node:
(3a) in the DSDV routing table, find the route of each gateway node, give each gateway node by this routing multicast;
(3b) select friend's node at random by each gateway node, each gateway node walks abreast and searches destination node simultaneously to selected friend's node transmit path solicited message.
4. according to the method for routing described in the claim 1, wherein step (3) is described sends an information that comprises request destination address and query depth according to the path to this friend's node with collaborative transmission means, carries out as follows:
(4a) node to be sent selects several one to jump neighborss and invite it collaborative at random, agrees to participate in collaborative node and will work in coordination with transmission information, comprises on the path node address within several jumpings in this information;
(4b) collaborative transmission obtains longer transmission path, makes that the node within several jumpings can both be received information on the path, receives the path of back search request destination address, gives sending node if find the path then to return ACK information immediately;
(4c) receive the node of information on the path, then start and the timing that is inversely proportional to apart from the sending node jumping figure that timing is 2 if do not find the path of destination address
-i* k, wherein i is the jumping figure apart from sending node, k is according to network condition, the constant that transmitted power is selected, with guarantee correctly to receive on the path bag apart from the maximum node of sending node jumping figure loopback ACK information at first;
After (4d) node to be sent is received ACK information, the information that comprises request destination address and query depth to be sent is issued the node that returns ACK information at first.
5. according to the method for routing described in the claim 1, wherein step (4) is if the described node of the information that sends request destination address and query depth of hearing has the path of destination node, return to source node by collaborative transmission means immediately, carry out as follows:
(5a) node to be sent selects several one to jump neighborss and invite it collaborative at random, agrees to participate in collaborative node and will work in coordination with transmission information, comprises on the return path node address within several jumpings in this information;
(5b) collaborative transmission obtains longer transmission path, makes that the node within several jumpings can both be received information on the path, receives that the node of information starts and the timing that is inversely proportional to apart from the sending node jumping figure, and timing is 2
-i* k, wherein i is the jumping figure apart from sending node, and k is according to network condition, and the constant that transmitted power is selected returns ACK information with what guarantee correctly to receive on the path bag at first apart from the maximum node of sending node jumping figure;
(5c) node to be sent receives that the information to the destination node path that will find after the ACK information issues the node that returns ACK information at first.
6. according to the method for routing described in the claim 1, wherein step (4) is described sends the business data packet that comprises source routing with collaborative transmission means, carries out as follows:
(6a) node to be sent selects several one to jump neighborss and invite it collaborative at random, agrees to participate in collaborative node and will work in coordination with transmission information, comprises on the source routing path node address within several jumpings in this information;
(6b) collaborative transmission obtains longer transmission path, makes that the node within several jumpings can both be received information on the path, receives that the node of information starts and the timing that is inversely proportional to apart from the sending node jumping figure, and timing is 2
-i* k, wherein i is the jumping figure apart from sending node, k is according to network condition, the constant that transmitted power is selected, with guarantee correctly to receive on the path bag apart from the maximum node of sending node jumping figure loopback ACK information at first;
(6c) node to be sent is issued the node that returns ACK information at first with business data packet after receiving ACK information.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910021908XA CN101521926B (en) | 2009-04-08 | 2009-04-08 | Cooperative routing method for large-scale wireless distribution network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910021908XA CN101521926B (en) | 2009-04-08 | 2009-04-08 | Cooperative routing method for large-scale wireless distribution network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101521926A CN101521926A (en) | 2009-09-02 |
| CN101521926B true CN101521926B (en) | 2010-12-29 |
Family
ID=41082243
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200910021908XA Expired - Fee Related CN101521926B (en) | 2009-04-08 | 2009-04-08 | Cooperative routing method for large-scale wireless distribution network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101521926B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102413539A (en) * | 2011-10-19 | 2012-04-11 | 西安电子科技大学 | Geographical position-based large-scale wireless distribution type network self-adaptive cooperative routing method |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102497646A (en) * | 2011-12-08 | 2012-06-13 | 中山大学 | Low-overhead cache data discovery mechanism used for wireless network |
| CN102843673B (en) * | 2012-09-10 | 2015-02-11 | 江苏科技大学 | Network position privacy protection method of wireless sensor |
| CN103369620A (en) * | 2013-06-24 | 2013-10-23 | 天津理工大学 | WSN (wireless sensor network)-oriented minimum transmission multicast routing method |
| CN103501526A (en) * | 2013-09-29 | 2014-01-08 | 北京天公瑞丰科技有限公司 | Wireless sensor node and wireless sensor network |
| CN104168191B (en) * | 2014-08-31 | 2017-04-19 | 西安电子科技大学 | Routing method for meeting multiple constrained parameter conditions in large-scale software-defined network |
| CN107801196B (en) * | 2016-09-06 | 2021-02-09 | 中国电信股份有限公司 | Method and system for detecting off-line node |
| CN110418393B (en) * | 2019-01-17 | 2022-04-19 | 西安电子科技大学 | Regional routing improvement method based on node relative movement speed |
| CN114732424B (en) * | 2022-04-29 | 2023-04-07 | 苏州大学 | Method for extracting complex network attribute of muscle fatigue state based on surface electromyographic signal |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101179492A (en) * | 2007-11-14 | 2008-05-14 | 中国人民解放军理工大学 | Energy-saving packet collision analyzing method for random access time slot self-organizing network |
| CN101286934A (en) * | 2008-03-05 | 2008-10-15 | 中科院嘉兴中心微系统所分中心 | Cross-layer routing method based on multi-node collaborative beam forming in wireless sensor network |
-
2009
- 2009-04-08 CN CN200910021908XA patent/CN101521926B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101179492A (en) * | 2007-11-14 | 2008-05-14 | 中国人民解放军理工大学 | Energy-saving packet collision analyzing method for random access time slot self-organizing network |
| CN101286934A (en) * | 2008-03-05 | 2008-10-15 | 中科院嘉兴中心微系统所分中心 | Cross-layer routing method based on multi-node collaborative beam forming in wireless sensor network |
Non-Patent Citations (11)
| Title |
|---|
| Garg, S. |
| Helmy, A. |
| Helmy, A.;Garg, S.;Pamu, P.;Nahata, N..Contact-based architecture for resource discovery (CARD) in large scale MANets.《Parallel and Distributed Processing Symposium, 2003. Proceedings. International》.2003, * |
| Nahata, N..Contact-based architecture for resource discovery (CARD) in large scale MANets.《Parallel and Distributed Processing Symposium, 2003. Proceedings. International》.2003, |
| Pamu, P. |
| 张文柱，等.多跳分布式无线网络中不同路由协议的性能.《西安电子科技大学学报(自然科学版)》.2003,第23卷(第4期), |
| 张文柱等.多跳分布式无线网络中不同路由协议的性能.《西安电子科技大学学报(自然科学版)》.2003,第23卷(第4期), * |
| 盛敏，等.Ad Hoc网络路由技术.《中兴通讯技术》.2007,第13卷(第4期), |
| 盛敏等.Ad Hoc网络路由技术.《中兴通讯技术》.2007,第13卷(第4期), * |
| 贺鹏，等.一种新型的基于地理位置信息的Ad H oc路由算法.《西安电子科技大学学报（自然科学版）》.2006,第33卷(第2期), |
| 贺鹏等.一种新型的基于地理位置信息的Ad H oc路由算法.《西安电子科技大学学报(自然科学版)》.2006,第33卷(第2期), * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102413539A (en) * | 2011-10-19 | 2012-04-11 | 西安电子科技大学 | Geographical position-based large-scale wireless distribution type network self-adaptive cooperative routing method |
| CN102413539B (en) * | 2011-10-19 | 2014-04-16 | 西安电子科技大学 | Geographical position-based large-scale wireless distribution type network self-adaptive cooperative routing method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101521926A (en) | 2009-09-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101521926B (en) | Cooperative routing method for large-scale wireless distribution network | |
| CN102148756B (en) | IPv6 over low power wireless personal area network (6LoWPAN) neighbor discovery-based tree routing method | |
| EP1859581B1 (en) | Routing communications in an ad hoc network | |
| CN102711209B (en) | Dynamic self-organizing hierarchical routing method applied to wireless sensor network | |
| CN101374108B (en) | Routing method suitable for static state self-grouping formation | |
| Akyildiz et al. | A virtual topology based routing protocol for multihop dynamic wireless networks | |
| JP2007325261A (en) | Method of establishing route | |
| Sharma et al. | A comparative review on routing protocols in MANET | |
| JP2006020332A (en) | Packet relaying method, router setting method, and router setting system | |
| CN101102283A (en) | A method and device for optimizing unknown unicast forward at wireless access point | |
| CN108770003A (en) | A kind of self-organizing unmanned plane network routing discovering method based on particle group optimizing | |
| CN101262449B (en) | A new wireless self-networking dual-frequency hierarchical routing method | |
| KR20090032193A (en) | Routing method and system based on location information | |
| CN101651619B (en) | Ad hoc network routing method based on label circular shift of MAC layer | |
| CN1491055A (en) | Method for constructing stabilized self-adaption self-organization network terminal | |
| KR100955246B1 (en) | Group dynamic source routing method for wireless mobile ad hoc network | |
| CN102695192A (en) | Routing scheme for IPv6 wireless sensor network | |
| CN102035730A (en) | Fusion network system architecture supporting WLAN to cross MANET for communication and on-demand routing method | |
| Mistry et al. | A survey: Use of ACO on AODV & DSR routing protocols in MANET | |
| Lim et al. | Landmark guided forwarding | |
| CN114040471A (en) | Distributed topology control method and terminal based on Bluetooth network | |
| Le et al. | An efficient hybrid routing approach for hybrid wireless mesh networks | |
| Das | Multicast routing protocols in MANETS | |
| CN106973422B (en) | Improved algorithm of DSR protocol | |
| Mann et al. | A Survey on Zone Routing protocol |
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: 20101229 Termination date: 20180408 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |