Next Article in Journal
An Imbalanced Sequence Feature Extraction Approach for the Detection of LTE-R Cells with Degraded Communication Performance
Previous Article in Journal
Clustering on the Chicago Array of Things: Spotting Anomalies in the Internet of Things Records
Previous Article in Special Issue
Flying Watchdog-Based Guard Patrol with Check Point Data Verification
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Review

Cross-Layer Methods for Ad Hoc Networks—Review and Classification

by
Valeriy Ivanov
* and
Maxim Tereshonok
Science and Research Department, Moscow Technical University of Communications and Informatics, Moscow 111024, Russia
*
Author to whom correspondence should be addressed.
Future Internet 2024, 16(1), 29; https://doi.org/10.3390/fi16010029
Submission received: 6 December 2023 / Revised: 12 January 2024 / Accepted: 14 January 2024 / Published: 16 January 2024

Abstract

:
The OSI model used to be a common network model for years. In the case of ad hoc networks with dynamic topology and difficult radio communications conditions, gradual departure is happening from the classical kind of OSI network model with a clear delineation of layers (physical, channel, network, transport, application) to the cross-layer approach. The layers of the network model in ad hoc networks strongly influence each other. Thus, the cross-layer approach can improve the performance of an ad hoc network by jointly developing protocols using interaction and collaborative optimization of multiple layers. The existing cross-layer methods classification is too complicated because it is based on the whole manifold of network model layer combinations, regardless of their importance. In this work, we review ad hoc network cross-layer methods, propose a new useful classification of cross-layer methods, and show future research directions in the development of ad hoc network cross-layer methods. The proposed classification can help to simplify the goal-oriented cross-layer protocol development.

1. Introduction

In this work, we present the classification of cross-layer methods in ad hoc networks and consider the methods themselves. An ad hoc network is a network of mobile radio nodes with no infrastructure: without gateways, access points, base stations, etc. (Figure 1 and Figure 2). A classic, well-established approach to network protocols is to split protocols into OSI model layers. This is a very effective approach for wired networks with reliable communication channels where the performance of protocols of different layers does not depend on the state of other layers. In the case of a mobile ad hoc network with dynamic topology (with radio channels exposed to noise, interference, no line of sight, etc.), the insulation of layers leads to sub-optimal network operation. The use of cross-layer methods in the development of protocols of ad hoc networks allows achieving optimal performance for ad hoc networks. Here and further, cross-layer methods are considered methods with no layer isolation, intensive exchange of information between layers, and joint layer management.
Ad hoc networks have the following properties [1]:
  • Self-organization. Nodes are organized into networks and manage the network independently and in a distributed manner without centralized intervention. Each node acts as both the user and router [1].
  • Peer network. Nodes of ad hoc networks are equal and perform the same functions [1].
  • Limited resources. Ad hoc networks usually consist of portable devices with low computing power, memory, and battery charge [1].
  • Network robustness. The failure of any network node almost never affects the performance of the network as a whole, unlike the failure of the central router of classical networks [2,3].
  • Dynamic topology. The network nodes move relative to each other. As a result, node connections and routes between nodes appear and disappear [2,3].
  • Limited constantly changing capacity of radio lines. Radio lines are susceptible to interference from neighboring nodes, noise from outside, multipath fading, and the Doppler effect [4].
  • Shared channel resource. The lack of dedicated channel resources (the contention of nodes over channel resources) leads to interference and packet collisions, which reduces network bandwidth [4].
  • Vulnerability to attacks. In classical networks, all data from a single subnet passes through one powerful firewall, and an attack from outside the network is directed only to the firewall. In the ad hoc network, each node is equally vulnerable to attacks from outside [5].
  • Large amount of service data for routing. It is necessary because of ad hoc network dynamic topology to send more (than static networks) service information about the lines state, etc., to find network routes [4].
  • Frequent network fragmentation. Network mobility can cause the ad hoc network to be divided into isolated subnets [4].
  • Complexity of providing QoS. The poorly predictable instability of radio lines, interference of nodes, frequent route breaks, and delay in finding a new route all make the task of providing QoS in ad hoc networks very difficult [4].
Ad hoc networks are often used in the following areas [1]:
  • Military use. It is difficult to deploy a cellular network in a warzone, but an ad hoc network can be deployed almost instantly.
  • Rescue and search operations. In the event of a disaster, the local infrastructure is destroyed, and in the case of search operations in sparsely populated areas, the infrastructure initially does not exist. The rapid deployment of an ad hoc network allows immediate rescue and search operations.
  • Distributed file sharing. During a meeting, such as a conference, one can quickly deploy a network to share files and presentations.
The International Organization for Standardization (ISO) created sub-cluster 16 (SC16) in 1977 to develop architecture for standard protocols. In 1979, the OSI [6] was created. The OSI model consists of seven layers: physical layer, channel layer, network layer, transport layer, session layer, presentation layer, and application layer. The task of the OSI model is to group similar communication functions into logical layers. The layer can only communicate with the upper and lower adjacent layers. However, with the development of the transport layer TCP protocol and network layer IP protocol, the TCP/IP model became dominant, consisting of five layers: application layer, transport layer, network layer, channel layer, and physical layer [6,7,8]. Layer architecture works very well in wired networks with stable connections and quasi-permanent topology. The layer isolation of different protocols allows for modular independent development of these protocols regardless of other layers. That speeds up the development and performance of the network. This is possible because events at different layers have little impact on each other.
In ad hoc networks with dynamic topology and difficult radio communications conditions, events at different layers may influence each other significantly. Therefore, to achieve high performance of an ad hoc network, one should not use an architecture with isolated layers [9,10,11].
During the analysis, we constructed the scheme (graph) of the interdependence and influence of OSI layers on each other (Figure 3). Almost all layer influence is indirect, with the help of intermediate events. The only direct influence is transport layer congestion control, which forces the application layer to slow down transmission.
In Figure 3, we can, for example, trace the following circular indirect layer influence with the positive feedback loop on the high packet corruption rate. To guarantee a high probability of packet delivery, the packet needs either to be retransmitted multiple times at the channel layer, or it is necessary to increase transmission power at the physical layer. Transmission power increase or multiple packet retransmissions can cause excessive interference to other nodes, which causes a low probability of successful packet delivery. At the network layer, the current route ceases to exist because of the low probability of successful packet delivery, so it is necessary to start the process of new route discovery by broadcasting route request packets, and route request packets cause even more interference.
Cross-layer methods strive to improve the performance of ad hoc networks by collaboratively developing protocols using multiple-layer interaction [12,13,14]. Compared to the layered OSI approach, the cross-layer approach allows interaction between layers, reading and changing the parameters of some other layers [15,16,17,18]. Cross-layer methods have emerged from the desire to ensure interaction and joint optimization of multiple layers [19]. For example, the physical layer can select data rate, power, and coding to meet application layer requirements. Cross-layer design is also indispensable in increasing battery lifetime (minimizing energy consumption) [20,21] and in optimizing the end-to-end latency for real-time applications [22,23], as energy consumption and latency depend on all layers.
The theoretical justification of the effectiveness of cross-layer methods is given in one of the first works on network coding [24]. Network coding is the process of using network parameter settings to meet all the data flow transmission requirements. Reference [24] shows that performing only routing by intermediate nodes results in suboptimal network performance.
Cross-layer interactions can be subdivided into two large categories [25]:
  • Provision of information. Adjacent and disconnected layers share information through interfaces or by using a common database.
  • Layer integration. Layer separation disappears, and all layers except maybe the application layer are merged into one.
There are two main architectures for cross-layer methods (Figure 4): “MobileMan” [26] and “CrossTalk” [27].
The “MobileMan” architecture [26] preserves the original layer architecture (Figure 4). The main achievement of this architecture is the creation of a central database that collects all network state data that can be used by various layers individually. “Mobileman” is the “provision of information” kind of cross-layer interaction.
The “CrossTalk” architecture [27] introduces the notion of global network state and local node state (Figure 4). Global information is collected using the messages from neighboring nodes. An important difference from the “MobileMan” architecture is that in “Crosstalk”, the cross-layer entity controls all layers, while in “MobileMan”, the layers tune themselves separately using each other’s information. “Crosstalk” is the “layer integration” kind of cross-layer interaction.
Cross-layer methods, based on the “MobileMan” and “Crosstalk” architectures, can be presented in terms of iterative optimization of multiple-layer configurations [11] to achieve QoS requirements for the data flows (Figure 5).
There are the following difficulties in developing cross-layer methods [11,28,29,30,31,32]:
  • Cross-layer method parameter selection. One of the fundamental questions of cross-layer methods is the choice of layer parameters on the basis of which decisions about network operation are made. It is very important to consider the physical layer parameters, but it is also important to consider the application layer parameters. For example, the received signal strength indicator (RSSI) is a good indicator of signal power, but this parameter does not take into account noise and interference. The noise level is taken into account in the signal-to-noise ratio (SNR), but interference is also not included. The signal-to-interference + noise ratio (SINR) parameter is much more useful because it simultaneously takes into account the signal strength and noise. With the SNR [33], one can estimate the proximity of the nodes (i.e., the nodes are within each other’s radio connection). Queue occupancy information is available at the channel layer. In addition to the above parameters, parameters that provide information about data flows are also used. As shown in [34,35], another approach is to use composite parameters obtained by combining many other parameters.
  • Layer interdependency and the complexity of independent development. As shown in [9], cross-layer protocol design is nothing more than an OSI violation in which interlinked layers interact. The modification and improvement of a highly interconnected system is difficult. However, achieving modularity is one of the most difficult tasks in developing cross-layer methods.
  • Overly complex interaction between layers. The flow of information between the different layers creates unforeseen relationships between layers, reducing the efficiency of the entire system. Therefore, it is necessary to choose the interaction between layers very carefully.

2. Related Works

In this section, we present our study on reviews of cross-layer methods in ad hoc networks (Table 1).
Early reviews of cross-layer methods in ad hoc networks reviewed possible approaches to the development rather than existing methods.
Srivastava et al. [9] introduced one of the first classifications for cross-layer method development approaches. The classification consists of four approaches: the creation of new interfaces between layers, the merging of adjacent layers, the development of fixed lower layers without creating new interfaces, and the holistic optimization of all layers. Ren et al. [36] approached the development of cross-layer methods by dividing them into three types: the use of event signaling between layers, the joint optimization of layer subsets, and the holistic optimization of all layers.
More recent reviews provide reviews and classifications of methods themselves. References [37,41] provide a classification of methods according to the layer combinations used in methods. Publications [28,38,39,40] focus on classifying not all cross-layer methods but cross-layer methods belonging to the same layer: cross-layer routing protocols, cross-layer transport protocols, and cross-layer applications for streaming video. Trivedi et al. [38] consider the routing protocols for vehicular ad hoc networks. The protocols are divided into two types: with the use of composite metrics from combining the physical and channel layer metrics and joint work of the network and channel layer. Awang et al. [28] deal with cross-layer routing protocols in ad hoc networks. The authors created a table with reviewed methods and what metrics and layers are used by methods. Goswami et al. [40] focus exclusively on the transport layer (the TCP protocol modifications) and the interaction of the transport layer with other layers to improve transport protocol performance. Mantzouratos et al. [39] focus on cross-layer methods that implement video streaming applications in ad hoc networks. The authors categorized methods according to the layers used in the methods. The categorization and distribution of methods by categories are the following: 1%—all except network and transport layer, 9%—use all layers (holistic approach), 40%—all layers except application layer, 50%—application layer, network and channel layer.
Every method for network control has a main goal or set of goals to achieve:
  • Line throughput. Line throughput is the volume of successfully delivered data through the line per unit of time.
  • Energy consumption. The less the node energy spent per successful information transmission, the more battery life, and the greater the longevity of network connectivity.
  • Line packet error rate. Line packet error rate is inversely proportional to line throughput with regard to the line bandwidth, which is the line transmission rate.
  • Line latency. Line latency is the sum of multiple delays: queueing delay, propagation delay, transmission delay, etc.
  • Route throughput. Route throughput is the minimal throughput of lines inside the route.
  • Route packet error rate. Route packet error rate is the complimentary of the lines inside route probabilities of successful packet delivery multiplication.
  • Route stability. Route stability is how long all lines in the route remain existing and within the desired range of parameters.
  • Route latency. Route latency is the sum of line latencies inside the route.
  • Interference. Interference is the simultaneous transmission of multiple nodes when the total power of other nodes transmitted, except the sender, corrupts the received packets. Low interference is not harmful. High interference causes packet collisions.
  • Data overhead. The volume of service data. The more, for example, the routing protocol sends route request packets, the lower the throughput.
The aforementioned goals are usually achievable with the intermediate goal of creating the specific method, for example, channel access method, routing protocol etc.
In our work, we propose a new classification of cross-layer methods in ad hoc networks based not on a specific combination of layers used but on the intermediate goal pursued with the help of multiple layers.
To this date, the practical realizations of ad hoc networks with cross-layer paradigms are almost non-existent. Some of the closest activities to practical implementations are DARPA (Defense Advanced Research Projects Agency) research [42] and different press releases and policies, such as the policy for developing ad hoc networks for automated vehicles in the European Union [43] and mesh internet in rural Africa [44]. The area of cross-layer ad hoc network control is still mostly under theoretical development. The known cross-layer method classifications, which are method-based, indicate that the development of new cross-layer methods is rather focused on the methodology itself. We hope that our work may facilitate and spur the practical implementations of ad hoc networks utilizing the cross-layer paradigm to its utmost value.
In the following review, methods are grouped by their intermediate goals and discussed in the corresponding sections.

3. Cross-Layer Method Publications Review

3.1. One Layer

Most of the cross-layer methods are usually focused on one layer interacting with other layers to optimize the work of the layer being focused on.

3.1.1. Physical Layer

Cross-layer methods that are focused on the physical layer use multi-element antenna systems to optimize the antenna beamforming and space-time coding for the minimization of interference between users and the maximization of bandwidth (Table 2). These methods use the data about neighboring nodes from the link layer and the data about data flows from the network layer.
Zorzi et al. [45] consider the problems of the development of the channel layer protocol for ad hoc networks with nodes with multiple antenna elements with MIMO technology. Network nodes are capable of forming directional antenna patterns, interference rejection, and MIMO space-time coding of signals. For single omnidirectional antennas, nodes send a transmission request packet, and the target node responds with a permission packet. All other nodes that have accepted the permission and request packet cease to use the radio channel for the time required to transfer the packet between the two nodes. If the receiving node can use a radio channel, the node allows the packet to receive. In the case of multiple antennas with independent transceivers, the node can receive multiple packets at the same time under sufficient spatial separation of senders; when transmitting packets, it can beamform in a way that reduces interference. As a result, requests for transmission packets are advisory in nature and are used to assess the needs of data streams. Therefore, the authors conclude that the interaction of physical and channel layers is necessary.
Hamdaoui et al. [46] propose a way to maximize bandwidth by using MIMO. The work uses the interaction of physical, channel, and network layers. Based on the knowledge of the amount of data streams passing through nodes, each node communicates with adjacent nodes to derive distributed complex coefficients of antenna elements for joint nullification of antenna directional patterns and simultaneous acceptance of packet transfer from several nodes depending on the data flows to be transmitted to nodes.

3.1.2. Channel Layer

Cross-layer methods concentrated on the channel layer consist of resource reservation, random access, and cooperative transmission methods.
  • Channel layer (resource reservation)
In the works focused on the resource reservation at the channel layer (Table 3), the channel layer rarely uses physical layer data, using mainly network layer data [47]. The network layer reports on the data streams passing through the nodes. On the basis of this data, the channel layer makes the decision to reserve resources. When splitting the network into clusters, route data helps to maximize the number of dedicated channels for intra-cluster communication, and in the case of a tree-like network, where nodes transmit data to a single data collector node, the route tree allows the allocation of disjoint channel resources between the previous and next link. The resource reservation by a channel layer based on the information from the network layer allows for increased network capacity, route stability, and reduced power consumption.
Gong et al. [48] propose the allocation of node channels using a routing protocol in such a way as to minimize interference of nodes along the route. The proposed method for allocating channels increases the bandwidth in comparison with the allocation of channels based on local node information.
In their subsequent work, Gong et al. [49] suggest reserving channels using information about network layer routes. The proposed protocol uses fewer service messages and provides more bandwidth than using only channel layer information.
De Renesse et al. [50] suggest that the channel layer should use the network layer information about the routes passing through the node and, on the basis of this information, pre-reserve bandwidth, minimizing the probability of packet collision. The network layer, in turn, searches for routes based on available reserved bandwidth.
Mansoor et al. [47] divide ad hoc networks into clusters; clusters are formed by the nodes themselves using a distributed algorithm. The access time in each cluster is represented as a synchronized sequence of super-frames. The superframe consists of four periods: the beacon period, the spectrum sensing period, the period of detection of adjacent nodes, and the period of data transmission. The cluster head in the beacon period sends information about synchronization and allocated cluster resources. In this work, the clustering is carried out in such a way as to simultaneously minimize the number of clusters and allocate the maximum number of free frequency channels for intra-cluster communication. For the formation of clusters and allocation of channels, joint work of the physical and channel layers is used. The routing algorithm, on the other hand, prefers the nodes that are the heads of the clusters to be included in the route when routes are selected, as the links with them are more stable. In the ad hoc network in question, there are the main users behind whom a certain channel resource is assigned and secondary users who, having found that the resource is not in use, can use it. When secondary users discover that the primary user has started using their resource, the secondary user must switch to another free resource; the switching takes time. The routing protocol looks for paths with the least delay. The delay is evaluated based on data from the link layer. The delay consists of a delay in the queue, a delay in switching to a new channel resource, and a delay in waiting time for the recharge of the resource.
Raj et al. [51] proposed a cross-layer channel assignment and routing algorithm for a cognitive radio ad hoc network that provides stable paths. A novel metric for the probability of successful transmission of a channel is derived by considering channel statistics, sensing periodicity of the secondary users, time-varying channel quality, and a time-varying set of idle channels from the physical layer. Furthermore, the number of available channels and their characteristics are considered for the selection of a next-hop node with an aim to avoid the one-hop neighbors located in the primary user transmission range. The primary user is the user with granted resources, which are not used all the time. Secondary users attempt to use the resources of primary users when resources are free.
In their subsequent work, Mansoor et al. [52] offer a cross-layer approach that minimizes power consumption in UAV networks. The approach uses network and channel layers. The network layer uses the AODV protocol for routing, the cluster head is selected by the GSO (Glow Swarm optimization) protocol, and the Cooperative MAC protocol is used at the channel layer. The network has a cluster head. Using AODV, the cluster head finds routes to all nodes and creates a node tree. The cluster head then assigns TDMA slots to other nodes along the node tree in such a way as to minimize packet interference and collisions, which results in lower power consumption, as fewer packets are sent repetitively.
  • Channel layer (random access)
In work focused on optimizing channel random access (Table 4), the channel layer uses data from the physical and network layers. The physical layer evaluates the state of the channel and reports to the channel layer. If the channel state is poor, the data link layer does not transmit the packet, as the packet is likely to be corrupted, further interfering with other users. The channel layer can also indicate the physical layer at what power the packet should be transmitted, making a trade-off between the high probability of successful packet delivery and the high interference for the other users.
Toumpis et al. [53] analyze the mutual influence of power control, queue types, routing protocols, and channel access protocols. The authors found that the effectiveness of the CSMA/CA channel layer protocol is highly dependent on the routing protocol, and the proposed two channel-layer protocols are superior to CSMA/CA. One of the protocols performs joint channel access control and power control, ensuring higher throughput and energy efficiency. The second protocol sacrifices energy efficiency in exchange for more bandwidth.
Pham et al. [54] propose a cross-layer approach. The physical layer in that approach shares the channel state with the other layers. If the channel state is bad, the upper layers decide not to transmit a packet, as this will result in energy consumption, interference, and waiting for packet reception confirmation reply. The approach is applicable to the Rayleigh fading channel. The level of future Rayleigh channel fading can be predicted based on previous measurements. The authors developed an attenuation prediction algorithm based on the Markov chains and examined in detail the interaction of the physical and channel layers. The authors derived theoretical formulas for bandwidth, packet processing speed, probability of packet loss and average packet delay in Rayleigh channels. The proposed approach increases network capacity and reduces energy consumption.
  • Channel layer (cooperative transmission)
In cooperative transmission-oriented works (Table 5), the channel layer interacts with the network and physical layer. Cooperative transmission is based on the fact that when the sending node sends a data packet, the packet is received not only by the receiving node but also by several other nodes (other nodes are usually called auxiliary nodes). The receiving node sends an acknowledgment packet. If the acknowledgment packet has not been sent, one of the nodes that received the data packet and whose communication channel is less attenuated sends the packet to the recipient. The difficulty of cooperative transmission is the correct formation of cooperative transmission groups and the choice of when cooperative transmission is more efficient and when cooperative transmission causes interference and is less reliable than ordinary transmission. Interaction with the physical layer in the cooperative transmission is used to obtain information about channel fading and to set signal-code structures for packet transmission from the sending node and auxiliary node. The network layer provides information about the direction of data flows. With this information, groups of nodes can be effectively selected for cooperative transmission.
Dai et al. [55] propose the interaction of channel and physical layer in cooperative transmission. In this work, nodes are expected to possess orthogonal communication channels (frequency, time slot, etc). When a packet is delivered, it is received by the recipient node and nodes that can participate in the cooperative transmission. The authors suggested the use of automatic packet forwarding by auxiliary nodes if they did not receive a confirmation packet after some time. Only nodes with the same communication channels as the recipient node are used for cooperative transmission forwarding.
Liu et al. [56] propose a protocol where, at the beginning, the sender node codes the packet encoded with error-correcting code so that half of the packet bits can be repaired. The sender node then sends half of the packet to the helper node and the other half to the recipient node. The helper node restores the second half of the packet, encodes again and sends it to the recipient node. By splitting the packets into two halves, the packet halves can be transmitted at different speeds depending on the channel state. For cooperative transmission, the channel layer uses physical layer information about the channel state and available signal-code structures for packet transmission.
Dong et al. [57] propose cooperative beamforming (virtual antenna with the help of multiple nodes). For cooperative beamforming, the physical and channel layers of the nodes interact. Nodes in the neighborhood use time division multiple access (TDMA) to broadcast data packets. Then, nodes that participate in the cooperative beamforming transmit the packets to recipients. To form a virtual antenna, node coordinates and time synchronization are required.
Aguilar et al. [58] make a channel layer to use information about signal strength from the physical layer to choose whether to use cooperative transmission or not. Cooperative transmission groups are formed based on route date from the network layer.
Ding et al. [59] use network layer data about routes to form cooperative transmission groups. At the same time, at the physical layer, the control of transmission power is optimized based on data from the channel layer about cooperative transmission groups.
Wang et al. [60] propose a cooperative transmission using network packet coding. When the helper node re-sends a data packet to a recipient, it cannot send its own packets. To solve this problem, the authors suggested using network packet coding. The helper node creates a modified packet based on its own packet and the packet intended for the recipient node. The receiving node, based on a corrupted packet from the sending node and a modified packet from the helper node, recovers both the packet from the sender and the packet from the helper node. As a result, network bandwidth is increased, and latency is reduced.

3.1.3. Network Layer

Cross-layer methods concentrated on the network layer consist of cross-layer routing protocols and cross-layer routing metrics, which can be used to turn a one-layer routing protocol into a cross-layer routing protocol.
  • Network layer (routing metrics)
Cross-layer routing metrics are composite metrics based on metrics collected from multiple layers (Table 6). Cross-layer routing metrics are used for existing routing protocols, turning routing protocols into cross-layer routing protocols.
Park et al. [61] propose a route reliability metric as the probability of successful packet delivery across the route. Successful packet delivery rate calculation is based on the received packets’ signal-to-noise ratio from the physical layer.
Draves et al. [62] propose two metrics: the metric of expected transmission time (ETT) and the weighted cumulative expected transmission time (WCETT). The ETT metric improves the expected transmission count (ETX) metric [74] (ETX is equal to the sum of hops, including retransmissions) by measuring the transmission speed. The ETT metric is equal to the ETX metric multiplied by the ratio of the packet size to the transmission speed. The WCETT metric improves the ETT metric by giving a lower score to routes in which subsequent lines use the same channel resources (data about channel resources is gained from the channel layer) to reduce user interference. However, this metric does not account for interference from other routes.
Yang et al. [63] propose the metric of interference and channel-switching (MIC). The MIC metric improves the WCETT metric by accounting for interference from other routes. The metric uses the number of adjacent nodes for each line of the route to evaluate interference from other routes.
The standard 802.11 s [64] uses the ALM metric (Airtime Link Metric). This metric measures the time required to deliver a packet of 8224 bits between the sender and receiver. To obtain this metric, the network layer uses the following data from the channel layer: number of bits in the frame, line transmission speed, probability of frame error, channel access delay, and frame service field size.
Ramachandran et al. [65] propose the metrics for estimating the probability of route packet loss, the probability of line packet loss, and the remaining battery charge of the node from the power of the received signal.
Oh et al. [66] propose a metric defined as the ratio of the time taken to transmit a packet to the sum of the transmission time and the time taken to wait for the channel to be free. If this metric is small, the channel is less congested, and the line has a low transmission delay; in this case, the line is more suitable for real-time applications.
Hieu et al. [67] offer a route metric for ad hoc networks with radio links with multiple transmission rates. The metric takes into account the maximum allowable transmission rate and the number of packet retransmissions. The selection of the lowest metric route ensures a high bandwidth route and prevents the selection of low bandwidth routes. A small metric value means that the route has a few intermediate nodes. The metric is based on the data of a number of packet retransmissions from the channel layer and the available line transmission speeds from the physical layer.
Katsaros et al. [34] use a weighted sequence of the signal-to-noise ratio and packet loss probability data from the channel layer to estimate line reliability.
Mucchi et al. [68] propose a metric that takes into account the mobility of nodes, the line load, and the fading of radio lines. This metric is called the network intersection metric. This metric uses the average packet wait time in the queue, the average packet transmission time and the packet loss probability estimate, which is based on the signal-to-noise ratio, packet length, modulation, and error-correcting code.
Ahmed et al. [69] use a metric for line reliability estimation based on queue size, number of hops, distance, and relative speed from the sender node to the receiving node.
Bhatia et al. [70] offer a path stability metric based on queue length, the signal-to-noise ratio, and the probability of packet loss. The queue size assesses the probability of packet drop due to line buffer overflow, the probability of packet loss estimates interference and the signal-to-noise ratio estimates distance and node mobility (if the node moves far away, the signal-to-noise ratio drops). By combining the three metrics into one, one can estimate the stability of the lines and the stability of the routes.
Zent et al. [71] present a metric based on delay, bandwidth, and geographic direction.
Jagadeesan et al. [72] propose a metric based on the residual energy of the node and channel occupancy.
Qureshi et al. [73] have derived a theoretical estimate of route energy consumption based on the probability of packet loss, the number of retransmissions and the number of route hops. The authors have created an algorithm for calculating transmission power for all route nodes in order to minimize the energy spent with a given probability of package delivery.
  • Network layer (routing protocols)
