CN110972209A - Dynamic control method for wireless ad hoc network routing protocol propagation range - Google Patents
Dynamic control method for wireless ad hoc network routing protocol propagation range Download PDFInfo
- Publication number
- CN110972209A CN110972209A CN201911261996.0A CN201911261996A CN110972209A CN 110972209 A CN110972209 A CN 110972209A CN 201911261996 A CN201911261996 A CN 201911261996A CN 110972209 A CN110972209 A CN 110972209A
- Authority
- CN
- China
- Prior art keywords
- node
- network
- destination
- wireless
- information
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/10—Flow control between communication endpoints
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- 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
Abstract
A dynamic control method for the propagation range of a routing protocol of a wireless ad hoc network divides the propagation range according to the purpose preference of a propagation path in the ad hoc network, and dynamically adjusts the sending range by controlling the network flow and the transmission rate information in the ad hoc network so as to realize the timely adaptation to the network topology change; the utilization efficiency of wireless resources is improved. The system has stable performance, and the network wiring, operation control and management are convenient and efficient, thereby not only ensuring the service quality, but also reducing the network delay, enhancing the diversity and reliability of transmission paths and improving the utilization rate of network resources.
Description
Technical Field
The invention relates to an IPC classification H04W40/02 communication routing or path selection technology or H04W28/00 wireless communication network traffic or resource management technology, in particular to a dynamic control method for a wireless ad hoc network routing protocol propagation range.
Background
The self-organizing network is a network combining mobile communication and computer network, the information exchange of the network adopts the packet exchange mechanism in the computer network, the user terminal is a portable terminal which can be moved, and each user terminal in the self-organizing network has two functions of router and host. As a host, the terminal needs to run various user-oriented applications, such as an editor, a browser, and the like; as a router, a terminal needs to run a corresponding routing protocol, and completes forwarding of data packets and route maintenance work according to a routing policy and a routing table, so that a node is required to implement a proper routing protocol. The purpose of the ad hoc network routing protocol is fast, accurate and efficient, accurate and available routing information needs to be found in as short a time as possible, the ad hoc network routing protocol can adapt to the fast change of the network topology, the introduced extra time delay and the control information for maintaining the routing are reduced, and the overhead of the routing protocol is reduced, so that the limitations in the aspects of the computing capacity, the storage space, the power supply and the like of the mobile terminal are met.
In wireless communication, information is not transmitted directly from a source to a sink at one time, but is forwarded through a plurality of antenna nodes between the source and the sink, that is, the information is transmitted through a plurality of nodes on a link. Each node may communicate directly with one or more peer nodes. Multihop is multiple forwarding. In frequency hopping communication, since communication is performed using a plurality of frequency point frequency shifts, multi-hopping is also sometimes referred to as frequency hopping communication.
With the development of communication technology and the improvement of mobile terminal performance, the application of the multi-hop ad hoc network is more and more extensive. In the ad hoc network, the user terminals move with great randomness, and the user terminals can move at any time and can be started and shut down at any time, and the topological structure of the network changes at any time due to the change of the sending power of the wireless transmitting device, the mutual interference among wireless channels, the influence of factors such as terrain and the like, and the change cannot be known in advance.
The related patent documents are less published.
Chinese patent application 201610393175.2 discloses an ad hoc wireless local area network and a data transceiving method of an autonomous protocol and a networking method. A Wireless Local Area Network (WLAN) capable of being combined into a multi-level and multi-path network master-slave structure comprises a controller and a plurality of nodes; the controller stores a routing table for routing control; the controller is used for sending control data conforming to a hardware chip protocol format to read the storage data in the final receiving data node, carrying out routing control on the sent control data through the routing table to obtain the storage data in the final receiving data node, and feeding back the obtained storage data in the final receiving data node to the controller through the routing table after the storage data is obtained; the routing table comprises the address of the final data receiving node, the address of each relay path node, the routing times and the priority level; data transmission is carried out between the controllers and the nodes and between the nodes through the following hardware chip protocols.
The chinese patent application 201810074089.4, which is proposed by the university of iean electronic technology, discloses a cross-layer routing protocol implementation method applied to a TDMA ad hoc network, and mainly solves the problems of large time delay and low throughput of the existing multipath routing protocol network. The scheme is as follows: 1. the network layer of each node acquires the number of time slots occupied by the node, the maximum transmission unit of a link from the node to each neighbor node and the queuing delay of the node in a cross-layer mode; 2. each node periodically broadcasts the path time delay of each path, the sum of the maximum transmission unit of the path and the number of time slots occupied by the nodes on the path; 3. the network layer receives the route broadcast message, calculates the weight of each path from the node to the destination node, and informs the MAC layer of the optimal path and the alternative path; and 4, the MAC layer combines the multipath information to carry out frame aggregation during queue scheduling.
Chinese patent application 201810290506.9 discloses a wireless networking device environment control system and a communication protocol agreement method thereof, wherein a plurality of environmental parameter collectors, a plurality of device drivers and a main controller configured in each room are respectively configured with a Zigbee wireless transceiver circuit module, the plurality of environmental parameter collectors and the device drivers in the same room are only in wireless communication connection with the main controller in the same room through the Zigbee wireless transceiver circuit module, and the main controller is in communication connection with a central controller through a wireless router; each device driver comprises a driver MCU control circuit module, and a switching value output circuit module, an RS485 communication output circuit module and an infrared control output circuit module which are respectively output and butted with the environment control interface device; and automatically driving and starting the environment control interface equipment according to the environment monitoring condition.
The Chinese patent application 201010607916.5, filed by Chongqing university, provides a flow control method among distributed network control systems based on wireless mesh, which comprises the steps of 1, improving the transmission quality of data by changing the structure of the traditional network control system, and adopting the wireless mesh network to transmit control signals and sampling signals, thereby not only ensuring that the whole control network has better fault-tolerant capability and grid connectivity, and the flexible diversity and higher self-management of networking modes, but also increasing the control capability of the whole network when the wireless mesh network transmits service flow; 2. the balance of the flow rate and the congestion rate of the service flow under different conditions is controlled by adjusting the difference value of different data queue thresholds among modules of the distributed network control system based on the wireless mesh.
In the prior art, for frequent network topology changes, a traditional fixed network routing protocol is difficult to reflect the topology structure of the network timely and accurately, meanwhile, control information used for maintaining the network topology is continuously distributed to the network, a large amount of wireless bandwidth is occupied, especially in the network with frequent link changes, a large amount of updated information also inevitably occupies a large amount of bandwidth, and the protocol overhead is increased.
Disclosure of Invention
The invention aims to provide a dynamic control method for a wireless ad hoc network routing protocol propagation range, which can dynamically adjust the sending range and adapt to network topology change in time by reasonably controlling network flow and transmission rate information in the ad hoc network.
The aim of the invention is achieved by the following technical measures: dividing a propagation range according to the purpose preference of a propagation path in the ad hoc network, and dynamically adjusting a transmission range by controlling network flow and transmission rate information in the ad hoc network so as to adapt to network topology change in time; the method specifically comprises the following steps:
(1) in the wireless ad hoc network, a dynamically-changed pure-purpose route pointing to a target point is established, and the optimal route is found out in the wireless network.
(2) In the process of establishing the route, the shortest path from the node to the node is not pursued, but the shortest path is required to smoothly reach the target node, and a route direction is provided for the source node to the target node.
(3) In the process of establishing and transmitting the route, the route protocol cannot be arbitrarily forwarded on each node.
(4) And the protocol transmission range is divided, the transmission range of the routing information in the wireless ad hoc network is limited, and the routing transmission is only carried out in the area meeting the set conditions, so that the method is suitable for rapid network topology change.
In particular, the process of establishing a route is a process of continuously providing a transmission direction to a destination for information; the method specifically comprises the following steps:
a) in an ad hoc network, a source node S transmits information to a destination node D.
b) There may be many links or paths between the source node S and the destination node D.
c) The source node S does not need to find the shortest path to the destination node D.
d) The source node S establishes a path to the destination so that the information can be continuously transmitted to the destination.
e) Routes continue to change depending on the location of the node relative to the destination, but are always directed to a particular destination.
f) In the ad hoc network, when the information to be transmitted to the destination node D is at a relatively high position, i.e., closer to the source node S, the topology change near the destination node D does not affect the link where the information is currently located.
g) As long as the information continues to be transmitted in the direction of the destination node D.
Particularly, the protocol transmission range is divided by dynamically adjusting the design of a function set, so that routing is realized; the method comprises the following steps:
(1) function set 1: the x node carries a parameter a which is the hop count to the active node, b which is the hop count to the target node, the condition that the f (x) area is a selected area is met, and the area is not considered, so that useless routing information is reduced, the cost of a network routing protocol is reduced, the fast network topology change is adapted, and the transmission range of a convergence space x is pi ab; defined by the number of hops to the active node and to the destination node.
(2) Function set 2: the x node carries a parameter h1，h1E (a, b) is the number of hops to the active node, h2，h2E (c, d) is the hop count to the destination node, the region satisfying f (x) is a selected region, the region is not considered, and the final transmission range of x in the obtained convergence space is limited by the hop count to the active node and the hop count to the destination node.
(3) The transmission range of node x is determined by the value ranges to the active node and to the destination node, and the transmission range is a limited space.
In particular, ad hoc routing protocol propagation ranges are defined by limiting the number of hops from a node to an active node and a target node.
The invention has the advantages and effects that: according to the purpose preference of the propagation path in the ad hoc network, a reasonable propagation range is divided, and the transmission range is dynamically adjusted by reasonably controlling the network flow and the transmission rate information in the ad hoc network, so that the network topology change can be adapted in time. The utilization efficiency of wireless resources is improved. The system has stable performance, and the network wiring, operation control and management are convenient and efficient, so that the service quality is effectively ensured, the network delay is reduced, the diversity and the reliability of a transmission path are enhanced, and the utilization rate of network resources is improved.
Drawings
Fig. 1 is a schematic diagram of a propagation path for a source node S to transmit information to a destination node D in an ad hoc network according to embodiment 1 of the present invention.
Fig. 2 is a schematic diagram of a hop-number selection ellipse region of a node in the function set 1 in embodiment 1 of the present invention.
Fig. 3 is a schematic diagram of a quadrilateral area selected by the hop count of the node in the function set 2 in embodiment 1 of the present invention.
Fig. 4 is a schematic diagram of a limited space transmission range of a quadrilateral area selected by hop count according to embodiment 1 of the present invention.
Detailed Description
The principle of the invention is as follows:
(1) in the wireless ad hoc network, the establishment of a pure destination route is mainly used, and the basic starting point is to give up the idea of finding the optimal route in the wireless network and establish a dynamically-changed route pointing to a target point.
(2) In the process of establishing the route, the shortest path from the node to the node is not pursued, but the destination node can be smoothly reached, namely, the path established from the source node to the destination node is not necessarily the shortest path, but the destination node can be reached, namely, the route direction is provided for the source node to the destination node.
(3) The routing protocol cannot be arbitrarily forwarded on each node in the process of route establishment and transmission, so that not only a large amount of wireless resources are occupied, but also a loop problem is caused.
(4) By limiting the transmission range of the routing information in the wireless ad hoc network and only carrying out routing transmission in the area meeting the set conditions, the useless routing information is reduced, the expense of a network routing protocol is reduced, and the method is suitable for rapid network topology change.
The invention is further illustrated by the following figures and examples.
Example 1: the process of establishing a route is a process of continuously providing a transmission direction to a destination for information.
As shown in figure 1:
a) in an ad hoc network, a source node S transmits information to a destination node D.
b) There may be many links or paths between the source node S and the destination node D, such as path 1, path 2, path 3.
c) The source node S does not need to find the shortest path, such as path 1, with the destination node D.
d) The source node S may establish a path to the destination so that the information may be continuously transmitted to the destination.
e) The route may change continuously depending on the location of the node relative to the destination, but always towards a particular destination, e.g., destination node D.
f) In the ad hoc network, when the information to be transmitted to the destination node D is at a relatively high position, i.e., closer to the source node S, the topology change near the destination node D does not affect the link where the information is currently located.
g) As long as the information continues to be transmitted in the direction of the destination node D.
In the embodiment of the invention, the protocol transmission range is divided by dynamically adjusting the design of the function set, so that the routing is realized, the time is reasonably reduced, and the utilization of wireless resources is increased; the method comprises the following steps:
and (1) as shown in the attached figure 2, the x node carries a parameter a which is the hop count to the active node, b is the hop count to the destination node, the f (x) area is a selected area, and the area which is not the selected area is not considered, so that useless routing information is reduced, the overhead of a network routing protocol is reduced, the method is suitable for rapid network topology change, and the area which meets the condition is not limited to an elliptical area but has other shapes. The specific derivation process can obtain that the transmission range of the convergence space x is pi ab; defined by the number of hops to the active node and to the destination node.
Function set 2 As shown in FIG. 3, the x node carries parameter h1，h1E (a, b) is the number of hops to the active node, h2，h2E (c, d) is the hop number to the destination node, the area satisfying f (x) is a selected area, and the area not in the selected area is not considered, thereby reducing useless routing information and reducing network routesThe overhead of the protocol adapts to rapid network topology change, and the area meeting the condition is not limited to be quadrilateral but can be in other shapes. The transmission range over which the convergence space final x can be derived by a specific derivation process is defined by the number of hops to the active node and to the destination node.
Assuming that four sides in the quadrilateral region are a, B, C, and D, and the associated vertex angles are a, B, C, and D, respectively, as shown in fig. 3, the propagation range is represented by Δ:
where s represents half the perimeter of the propagation range.
If so, the
Substituting and finishing to obtain:
at this point, if the parameters a, B, c, D are close to the same constant, then B + D is 180 °, the propagation range is maximized, and the square of the range is:
the propagation range Δ is given by a, B, c, D, as shown in fig. 4, and the parameters of Δ may vary as an angle B, and angle D is determined by angle B and thus may be considered as a function of B.
Firstly setting delta as:
then:
because:
l2＝a2+b2-2abcosB＝c2+d2-2cdcosD
after differentiation there are:
substituting (1) into:
then substituting (1) into the following formula:
therefore:
thus:
wherein:
k (a, b, c, d) is a undetermined constant, which is obtained by the triangle area formula:
and the cosine theorem is reused once:
on the left of the equation is the area square formula of the three sides of the propagation range, a + b, c, d. (4) Formula having determined that k, k is a fourth order polynomial of a, b, c, d, k is now finished using the recipe.
The substitution is returned to the step (2),
differentiate Δ diagonally B:
the transmission range of the node x is determined by the value ranges of the active node and the destination node, and the transmission range can be proved to be a limited space through calculation.
In the embodiment of the invention, the propagation range of the routing protocol of the ad hoc network is defined by limiting the hop counts from the node to the active node and the target node, so that the routing protocol cannot be infinitely diffused, and the routing establishment efficiency and the wireless bandwidth utilization rate are improved.
In the embodiment of the invention, the system equipment configuration requirement is as follows: CPU (central processing unit)>680 Mhz; memory device>64 MB; hard disk RAM>64MBFlash>64 MB; communication/network interface card Ethernet: 10/100/1000 the Ethernet of the MBit is composed of a network,
82574>and (4) 1 way.
Claims (4)
1. A dynamic control method for the propagation range of the routing protocol of a wireless ad hoc network is characterized in that the propagation range is divided according to the purpose preference of the propagation path in the ad hoc network, and the transmission range is dynamically adjusted by controlling the network flow and the transmission rate information in the ad hoc network so as to realize the timely adaptation to the network topology change; the method specifically comprises the following steps:
(1) in the wireless ad hoc network, a dynamically-changed pure-purpose route pointing to a target point is established, and the optimal route is found in the wireless network in a abandoned manner;
(2) in the process of establishing the route, the shortest path from the node to the node is not pursued, but the shortest path is required to smoothly reach the target node, and a route direction is provided for the source node to the target node;
(3) in the process of establishing and transmitting the route, the route protocol cannot be arbitrarily forwarded on each node;
(4) and the protocol transmission range is divided, the transmission range of the routing information in the wireless ad hoc network is limited, and the routing transmission is only carried out in the area meeting the set conditions, so that the method is suitable for rapid network topology change.
2. The method of claim 1, wherein the step of establishing a route is a step of continuously providing a transmission direction to a destination for information; the method specifically comprises the following steps:
a) in ad hoc networks, a source node S transmits information to a destination node D;
b) there may be many links or paths between the source node S and the destination node D;
c) the source node S does not need to find out the shortest path between the source node S and the destination node D;
d) the source node S establishes a path to the destination so that the information can be continuously transmitted to the destination;
e) routes continue to change depending on the location of the node relative to the destination, but are always directed to a particular destination;
f) in the ad hoc network, when the information to be transmitted to the destination node D is at a relatively high position, i.e., closer to the source node S, the topology change near the destination node D does not affect the link at the position where the information is currently located;
g) as long as the information continues to be transmitted in the direction of the destination node D.
3. The method according to claim 1, wherein the dynamic control of the propagation range of the routing protocol of the wireless ad hoc network is performed by dynamically adjusting the design of the function set to divide the transmission range of the protocol, thereby realizing the routing; the method comprises the following steps:
(1) function set 1: the x node carries a parameter a which is the hop count to the active node, b which is the hop count to the target node, the condition that the f (x) area is a selected area is met, and the area is not considered, so that useless routing information is reduced, the cost of a network routing protocol is reduced, the fast network topology change is adapted, and the transmission range of a convergence space x is pi ab; defined by the number of hops to the active node and to the destination node;
(2) function set 2: the x node carries a parameter h1，h1E (a, b) is the number of hops to the active node, h2，h2E (c, d) is the hop count to the destination node, the region satisfying f (x) is a selected region, the region is not considered, and the final transmission range of x in the obtained convergence space is limited by the hop count to the active node and the hop count to the destination node;
(3) the transmission range of node x is determined by the value ranges to the active node and to the destination node, and the transmission range is a limited space.
4. The method of claim 1 wherein the ad hoc routing protocol propagation range is defined by limiting the number of hops from the node to the active node and the target node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911261996.0A CN110972209B (en) | 2019-12-10 | 2019-12-10 | Dynamic control method for wireless ad hoc network routing protocol propagation range |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911261996.0A CN110972209B (en) | 2019-12-10 | 2019-12-10 | Dynamic control method for wireless ad hoc network routing protocol propagation range |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110972209A true CN110972209A (en) | 2020-04-07 |
| CN110972209B CN110972209B (en) | 2023-04-07 |
Family
ID=70033725
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911261996.0A Active CN110972209B (en) | 2019-12-10 | 2019-12-10 | Dynamic control method for wireless ad hoc network routing protocol propagation range |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110972209B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020018448A1 (en) * | 2000-04-25 | 2002-02-14 | Amis Alan Dewayne | Clusterhead selection in wireless ad hoc networks |
| CN106535207A (en) * | 2016-11-04 | 2017-03-22 | 中国科学院上海微系统与信息技术研究所 | Miniaturized multiservice wireless mobile ad hoc network system |
| CN107852663A (en) * | 2015-07-21 | 2018-03-27 | 英特尔Ip公司 | The configuration of data path group in wireless network |
-
2019
- 2019-12-10 CN CN201911261996.0A patent/CN110972209B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020018448A1 (en) * | 2000-04-25 | 2002-02-14 | Amis Alan Dewayne | Clusterhead selection in wireless ad hoc networks |
| CN107852663A (en) * | 2015-07-21 | 2018-03-27 | 英特尔Ip公司 | The configuration of data path group in wireless network |
| CN106535207A (en) * | 2016-11-04 | 2017-03-22 | 中国科学院上海微系统与信息技术研究所 | Miniaturized multiservice wireless mobile ad hoc network system |
Non-Patent Citations (5)
| Title |
|---|
| 夏荣大等: "基于双转发机制的车载自组织网络路由算法", 《计算机工程》 * |
| 时锐等: "自组网Random Direction移动模型点空间概率分布的研究", 《计算机研究与发展》 * |
| 曹静等: "认知无线ad hoc网的多尺度跨层路由协议", 《西安电子科技大学学报》 * |
| 杨挺等: "无线传感器网络中一种节省资源的快速重路由算法", 《传感技术学报》 * |
| 陶冰等: "基于公交车骨干网的区域路由协议研究", 《计算机工程》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110972209B (en) | 2023-04-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109348537B (en) | Multi-beam self-organizing network channel access control method | |
| Zafar et al. | A reliable, delay bounded and less complex communication protocol for multicluster FANETs | |
| EP1665636B1 (en) | Mobile ad hoc network (manet) providing interference reduction features and related methods | |
| Deng et al. | Optimum transmission range for wireless ad hoc networks | |
| CA2538042A1 (en) | Mobile ad hoc network providing connectivity enhancement features | |
| Unnikrishnan et al. | Cooperative routing for improving the lifetime of wireless ad-hoc networks | |
| Nawaz et al. | Implementation of cross layer design for efficient power and routing in UAV communication networks | |
| Ji et al. | A three-level routing hierarchy in improved SDN-MEC-VANET architecture | |
| Perwej et al. | Some drastic improvements found in the analysis of routing protocol for the Bluetooth technology using scatternet | |
| Remondo | Tutorial on wireless ad hoc networks | |
| CN110972209B (en) | Dynamic control method for wireless ad hoc network routing protocol propagation range | |
| CN111510955A (en) | Method for optimizing overhead space of wireless ad hoc network protocol | |
| Lee | Improved acoustic modeling for speaker independent large vocabulary continuous speech recognition | |
| Pushpalatha et al. | Power efficient multicast routing protocol for dynamic intra cluster device to device communication | |
| Ren et al. | System design of high speed ad hoc networking with directional antenna | |
| CN111010709B (en) | Method for optimizing overhead time of wireless ad hoc networking protocol | |
| Singh et al. | Linear regression based energy aware location-aided routing protocol for mobile ad-hoc networks | |
| Sasikumar et al. | Packet transmission using radio access protocol for intra-cluster communications in mobile ad hoc networks | |
| Oda et al. | A transmission power control adaptive to variation of node density in mobile ad hoc network clustering | |
| Fuhrmann | Estimation of sensor gain and phase using known field covariance | |
| Mu’azu et al. | Guaranteed QoS for UDP and TCP flows to measure throughput in VANETs | |
| Fang et al. | An energy balance and mobility prediction clustering algrithm for large-scale UAV ad hoc networks | |
| Han et al. | Cross-layer protocol design for wireless communication in hybrid data center networks | |
| Shringar Raw et al. | Improved position-based routing in vehicular ad hoc networks using P-DIR method | |
| Jasuja et al. | A minimal spanner and backoff approach for topology and collision control in mesh networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |