CN102143561A - Position-based data packet forward method in wireless self-organized network - Google Patents
Position-based data packet forward method in wireless self-organized network Download PDFInfo
- Publication number
- CN102143561A CN102143561A CN2011100825570A CN201110082557A CN102143561A CN 102143561 A CN102143561 A CN 102143561A CN 2011100825570 A CN2011100825570 A CN 2011100825570A CN 201110082557 A CN201110082557 A CN 201110082557A CN 102143561 A CN102143561 A CN 102143561A
- Authority
- CN
- China
- Prior art keywords
- node
- neighbor
- destination
- nodes
- location
- 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
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a position-based data packet forward method in a wireless self-organized network in the technical field of a wireless network, comprising the steps of: after a source node receives a data packet message, decapsulating a target node address for checking the node and position information of a target node; and then carrying out selection and optimization of paths on data transmission. When the node moves at a speed of 70m/s, the packet loss ratio of the transmission method adopting the position-based data packet forward method is obviously better than that of the GPSR (Global Position System Receiver) technology.
Description
Technical field
What the present invention relates to is the method in a kind of radio network technique field, specifically is location-based data packet forwarding method in a kind of wireless self-organization network.
Background technology
Wireless self-organization network is as a kind of novel mobile multi-hop wireless network, with traditional wireless network many different characteristics being arranged: 1. the group certainly of network---the support that the maximum mutually characteristics of MANET exactly can be at any time, any place does not need existing basic network facility (as the base station) builds a mobile communications network fast; 2. the network topology structure of dynamic change---in MANET, communication nodes can add and disappear arbitrarily, moves in net with arbitrary speed and any-mode, and the network topology structure that forms by wireless channel between the communication nodes may change at any time; 3. limited wireless transmission bandwidth---because MANET adopts Radio Transmission Technology as the bottom communication means, and because the physical characteristic of wireless channel itself, the relative wire message way of the network bandwidth that it can provide is much lower; 4. distributed control network---the communication nodes in the MANET all has both independent route and host function, there is not a network center control point, status between the communication nodes is an equality, network routing protocol adopts distributed control mode usually, thereby has very strong robustness and survivability.
It is to be noted, limited bandwidth at the MANET network, how characteristics such as the topological dynamic change of network make numerous communication nodes rationally take efficiently between Radio Resource and source node and purpose node and set up the key problem that effective route becomes wireless self-organization network.Particularly under battlefield surroundings, the translational speed of node increases, and when the change in topology of network is frequent, how to guarantee the challenging especially problem of validity of route.Tradition can't satisfy the demand of quick change in topology based on the wireless self-networking Routing Protocol of topology.
Find through literature search prior art, the paper that Brad Karp delivered among the MobiCom in 2000 " GPSR:Greedy Perimeter Stateless Routing for Wireless Networks " (the greedy peripheral stateless route of wireless self-organization network), greedy peripheral forwarding strategy GPSR based on the communication nodes positional information has been proposed in this article, the network service node can be by the positional information of acquisitions such as GPS self in reality, and algorithm provides feasibility for this reason.Node can obtain the positional information of other nodes in the network by location-based service, thereby uses location-based wireless self-networking routing algorithm.GPSR is typical location-based Routing Protocol, so GPSR is a kind of stateless Routing Protocol, both do not exchanged periodically routing iinformation, do not carry out route requests by the broadcasting inundation yet, do not store routing iinformation yet, so reduced the consumption of agreement bandwidth in the network, also reduced requirement to the node disposal ability, this is based on the general advantage of position route.The message of GPSR is transmitted and is mainly contained greedy the forwarding and peripheral these two kinds of forward modes of transmitting:
The greedy forwarding used operable the time any; The edge is transmitted, and transmits disabled zone in greediness and uses.So-called greedy the forwarding is exactly the positional information that all records neighbours' node in the neighbor entry of the node that moves GPSR.So it can jump node as next by the nearest neighbours' node of chosen distance purpose node when node E-Packets.So in the ideal case, data message finally can be forwarded to the purpose node with minimum jumping figure.But ought not nearer apart from purpose node neighbours' node than source node, greedy forwarding will be failed, and the author of GPSR has proposed to carry out the forwarding of periphery traversal when failure.It is exactly to make up a plane graph that so-called periphery traversal is transmitted, and uses right-hand rule to carry out the periphery traversal then, will form a path to the purpose node like this.By discovering, the GPSR agreement has following limitation: at first the greedy thought of transmitting of GPSR agreement is to select as far as possible next jumping of " far ", so just might cause having made retransmission failure at next moment neighbours' node not in communication range; When adopting the periphery traversal to transmit, because employing is smooth figure traversal method, institute will not be so that the GPSR agreement will be suitable for three-dimensional situation; And use the right-hand rule traversal of smooth figure certainly will introduce more jumping figure, thereby increased time delay end to end.
Summary of the invention
The present invention is directed to the prior art above shortcomings, location-based data packet forwarding method in a kind of wireless self-organization network is provided, when node moves with 70m/s speed, adopt transmission method packet loss of the present invention significantly better than existing GPSR technology.
The present invention is achieved by the following technical solutions, the present invention includes following steps:
The route discovery procedure that the first step, information are obtained: after source node is received the packet literary composition, the destination node location of node and the positional information of destination node are checked in decapsulation, specifically comprise: destination locations information obtains the positional information of neighbor node by unified location-based service, and the hello packet by neighbours one jumps broadcasting and obtains and store in the neighbor node table, by periodic Hello more newly arrive real-time effective information that continues maintenance of neighbor and the path that obtains to lead to destination node by the maintenance of information of neighbor nodes.
The Path selection of second step, transmission data: on the basis that first step neighbor information is safeguarded, the network address and the horizontal partition principle of positional information employing according to destination node after source node is received message are selected how to arrive the next-hop node of destination node and obtain optimal path;
Described level is cut apart and is meant: when source node no longer is that the data that then send out will no longer be transmitted back this source node when receiving the next-hop node of packet; Then the nearest node of all neighbor node middle distance destination nodes of preferred source node is jumped as next on loop-free basis, when all neighbor nodes apart from the distance of destination node all greater than source node apart from destination node apart from the time, select the neighbor node of purpose deflection minimum to transmit data as next-hop node.
Described purpose direction is meant: the source node is called the purpose direction of this source node to the ray side of purpose node; Described purpose deflection is meant: the purpose direction rotates to the absolute value of the minimum value of the angle that neighbours' direction rotated.
The 3rd step, the unreachable processing procedure in path: all store into two feasible successor nodes in the topology table, judge when node selects next to jump whether optimum next jumping has run counter to horizontal partition principle, when running counter to horizontal partition principle, then be designated the last hop node of this node unreachable and reselect the feasible successor node; When a feasible successor node only being arranged and, this node being transmitted packet as next-hop node without prejudice to horizontal partition principle; Then will be self-marked as the route poison and return to a last hop node when running counter to, be that node receives that the Hello bag that has the route poison does not then send data to this node, check by a last hop node whether other feasible successor nodes are arranged again, when having other feasible successor nodes, then do not return the unreachable message of destination node to source node.
Described route poison is about to hop count and is labeled as maximum or unreachable; Described Hello bag is the message of exchanging routing information between two nodes.
Description of drawings
Fig. 1 is the schematic diagram of the definition of using among the present invention;
Among the figure: purpose direction, neighbours' direction, purpose direction forward angle, purpose direction negative sense angle, neighbours' direction negative sense angle.Node is the networking node in the wireless self-networking, and dotted arrow is a movement direction of nodes, and the entity black line is for transmitting data path.
Fig. 2 is the schematic diagram that packet is transmitted routing process;
Among the figure: the S node is a source node, and the D node is a destination node.Circle is the forwarding radius of S node, and dotted arrow is a movement direction of nodes, and the entity black line is for transmitting data path.
The schematic diagram that Fig. 3 loop procedure is described;
Among the figure: the S node is a source node, and the D node is a destination node.The arrow direction is the Path selection direction.
Fig. 4 is the schematic diagram that GPSR periphery traversal is transmitted the result;
Among the figure: the S node is a source node, and the D node is a destination node, and the arrow direction is the Path selection direction.
Fig. 5 improves the schematic diagram that the result is transmitted in the back according to the present invention;
Among the figure: the S node is a source node, and the D node is a destination node, and the arrow direction is the Path selection direction.
Fig. 6 is the present invention and the existing GPSR technology comparison diagram at NS-2 simulated experiment packet loss;
Among the figure: horizontal longitudinal direction is the maximum translational speed of node, and the m/s of unit, y direction are packet loss.
Embodiment
Below in conjunction with accompanying drawing embodiments of the invention are elaborated and below in conjunction with accompanying drawing embodiments of the invention to be elaborated: present embodiment is being to implement under the prerequisite with the technical solution of the present invention; provided detailed execution mode and concrete operating process, but protection scope of the present invention is not limited to following embodiment.
Present embodiment comprises the steps:
The first step, route discovery procedure:
Node itself obtains self positional information by navigation system (as GPS), carries out unified management by the global position service.When node will mail to certain destination node data, at first obtain the positional information of destination node, then encapsulation of data according to the network address request global position service of destination node.The physical location that this destination node has been arranged, source node can calculate distance and the purpose direction of this node to destination node in conjunction with the physical location of oneself.Exchange hello packet by the cycle between neighbours obtains the position and the velocity information of neighbor node, and each node all will be safeguarded a neighbor information table, as following table:
Table 1
Each node obtains to lead to the feasible path of other multi-hop destination nodes by the maintenance of neighbor information table.
The information of neighbor nodes definition as shown in Figure 1.
The purpose direction: source node is called the purpose direction of this source node to the ray side of destination node.S-＞D for example.
Neighbours' direction: a node is called neighbours' direction of this node to the directions of rays of its neighbor node.S-＞A for example, S-＞F.
The purpose direction just (is being born) to angle: neighbours' direction is called the purpose direction and just (is bearing) to angle (0 °≤α≤180 °) by rotate to angle that the purpose direction rotated along (contrary) hour hands.The forward angle be on the occasion of, the negative sense angle is a negative value.
The purpose deflection: the absolute value that the purpose direction just (is being born) to angle is called the purpose deflection.
The neighbor node position (X, Y, Z): the three dimensional space coordinate value.
Neighbor node distance: air line distance between two nodes.
The neighbours angular separation: the movement velocity of node is a vector, and the node movement velocity is known.Neighbours' direction is called neighbours' direction and just (bears) to angle by rotate to angle that the neighbor node velocity attitude rotated along (contrary) hour hands.The forward angle be on the occasion of, the negative sense angle is a negative value.Its absolute value is called neighbours' deflection.
As shown in Figure 1, the SD directions of rays is the purpose direction, the SA directions of rays is neighbours' direction of neighbor node A, ∠ β is the purpose direction forward angle of neighbor node A,-∠ α is the purpose direction negative sense angle of neighbor node F,-∠ γ is neighbours' direction negative sense angle of node A, and-∠ ε is neighbours' direction negative sense angle of node F.
Second step, Path selection process:
When a source node need send a data message when the destination node, the physical location that source node can be searched destination node according to the network address and the location-based service of destination node according to step 1.Source node judges whether the node that satisfies greedy forwarding condition is arranged in the neighbor node that satisfies neighbours' condition, have then to transmit; When greedy retransmission failure, then search purpose angular separation in the neighbor table, select two less nodes of absolute value to be stored in the subsequent node table as the feasible successor node.In two nodes, select next redirect of conduct of purpose deflection minimum to send out packet afterwards.When the purpose deflection is identical, next judge neighbours angular separation and purpose angular separation phase " with " whether the result identical in the back, different when direction of motion judged result, then preferred neighbours angular separation and purpose angular separation neighbor node are in the same way jumped as next; When the direction of motion judged result by two nodes the same (just be all or be all negative) then one of picked at random as next redirect literary composition of transmitting messages.Then the upper layer data message is packaged into network layer route direction message and is transmitted to this neighbor node, and in header the network address information of adding purpose node location.Receive the direction message of a needs forwarding when an intermediate node after, it can calculate local purpose direction distance according to the physical location of destination node in the header, ensuing work just sees if there is the neighbor node that satisfies greedy algorithm with the same neighbor table that travels through of source node, it's not true then selects the neighbor node of purpose direction optimum and message is forwarded to this node, until text delivery the most at last to destination node.
Instantiation as shown in Figure 2, the S node is a source node, the D node is a destination node, ∠ α=∠ β, the node speed direction as shown in the figure.When the S node selects next to jump, owing to satisfy the greedy neighbor node of transmitting, the therefore purpose deflection size of neighbor node relatively, ∠ α=∠ β be a purpose deflection minimum among all neighbours, so two nodes store in the feasible successor node table; Further whether in the same way to judge neighbours' deflection and purpose deflection according to the velocity attitude of node operation, because node A neighbours deflection and purpose deflection are in the same way, and F neighbours' deflection and purpose deflection are reverse, so node A becomes next-hop node.Node A continue to select next-hop node, has to satisfy the greedy Node B of transmitting and become next-hop node (even if the nearer because level of node S distance objective node this moment is cut apart and also can not selected S to jump as next).Select next to jump to node C successively, node C selects node N to send out data as next redirect according to greedy algorithm, but because node N does not have other neighbor nodes again, therefore will oneself be labeled as the route poison by Hello bag notice node C, node C will can not transmit packet to node N.Node C continues to select node M to send out data as next redirect, until arriving destination node D.Final path is S-＞A-＞B-＞C-＞M-＞L-＞D
When selecting next to jump the path, should guarantee that loop free takes place, when source node S has only a neighbor node A, after giving A with data forwarding, the A node according to step 1 select node S as optimum next jump and continue to transmit data, so just formed loop, become 0 up to TTL data abandoned.Solution also is added on the network layer information of this node in the header with destination node is the same during upper layer data in encapsulation, and next-hop node receives the thought that the employing level is cut apart behind this message and source node is changed to unreachable.It is will no longer be transmitted back by the data that certain node forwards that level is cut apart thought.Concrete loop is avoided the example explanation as shown in Figure 3, among Fig. 3 detailed description the loop example that may run in the engineering, node A should select node S to jump as next according to the routing policy of the first step after receiving message, but avoid the requirement of process according to this step intermediate ring road, source node S is labeled as unreachable, preferred B can not select the S node to jump as next as next jumping again, thereby has avoided loop.
The 3rd step, the unreachable processing procedure in path:
In step 2 initial design select two feasible successor nodes, and finally select the node of purpose direction optimum to jump as next.All store two feasible successor nodes in the topology table this moment, judges when node selects next to jump whether optimum next jumping has run counter to horizontal partition principle, and the process of narrating in not running counter to then according to step 2 is transmitted data; Then will go up a hop node and be designated unreachable and reselect the feasible successor node when running counter to.When a feasible successor node only being arranged and, this node being transmitted packet as next-hop node without prejudice to horizontal partition principle; Then will be self-marked as the route poison and return to a last hop node (node is received the Hello bag that has the route poison when running counter to, do not send data) to this node, check by a last hop node whether other feasible successor nodes are arranged again, as then continuing forwarding, when then returning the unreachable message of destination node to source node.
Be compared with the prior art the present invention following beneficial effect arranged:
1. more excellent Path selection, the present invention adopts greedy direction to transmit after greediness is apart from retransmission failure, and whole process to destination node forwarding data all is based on greedy thought, has reached the degree of path optimization like this.Be illustrated by following example: as shown in Figure 4, the S node is the source node, and the D node is the purpose node.To fail according to the greedy algorithm forwarding strategy, because not nearer node in neighbours' node of S than S node distance D itself.Therefore keep out of the way according to the periphery traversal and transmit, transmit the result as shown in Figure 3, can produce more jumping figure like this, increased time delay end to end.Take target forwarding strategy based on directivity, determine that according to the direction of target the feasible successor node is R and K, what judge purpose deflection minimum afterwards is R (supposing that herein node R and node K velocity component planar all are to move near SD purpose direction), forwarding strategy is that the part is made, and node R repeats this process.It is S-＞R-＞Q-＞P-D that this example is chosen down the path successively, as shown in Figure 5.
2. the transfer rate of packet success, packet transfer rate of the present invention are much better than existing periphery traversal and transmit under the situation of node high-speed mobile.In order to verify beneficial effect of the present invention, adopt the NS2.31[17 of Berkeley University's exploitation] carry out simulating, verifying.Realized the routing forwarding process described in existing GPSR and the present invention on the basis of NS2.31, the basic setup of emulation is as follows: the node number in the network is 30; The MAC agreement is 802.11; Link bandwidth is 1Mbps; The node transmission range is 250m; The translational speed of node maximum is 20m-70m/s; Scene domain is 800m*800m; For the traffic model of node, discharge pattern is CBR (Constant Bit Rate); The bag size is 64byte; Each CBR node is selected a destination node at random as constant code stream node CBR to choose 20 in N simulation node, sends datagram to this destination node with the constant rate 2Hz that gives out a contract for a project then.HELLO wraps transmission cycle 1Hz; The expired 2S of neighbours; Each simulation time is 200s.As shown in Figure 6, under the different situation of node motion maximal rate, the mean value of 10 emulation experiment packet loss of each speed.When node moved with 70m/s speed, packet loss of the present invention was significantly better than existing GPSR technology as can be seen.
Claims (4)
1. location-based data packet forwarding method in the wireless self-organization network is characterized in that, may further comprise the steps:
The route discovery procedure that the first step, information are obtained: after source node was received the packet literary composition, the destination node location of node and the positional information of destination node were checked in decapsulation;
The Path selection of second step, transmission data: on the basis that first step neighbor information is safeguarded, the network address and the horizontal partition principle of positional information employing according to destination node after source node is received message are selected how to arrive the next-hop node of destination node and obtain optimal path;
The 3rd step, the unreachable processing procedure in path: all store into two feasible successor nodes in the topology table, judge when node selects next to jump whether optimum next jumping has run counter to horizontal partition principle, when running counter to horizontal partition principle, then be designated the last hop node of this node unreachable and reselect the feasible successor node; When a feasible successor node only being arranged and, this node being transmitted packet as next-hop node without prejudice to horizontal partition principle; Then will be self-marked as the route poison and return to a last hop node when running counter to, be that node receives that the Hello bag that has the route poison does not then send data to this node, check by a last hop node whether other feasible successor nodes are arranged again, when having other feasible successor nodes, then do not return the unreachable message of destination node to source node.
2. location-based data packet forwarding method in the wireless self-organization network according to claim 1, it is characterized in that, the described first step specifically comprises: destination locations information obtains the positional information of neighbor node by unified location-based service, and the hello packet by neighbours one jumps broadcasting and obtains and store in the neighbor node table, by periodic Hello more newly arrive real-time effective information that continues maintenance of neighbor and the path that obtains to lead to destination node by the maintenance of information of neighbor nodes.
3. location-based data packet forwarding method in the wireless self-organization network according to claim 1, it is characterized in that, described level is cut apart and is meant: when source node no longer is that the data that then send out will no longer be transmitted back this source node when receiving the next-hop node of packet; Then the nearest node of all neighbor node middle distance destination nodes of preferred source node is jumped as next on loop-free basis, when all neighbor nodes apart from the distance of destination node all greater than source node apart from destination node apart from the time, select the neighbor node of purpose deflection minimum to transmit data as next-hop node.
4. location-based data packet forwarding method in the wireless self-organization network according to claim 3 is characterized in that, described purpose direction is meant: the source node is called the purpose direction of this source node to the ray side of purpose node; Described purpose deflection is meant: the purpose direction rotates to the absolute value of the minimum value of the angle that neighbours' direction rotated.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110082557 CN102143561B (en) | 2011-04-01 | 2011-04-01 | Position-based data packet forward method in wireless self-organized network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110082557 CN102143561B (en) | 2011-04-01 | 2011-04-01 | Position-based data packet forward method in wireless self-organized network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102143561A true CN102143561A (en) | 2011-08-03 |
| CN102143561B CN102143561B (en) | 2013-12-25 |
Family
ID=44410714
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201110082557 Expired - Fee Related CN102143561B (en) | 2011-04-01 | 2011-04-01 | Position-based data packet forward method in wireless self-organized network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102143561B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102802121A (en) * | 2012-09-01 | 2012-11-28 | 北京理工大学 | Vehicle-mounted IOT (Internet of Things) routing method on basis of geographical positions |
| CN104579958A (en) * | 2014-12-25 | 2015-04-29 | 东软集团股份有限公司 | GPSR (greedy perimeter stateless routing) protocol based route optimization method and device |
| CN105827525A (en) * | 2015-01-27 | 2016-08-03 | 富士通株式会社 | Device and method for wireless communication used in wireless ad hoc network |
| CN106559344A (en) * | 2015-09-30 | 2017-04-05 | 国网智能电网研究院 | A kind of fault tolerance rout ing method based on geographical location information |
| CN110995509A (en) * | 2019-12-24 | 2020-04-10 | 中国人民解放军火箭军工程大学 | Method for reducing communication interference by selecting and using fewer nodes in Ad Hoc route |
| CN112260742A (en) * | 2020-09-10 | 2021-01-22 | 清华大学 | Fast rerouting method and device in mesh satellite network |
| CN113709843A (en) * | 2021-08-30 | 2021-11-26 | 河南大学 | Position-sensing-based layer cluster type wireless data center network routing method |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101296190A (en) * | 2008-06-27 | 2008-10-29 | 清华大学 | Cooperative communication mode based on game theory in wireless ad hoc network |
| US20100191968A1 (en) * | 2009-01-27 | 2010-07-29 | Sony Corporation | Authentication for a multi-tier wireless home mesh network |
| CN101986727A (en) * | 2010-11-18 | 2011-03-16 | 北京交通大学 | Multipath improvement method of network on-demand distance vector multicast routing protocol and corresponding device |
-
2011
- 2011-04-01 CN CN 201110082557 patent/CN102143561B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101296190A (en) * | 2008-06-27 | 2008-10-29 | 清华大学 | Cooperative communication mode based on game theory in wireless ad hoc network |
| US20100191968A1 (en) * | 2009-01-27 | 2010-07-29 | Sony Corporation | Authentication for a multi-tier wireless home mesh network |
| CN101986727A (en) * | 2010-11-18 | 2011-03-16 | 北京交通大学 | Multipath improvement method of network on-demand distance vector multicast routing protocol and corresponding device |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102802121A (en) * | 2012-09-01 | 2012-11-28 | 北京理工大学 | Vehicle-mounted IOT (Internet of Things) routing method on basis of geographical positions |
| CN104579958A (en) * | 2014-12-25 | 2015-04-29 | 东软集团股份有限公司 | GPSR (greedy perimeter stateless routing) protocol based route optimization method and device |
| CN104579958B (en) * | 2014-12-25 | 2018-07-13 | 东软集团股份有限公司 | Routing optimization method based on GPSR agreements and device |
| CN105827525A (en) * | 2015-01-27 | 2016-08-03 | 富士通株式会社 | Device and method for wireless communication used in wireless ad hoc network |
| CN105827525B (en) * | 2015-01-27 | 2019-04-30 | 富士通株式会社 | Device and method for the wireless communication used in wireless self-organization network |
| CN106559344A (en) * | 2015-09-30 | 2017-04-05 | 国网智能电网研究院 | A kind of fault tolerance rout ing method based on geographical location information |
| CN110995509A (en) * | 2019-12-24 | 2020-04-10 | 中国人民解放军火箭军工程大学 | Method for reducing communication interference by selecting and using fewer nodes in Ad Hoc route |
| CN112260742A (en) * | 2020-09-10 | 2021-01-22 | 清华大学 | Fast rerouting method and device in mesh satellite network |
| CN113709843A (en) * | 2021-08-30 | 2021-11-26 | 河南大学 | Position-sensing-based layer cluster type wireless data center network routing method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102143561B (en) | 2013-12-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Huang et al. | Energy-aware dual-path geographic routing to bypass routing holes in wireless sensor networks | |
| CN102143561B (en) | Position-based data packet forward method in wireless self-organized network | |
| US8134995B2 (en) | Mobile ad-hoc network routing based upon hardware address | |
| Mauve et al. | A survey on position-based routing in mobile ad hoc networks | |
| Stojmenovic et al. | Design guidelines for routing protocols in ad hoc and sensor networks with a realistic physical layer | |
| Awad et al. | Virtual cord protocol (VCP): A flexible DHT-like routing service for sensor networks | |
| Prabu et al. | Energy efficient routing in MANET through edge node selection using ESPR algorithm | |
| Cobo et al. | A location routing protocol based on smart antennas for wireless sensor networks | |
| Bhangwar et al. | On routing protocols for high performance | |
| EP1944924A1 (en) | System, method and computer-readable medium for mobile Ad-hoc network routing based upon hardware address (MAC) | |
| Djenouri et al. | Ad Hoc Networks Routing Protocols and Mobility. | |
| CN104902530A (en) | Location aided routing method applied to wireless Mesh network | |
| Macintosh et al. | Local Area Network Dynamic (LANDY) routing protocol: A position based routing protocol for MANET | |
| Jin et al. | MANET for Disaster Relief based on NDN | |
| Cao et al. | A position based beaconless routing algorithm for mobile ad hoc networks | |
| Chen et al. | Multi-metric opportunistic routing for VANETs in urban scenario | |
| Meghanathan | A location prediction-based reactive routing protocol to minimize the number of route discoveries and hop count per path in mobile ad hoc networks | |
| CN101437303B (en) | Method for routing and forwarding Ad Hoc network data packet | |
| Fonseca et al. | Beacon vector routing: Scalable point-to-point in wireless sensornets | |
| Lee et al. | Relative velocity based vehicle–to–vehicle routing protocol over ad–hoc networks | |
| Wang et al. | A stable on-demand routing protocol for mobile ad hoc networks with weight-based strategy | |
| Wang et al. | An improved VANET intelligent forward decision-making routing algorithm | |
| Aujla et al. | Comparative Analysis of AODV, DSR, GRP, OLSR and TORA by varying Number of Nodes with FTP and HTTP Applications over MANETs | |
| Raffelsberger et al. | Overview of hybrid MANET-DTN networking and its potential for emergency response operations | |
| Al-Mayouf et al. | Efficient routing algorithm for VANETs based on distance factor |
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 | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20110803 Assignee: Hantress Enterprise (China) Co., Ltd. Assignor: Shanghai Jiao Tong University Contract record no.: 2014320000143 Denomination of invention: Position-based data packet forward method in wireless self-organized network Granted publication date: 20131225 License type: Exclusive License Record date: 20140305 |
|
| LICC | Enforcement, change and cancellation of record of contracts on the licence for exploitation of a patent or utility model | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20131225 Termination date: 20160401 |