The single-layer routing protocol in ad hoc networks, using probing packets, can only receive information about the nodes through which the probing packet passed and the packet travel time that estimates the delay of the found route (Table 7). As a result, the routing protocol can select routes by delay and hop number. Cross-layer routing protocols can use the cross-layer metrics described above or collect information from different layers.
Canales et al. [75] offer a routing protocol that uses data about free time slots from the channel layer to reduce interference. When sending a route request packet, it is checked on each hop whether it is possible to reserve non-interfering time slots on previous and next hops; if it’s not possible, then the request packet is dropped.
Amel et al. [76] propose a modification of the AODV routing protocol, where instead of the hop number metric, the delivery probability is estimated based on the signal-to-noise ratio obtained from the physical layer.
Chen et al. [77] suggest an improvement to the AOMDV routing protocol. The new routing protocol uses a weighted function from the queue size of the line buffer and the residual energy of the node to find routes.
Madhanmohan et al. [78] propose a modification of the AODV protocol, in which a route request is sent with information about how much power is needed to transmit the packet alongside the route. If one of the route lines does not support the specified power, the route request packet through that line is not set.
Weng et al. [79] propose a cross-layer protocol of channel and network layer. The new protocol minimizes the energy consumption in the network. The routing protocol uses data from the channel layer and finds paths with minimal power consumption for packet transmission. The energy consumption is estimated based on the probability of packet line successful delivery, the number of packet collisions, the residual energy of the nodes, and the number of packets transferred. The channel layer protocol gives a larger share of the channel to those nodes that are more likely to successfully transmit packets.
Attada et al. [80] propose an improvement of the DYMO routing protocol based on the channel resources reservation. When reserving resources, physical layer parameters such as transmission power, transmission speed, signal constellation size, and error code type are requested. By reserving resources on the basis of physical layer parameters rather than just the capacity of the line, the network capacity increases.
Ahmed et al. [81] propose to use the signal-to-noise ratio. When one selects the next node to forward the route request message, only nodes with the minimum allowable signal-to-noise ratio are selected. The high signal-to-noise ratio implies that the node is close and will not be out of radio sight for a relatively long time.
Chander et al. [82] offer a multicast routing protocol. The protocol uses physical, channel, and network layer information to form a multicast tree. The following data is used: signal strength, fading estimation, line lifetime, residual node energy, and cost of updating the multicast tree. Cross-layer interaction allows the routing protocol to find stable, slow-changing multicast route trees.
Safari et al. [83] propose the enhancement for the AODV routing protocol called cross-layer adaptive fuzzy-based ad hoc on-demand distance vector routing protocol (CLAF-AODV). The suggested method employs two-level fuzzy logic and a cross-layer design approach to select the appropriate nodes with a higher probability of participating in broadcasting by considering parameters from the three first layers of the open systems interconnection (OSI) model to achieve a quality of service, stability, and adaptability. It not only investigates the quality of the node and the network density around the node to make a decision but also investigates the path that the broadcast packet traveled to reach this node. The proposed protocol reduces the number of broadcast packets and significantly improves network performance with respect to throughput, packet loss, interference, and average energy consumption compared to the standard AODV and the fixed probability AODV (FP-AODV) routing protocols.

3.1.4. Transport Layer

The transport layer is responsible for the congestion control. The transport layer protocol estimates overload by measuring the interarrival time between delivery confirmation packets or by the lack of confirmation packets. When congestion is detected, the transport layer starts transmitting packets with a lower frequency. Congestion estimation takes into account only the line buffer overload. However, packets in ad hoc networks can be lost due to line noises and packet collisions. Then, the slowdown of packet transmission by the transport layer will not affect the probability of packet loss; the transport layer will slow down to the minimum speed, underutilizing the network capacity. To avoid this problem, cross-layer transport protocols use data from the channel and network layers to find out the cause of packet loss (Table 8).
Yu et al. [84] propose an adaptation of the TCP protocol to ad hoc networks. When delivery confirmation packets do not arrive, TCP believes that packets have been dropped due to line congestion rather than due to radio line noise or route disruption due to node movement, resulting in TCP slowing down the transmission speed by underutilizing the network’s free capacity. To avoid this, the channel layer reports the packet loss to TCP so that the packet is retransmitted from the TCP cache of adjacent nodes. This allows TCP to avoid congestion control and use full available line capacity.
Kliazovich et al. [85] modify the TCP protocol to take into account the channel layer data: the delay and the capacity of the line. More data allows for more accurate congestion estimates than using only inter-arrival time of delivery confirmation packets.
Nahm et al. [86] propose the TCP protocol modification to address the problem of network cascading overload. The cascading overload begins with the transport protocol overloading one of the route lines; the channel layer detects line overload and reports the routing protocol about line break; the routing protocol starts the procedure of finding a new route, overloading the network with route request messages. Therefore, the authors proposed a mechanism for controlling congestion at the transport layer that reduces the likelihood of network congestion due to the search for new routes. To achieve that, a new method of fractional increase in the TCP window size with explicit notification of the network layer that the route is not broken is proposed.
Chang et al. [87] offer transport and network layer protocols that use network event information. Network events are route and connection failure, network packet reception errors, line buffer overflow at the channel layer, and long channel access time. The transport protocol behaves in the following manner. When a connection is severed, the transport protocol continues to transmit data packets and sends a request to the network layer to find a new route. If a line packet transmission fails, the transport protocol retransmits the packet without waiting for a delivery confirmation packet, which will never be sent. When the packet is discarded due to the line buffer overflow, the transport protocol triggers the congestion control mechanism. In the case of long channel access time, the transport protocol also triggers the congestion control mechanism. Each node uses an overload metric counter, which increases when a buffer overflow event or a long access channel time event occurs and decreases when the event disappears. Routing is performed using the hop metric and the overload metric.
Alhosainy et al. [88] use multipath routing and optimize the network bandwidth by selecting, at the transport layer, total speeds for a set of routes and the distribution of speeds within a set of routes, depending on the packet collision probability. The optimization problem is presented as a dual decomposition problem.
Sharma et al. [89] propose improvements to the MPTCP transport protocol. To avoid congestion control due to packet loss, the transport protocol uses a route delay variance estimate and an average number of line retransmissions in routes. As a result, the transport protocol can differentiate between packet drops due to line buffer overflows and packet corruption in radio lines.

3.1.5. Application Layer

Cross-layer methods concentrated on the application layer consist of overlay network methods and applications.
  • Application layer (overlay network)
An overlay network is a collection of nodes and the services they provide (e.g., file sharing). An overlay network is implemented by applications. The overlay network has its own routing and neighbor discovery. However, the problem is that the overlay network topology and routes in it may not correspond to the physical network: neighboring nodes in the overlay network may be very far away from each other, and short routes in the overlay network may be very long in the underlying physical network. Therefore, cross-layer overlay networks use routing protocols to collect information about the overlay network. As a result, information about both the physical network and the overlay network is collected simultaneously, hence minimizing the amount of service information sent out by the overlay network (Table 9).
Beylot et al. [90] use network layer interaction for peer-to-peer application layer protocol “Gnutella” from conventional networks, as the peer discovery task is the same as the route discovery task. As a result, application layer service data are added to the network layer service data of the routing protocol. Routing protocol route discovery success is higher than using the peer node discovery protocol of the “Gnutella” application protocol.
In the works [91,93], interaction with the OLSR routing protocol is suggested without the specification of an overlay network protocol.
Delmastro et al. [92] propose the adaptation of the “Pastry” protocol to ad hoc networks.
Boukerche et al. [94] propose an adaptation of the peer-to-peer (P2P) network “Gnutella” to ad hoc networks by utilizing node location information and information from the network layer.
Kuo et al. [95] propose a P2P overlay network that interacts with the network and physical layer. To know about the link disconnections with virtual nodes, the network layer sends route disconnection messages, and the physical layer sends signal-to-noise ratio values to the application layer. With a gradual decrease in the signal-to-noise ratio, one can assume that the virtual node of the P2P network is about to disconnect, and then P2P nodes update the virtual network topology. Furthermore, all P2P nodes can be connected to each other through routes with common nodes. The virtual network will look fully connected, but the routes will redundantly pass through the physical nodes of the virtual nodes. By using route information from the network layer, the problem of false full connectivity can be avoided.
  • Application layer (applications)
There are not a lot of cross-layer applications that adapt to other layers because data from the application layer is usually treated as input data for other layers (Table 10).
In transport ad hoc networks, a moving vehicle information dissemination application, depending on the rate of ad hoc network state change (information from the other four layers), which reflects the trajectories and vehicle distribution density, can disseminate information more or less frequently, thus avoiding network congestion and delivering only the most critical information.
Puthal et al. [96] propose a congestion control mechanism for transport ad hoc networks, where, depending on the congestion level estimate, the application layer determines the number of messages to be sent and the size of the sliding window for congestion detection. The application layer also performs the task of the transport layer. The information from multiple layers about channel occupancy, queue occupancy, number of neighboring nodes, and transmission speed is used to estimate the congestion level.

3.2. Multiple Layers

Cross-layer methods that optimize the operation of multiple layers consist of methods with external entities optimizing and controlling multiple layers, and in the case where multiple layers are independent, they share information with each other.

3.2.1. External Entity Multiple Layers Control and Optimization

External entities can control and optimize multiple layers. This approach is consistent with (inherited from) the “CrossTalk” architecture [27]. External entity control is divided into fuzzy logic-based methods and dual decomposition optimization-based methods.
  • External entity multiple layers control and optimization (fuzzy logic)
Fuzzy logic-based cross-layer methods use a set of rules on how to transform a set of input metrics from different layers into output metrics for tuning the layers. The input metrics are converted into classes depending on how the metrics value space is partitioned into ranges. The output of the fuzzy logic-based system is the classes of metrics, which are converted into parameter values. Most of the conversion rules in publications are chosen empirically by the authors (Table 11).
Xia et al. [97] propose the use of information from physical, channel, and application layers (vehicle traffic speed to account for signal fading due to the Doppler effect, average line transmission delay, probability of successful packet delivery in the line) as inputs to the fuzzy logic system. The system outputs correction factors to specify the type of modulation and error-correcting codes, transmission power, maximum number of retransmissions, and rate of packet stream creation at the application layer.
Li et al. [98] propose a generalized method to evaluate the usefulness of nodes in selecting the next node for forwarding. The authors use fuzzy logic. Nodes may have many metrics, but the variance of some metrics among the set of nodes, among which the next node for forwarding is selected, may be different. If some metric does not differ much between nodes, less attention can be paid to it. Metrics normalized with respect to the mathematical expectation of the variance of metrics are fed into the fuzzy logic evaluator, and the evaluator outputs the weights of metrics. Then, the summation of metrics with weights yields the utility value of the node for forwarding. The node with the maximum value for forwarding is selected by the next node. The proposed method is suitable for the metrics of all layers.
Hasan et al. [99] propose a cross-layer approach based on fuzzy logic. The fuzzy logic evaluator uses end-to-end transport layer delay, application layer packet delivery probability and physical layer transmission speed as inputs, and monitors parameters such as transmission power and signal-code constructions of the physical layer, number of channel layer retransmissions, number of network layer route hops and application layer transmission rate. The three input parameters are assigned three values (low, medium, and high) within the fuzzy logic framework. As a result, nine combinations of parameter values are obtained, and these nine values are matched with rules that set the output parameters in nine different ranges.
  • External entity multiple layers control and optimization (dual decomposition)
