CN101409905A - Routing method for mobile multi-hop grouping wireless network based on random broadcast mode - Google Patents
Routing method for mobile multi-hop grouping wireless network based on random broadcast mode Download PDFInfo
- Publication number
- CN101409905A CN101409905A CNA2007101756054A CN200710175605A CN101409905A CN 101409905 A CN101409905 A CN 101409905A CN A2007101756054 A CNA2007101756054 A CN A2007101756054A CN 200710175605 A CN200710175605 A CN 200710175605A CN 101409905 A CN101409905 A CN 101409905A
- Authority
- CN
- China
- Prior art keywords
- node
- anycast group
- destination node
- anycast
- request packet
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Abstract
The embodiment of the invention provides a mobile multi-hop packet wireless network routing method based on an anycast manner. The method comprises the following steps: a source node sends a routing request packet containing a service value and an anycast group address of the source node; a forwarding node which receives the routing request packet searches a destination node in the anycast group of the forwarding node, if the destination node is not found, an anycast group which is closest to the anycast group of the forwarding node is determined by a function algorithm according to the anycast group address information, and the routing request packet is sent to the closest anycast group so as to continue searching the destination node in the closest anycast group; the steps are repeated until the destination node is found; and communication connection between the source node and the destination node is established. The method achieves rapid search of the destination node and enhances the resource retrieval and inquiry efficiency.
Description
Technical field
The present invention relates to wireless communication technology field, be specifically related to a kind of routing method for mobile multi-hop grouping wireless network based on random broadcast mode.
Background technology
Along with development of wireless communication devices, the integration technology of Ad Hoc (mobile multi-hop grouping wireless) network technology and Peer-to-Peer (reciprocity computing network technology) is more and more paid attention to by people.Ad Hoc network is not rely on any infrastructure, the multi-hop wireless network of no center self-organization distribution, and the node in this network is mobile host.In the Ad Hoc network, if two mobile hosts are in communication coverage each other the time, can direct communication; But, in the time of need communicating by letter as if the mobile host of two apart from each others, just must transmit data, to realize communication by other mobile host between these two mobile hosts because the communication coverage of mobile host is limited.Therefore in Ad Hoc network, each mobile host is all being undertaken the work of seeking route, forwarding data, and route generally all need be passed through multi-hop, and data are transmitted through a plurality of mobile hosts could arrive the destination.
At present,, be called for short AAODV (Anycast AODV), be applied to Ad Hoc network based on appointing AODV (wireless self-networking is distance vector routing protocol as required, the Ad HocOn-Demand Distance Vector) agreement of broadcasting.
Any casting is a kind of new network application, it can support to give an address assignment a plurality of nodes so that special services to be provided, and appoints the data message of broadcasting destination address can use identical appointing to broadcast the address and is passed in above-mentioned numerous node any one and have.Therefore, in given Routing Area, broadcasting the address for one can corresponding a plurality of node.Appoint and to broadcast agreement and must set up and safeguard to appoint and broadcast address necessary message information when node for data forwarding.
The course of work of AAODV agreement is as follows: when mobile node need send data, when but can not find suitable path in routing table, this mobile node is just broadcasted routing information request.If this routing information request can arrive destination node, then destination node is just returned the answer solicited message to above-mentioned mobile node; Otherwise just return error reporting.Mobile node can also be in some relevant informations of broadcasting of subrange intercycle, so that can obtain the position of next-hop node, and the routing table that upgrades in time, whether detect simultaneously has new mobile node to add network.In order to reduce extra communication overhead,, can will appoint by the control signaling and broadcast map addresses in unicast address according to the AAODV agreement.
But, existing AAODV agreement is not considered the particularity of Peer-to-Peer business, especially when the mobile node in the Ad Hoc network is a lot, seek destination node by great deal of nodes forwarding data and can consume a large amount of Internet resources and time, and the AAODV agreement does not adopt the professional search method that is fit to Peer-to-Peer yet, lacks the support to retrieval service.Therefore, AAODV agreement and be not suitable for the Peer-to-Peer business.
Summary of the invention
In view of above-mentioned existing in prior technology problem, the embodiment of the invention provides a kind of Ad Hoc network route method (Anycast based AODV routingprotocol for peer to peer services in MANET) of the Peer-to-Peer business that is applicable to based on random broadcast mode, is called for short AAPP.This method is applicable to that " with the resource is the route of " center " to peer topeer business.
For achieving the above object, the invention provides a kind of routing method for mobile multi-hop grouping wireless network based on random broadcast mode, comprising: source node sends a routing request packet that comprises traffic value and anycast group address, source node place; The forward node that receives described routing request packet is searched destination node in the anycast group at this forward node place, if do not find, then adopt function algorithm to determine and the nearest anycast group of this forward node place anycast group according to the anycast group address information, and described routing request packet is sent to described nearest anycast group, in described nearest anycast group, to continue to search described destination node; By that analogy, up to finding destination node; Set up communicating to connect of source node and destination node.
Description by technique scheme as can be known, the embodiment of the invention is by setting up anycast group, increase traffic value and anycast group address in routing request packet in Ad Hoc network, utilize function algorithm to search the purpose anycast group simultaneously, realized searching fast corresponding destination node, the network traffics that improved resource retrieval search efficiency, balance, reduced propagation delay time, improved link utilization efficient, improve network performance, can better support peer to peer business.The method for routing of having realized the resource discovering of peer to peer and localization method and Ad Hoc network by this method merges, and combines and appoint characteristics of broadcasting route, be particularly useful for peer to peer business " with the resource is the route of " center ".
Description of drawings
Fig. 1 is the schematic diagram of the RREQ packet format that provides of the embodiment of the invention;
Fig. 2 is the schematic diagram of the RREP packet format that provides of the embodiment of the invention;
Fig. 3 is RREQ packet generation, the transmission flow figure that the embodiment of the invention provides;
Fig. 4 is that the flow chart that RREQ wraps is handled and transmitted to the forward node that the embodiment of the invention provides;
Fig. 5 is the illustraton of model that utilizes Chord algorithm process anycast group ID that the embodiment of the invention provides;
Fig. 6 is the scope of business and discovery illustraton of model that the embodiment of the invention provides;
Fig. 7 is realization service discovering and the positioning flow figure that the embodiment of the invention provides.
Embodiment
The embodiment of the invention is by setting up anycast group in Ad Hoc network, in routing request packet, increase traffic value and anycast group address (being anycast group ID), can find the purpose anycast group address of routing request packet rapidly by function algorithm, and in anycast group, determine fast destination node, set up communicating to connect between source node and the destination node, greatly improved the Internet resources recall precision.
In embodiments of the present invention, some nodes are formed an anycast group, each anycast group has a unique anycast group ID, and the anycast group ID of nodes sharing in each group.Source node sends a routing request packet that comprises traffic value and anycast group address, place, this traffic value is that the keyword to the business of source node request carries out obtaining after the hash function computing, the business information that promptly comprises the source node request in this routing request packet, the forward node that receives described routing request packet is searched destination node in the anycast group at this forward node place, if do not find, then adopt function algorithm to determine and the nearest anycast group of this forward node place anycast group according to the anycast group address information, and described routing request packet is sent to described nearest anycast group, in described nearest anycast group, to continue to search described destination node; By that analogy, up to finding destination node; Set up communicating to connect of source node and destination node.
Below in conjunction with accompanying drawing the embodiment of the invention is described in detail.
In the prior art, there are not traffic value and anycast group id field in RREQ (routing request packet) form.Among the AAPP that the embodiment of the invention provides, in the RREQ bag, traffic value and anycast group id field have been increased.The RREQ packet format that increases above-mentioned field as shown in Figure 1.Fig. 1 is the schematic diagram of the RREQ packet format that provides of the embodiment of the invention, and the Service Key that increases newly among the figure represents traffic value, and Anycase groupID represents the anycast group address, and RREQ wraps other original form and do not change as can be seen.
Same, among the AAPP that the embodiment of the invention provides, in RREP (route replies bag), having increased the anycast group id field, the RREP packet format of increase anycast group id field is as shown in Figure 2.Fig. 2 is the schematic diagram of the RREP packet format that provides of the embodiment of the invention, and the Anycase groupID that increases newly among the figure represents the anycast group address, and RREP wraps other original form and do not change as can be seen.
In the embodiment of the invention, the RREQ bag is produced and is sent by source node.In an anycast group, in a node (source node) need route on the same group during another node (destination node), source node can check that at first all and source node have the newly added node of identical anycast group address, judges whether to have multilink between source node and destination node; If there is multilink, source node will be selected the link of a jumping figure minimum, simultaneously with destination node as server node, the storage relevant information; If there is not link, then source node is appointed and is broadcast RREQ bag, seeks to the destination node route hop count field zero clearing in this RREQ bag, and interior each IP addresses of nodes of this anycast group of storage and sequence number in this RREQ bag, the configuration and the mode of unicast of other field are similar.Receive the request package of source node when destination node after, comprise in the route replies bag that sends when replying source node: the anycast group address of the IP address of destination node and destination node place anycast group with mode of unicast.Fig. 3 is the flow chart of RREQ packet generation, process of transmitting, below in conjunction with Fig. 3 this flow process is described in detail, and step is as follows:
Step 30: when source node need be set up to the link of destination node, check routing table, judge between source node and destination node, whether there is at least one link.If there is not such link, then carry out step 310, if exist such link then carry out step 31.
Step 31: have at least one link between source node and the destination node, then source node is selected a minimum link of jumping figure.
Step 32: after source node is selected the minimum link of jumping figure, judge whether the link that exists jumping figure identical, judge whether that promptly link with fewest number of hops has the link of same number of hops; If exist, then carry out step 33, if do not exist, then carry out step 34.
Step 33: source node is selected that the longest link of life cycle, as the link that is connected with destination node.
Step 34:, set up being connected of source node and destination node, and destination node is stored relevant information as server node according to the link of selecting.
Step 310: because source node does not find the path to destination node, so source node is created a RREQ bag, and this RREQ bag of initialization, be about to the hop count field zero clearing in the bag, and coexist other IP addresses of nodes and the sequence number of an anycast group of storage and source node in this bag, the configuration of other field and the mode of clean culture are similar.
Step 311: source node is appointed and is broadcast this RREQ bag.
When a forward node is received the RREQ bag, at first judge the value of the sign flagA of RREQ bag; If A is zero, illustrate that then this RREQ bag is a unicast packet, this forward node is just handled this RREQ bag according to the mode of clean culture; If A is 1, illustrate that then this RREQ bag is to appoint unicast packets, this forward node just need judge whether received identical RREQ at synchronization with initial ip address according to the anycast group ID in this RREQ bag, if received identical RREQ bag, just loses the up-to-date identical RREQ bag of receiving.If learning, the forward node judgement do not receive identical RREQ bag before this, then at first check node address and the identical node of RREQ bag source address in the routing table, the IP address of judging this source node whether change (because each node location, address may change at any time in the network), then the source node address in the RREQ bag is updated to the new IP address of source node if change, the renewal class of operation of this renewal operation and clean culture seemingly.Then, if this forward node and destination node are in same anycast group or have the path of an anycast group from this forward node to the destination node place at least, this forward node is just created RREP bag and is sent to this source node in the mode of clean culture, and the notification source node arrives the path of destination node; If this forward node and destination node be in same anycast group, and do not have the path of the anycast group from this forward node to the destination node place, then this forward node upgrades above-mentioned RREQ bag, then it is broadcasted, and seeks the route to destination node.Fig. 4 is the flow chart that the RREQ bag was handled and transmitted to forward node, and the step that the RREQ bag was handled and transmitted to forward node is as follows:
Step 401: after forward node is received the RREQ bag, judge that the flagA of RREQ bag indicates,, then carry out step 403,, then carry out step 402 if A equals 1 if A equals zero.
Step 402: forward node judges whether received identical RREQ at synchronization according to the anycast group ID in this RREQ bag with initial ip address, if received identical RREQ bag, then carry out step 404, if do not receive, then carry out step 405.
Step 403: forward node is handled this RREQ bag with mode of unicast.
Step 404: the RREQ bag identical with above-mentioned RREQ bag that forward node will newly be received abandons.
Step 405: forward node is checked in the routing table and is wrapped the identical node in source node IP address with RREQ judge whether this source node IP address changes, if having, then the source node IP address in the RREQ bag is updated to the new IP address of source node.
Step 406: forward node judges between the destination node of this node and RREQ bag whether have the path, if exist, carry out step 407, if do not exist, carry out step 408.
Step 407: forward node initialization RREP wraps, and carries the IP address and the anycast group address, destination node place of destination node in this RREP bag.Carry out step 409.
Step 408: because there be not the path of forward node, after forward node upgrades the RREQ bag, with its broadcasting to destination node.
Step 409: forward node is issued source node with the RREP bag in the mode of clean culture.
In the embodiment of the invention, search the anycast group at destination node place fast according to function algorithm, determine to determine that the principle of destination node is as follows behind the anycast group of destination node place: in AAPP, after setting up anycast group, routing table of each node maintenance, routing table inlet (being first node in the routing table) comprising: anycast group ID, purpose IP address, aim sequence number, interface, jumping figure, last jumping figure, next jumping, life cycle and route indicate.The AAPP that provides in the embodiment of the invention is based on the route of AODV agreement and improves agreement, in the routing table of initiating routing node, increased the anycast group id field, the a plurality of adjacent anycast groups of storage address forms the tabulation of anycast group address ID in the routing table of each node in anycast group.By inquiring about this anycast group ID tabulation, node just can be searched relevant anycast group fast.After source node sends the RREQ bag, traffic value in this bag shows the business of source node needs, forward node can utilize function algorithm to carry out computing after receiving this RREQ bag, and draws the anycast group address nearest with the anycast group at present node place in conjunction with the anycast group address information.In embodiments of the present invention, the function algorithm that is used to search destination node is the Chord algorithm, in other words can locate the anycast group that provides professional with the Chord algorithm exactly.Source node sends a routing request packet that comprises traffic value and anycast group address, source node place, after forward node is received this routing request packet, in the anycast group at this forward node place, search destination node, if do not find, then adopt function algorithm to determine and the nearest anycast group of this forward node place anycast group according to the anycast group address information, and described routing request packet is sent to described nearest anycast group, in described nearest anycast group, to continue to search described destination node; By that analogy, up to by appoint broadcast route technology and in anycast group, find destination node after, set up communicating to connect of source node and destination node.Node in each anycast group in the network provides similar business, and when providing each anycast group of different business to be distributed in the network with certain rule, the embodiment of the invention can find destination node faster.
In same anycast group, the ID of each node is the sign that is different from other node, and node ID and this node IP address are one to one.
Below in conjunction with Fig. 5 the method for utilizing the Chord algorithm to handle anycast group ID is introduced.Fig. 5 is the illustraton of model that utilizes Chord algorithm process anycast group ID.Among Fig. 5, G
1, G
2, G
t, G
kBe the several anycast groups in numerous anycast groups on the Chord ring.Supposing has 2 in network
32Individual node, they are respectively in each anycast group on the Chord ring.When routing request packet is sought destination node, determine nearest anycast group address, anycast group address with the source node place by utilizing the Chord algorithm, along NRI (Next RingInterval, next jumping in the ring) direction enters adjacent anycast group and seeks, by that analogy, can find the purpose anycast group fast.
Introduce the several expression formulas in the Chord algorithm below:
Entry[j] .start: the anycast group of representing j node place on the Chord ring initial position,
Entry[j] .start=(n+2
J-1) mod2
32, 1≤j≤32 (1) (wherein n represents the side-play amount of j node, i.e. residing position in Chord ring, this value is set initialized the time)
Expression formula (1) has been represented the algorithm of anycast group residing position on the Chord ring at j node place.
NRI[j]＝[Entry[j].start，Entry[j+1].start]，1≤j≤32 (2)
Expression formula (2) has been represented the central spacer of the anycast group at the anycast group at j node place and next-hop node place, i.e. the scope of the ring that covers of j node.
Entry[j] .start → GID (G), 1≤j≤32 (3) (G represents j the residing anycast group of node)
Expression formula (3) expression is determined and the nearest anycast group address of anycast group at present node place according to the Chord algorithm when not having destination node in the anycast group at j node place, is entered this anycast group along the NRI direction and seek destination node.
Be described in detail utilizing the Chord algorithm to search the purpose anycast group below.When source node A needs specificly when professional, source node A at first produces a traffic value, and this value is carried out Hash operation by the professional keyword to above-mentioned business and obtained, and source node sends the RREQ that carries traffic value and wraps then.
When the destination node of routing request packet and source node during not at same anycast group, if a forward node is received this RREQ, and this forward node is the clean culture node, then it does not provide any business, therefore it only broadcasts the RREQ bag that has traffic value, perhaps gives contiguous node with the RREQ bag clean culture of default anycast group ID.
When one appoint broadcast node and receive this RREQ bag as forward node after, provided this traffic value corresponding service just if should broadcast node, it just wraps to the RREP that one of source node transmission comprises destination node IP address and destination node place anycast group ID; If this broadcasts node is not destination node, and with destination node not at same anycast group, then this is broadcast node and checks that (the finger table is the table that is used for keeping the design of Chord ring in the Chord algorithm to the finger table of place anycast group, from this table, can find the neighbor node in the Chord ring, and utilize the Chord algorithm to select an anycast group S nearest next-hop node just), with present node place anycast group.Then, this is broadcast node and checks all nodes identical with the ID of anycast group S in the routing table, judges whether to exist a communication link.If a lot of bar links are arranged, then select minimum that of jumping figure, and destination node as server node.If there is not such link among the anycast group S, it will broadcast the RREQ bag again to its neighbor node, search the route to destination node.
Fig. 6 is the scope of business and discovery illustraton of model that the embodiment of the invention provides.Be described in detail utilizing the Chord algorithm to search the purpose anycast group below in conjunction with Fig. 6.Among Fig. 6, E, F, G node are at anycast group G (S
1) in, G (S
1) provide and traffic value k
1Corresponding service; I, J, K node are at anycast group G (S
i) in, G (S
i) provide and traffic value k
iCorresponding service; L, M, N node are at anycast group G (S
t) in, G (S
t) provide and traffic value k
tCorresponding service.When clean culture node A needs specific and traffic value k
tDuring corresponding service, clean culture is given the default anycast group ID of adjacent node, is carried traffic value k
tRREQ (k
t, Default) bag.RREQ (k
t, Default) bag unicasts to appoint through the D node and broadcasts node E, when the E node does not have destination node in searching the anycast group of finding the place, according to the Chord algorithm, determines that nearest anycast group is S
2, and pass through the G node with RREQ (k
t, S
2) bag is sent to anycast group G (S
2).And the like, RREQ (k
t, S
t) the very fast arrival purpose anycast group G (S of bag
t), and route to destination node.After destination node is received this RREQ bag, send the RREP bag that carries destination node IP address, anycast group address, destination node place with mode of unicast to source node.
Fig. 7 is realization service discovering and the positioning flow figure that the embodiment of the invention provides, and this process step is as follows:
Step 701: clean culture node need with traffic value k
tSo corresponding service is broadcasting RREQ (k
t) bag, seek route to destination node.Forward node judges whether this node is source node, if source node carry out step 702, if not source node carry out step 703 after receiving this RREQ bag.
Step 702: the RREQ (k of the default anycast group of this node broadcasts address
t, Default) bag.
Step 703: node (forward node) receives RREQ (k
t, Default) bag is searched the back and is found not have link between this node and the destination node.
Step 704: above-mentioned forward node upgrades RREQ (k
t, Default) behind the bag,, seek route to destination node with its broadcasting.
Step 705: when another forward node receives RREQ (k
t, Default) behind the bag,, then carry out step 703 if this node is the clean culture node, if this node is to appoint to broadcast node, then carry out step 706.
Step 706: judge that this broadcasts node whether in anycast group,, then carry out step 707,, then carry out step 708 if not in anycast group if in anycast group.
Step 707: should appointing in anycast group broadcast node and receive RREQ (k
t, Default) behind the bag, in the anycast group of place by appoint broadcast search whether exist and destination node between the path, find not exist, carry out step 708.
Step 708: with Chord algorithm positioning service value is k
tThe anycast group at node place.Promptly this node is determined the nearest anycast group address of anycast group at present node place according to the finger table of anycast group by the Chord algorithm.
Step 709: appoint and broadcast node broadcasts RREQ (k
t, S
I+1) bag, search route to destination node.
Step 710: as anycast group S
iIn appoint broadcast node and receive above-mentioned request package after, if find anycast group S
iBe the purpose anycast group, promptly the nearest anycast group of the anycast group with the present node place that obtains according to the Chord algorithm in the step 708 then carry out step 711, if not, then at definite S
iDo not have in the group carry out step 709 after the destination node.
Step 711: search destination node by in group, appointing to broadcast, judge that whether having traffic value in this anycast group is k
tDestination node, if exist, carry out step 712, if do not exist, carry out step 708.
Step 712: this destination node sends the RREP bag that has destination node IP address and corresponding anycast group ID to source node.
Step 713: source node is determined a shortest path that arrives destination node according to destination node IP address.
Step 714: service discovering and position fixing process finish.
In sum, the embodiment of the invention is by setting up anycast group, increase traffic value and anycast group address in routing request packet in Ad Hoc network, realized determining fast the purpose anycast group, and broadcast the route querying respective nodes by appointing, the network traffics that improved resource retrieval search efficiency, balance, reduced propagation delay time, improved link utilization efficient, improve network performance, can better support peer to peer business.Therefore can effectively avoid the invalid re-transmission of data, save data transmission resources and time, thereby improve data transmission efficiency greatly.
Though described the present invention by embodiment, those of ordinary skills know, the present invention has many distortion and variation and do not break away from spirit of the present invention, and the claim of application documents of the present invention comprises these distortion and variation.
Claims (9)
1, a kind of routing method for mobile multi-hop grouping wireless network based on random broadcast mode is characterized in that, described method comprises:
Source node sends a routing request packet that comprises traffic value and anycast group address, source node place;
The forward node that receives described routing request packet is searched destination node in the anycast group at this forward node place, if do not find, then adopt function algorithm to determine and the nearest anycast group of this forward node place anycast group according to the anycast group address information, and described routing request packet is sent to described nearest anycast group, in described nearest anycast group, to continue to search described destination node; By that analogy, up to finding destination node;
Set up communicating to connect of source node and destination node.
2, the method for claim 1 is characterized in that, described anycast group is made up of plurality of nodes, and each anycast group has unique anycast group address, the anycast group address of nodes sharing in each anycast group.
3, method as claimed in claim 1 or 2 is characterized in that, the traffic value that comprises in the described routing request packet is to be undertaken obtaining after the functional operation by the keyword to the business of source node request.
4, method as claimed in claim 1 or 2 is characterized in that, a plurality of adjacent anycast groups of storage address in the routing table of each node forms the anycast group address list in the anycast group.
5, method as claimed in claim 1 or 2, it is characterized in that, after described destination node is received the request package of source node, when replying source node, in the route replies bag of its transmission, comprise: the anycast group address of the IP address of destination node and destination node place anycast group with mode of unicast.
6, method as claimed in claim 1 or 2 is characterized in that, described method also comprises, when source node need communicate to connect with the destination node in the same anycast group:
If source node finds and destination node between have multilink, then source node is selected the link that jumping figure is minimum, sets up and the communicating to connect of destination node, and simultaneously destination node is stored relevant information as server node;
If source node can not find and destination node between link, source node is appointed and is broadcast a routing request packet, searches the route to destination node, each address of node and sequence number in the anycast group of storage source node place in this routing request packet.
7, method as claimed in claim 1 or 2, it is characterized in that, described destination node and source node during when routing request packet not at same anycast group, if receiving the forward node of routing request packet is the clean culture node, then this clean culture node broadcasts has the routing request packet of traffic value, or the routing request packet of the default anycast group of adjacent node address is given in clean culture.
8, method as claimed in claim 4, it is characterized in that, described destination node and source node during when routing request packet not at same anycast group, if receive the forward node of routing request packet is to appoint to broadcast node, broadcast the finger table that node is checked to comprise anycast group address list information, and adopt functional operation to determine and the described nearest anycast group address of anycast group of broadcasting the node place for described.
9, method as claimed in claim 8 is characterized in that, broadcasts node for described and checks in the routing table node in the anycast group identical with described nearest anycast group address, judges whether to exist the communication link of destination node;
If there are many links to destination node, then appoint and broadcast node and select that minimum link of jumping figure, and destination node as server node;
If there is not such link, broadcast node for then described and broadcast routing request packet again to his neighbor node, search route to destination node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2007101756054A CN101409905A (en) | 2007-10-08 | 2007-10-08 | Routing method for mobile multi-hop grouping wireless network based on random broadcast mode |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2007101756054A CN101409905A (en) | 2007-10-08 | 2007-10-08 | Routing method for mobile multi-hop grouping wireless network based on random broadcast mode |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101409905A true CN101409905A (en) | 2009-04-15 |
Family
ID=40572638
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA2007101756054A Pending CN101409905A (en) | 2007-10-08 | 2007-10-08 | Routing method for mobile multi-hop grouping wireless network based on random broadcast mode |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101409905A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101945339A (en) * | 2010-07-02 | 2011-01-12 | 哈尔滨工程大学 | Cognitive radio self-organization network message multicast transmission method |
| CN102136990A (en) * | 2010-06-09 | 2011-07-27 | 华为技术有限公司 | Service routing method and system of service superposition network |
| CN102572993A (en) * | 2012-01-31 | 2012-07-11 | 北京航空航天大学 | Opportunistic network Anycast routing method based on comprehensive ability selection |
| CN106777332A (en) * | 2017-01-12 | 2017-05-31 | 山东大学 | The system and method for file where file is found in a kind of Android terminal by file identification |
| CN110380959A (en) * | 2018-04-13 | 2019-10-25 | 华为技术有限公司 | Method for forwarding message and device |
-
2007
- 2007-10-08 CN CNA2007101756054A patent/CN101409905A/en active Pending
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8780883B2 (en) | 2010-06-09 | 2014-07-15 | Huawei Technologies Co., Ltd. | Service routing method and system on service overlay network |
| CN102136990A (en) * | 2010-06-09 | 2011-07-27 | 华为技术有限公司 | Service routing method and system of service superposition network |
| WO2011153909A1 (en) * | 2010-06-09 | 2011-12-15 | 华为技术有限公司 | Service routing method and system in service overlay network |
| CN102136990B (en) * | 2010-06-09 | 2013-11-06 | 华为技术有限公司 | Service routing method and system of service superposition network |
| CN101945339A (en) * | 2010-07-02 | 2011-01-12 | 哈尔滨工程大学 | Cognitive radio self-organization network message multicast transmission method |
| CN101945339B (en) * | 2010-07-02 | 2013-03-20 | 哈尔滨工程大学 | Cognitive radio self-organization network message multicast transmission method |
| CN102572993A (en) * | 2012-01-31 | 2012-07-11 | 北京航空航天大学 | Opportunistic network Anycast routing method based on comprehensive ability selection |
| CN102572993B (en) * | 2012-01-31 | 2014-09-17 | 北京航空航天大学 | Opportunistic network Anycast routing method based on comprehensive ability selection |
| CN106777332A (en) * | 2017-01-12 | 2017-05-31 | 山东大学 | The system and method for file where file is found in a kind of Android terminal by file identification |
| CN106777332B (en) * | 2017-01-12 | 2020-03-20 | 山东大学 | System and method for finding folder where file is located through file identification in Android terminal |
| CN110380959A (en) * | 2018-04-13 | 2019-10-25 | 华为技术有限公司 | Method for forwarding message and device |
| CN110380959B (en) * | 2018-04-13 | 2020-11-17 | 华为技术有限公司 | Message forwarding method and device |
| US11477114B2 (en) | 2018-04-13 | 2022-10-18 | Huawei Technologies Co., Ltd. | Packet forwarding method and apparatus |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Jain et al. | Geographical routing using partial information for wireless ad hoc networks | |
| US6744740B2 (en) | Network protocol for wireless devices utilizing location information | |
| US8134995B2 (en) | Mobile ad-hoc network routing based upon hardware address | |
| CN105577547A (en) | Multi-Qos based route selection method in mobile self-organizing network | |
| CN101102283A (en) | A method and device for optimizing unknown unicast forward at wireless access point | |
| Prabu et al. | Energy efficient routing in MANET through edge node selection using ESPR algorithm | |
| Bhangwar et al. | On routing protocols for high performance | |
| CN101409905A (en) | Routing method for mobile multi-hop grouping wireless network based on random broadcast mode | |
| Banka et al. | Angle routing protocol: location aided routing for mobile ad-hoc networks using dynamic angle selection | |
| Omar et al. | On-demand source routing with reduced packets protocol in mobile ad-hoc networks | |
| Ramalakshmi et al. | Weighted dominating set based routing for ad hoc communications in emergency and rescue scenarios | |
| Lavanya et al. | Research and survey on multicast routing protocols for MANETs | |
| Kumar et al. | Simulation based performance analysis of routing protocols using random waypoint mobility model in mobile ad hoc network | |
| CN110121185A (en) | A kind of power distribution communication network route optimization method | |
| Saxena et al. | Multi-objective based route selection approach using AOMDV in MANET | |
| Xiuli et al. | A novel multipath disjoint routing to support ad hoc wireless sensor networks | |
| Cynthia et al. | A survey on MANET protocols in wireless sensor networks | |
| Le et al. | An efficient hybrid routing approach for hybrid wireless mesh networks | |
| Alassery et al. | Context information aggregation mechanism based on bloom filters (CIA-BF) for high performance monitoring applications of Internet of things | |
| Chen et al. | Shortcut anycast tree routing in MANETs | |
| Chang et al. | A location-aware routing protocol for the bluetooth scatternet | |
| Gelenbe et al. | A power-aware routing algorithm | |
| Mitra et al. | A Modified Algorithmic Approach of DSDV Routing Protocol for Wireless Ad Hoc Network | |
| Jie | Ad hoc access gateway selection algorithm | |
| Zhang et al. | A Novel Road Topology-aware Routing in VANETs |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Open date: 20090415 |