The dual decomposition can be used to solve the problem of finding the optimal parameters of network operation. Optimization constraints are the values of data flow volumes between pairs of nodes, available signal-code constructions of transceivers and their transmission speeds, and parameters of MIMO antennas. The purpose of the optimization is to select routes and distribute flows along them, to set the transmission power, transmission rate, signal-code constructions of transmitters, parameters of MIMO space-time coding, and channel access time (Table 12).
Liu et al. [100] propose a cross-layer optimization of the ad hoc MIMO network throughput. The simultaneous optimization of route selection, bandwidth selection for each packet transmission, and transmission power for each MIMO complex-matrix channel is performed. The optimization takes place at the network, channel, and physical layers. The optimization problem is decomposed into two sub-problems: network layer, and physical and link layer together. The two optimization problems are then solved by the plane dissection method and subgradient method.
Cammarano et al. [101] propose an optimization of ad hoc network operation parameters with cognitive radio to maximize the network throughput through dual decomposition. The transmission rate at the transport layer, the routes at the network layer, and the channel access time at the channel layer are used together to optimize network throughput.
Teng et al. [102] propose the optimization of network performance at all five layers through vertical decomposition of the optimization problem. The paper uses the Lagrange multiplier method and derives a partial Lagrangian formula that takes into account the network’s target function and constraints from all five layers. Using dual decomposition, the complex optimization problem is decomposed into three simple problems with control parameters moved iteratively between the three problems. Solving the three optimization problems is computationally challenging, so the authors proposed a simplified heuristic to solve the three problems.

3.2.2. Independent Layers and Information Sharing

The layers can stay independent, optimizing their performance based on the information that the layers share with each other. This approach is consistent with the “MobileMan” architecture [26] (Table 13).
Yuen et al. [103] propose to use channel layer resource reservation packets by physical layer to estimate the channel state and send a reply so that the sender can choose appropriate signal-code construction based on channel estimation. The network layer obtains information about reserved resources and signal-code constructions from appropriate layers to choose routes.
Wu et al. [104] address the problem of allocating physical and channel layer resources to maximize throughput for multicast data streams. The result is a set of achievable trade-offs between throughput and energy efficiency. The physical layer resource is transmission speed, and the channel layer resource is time slots. The network layer translates the data flow requirements between sender and receiver into link resource requirements. The purpose of this work is to minimize line congestion and energy consumption in a bandwidth and energy-constrained environment.
Setton et al. [105] were among the first to propose the use of a cross-layer approach to provide low-latency video streaming. Depending on the signal-to-noise ratio, the authors vary the optimal value of packet size, type of signal constellation and symbol rate. The joint use of the channel layer and network layer solves the problem of allocating link resources according to the flows along the routes. Smart transmission scheduling at the transport layer can reduce the probability of packet loss. The application layer can adaptively select the video streaming rate according to the congestion of the routes.
Shah et al. [106] propose a cross-layer channel layer and network layer co-operation protocol for ad hoc networks with high link asymmetry. In this network, there are nodes with high transmission power and nodes with low transmission power. As a result, one node with high transmission power can send a packet to a node that has low transmission power, and the second node cannot send a reply due to low transmission power, hence link asymmetry. Link asymmetry is a problem when low-power nodes send transmission request packets. The high-power nodes will not receive them and will interfere with the transmission of low-power nodes. To solve this problem, network layer routing information is used. The transmission request packet is forwarded not only to neighboring nodes but also some number of hops further away depending on the power difference between the nodes. In this case, the request packet is sent further only to those nodes with which there is an asymmetric link. The routing protocol, in turn, from the channel layer, learns about the lists of neighboring nodes and creates reverse routes so that despite the asymmetry of links, communication can be bidirectional.
Huang et al. [107] propose a cross-layer approach that controls the transmission power, signal constellation size and channel access time depending on packet transmission rate, QoS requirements, power constraints and channel state. The authors’ technique helps to deal with the divergence problem of the traditional power control and facilitate the execution of scheduling in a distributed manner; a power control algorithm with adaptive SINR was adopted. The authors simplified the scheduling by automatically implementing it in the power control phase after solving the “transmit–receive collision”.
Jakllari et al. [108] consider a cross-layer approach using virtual MISO. In virtual MISO, multiple nodes jointly form a virtual antenna system for transmission and transmit information to a single node. For this purpose, nodes in visibility of each other are used. When one of the nodes in the group of virtual MISO receives a packet, the node distributes the packet to the nodes in the group and then the nodes in the group send the packet to the next recipient. Sending to the group may cause more interference, but the gains from the virtual antenna system can be greater. Authors state that throughput can be increased by a factor of 1.5, delivery delay can be reduced by up to 75 percent, and the number of attempts to find new routes after breaking links can be reduced by up to 60 percent. The cross-layer approach consists of several things. In the case of the network layer, routes are first searched using the usual routing protocol; then the found route is checked if there are MISO links and if the route nodes are part of MISO groups, the route is rebuilt using this information with potentially fewer hops and more stable links due to the spatial separation of MISO. The physical layer receives information from the channel layer that the transmitter is part of the virtual antenna system.
Yu et al. [109] propose a joint optimization of the selection of the data flow rate at the transport layer and the probability of sending a packet at the channel layer—the channel layer chooses whether or not to transmit a packet with some probability depending on the channel load.
Alshbatat et al. [13] optimize the UAV network parameters depending on the height and angle of the drones. UAVs can alternately use an omnidirectional antenna and a narrow directional antenna. The use of a narrow directional antenna is necessary when the UAV is at high altitude and the line budget does not allow the use of wide directional antennas. Each UAV has two directional antennas with main lobe rotation (one for communication in the down direction (in a geometrical sense), another for communication in the up direction) and two omnidirectional antennas. The UAVs also use GPS and an inertial navigation system to orient the antennas. The UAVs transmit their coordinates and orientations in space to each other based on the coordinates and orientation, and the antennas can be properly pointed toward the receivers. The authors use the OLSR routing protocol for omnidirectional antennas and a modification of the OLSR protocol for directional antennas. In this modification, the routing protocol learns the properties of directional antennas and the coordinates and orientations of the nodes.
Pham et al. [110] propose the optimization of link delay and power consumption through joint congestion control at the transport layer, channel layer queuing control, transmission speed control, and power control at the physical layer. The control is performed at different time scales. Very often at the physical layer, since signal fading can change rapidly, the average frequency for the channel layer is determined at time intervals proportional to the length of the channel packet, and the transport layer controls congestion at time intervals in seconds. Routing is not considered in the paper.
Xie et al. [111] propose using a cross-layer approach for joint routing, dynamic spectrum allocation, choice of package transmission moment, and power control with the minimization of user interference and the guarantee of the signal-to-noise ratio for ad hoc networks with cognitive radio.
Aljubayri et al. [112] offer joint multipath routing and congestion control to maximize bandwidth and reduce queuing delay. A global optimization algorithm is proposed, in which all nodes take into account the data of the entire network, and a distributed optimization algorithm is proposed, in which nodes take into account only the data from neighboring nodes.

4. Discussion

A total of 69 publications were reviewed between the years 2002 and 2023. The publication distribution by year is represented as a histogram (Figure 6).
In the reviewed publications, cross-layer methods use different combinations of OSI model layers. Using the algorithm for finding associative rules FPG (frequent pattern growth) [113], the frequency of occurrence of different combinations of layers in the considered publications (Table 14) has been calculated. Cross-layer methods most commonly use the channel, network, and physical layers (Table 14). Without the first three layers, ad hoc networks cannot exist; the first three layers have the greatest influence on ad hoc networks.
Applying FPG to the goals of the methods in the reviewed publications, we obtained the following results (Table 15). The optimization of line parameters is the most widespread compared to the optimization of route parameters. It happens mainly because, to optimize route parameters, one needs to obtain a more holistic view of the network, which is harder and incurs more service data overhead compared to obtaining neighborhood knowledge. The two most popular parameters are line throughput and energy consumption, and the sum of their frequencies is more than half (0.57). It happens because all other line parameters influence and define throughput. The line throughput optimization implicitly optimizes other parameters. Route parameters, in turn, are dependent on the line parameters and on the energy consumption. If the node battery is depleted, the route with that node is disrupted.
We can see in the reviewed works that cross-layer methods fall into two broad categories: first, methods concentrated on one layer using other layers, and second, methods concentrated on joint optimization of multiple layers. Inside these two broad categories, ten goals for using a cross-layer approach are visible:
  • MIMO, beamforming.
  • Resource reservation.
  • Random channel access.
  • Cooperative transmission.
  • Routing metrics.
  • Routing protocols.
  • TCP adaptation to ad hoc networks.
  • Overlay network.
  • Application data flow adaptation to network state.
  • Optimization of multiple layers working simultaneously.
In previous works [9,28,36,37,38,39,40,41], cross-layer methods were classified by used layer combinations. Such classification is exhaustive and poorly reflects the essence of cross-layer methods. Based on the goal of using the cross-layer approach, we deduced the new classification of cross-layer methods in ad hoc networks (Figure 7) according to the purpose pursued by using multiple layers. The proposed classification can help to simplify the goal-oriented cross-layer protocol development.
The overall objectives for network control protocols are always throughput, latency, and packet error rate. These objectives remain invariant regardless of the number of layers involved in the optimization process. At the same time, these objectives can be achieved in a variety of ways. The proposed classification helps to systematize these ways.
Quite often, when developing a new cross-layer protocol, there is a goal to achieve (it can be a routing protocol, channel access protocol, etc.). Figure 7 helps to choose the publications to base the research of new cross-layer protocols upon, given the protocols in publications were already categorized using the proposed classification. The proposed classification is goal-based, contrary to usual combination-based classifications. Combination-based classifications may be ambiguous. For example, let one cross-layer method use physical, channel, and network layers. This method can be categorized equally as channel access protocol, routing protocol, or protocol with independent layers and information sharing. At the same time, the proposed classification provides an explicit reasoning about the considered protocol. This circumstance makes the proposed classification more useful. The proposed classification helped us to highlight the 10 problems that can be solved using a cross-layer approach. These 10 problems are enumerated above. These problems were solved earlier in the confines of one corresponding layer.

5. Conclusions

The overall objectives for network control protocols are always throughput, latency, and packet error rate. These objectives remain invariant regardless of the number of layers involved in the optimization process. At the same time, these objectives can be achieved in a variety of ways. This variety is very wide, so a useful classification is needed for it. The existing surveys offer the only way to classify cross-layer ad hoc network control methods based on the involved layers. This classification is simple but not very useful because the number of the involved layers does not give us any information on the goals of the considered methods.
We have introduced the new classification of cross-layer methods in ad hoc networks, which is not based on combinations of used OSI layers. It is based on the main goal of the cross-layer method instead. Cross-layer methods can be divided into two large groups: first, optimization methods for tasks of one layer with information usage from other layers, and second, methods for the collaborative optimization of multiple layers (Figure 7). The methods of one-layer optimization are divided into corresponding layers: physical, channel, network, transport, and application. The methods of multiple layer optimization are divided into, first, the optimization of layers by a separate independent entity (this approach corresponds to the “CrossTalk” architecture [27]), and second, the independent optimization of layers by themselves, but with information sharing (this approach corresponds to the “MobileMan” architecture [26]).
The proposed classification helps to systematize the cross-layer ad hoc network control methods based on the purpose of these methods. Thus, the proposed classification is not morphology-based but is goal-based.
Most cross-layer methods use the first three layers of the OSI model. Network, channel, and physical layers form the basis of ad hoc networks. Without these layers, ad hoc networks cannot exist. Meeting the requirements for the delivery of data flows (and the possibility of delivery) depends mostly on the bottom three layers. The studies of cross-layer methods for upper layers are rare. The optimization of the application layer does not matter, as this layer creates data streams for the network to deliver. Data from the application layer should be treated as an input parameter for cross-layer methods. The transport layer is responsible for the delivery guarantee and congestion control, but the confirmation of delivery can be performed at the application layer, and congestion can be avoided by the routing protocol (network layer), which chooses paths with the least busy lines.

6. Future Directions

There is a lack of cross-layer methods concentrated on applications in which applications perceive network state, communicate with each other (inside one node), and generate data flows at the necessary rate or with a rate as close to the network congestion occurrence as possible. The transport layer is responsible for congestion control, but congestion control is usually not QoS sensitive; multiple applications will be given equal access to available bandwidth. Therefore, application congestion control is capable of achieving QoS requirements better than other layers or, at least, acknowledging that QoS requirements cannot be met.
Cross-layer methods concentrated on routing protocols with route selection based on physical layer antenna characteristics (beamforming capabilities, number of antenna sectors etc.) are still not completely developed. There were quite a few routing protocols created that consider antenna properties, but in an abstract way, never using data about antenna patterns (dependence of antenna gain from elevation and azimuth angles) to the authors’ knowledge. Aljumaily et al. [114] consider ad hoc networks with random beamforming. Nodes steer beams in random directions, eventually scanning all angular space and, with some probability, obtain reply packets. Routes are constructed based on line existence probability. Biomo et al. [115] propose a routing algorithm for ad hoc networks with sector antennas. Nodes in that network can transmit or receive simultaneously in multiple sectors without intersector interference. Sectors are effectively considered as additional lines compared to the one omnidirectional antenna. Lahsen et al. [116] use q-learning and ant-colony algorithm optimization to jointly select beam and transmission power. The routing protocol of Lahsen et al. uses the ratio of node beams to node the neighbors’ number. Nodes with bigger ratios are preferred during route construction as their lines have less interference. Rana et al. [117] propose the route request scheme dealing with the problem of the impossibility of receiving route replies from all sides when using directional antennas.
One can estimate interference of packet transmission using knowledge about antenna patterns and transmission power. Choosing routes with directive antennas transmitting packets with different antenna patterns at each hop can minimize network interference and packet collisions and increase network capacity. In particular, multicast routes can benefit from antenna transmission pattern selection because multicast routes are trees. Sometimes, a node can have multiple children, and then an omnidirectional antenna pattern is preferable. Sometimes, a node can have one child, and then a directive pattern is preferable.
It should be noted that thorough research was conducted regarding potential ad hoc network capacity using directive antennas such as sector antennas and beamforming antennas [118,119,120], the channel layer protocols development [55,56,57,58,59,60,121,122,123,124], and fast neighborhood discovery protocols for directive antennas [125,126]. However, channel layer protocols optimize line performance, not flow performance.
Furthermore, cross-layer methods concentrated on routing protocols rarely use estimated data flow rates from application or transport layers. If the flow rate is low, the routing protocol can be lenient in choosing the route because a low rate can hardly cause network congestion. The contrary situation occurs for high bandwidth flows.
Cross-layer methods with external entity multiple-layer control and optimization based on fuzzy logic lack a theoretical base because, in all publications, to our knowledge, fuzzy rules are chosen empirically. Automated heuristics are much needed for fuzzy rule set creation. As for dual decomposition optimization applications, there are many more heuristic optimization methods that are still not applied to multiple-layer control.
In cross-layer methods with independent layers and information sharing, layers are independent, but information sharing forms implicit interconnections between layers. Some layer connections can possibly cause instability of all layers. Therefore, it is necessary to conduct research about what information layers should be shared and how often to update it.
Furthermore, almost all of cross-layer methods depend on an information exchange between network nodes. There is still no research, to our knowledge, which addresses the problem of the estimation of what data should be sent between nodes and how often, depending on network and data flow state, their change rate, and with regard to underlying network control methods.

Author Contributions

Conceptualization, V.I. and M.T.; methodology, V.I.; software, V.I.; validation, V.I.; investigation, V.I.; data curation, V.I.; writing—original draft preparation, V.I. and M.T.; writing—review and editing, V.I. and M.T.; visualization, V.I.; supervision, M.T.; project administration, M.T.; funding acquisition, M.T. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

All the numerical data analyzed in the paper is presented in the text.

Acknowledgments

The authors thank Andrey E. Schegolev for his valuable insights.

Conflicts of Interest

The authors declare no conflicts of interest.

Abbreviations

The following abbreviations are used in this manuscript:
ALMAirtime Link Metric
AODVAd-hoc On-demand Distance Vector
AOMDVAd-hoc On-demand Multipath Distance Vector
CLAF-AODVAdaptive Fuzzy-based Ad Hoc On-Demand Distance Vector
CSMA/CACollision Sensing Medium Access / Collision Avoidance
DARPADefense Advanced Research Projects Agency
DYMODynamic MANET On-demand
ETTExpected Transmission Time
ETXExpected Transmission Count
FP-AODVFixed Probability AODV
FPGFrequent Pattern Growth
GSOGlow Swarm optimization
IPInternet Protocol
ISOInternational Organization for Standardization
MACMedium Access Control
MICMetric of Interference and Channel-switching
MIMOMultiple-Input Multiple-Output
MISOMultiple-Input Single-Output
MPTCPMultipath Transport Control Protocol
OLSROptimized Link State Routing
OSIOpen Systems Interconnection
P2PPeer-to-Peer
QoSQuality of Service
RSSIReceived Signal Strength Indicator
SINRSignal-to-Interference + Noise Ratio
SNRSignal-to-Noise Ratio
TCPTransport Control Protocol
TDMATime Division Multiple Access
UAVUnmanned Aerial Vehicle
WCETTWeighted Cumulative Expected Transmission Time

References

  1. Raza, N.; Umar Aftab, M.; Qasim Akbar, M.; Ashraf, O.; Irfan, M. Mobile ad-hoc networks applications and its challenges. Commun. Netw. 2016, 8, 131–136. [Google Scholar] [CrossRef]
  2. Kirubasri, G.; Maheswari, U.; Venkatesh, R. A survey on hierarchical cluster based routing protocols for wireless multimedia sensor networks. J. Converg. Inf. Technol. 2014, 9, 19. [Google Scholar]
  3. Sennan, S.; Somula, R.; Luhach, A.K.; Deverajan, G.G.; Alnumay, W.; Jhanjhi, N.; Ghosh, U.; Sharma, P. Energy efficient optimal parent selection based routing protocol for Internet of Things using firefly optimization algorithm. Trans. Emerg. Telecommun. Technol. 2021, 32, e4171. [Google Scholar] [CrossRef]
  4. Zemrane, H.; Baddi, Y.; Hasbi, A. Mobile adhoc networks for intelligent transportation system: Comparative analysis of the routing protocols. Procedia Comput. Sci. 2019, 160, 758–765. [Google Scholar] [CrossRef]
  5. Pandey, M.A. Introduction to mobile ad hoc network. Int. J. Sci. Res. Publ. 2015, 5, 1–6. [Google Scholar]
  6. Zimmermann, H. OSI reference model-the ISO model of architecture for open systems interconnection. IEEE Trans. Commun. 1980, 28, 425–432. [Google Scholar] [CrossRef]
  7. Goldsmith, A. Wireless Communications; Cambridge University Press: Cambridge, UK, 2005. [Google Scholar]
  8. Stallings, W. Wireless Communications & Networks; Pearson Education India: Delhi, India, 2009. [Google Scholar]
  9. Srivastava, V.; Motani, M. Cross-layer design: A survey and the road ahead. IEEE Commun. Mag. 2005, 43, 112–119. [Google Scholar] [CrossRef]
  10. Conti, M.; Maselli, G.; Turi, G.; Giordano, S. Cross-layering in mobile ad hoc network design. Computer 2004, 37, 48–51. [Google Scholar] [CrossRef]
  11. Jurdak, R. Wireless Ad Hoc and Sensor Networks: A Cross-Layer Design Perspective; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2007. [Google Scholar]
  12. Goldsmith, A.; Wicker, S. Design challenges for energy-constrained ad hoc wireless networks. IEEE Wirel. Commun. 2002, 9, 8–27. [Google Scholar] [CrossRef]
  13. Alshbatat, A.I.; Dong, L. Cross layer design for mobile ad-hoc unmanned aerial vehicle communication networks. In Proceedings of the 2010 International Conference on Networking, Sensing and Control (ICNSC), Chicago, IL, USA, 10–12 April 2010; IEEE: Piscataway, NJ, USA, 2010; pp. 331–336. [Google Scholar]
  14. Gawas, M.A.; Govekar, S. State-of-art and open issues of cross-layer design and QOS routing in internet of vehicles. Wirel. Pers. Commun. 2021, 116, 2261–2297. [Google Scholar] [CrossRef]
  15. Cruz, R.L.; Santhanam, A.V. Optimal link scheduling and power control in cdma multihop wireless networks. In Proceedings of the Global Telecommunications Conference, 2002, GLOBECOM’02, Taipei, Taiwan, 17–21 November 2002; IEEE: Piscataway, NJ, USA, 2002; Volume 1, pp. 52–56. [Google Scholar]
  16. Merz, R.; Widmer, J.; Le Boudec, J.Y.; Radunović, B. A joint PHY/MAC architecture for low-radiated power TH-UWB wireless ad hoc networks. Wirel. Commun. Mob. Comput. 2005, 5, 567–580. [Google Scholar] [CrossRef]
  17. Toumpis, S.; Goldsmith, A.J. Capacity regions for wireless ad hoc networks. IEEE Trans. Wirel. Commun. 2003, 2, 736–748. [Google Scholar] [CrossRef]
  18. Neely, M.; Modiano, E.; Rohrs, C. Dynamic power allocation and routing for time varying wireless networks. In Proceedings of the IEEE INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428), San Francisco, CA, USA, 30 March–3 April 2003; Volume 1, pp. 745–755. [Google Scholar] [CrossRef]
  19. Zorba, N.; Skianis, C.; Verikoukis, C. Cross Layer Designs in WLAN Systems; Troubador Publishing Limited: Market Harborough, UK, 2011. [Google Scholar]
  20. Zuo, J.; Dong, C.; Ng, S.X.; Yang, L.L.; Hanzo, L. Cross-layer aided energy-efficient routing design for ad hoc networks. IEEE Commun. Surv. Tutorials 2015, 17, 1214–1238. [Google Scholar] [CrossRef]
  21. Arafat, M.Y.; Poudel, S.; Moh, S. Medium access control protocols for flying ad hoc networks: A review. IEEE Sens. J. 2020, 21, 4097–4121. [Google Scholar] [CrossRef]
  22. Labiod, M.A.; Gharbi, M.; Coudoux, F.X.; Corlay, P.; Doghmane, N. Cross-layer scheme for low latency multiple description video streaming over Vehicular Ad-hoc NETworks (VANETs). AEU-Int. J. Electron. Commun. 2019, 104, 23–34. [Google Scholar] [CrossRef]
  23. Amponis, G.; Lagkas, T.; Sarigiannidis, P.; Vitsas, V.; Fouliras, P.; Wan, S. A survey on FANET routing from a cross-layer design perspective. J. Syst. Archit. 2021, 120, 102281. [Google Scholar] [CrossRef]
  24. Ahlswede, R.; Cai, N.; Li, S.Y.; Yeung, R.W. Network information flow. IEEE Trans. Inf. Theory 2000, 46, 1204–1216. [Google Scholar] [CrossRef]
  25. Fu, F.; van der Schaar, M. A new systematic framework for autonomous cross-layer optimization. IEEE Trans. Veh. Technol. 2008, 58, 1887–1903. [Google Scholar] [CrossRef]
  26. Conti, M.; Giordano, S.; Maselli, G.; Turi, G. Mobileman: Mobile metropolitan ad hoc networks. In Proceedings of the IFIP International Conference on Personal Wireless Communications, Venice, Italy, 23–25 September 2003; Springer: Berlin/Heidelberg, Germany, 2003; pp. 169–174. [Google Scholar]
  27. Winter, R.; Schiller, J.H.; Nikaein, N.; Bonnet, C. Crosstalk: Cross-layer decision support based on global knowledge. IEEE Commun. Mag. 2006, 44, 93–99. [Google Scholar] [CrossRef]
  28. Awang, A.; Husain, K.; Kamel, N.; Aissa, S. Routing in vehicular ad-hoc networks: A survey on single-and cross-layer design techniques, and perspectives. IEEE Access 2017, 5, 9497–9517. [Google Scholar] [CrossRef]
  29. Fu, B.; Xiao, Y.; Deng, H.; Zeng, H. A survey of cross-layer designs in wireless networks. IEEE Commun. Surv. Tutorials 2013, 16, 110–126. [Google Scholar] [CrossRef]
  30. Aktas, I.; Alizai, M.H.; Schmidt, F.; Wirtz, H.; Wehrle, K. Harnessing cross-layer-design. Hoc Netw. 2014, 13, 444–461. [Google Scholar] [CrossRef]
  31. Edirisinghe, R.; Zaslavsky, A. Cross-layer contextual interactions in wireless networks. IEEE Commun. Surv. Tutorials 2013, 16, 1114–1134. [Google Scholar] [CrossRef]
  32. Kawadia, V.; Kumar, P.R. A cautionary perspective on cross-layer design. IEEE Wirel. Commun. 2005, 12, 3–11. [Google Scholar] [CrossRef]
  33. Singh, J.P.; Bambos, N.; Srinivasan, B.; Clawin, D. Cross-layer multi-hop wireless routing for inter-vehicle communication. In Proceedings of the 2nd International Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities, 2006. TRIDENTCOM 2006, Barcelona, Spain, 1–3 March 2006; IEEE: Piscataway, NJ, USA, 2006; p. 10. [Google Scholar]
  34. Katsaros, K.; Dianati, M.; Tafazolli, R.; Kernchen, R. CLWPR—A novel cross-layer optimized position based routing protocol for VANETs. In Proceedings of the 2011 IEEE Vehicular Networking Conference (VNC), Amsterdam, The Netherlands, 14–16 November 2011; IEEE: Piscataway, NJ, USA, 2011; pp. 139–146. [Google Scholar]
  35. Chen, Y.; Xiang, Z.; Jian, W.; Jiang, W. A cross-layer AOMDV routing protocol for V2V communication in urban VANET. In Proceedings of the 2009 Fifth International Conference on Mobile Ad-Hoc and Sensor Networks, Wuyi, China, 14–16 December 2009; IEEE: Piscataway, NJ, USA, 2009; pp. 353–359. [Google Scholar]
  36. Ren, X.; Zhang, J. Review of the Cross-Layer Design in Wireless Ad Hoc and Sensor Networks. In Proceedings of the 2010 International Conference on Computational Intelligence and Software Engineering, Wuhan, China, 10–12 December 2010; IEEE: Piscataway, NJ, USA, 2010. [Google Scholar] [CrossRef]
  37. Jarupan, B.; Ekici, E. A survey of cross-layer design for VANETs. Hoc Netw. 2011, 9, 966–983. [Google Scholar] [CrossRef]
  38. Trivedi, H.; Veeraraghavan, P.; Loke, S.; Desai, A.; Singh, J. Routing mechanisms and cross-layer design for Vehicular Ad Hoc Networks: A survey. In Proceedings of the 2011 IEEE Symposium on Computers & Informatics, Banff, AB, USA, 18–20 August 2011; IEEE: Piscataway, NJ, USA, 2011. [Google Scholar] [CrossRef]
  39. Mantzouratos, S.; Gardikis, G.; Koumaras, H.; Kourtis, A. Survey of cross-layer proposals for video streaming over Mobile Ad hoc Networks (MANETs). In Proceedings of the 2012 International Conference on Telecommunications and Multimedia (TEMU), Crete, Greece, 30 July–1 August 2012; IEEE: Piscataway, NJ, USA, 2012. [Google Scholar] [CrossRef]
  40. Goswami, C.; Sultanah, P. A Study on Cross-Layer TCP Performance in Wireless Ad Hoc Network. In International Conference on Intelligent Data Communication Technologies and Internet of Things (ICICI) 2018; Springer International Publishing: Coimbatore, India, 2018; pp. 56–70. [Google Scholar] [CrossRef]
  41. Singhal, C.; Rajesh, A. Review on cross-layer design for cognitive ad-hoc and sensor network. IET Commun. 2020, 14, 897–909. [Google Scholar] [CrossRef]
  42. DARPA IAMANET Developed Scalable and Secure Mobile Ad Hoc Networks (MANETS) to Support an Entire Battalion—International Defense Security & Technology. 2024. Available online: https://idstch.com/military/mobile-ad-hoc-networks-manets-essential-for-network-centric-warfare-and-disaster-management/ (accessed on 12 January 2024).
  43. Connected and Automated Mobility. 2024. Available online: https://digital-strategy.ec.europa.eu/en/policies/connected-and-automated-mobility/ (accessed on 12 January 2024).
  44. Frąckiewicz, M. The Potential of Mesh Networks for Africa’s Connectivity. 2023. Available online: https://ts2.pl/en/the-potential-of-mesh-networks-for-africas-connectivity (accessed on 12 January 2024).
  45. Zorzi, M.; Zeidler, J.; Anderson, A.; Rao, B.; Proakis, J.; Swindlehurst, A.; Jensen, M.; Krishnamurthy, S. Cross-layer issues in MAC protocol design for MIMO ad hoc networks. IEEE Wirel. Commun. 2006, 13, 62–76. [Google Scholar] [CrossRef]
  46. Hamdaoui, B.; Ramanathan, P. A Cross-Layer Admission Control Framework for Wireless Ad-Hoc Networks using Multiple Antennas. IEEE Trans. Wirel. Commun. 2007, 6, 4014–4024. [Google Scholar] [CrossRef]
  47. Mansoor, N.; Islam, A.K.M.M.; Zareei, M.; Vargas-Rosales, C. RARE: A Spectrum Aware Cross-Layer MAC Protocol for Cognitive Radio Ad-Hoc Networks. IEEE Access 2018, 6, 22210–22227. [Google Scholar] [CrossRef]
  48. Gong, M.X.; Midkiff, S.F. Distributed channel assignment protocols: A cross-layer approach [wireless ad hoc networks]. In Proceedings of the IEEE Wireless Communications and Networking Conference, Wuhan, China, 26 September 2005; IEEE: Piscataway, NJ, USA, 2005; Volume 4, pp. 2195–2200. [Google Scholar]
  49. Gong, M.X.; Midkiff, S.F.; Mao, S. A Cross-layer Approach to Channel Assignment in Wireless Ad Hoc Networks. Mob. Netw. Appl. 2006, 12, 43–56. [Google Scholar] [CrossRef]
  50. de Renesse, R.; Friderikos, V.; Aghvami, H. Cross-layer cooperation for accurate admission control decisions in mobile ad hoc networks. IET Commun. 2007, 1, 577. [Google Scholar] [CrossRef]
  51. Raj, R.N.; Nayak, A.; Kumar, M.S. Spectrum-aware cross-layered routing protocol for cognitive radio ad hoc networks. Comput. Commun. 2020, 164, 249–260. [Google Scholar]
  52. Mansour, H.S.; Mutar, M.H.; Aziz, I.A.; Mostafa, S.A.; Mahdin, H.; Abbas, A.H.; Hassan, M.H.; Abdulsattar, N.F.; Jubair, M.A. Cross-Layer and Energy-Aware AODV Routing Protocol for Flying Ad-Hoc Networks. Sustainability 2022, 14, 8980. [Google Scholar] [CrossRef]
  53. Toumpis, S.; Goldsmith, A.J. Performance, optimization, and cross-layer design of media access protocols for wireless ad hoc networks. In Proceedings of the IEEE International Conference on Communications, 2003. ICC’03, Anchorage, AK, USA, 11–15 May 2003; IEEE: Piscataway, NJ, USA, 2003; Volume 3, pp. 2234–2240. [Google Scholar]
  54. Pham, P.; Perreau, S.; Jayasuriya, A. New cross-Layer design approach to ad hoc networks under Rayleigh fading. IEEE J. Sel. Areas Commun. 2005, 23, 28–39. [Google Scholar] [CrossRef]
  55. Dai, L.; Letaief, K. Cross-layer design for combining cooperative diversity with truncated ARQ in ad-hoc wireless networks. In Proceedings of the GLOBECOM’05. IEEE Global Telecommunications Conference, St. Louis, MI, USA, 28 November–2 December 2005; IEEE: Piscataway, NJ, USA, 2005. [Google Scholar] [CrossRef]
  56. Liu, F.; Korakis, T.; Tao, Z.; Panwar, S. A MAC-PHY cross-layer protocol for ad hoc wireless networks. In Proceedings of the 2008 IEEE Wireless Communications and Networking Conference, Las Vegas, NV, USA, 31 March–3 April 2008; IEEE: Piscataway, NJ, USA, 2008; pp. 1792–1797. [Google Scholar]
  57. Dong, L.; Petropulu, A.; Poor, H. A Cross-Layer Approach to Collaborative Beamforming for Wireless Ad Hoc Networks. IEEE Trans. Signal Process. 2008, 56, 2981–2993. [Google Scholar] [CrossRef]
  58. Aguilar, T.; Syue, S.J.; Gauthier, V.; Afifi, H.; Wang, C.L. CoopGeo: A Beaconless Geographic Cross-Layer Protocol for Cooperative Wireless Ad Hoc Networks. IEEE Trans. Wirel. Commun. 2011, 10, 2554–2565. [Google Scholar] [CrossRef]
  59. Ding, Z.; Leung, K.K. Cross-Layer Routing Using Cooperative Transmission in Vehicular Ad-hoc Networks. IEEE J. Sel. Areas Commun. 2011, 29, 571–581. [Google Scholar] [CrossRef]
  60. Wang, X.; Li, J. Network Coding Aware Cooperative MAC Protocol for Wireless Ad Hoc Networks. IEEE Trans. Parallel Distrib. Syst. 2014, 25, 167–179. [Google Scholar] [CrossRef]
  61. Park, M.; Andrews, J.; Nettles, S. Wireless channel-aware ad hoc cross-layer protocol with multiroute path selection diversity. In Proceedings of the 2003 IEEE 58th Vehicular Technology Conference, VTC 2003-Fall (IEEE Cat. No.03CH37484), Orlando, FL, USA, 6–9 October 2003; IEEE: Piscataway, NJ, USA, 2003. [Google Scholar] [CrossRef]
  62. Draves, R.; Padhye, J.; Zill, B. Routing in multi-radio, multi-hop wireless mesh networks. In Proceedings of the 10th Annual International Conference on Mobile Computing and Networking, Philadelphia, PA, USA, 26 September–1 October 2004; pp. 114–128. [Google Scholar]
  63. Yang, Y.; Wang, J.; Kravets, R. Designing routing metrics for mesh networks. In Proceedings of the IEEE Workshop on Wireless Mesh Networks (WiMesh), Santa Clara, CA, USA, 26 September 2005; pp. 1–9. [Google Scholar]
  64. Aboul-Magd, O. Joint SEE-Mesh/Wi-Mesh Proposal to 802.11 TGs. In Proceedings of the IEEE 802.11 WLAN Working Group Session, March 2006; Volume 3, p. 77. Available online: https://www.comnets.rwth-aachen.de (accessed on 12 January 2024).
  65. Ramachandran, B.; Shanmugavel, S. Received signal strength-based cross-layer designs for mobile ad hoc networks. IETE Tech. Rev. 2008, 25, 192–200. [Google Scholar] [CrossRef]
  66. Oh, B.J.; Chen, C.W. A Cross-Layer Approach to Multichannel MAC Protocol Design for Video Streaming Over Wireless Ad Hoc Networks. IEEE Trans. Multimed. 2009, 11, 1052–1061. [Google Scholar] [CrossRef]
  67. Hieu, C.T.; Hong, C.S. A reliable and high throughput Multi-Rate Ad Hoc routing protocol: Cross layer approach. In Proceedings of the 2010 International Conference on Information and Communication Technology Convergence (ICTC), Jeju, Republic of Korea, 17–19 November 2010; IEEE: Piscataway, NJ, USA, 2010; pp. 362–367. [Google Scholar]
  68. Mucchi, L.; Chisci, L.; Giovannetti, G.; Fabbrini, L. Robust cross-layer routing protocol for Mobile Ad hoc NETworks. In Proceedings of the 2012 IEEE 23rd International Symposium on Personal, Indoor and Mobile Radio Communications-(PIMRC), Toronto, ON, Canada, 5–8 September 2012; IEEE: Piscataway, NJ, USA, 2012; pp. 278–284. [Google Scholar]
  69. Ahmed, B.; Mohamed, R.; Mohamed, O. Queue length and mobility aware routing protocol for mobile ad hoc network. Int. J. Commun. Netw. Inf. Secur. 2012, 4, 207. [Google Scholar] [CrossRef]
  70. Bhatia, G.; Kumar, V. A cross layer based reliable route metric for Mobile Ad hoc Networks. In Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology, Coimbatore, India, 26–28 October 2012; ACM: New York, NY, USA, 2012. [Google Scholar] [CrossRef]
  71. Zeng, Y.; Xiang, K.; Li, D.; Vasilakos, A.V. Directional routing and scheduling for green vehicular delay tolerant networks. Wirel. Netw. 2013, 19, 161–173. [Google Scholar] [CrossRef]
  72. Jagadeesan, D.; Narayanan, S.; Asha, G. Efficient load sharing using multipath channel awareness routing in mobile ad hoc networks. Indian J. Sci. Technol. 2015, 8, 67729. [Google Scholar] [CrossRef]
  73. Qureshi, K.N.; Abdullah, A.H.; Lloret, J.; Altameem, A. Road-aware routing strategies for vehicular ad hoc networks: Characteristics and comparisons. Int. J. Distrib. Sens. Netw. 2016, 12, 1605734. [Google Scholar] [CrossRef]
  74. De Couto, D.S.; Aguayo, D.; Bicket, J.; Morris, R. A high-throughput path metric for multi-hop wireless routing. In Proceedings of the 9th Annual International Conference on Mobile Computing and Networking, San Diego, CA, USA, 14–19 September 2003; pp. 134–146. [Google Scholar]
  75. Canales, M.; Gállego, J.R.; Hernández-Solana, Á.; Valdovinos, A. QoS provision in mobile ad hoc networks with an adaptive cross-layer architecture. Wirel. Netw. 2008, 15, 1165–1187. [Google Scholar] [CrossRef]
  76. Amel, B.; Zoulikha, M.M. Routing technique with cross-layer approach in Ad hoc network. In Proceedings of the 2009 Second International Conference on the Applications of Digital Information and Web Technologies, London, UK, 4–6 August 2009; IEEE: Piscataway, NJ, USA, 2009. [Google Scholar] [CrossRef]
  77. Chen, J.; Li, Z.; Liu, J.; Kuo, Y. QoS Multipath Routing Protocol Based on Cross Layer Design for Ad hoc Networks. In Proceedings of the 2011 International Conference on Internet Computing and Information Services, Hong Kong, China, 17–18 September 2011; IEEE: Piscataway, NJ, USA, 2011. [Google Scholar] [CrossRef]
  78. MadhanMohan, R.; Selvakumar, K. Power controlled routing in wireless ad hoc networks using cross layer approach. Egypt. Inform. J. 2012, 13, 95–101. [Google Scholar] [CrossRef]
  79. Weng, C.C.; Chen, C.W.; Chen, P.Y.; Chang, K.C. Design of an energy-efficient cross-layer protocol for mobile iad hoc/i networks. IET Commun. 2013, 7, 217–228. [Google Scholar] [CrossRef]
  80. Attada, V.; Setty, S.P. Cross Layer Design Approach to Enhance the Quality of Service in Mobile Ad Hoc Networks. Wirel. Pers. Commun. 2015, 84, 305–319. [Google Scholar] [CrossRef]
  81. Ahmed, A.S.; Kumaran, T.S.; Syed, S.S.A.; Subburam, S. Cross-Layer Design Approach for Power Control in Mobile Ad Hoc Networks. Egypt. Inform. J. 2015, 16, 1–7. [Google Scholar] [CrossRef]
  82. Chander, D.; Kumar, R. QoS Enabled Cross-Layer Multicast Routing over Mobile Ad Hoc Networks. Procedia Comput. Sci. 2018, 125, 215–227. [Google Scholar] [CrossRef]
  83. Safari, F.; Kunze, H.; Ernst, J.; Gillis, D. A Novel Cross-layer Adaptive Fuzzy-based Ad hoc On-Demand Distance Vector Routing Protocol for MANETs. IEEE Access 2023, 11, 50805–50822. [Google Scholar] [CrossRef]
  84. Yu, X. Improving TCP performance over mobile ad hoc networks by exploiting cross-layer information awareness. In Proceedings of the 10th Annual International Conference on Mobile Computing and Networking, Philadelphia, PA, USA, 26 September–1 October 2004; ACM: New York, NY, USA, 2004. [Google Scholar] [CrossRef]
  85. Kliazovich, D.; Granelli, F. Cross-layer congestion control in ad hoc wireless networks. Hoc Netw. 2006, 4, 687–708. [Google Scholar] [CrossRef]
  86. Nahm, K.; Helmy, A.; Kuo, C.C. Cross-Layer Interaction of TCP and Ad Hoc Routing Protocols in Multihop IEEE 802.11 Networks. IEEE Trans. Mob. Comput. 2008, 7, 458–469. [Google Scholar] [CrossRef]
  87. Chang, H.P.; Kan, H.W.; Ho, M.H. Adaptive TCP congestion control and routing schemes using cross-layer information for mobile ad hoc networks. Comput. Commun. 2012, 35, 454–474. [Google Scholar] [CrossRef]
  88. Alhosainy, A.; Kunz, T. Joint Optimal Congestion, Multipath Routing, and Contention Control for Wireless Ad Hoc Networks. IEEE Commun. Lett. 2017, 21, 2670–2673. [Google Scholar] [CrossRef]
  89. Sharma, V.K.; Verma, L.P.; Kumar, M. CL-ADSP: Cross-Layer adaptive data scheduling policy in mobile ad-hoc networks. Future Gener. Comput. Syst. 2019, 97, 530–563. [Google Scholar] [CrossRef]
  90. Beylot, A.L.; Dhaou, R.; Gauthier, V.; Becker, M. Cross-Layer Simulation and Optimization for Mobile Ad-Hoc Networks. In IFIP International Federation for Information Processing; Springer: Greer, SC, USA, 2005; pp. 13–22. [Google Scholar] [CrossRef]
  91. Li, L.; Lamont, L. A lightweight service discovery mechanism for mobile ad hoc pervasive environment using cross-layer design. In Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops, Kauai, HI, USA, 8–12 March 2005; IEEE: Piscataway, NJ, USA, 2005; pp. 55–59. [Google Scholar]
  92. Delmastro, F. From Pastry to CrossROAD: CROSS-layer Ring Overlay for AD hoc networks. In Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops, Kauai, HI, USA, 8–12 March 2005; IEEE: Piscataway, NJ, USA, 2005; pp. 60–64. [Google Scholar]
  93. Halonen, T.; Ojala, T. Cross-layer design for providing service oriented architecture in a mobile Ad Hoc network. In Proceedings of the 5th International Conference on Mobile and Ubiquitous Multimedia, Stanford, CA, USA, 4–6 December 2006; ACM: New York, NY, USA, 2006. [Google Scholar] [CrossRef]
  94. Boukerche, A.; Zarrad, A.; Araujo, R.B. A Cross-Layer Approach-Based Gnutella for Collaborative Virtual Environments over Mobile Ad Hoc Networks. IEEE Trans. Parallel Distrib. Syst. 2010, 21, 911–924. [Google Scholar] [CrossRef]
  95. Kuo, J.L.; Shih, C.H.; Ho, C.Y.; Chen, Y.C. A cross-layer approach for real-time multimedia streaming on wireless peer-to-peer ad hoc network. Hoc Netw. 2013, 11, 339–354. [Google Scholar] [CrossRef]
  96. Puthal, D.; Mir, Z.H.; Filali, F.; Menouar, H. Cross-layer architecture for congestion control in Vehicular Ad-hoc Networks. In Proceedings of the 2013 International Conference on Connected Vehicles and Expo (ICCVE), Las Vegas, NV, USA, 2–6 December 2013; IEEE: Piscataway, NJ, USA, 2013. [Google Scholar] [CrossRef]
  97. Xia, X.; Ren, Q.; Liang, Q. Cross-layer design for mobile ad hoc networks: Energy, throughput and delay-aware approach. In Proceedings of the IEEE Wireless Communications and Networking Conference, 2006. WCNC 2006, Las Vegas, NV, USA, 3–6 April 2006; IEEE: Piscataway, NJ, USA, 2006. [Google Scholar] [CrossRef]
  98. Li, N.; Martinez-Ortega, J.F.; Diaz, V.H. Cross-Layer and Reliable Opportunistic Routing Algorithm for Mobile Ad Hoc Networks. IEEE Sens. J. 2018, 18, 5595–5609. [Google Scholar] [CrossRef]
  99. Hasan, N.; Mishra, A.; Ray, A.K. Fuzzy logic based cross-layer design to improve Quality of Service in Mobile ad-hoc networks for Next-gen Cyber Physical System. Eng. Sci. Technol. Int. J. 2022, 35, 101099. [Google Scholar] [CrossRef]
  100. Liu, J.; Hou, Y.; Shi, Y.; Sherali, H. Cross-Layer Optimization for MIMO-Based Wireless Ad Hoc Networks: Routing, Power Allocation, and Bandwidth Allocation. IEEE J. Sel. Areas Commun. 2008, 26, 913–926. [Google Scholar] [CrossRef]
  101. Cammarano, A.; Presti, F.L.; Maselli, G.; Pescosolido, L.; Petrioli, C. Throughput-Optimal Cross-Layer Design for Cognitive Radio Ad Hoc Networks. IEEE Trans. Parallel Distrib. Syst. 2015, 26, 2599–2609. [Google Scholar] [CrossRef]
  102. Teng, Y.; Song, M. Cross-Layer Optimization and Protocol Analysis for Cognitive Ad Hoc Communications. IEEE Access 2017, 5, 18692–18706. [Google Scholar] [CrossRef]
  103. Yuen, W.H.; no Lee, H.; Andersen, T. A simple and effective cross layer networking system for mobile ad hoc networks. In Proceedings of the 13th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, Lisbon, Portugal, 18 September 2002; IEEE: Piscataway, NJ, USA, 2002. [Google Scholar] [CrossRef]
  104. Wu, Y.; Chou, P.A.; Zhang, Q.; Jain, K.; Zhu, W.; Kung, S.Y. Network planning in wireless ad hoc networks: A cross-layer approach. IEEE J. Sel. Areas Commun. 2005, 23, 136–150. [Google Scholar]
  105. Setton, E.; Yoo, T.; Zhu, X.; Goldsmith, A.; Girod, B. Cross-layer design of ad hoc networks for real-time video streaming. IEEE Wirel. Commun. 2005, 12, 59–65. [Google Scholar] [CrossRef]
  106. Shah, V.; Gelal, E.; Krishnamurthy, S.V. Handling asymmetry in power heterogeneous ad hoc networks. Comput. Netw. 2007, 51, 2594–2615. [Google Scholar] [CrossRef]
  107. Huang, W.L.; Letaief, K.B. Cross-Layer Scheduling and Power Control Combined With Adaptive Modulation for Wireless Ad Hoc Networks. IEEE Trans. Commun. 2007, 55, 728–739. [Google Scholar] [CrossRef]
  108. Jakllari, G.; Krishnamurthy, S.V.; Faloutsos, M.; Krishnamurthy, P.V.; Ercetin, O. A Cross-Layer Framework for Exploiting Virtual MISO Links in Mobile Ad Hoc Networks. IEEE Trans. Mob. Comput. 2007, 6, 579–594. [Google Scholar] [CrossRef]
  109. Yu, Y.; Giannakis, G.B. Cross-layer congestion and contention control for wireless ad hoc networks. IEEE Trans. Wirel. Commun. 2008, 7, 37–42. [Google Scholar] [CrossRef]
  110. Pham, Q.V.; To, H.L.; Hwang, W.J. A multi-timescale cross-layer approach for wireless ad hoc networks. Comput. Netw. 2015, 91, 471–482. [Google Scholar] [CrossRef]
  111. Xie, X.Z.; Yang, H.L.; Hu, X.F.; Ma, B. Cross-layer design of distributed routing and dynamic spectrum access in cognitive radio ad hoc networks. Int. J. Auton. Adapt. Commun. Syst. 2017, 10, 139. [Google Scholar] [CrossRef]
  112. Aljubayri, M.; Yang, Z.; Shikh-Bahaei, M. Cross-layer multipath congestion control, routing and scheduling design in ad hoc wireless networks. IET Commun. 2021, 15, 1096–1108. [Google Scholar] [CrossRef]
  113. Han, J.; Pei, J. Mining frequent patterns by pattern-growth: Methodology and implications. ACM Sigkdd Explor. Newsl. 2000, 2, 14–20. [Google Scholar] [CrossRef]
  114. Aljumaily, M.S.; Li, H. Opportunistic Routing Protocol for Ad-Hoc Networks Using mmWave and Random Beamforming. In Proceedings of the 2019 IEEE 90th Vehicular Technology Conference (VTC2019-Fall), Honolulu, HI, USA, 22–25 September 2019; IEEE: Piscataway, NJ, USA, 2019; pp. 1–6. [Google Scholar]
  115. Biomo, J.D.M.M.; Kunz, T.; St-Hilaire, M. A novel routing protocol for reducing packet delay with multi-beam antennas. Comput. Netw. 2023, 220, 109479. [Google Scholar] [CrossRef]
  116. Lahsen-Cherif, I.; Zitoune, L.; Vèque, V. Energy efficient routing for wireless mesh networks with directional antennas: When Q-learning meets ant systems. Hoc Netw. 2021, 121, 102589. [Google Scholar] [CrossRef]
  117. Rana, K.K.; Tripathi, S.; Raw, R.S. Directional antenna-enabled multi-hop directional location routing in vehicular ad-hoc networks. J. Ambient. Intell. Humaniz. Comput. 2023, 14, 1–15. [Google Scholar] [CrossRef]
  118. Nasipuri, A.; Li, K.; Sappidi, U. Power consumption and throughput in mobile ad hoc networks using directional antennas. In Proceedings of the Proceedings. Eleventh International Conference on Computer Communications and Networks, Miami, FL, USA, 16 October 2002; pp. 620–626. [Google Scholar] [CrossRef]
  119. Wang, J.; Kong, L.; Wu, M.Y. Capacity of wireless ad hoc networks using practical directional antennas. In Proceedings of the 2010 IEEE Wireless Communication and Networking Conference, Sydney, Australia, 18–21 April 2010; IEEE: Piscataway, NJ, USA, 2010; pp. 1–6. [Google Scholar]
  120. Khan, M.A.; Qureshi, I.M.; Khan, I.U.; Nasim, A.; Javed, U.; Khan, W. On the performance of flying ad-hoc networks (FANETs) with directional antennas. In Proceedings of the 2018 5th International Multi-Topic ICT Conference (IMTIC), Jamshoro, Pakistan, 25–27 April 2018; IEEE: Piscataway, NJ, USA, 2018; pp. 1–8. [Google Scholar]
  121. Swaminathan, A.; Noneaker, D.L.; Russell, H.B. The design of a channel-access protocol for a wireless ad hoc network with sectored directional antennas. Hoc Netw. 2012, 10, 284–298. [Google Scholar] [CrossRef]
  122. Bhusal, R.; Timalsina, S.K.; Moh, S. Impact of directional antennas on contention based MAC protocols in ad hoc networks. In Proceedings of the 2012 8th International Conference on Computing and Networking Technology (INC, ICCIS and ICMIC), Gyeongju, Republic of Korea, 27–29 August 2012; pp. 405–408. [Google Scholar]
  123. George, Y.; Bergel, I. The spectral efficiency of slotted CSMA ad-hoc networks with directional antennas. IEEE Trans. Wirel. Commun. 2012, 11, 3799–3809. [Google Scholar] [CrossRef]
  124. Xie, T.; Zhao, H.; Xiong, J.; Sarkar, N.I. A Multi-Channel MAC Protocol with Retrodirective Array Antennas in Flying Ad Hoc Networks. IEEE Trans. Veh. Technol. 2021, 70, 1606–1617. [Google Scholar] [CrossRef]
  125. Mir, Z.H.; Jung, W.S.; Ko, Y.B. Continuous neighbor discovery protocol in wireless ad hoc networks with sectored-antennas. In Proceedings of the 2015 IEEE 29th International Conference on Advanced Information Networking and Applications, Gwangiu, Republic of Korea, 24–27 March 2015; IEEE: Piscataway, NJ, USA, 2015; pp. 54–61. [Google Scholar]
  126. Wang, Y.; Peng, L.; Xu, R.; Yang, Y.; Ge, L. A fast neighbor discovery algorithm based on Q-learning in wireless ad hoc networks with directional antennas. In Proceedings of the 2020 IEEE 6th International Conference on Computer and Communications (ICCC), Chengdu, China, 11–14 December 2020; IEEE: Piscataway, NJ, USA, 2020; pp. 467–472. [Google Scholar]
Figure 1. Network classification.
Figure 1. Network classification.
Futureinternet 16 00029 g001
Figure 2. Ad hoc network.
Figure 2. Ad hoc network.
Futureinternet 16 00029 g002
Figure 3. The interdependence of OSI layers in an ad hoc network.
Figure 3. The interdependence of OSI layers in an ad hoc network.
Futureinternet 16 00029 g003
Figure 4. Two main cross-layer architectures: “MobileMan” and “Crosstalk”.
Figure 4. Two main cross-layer architectures: “MobileMan” and “Crosstalk”.
Futureinternet 16 00029 g004
Figure 5. Cross-layer methods as the iterative optimization of multiple-layer configuration.
Figure 5. Cross-layer methods as the iterative optimization of multiple-layer configuration.
Futureinternet 16 00029 g005
Figure 6. Cross-layer methods for ad hoc networks publication activity.
Figure 6. Cross-layer methods for ad hoc networks publication activity.
Futureinternet 16 00029 g006
Figure 7. Cross-layer methods for ad hoc network classification.
Figure 7. Cross-layer methods for ad hoc network classification.
Futureinternet 16 00029 g007
Table 1. Review publications on cross-layer methods in ad hoc networks.
Table 1. Review publications on cross-layer methods in ad hoc networks.
TitleYearCitations
Ref. [9]: Cross-layer design: a survey and the road ahead20051538
Ref. [36]: Review of the cross-layer design in wireless ad hoc and sensor networks20108
Ref. [37]: A survey of cross-layer design for VANETs2011159
Ref. [38]: Routing mechanisms and cross-layer design for vehicular ad hoc networks: a survey201143
Ref. [39]: Survey of cross-layer proposals for video streaming over mobile ad hoc networks (MANETs)201228
Ref. [28]: Routing in vehicular ad-hoc networks: a survey on single- and cross-layer design techniques, and perspectives2017139
Ref. [40]: A study on cross-layer {TCP} performance in wireless ad hoc network201812
Ref. [41]: Review of cross-layer design for cognitive ad-hoc and sensor network20209
Table 2. Cross-layer methods concentrated on the physical layer.
Table 2. Cross-layer methods concentrated on the physical layer.
PublicationYearCitationsLayersGoal
[45]2006981, 2line throughput, interference
[46]2007451, 2, 3line throughput
Table 3. Cross-layer methods concentrated on channel layer resource reservation.
Table 3. Cross-layer methods concentrated on channel layer resource reservation.
PublicationYearCitationsLayersGoal
[48]2005692, 3line throughput
[49]2006582, 3line throughput
[50]2007942, 3line throughput
[47]2018341, 2, 3line throughput, route stability
[51]2020101, 2, 3line throughput, route latency, route stability
[52]2022252, 3energy consumption
Table 4. Cross-layer methods concentrated on channel layer random access.
Table 4. Cross-layer methods concentrated on channel layer random access.
PublicationYearCitationsLayersGoal
[53]20031571, 2, 3line throughput, energy consumption
[54]20051211, 2line throughput, energy consumption
Table 5. Cross-layer methods concentrated on channel layer cooperative transmission.
Table 5. Cross-layer methods concentrated on channel layer cooperative transmission.
PublicationYearCitationsLayersGoal
[55]2005541, 2line throughput
[56]2008321, 2line throughput
[57]20081001, 2line throughput
[58]2011521, 2, 3line throughput
[59]2011671, 2, 3line packet error rate, energy consumption
[60]2014261, 2line throughput, line latency
Table 6. Cross-layer methods concentrated on network layer routingmetrics.
Table 6. Cross-layer methods concentrated on network layer routingmetrics.
PublicationYearCitationsLayersGoal
[61]2003492, 3route packet error rate
[62]200436091, 2route throughput
[63]20056431, 2, 3route throughput, interference
[64]2006181, 2route stability
[65]2008671, 2, 3route packet error rate, energy consumption
[66]2009642, 3route latency
[67]201041, 2route throughput
[34]20111121, 2route packet error rate
[68]201241, 2route throughput, route packet error rate
[69]2012152, 3, 5route throughput, route stability
[70]2012221, 2, 3route stability
[71]20133292, 5route throughput, route latency
[72]201581, 2route throughput, energy consumption
[73]2016321, 2, 3energy consumption
Table 7. Cross-layer methods concentrated on network layer routing protocols.
Table 7. Cross-layer methods concentrated on network layer routing protocols.
PublicationYearCitationsLayersGoal
[75]2008222, 3route throughput
[76]2009191, 3route throughput
[77]2011282, 3route throughput, energy consumption
[78]2012221, 3route throughput, energy consumption
[79]2013282, 3energy consumption
[80]2015211, 3, 5route throughput
[81]2015641, 3route stability
[82]2018301, 3, 5route stability
[83]202361, 2, 3route throughput, route packet error rate, interference, energy consumption
Table 8. Cross-layer methods concentrated on transport layer protocols.
Table 8. Cross-layer methods concentrated on transport layer protocols.
PublicationYearCitationsLayersGoal
[84]20041352, 4route throughput
[85]20061482, 4route throughput
[86]2008582, 3, 4route throughput
[87]2012342, 3, 4route throughput
[88]201762, 3, 4route throughput
[89]2019302, 4route throughput
Table 9. Cross-layer methods concentrated on application layer overlay networks.
Table 9. Cross-layer methods concentrated on application layer overlay networks.
PublicationYearCitationsLayersGoal
[90]200533, 5data overhead
[91]2005753, 5data overhead
[92]20051313, 5data overhead
[93]2006303, 5data overhead
[94]2010433, 5data overhead
[95]2013401, 3, 5data overhead, route stability
Table 10. Cross-layer methods concentrated on application layer applications.
Table 10. Cross-layer methods concentrated on application layer applications.
PublicationYearCitationsLayersGoal
[96]2013441, 2, 3, 4, 5route throughput
Table 11. Cross-layer methods concentrated on multiple-layer optimization with fuzzy logic.
Table 11. Cross-layer methods concentrated on multiple-layer optimization with fuzzy logic.
PublicationYearCitationsLayersGoal
[97]2006311, 2, 5line latency, line throughput, energy consumption
[98]2018221, 2, 3, 4, 5route packet error rate
[99]2022101, 2, 3, 4, 5route throughput, route packet error rate, route latency
Table 12. Cross-layer methods concentrated on multiple-layer optimization with dual decomposition.
Table 12. Cross-layer methods concentrated on multiple-layer optimization with dual decomposition.
PublicationYearCitationsLayersGoal
[100]2008551, 2, 3line throughput
[101]2015351, 2, 3, 4line throughput
[102]2017211, 2, 3, 4, 5not specified
Table 13. Cross-layer methods with independent layer optimization.
Table 13. Cross-layer methods with independent layer optimization.
PublicationYearCitationsLayersGoal
[103]20021571, 2, 3line throughput
[104]20053311, 2, 3line throughput, energy consumption
[105]20054661, 2, 3, 4, 5route throughput, route latency
[106]2007272, 3interference
[107]2007781, 2, 4, 5line throughput, interference
[108]20071831, 2, 3line throughput, line latency, route stability
[109]2008712, 4line throughput
[13]20101001, 2, 3line throughput
[110]2015254, 2, 1line latency, energy consumption
[111]201711, 2, 3line throughput, interference
[112]202142, 3, 4route throughput, route latency
Table 14. Layer usage frequency in reviewed publications.
Table 14. Layer usage frequency in reviewed publications.
FrequencyLayer Combination
0.84(2)
0.7(3)
0.63(1)
0.24(4)
0.25(5)
0.54(2 3)
0.54(1 2)
0.4(1 3)
0.31(1 2 3)
0.24(2 4)
0.15(3 4)
0.12(1 4)
0.09(4 5)
0.15(2 3 4)
0.12(1 2 4)
0.09(1 3 4)
0.09(1 2 3 4)
0.09(1 4 5)
0.09(2 4 5)
0.07(3 4 5)
0.09(1 2 4 5)
0.07(1 3 4 5)
0.07(2 3 4 5)
0.07(1 2 3 4 5)
0.21(3 5)
0.15(1 5)
0.13(2 5)
0.12(1 3 5)
0.1(1 2 5)
0.09(2 3 5)
0.07(1 2 3 5)
Table 15. Goal frequency of the methods in the reviewed publications.
Table 15. Goal frequency of the methods in the reviewed publications.
FrequencyGoal Combination
0.36(line throughput)
0.21(energy consumption)
0.015(line packet error rate)
0.06(line latency)
0.1(route packet error rate)
0.33(route throughput)
0.09(interference)
0.13(route stability)
0.09(route latency)
0.09(data overhead)
0.06(route throughput, energy consumption)
0.06(line throughput, energy consumption)
0.01(line packet error rate, energy consumption)
0.04(line throughput, line latency)
0.01(route stability, line latency)
0.03(line latency, energy consumption)
0.01(route stability, line throughput, line latency)
0.01(line throughput, line latency, energy consumption)
0.03(route packet error rate, energy consumption)
0.04(route throughput, route packet error rate)
0.01(route throughput, route packet error rate, energy consumption)
0.03(route throughput, interference)
0.04(interference, line throughput)
0.01(interference, route packet error rate)
0.01(interference, energy consumption)
0.01(route throughput, route packet error rate, interference)
0.01(interference, route packet error rate, energy consumption)
0.01(interference, route throughput, energy consumption)
0.01(interference, route packet error rate, route throughput, energy consumption)
0.01(route stability, route throughput)
0.04(route stability, line throughput)
0.06(route throughput, route latency)
0.01(route latency, route packet error rate)
0.01(route stability, route latency)
0.01(line throughput, route latency)
0.01(route throughput, route latency, route packet error rate)
0.01(route stability, line throughput, route latency)
0.01(route stability, data overhead)
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Ivanov, V.; Tereshonok, M. Cross-Layer Methods for Ad Hoc Networks—Review and Classification. Future Internet 2024, 16, 29. https://doi.org/10.3390/fi16010029

AMA Style

Ivanov V, Tereshonok M. Cross-Layer Methods for Ad Hoc Networks—Review and Classification. Future Internet. 2024; 16(1):29. https://doi.org/10.3390/fi16010029

Chicago/Turabian Style

Ivanov, Valeriy, and Maxim Tereshonok. 2024. "Cross-Layer Methods for Ad Hoc Networks—Review and Classification" Future Internet 16, no. 1: 29. https://doi.org/10.3390/fi16010029

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop