We propose a selection region based multi-hop routing protocol for random mobile ad hoc networks, where the selection region is defined by two parameters: a reference distance and a selection angle. At each hop, a relay is chosen as the nearest node to the transmitter that is located within the selection region. By assuming that the relay nodes are randomly placed, we derive an upper bound for the optimum reference distance to maximize the expected density of progress and investigate the relationship between the optimum selection angle and the optimum reference distance. We also note that the optimized expected density of progress scales as $Θ(\sqrtλ)$, which matches the prior results in the literature. Compared with the spatial-reuse multi-hop protocol in \cite{Baccelli:Aloha} recently proposed by Baccelli \emph{et al.}, in our new protocol the amount of nodes involved and the calculation complexity for each relay selection are reduced significantly, which is attractive for energy-limited wireless ad hoc networks (e.g., wireless sensor networks).
Cognitive radio (CR) technology will have significant impacts on upper layer performance in mobile ad hoc networks (MANETs). In this paper, we study topology control and routing in CR-MANETs. We propose a distributed Prediction-based Cognitive Topology Control (PCTC) scheme to provision cognition capability to routing in CR-MANETs. PCTC is a midware-like cross-layer module residing between CR module and routing. The proposed PCTC scheme uses cognitive link availability prediction, which is aware of the interference to primary users, to predict the available duration of links in CR-MANETs. Base…
Providing Internet service above the clouds is of ever-increasing interest and in this context aeronautical {\it{ad-hoc}} networking (AANET) constitutes a promising solution. However, the optimization of packet routing in large ad hoc networks is quite challenging. In this paper, we develop a discrete $ε$ multi-objective genetic algorithm ($ε$-DMOGA) for jointly optimizing the end-to-end latency, the end-to-end spectral efficiency (SE), and the path expiration time (PET) that specifies how long the routing path can be relied on without re-optimizing the path. More specifically, a distance-base…
In this paper different optimization of Ad-hoc routing algorithm is surveyed and a new method using training based optimization algorithm for reducing the complexity of routing algorithms is suggested. A binary matrix is assigned to each node in the network and gets updated after each data transfer using the protocols. The use of optimization algorithm in routing algorithm can reduce the complexity of routing to the least amount possible.
In this paper, we propose a selection region based multihop routing protocol with directional antennas for wireless mobile ad hoc networks, where the selection region is defined by two parameters: a reference distance and the beamwidth of the directional antenna. At each hop, we choose the nearest node to the transmitter within the selection region as the next hop relay. By maximizing the expected density of progress, we present an upper bound for the optimum reference distance and derive the relationship between the optimum reference distance and the optimum transmission probability. Compared…
In this paper, a hierarchical cross-layer design approach is proposed to increase energy efficiency in ad hoc networks through joint adaptation of nodes' transmitting powers and route selection. The design maintains the advantages of the classic OSI model, while accounting for the cross-coupling between layers, through information sharing. The proposed joint power control and routing algorithm is shown to increase significantly the overall energy efficiency of the network, at the expense of a moderate increase in complexity. Performance enhancement of the joint design using multiuser detection…
In this paper, we study the problem of secure routing in a multihop wireless ad-hoc network in the presence of randomly distributed eavesdroppers. Specifically, the locations of the eavesdroppers are modeled as a homogeneous Poisson point process (PPP) and the source-destination pair is assisted by intermediate relays using the decode-and-forward (DF) strategy. We analytically characterize the physical layer security performance of any chosen multihop path using the end-to-end secure connection probability (SCP) for both colluding and non-colluding eavesdroppers. To facilitate finding an effic…
Overheads incurred by routing protocols diminish the capacity available for relaying useful data in a mobile wireless ad hoc network. Discovering lower bounds on the amount of protocol overhead incurred for routing data packets is important for the development of efficient routing protocols, and for characterizing the actual (effective) capacity available for network users. This paper presents an information-theoretic framework for characterizing the minimum routing overheads of geographic routing in a network with mobile nodes. specifically, the minimum overhead problem is formulated as a rat…
In this paper we consider routing in random wireless-adhoc-networks (WANETs), where each node is equipped with a single antenna. Our analysis uses a proper model of the physical layer together with an abstraction of higher communication layers. We assume that the nodes are distributed according to a Poisson-point-process and consider routing schemes that select the next relay based on the geographical locations, the channel gains of its neighbor nodes and the statistical characterization of all other nodes. While many routing problems are formulated as optimization problems, the optimal distri…
Routing tables in ad hoc and wireless routing protocols can be represented using rooted trees. The constant need for communication and storage of these trees in routing protocols demands an efficient rooted tree coding algorithm. This efficiency is defined in terms of the average code length, and the optimality of the algorithm is measured by comparing the average code length with the entropy of the source. In this work, TreeExplorer is introduced as an easy-to-implement and nearly optimal algorithm for coding rooted tree structures. This method utilizes the number of leaves of the tree as an …
This paper presents a dual method of closed-form analysis and lightweight simulation that enables an evaluation of the performance of mobile ad hoc networks that is more realistic, efficient, and accurate than those found in existing publications. Some features accommodated by the new analysis are shadowing, exclusion and guard zones, and distance-dependent fading. Three routing protocols are examined: least-delay, nearest-neighbor, and maximum-progress routing. The tradeoffs among the path reliabilities, average conditional delays, average conditional number of hops, and area spectral efficie…
Geographic routing protocols greatly reduce the requirements of topology storage and provide flexibility in the accommodation of the dynamic behavior of mobile ad hoc networks. This paper presents performance evaluations and comparisons of two geographic routing protocols and the popular AODV protocol. The tradeoffs among the average path reliabilities, average conditional delays, average conditional numbers of hops, and area spectral efficiencies and the effects of various parameters are illustrated for finite ad hoc networks with randomly placed mobiles. This paper uses a dual method of clos…
In this work we develop a new theory to analyse the process of routing in large-scale ad-hoc wireless networks. We use a path integral formulation to examine the properties of the paths generated by different routing strategies in these kinds of networks. Using this theoretical framework, we calculate the statistical distribution of the distances between any source to any destination in the network, hence we are able to deduce a length parameter that is unique for each routing strategy. This parameter, defined as the {\it effective radius}, effectively encodes the routing information required …
Throughput scaling laws of an ad hoc network equipping directional antennas at each node are analyzed. More specifically, this paper considers a general framework in which the beam width of each node can scale at an arbitrary rate relative to the number of nodes. We introduce an elastic routing protocol, which enables to increase per-hop distance elastically according to the beam width, while maintaining an average signal-to-interference-and-noise ratio at each receiver as a constant. We then identify fundamental operating regimes characterized according to the beam width scaling and analyze t…
In this paper, we consider the problem of joint secure routing and transmit power optimization for a multi-hop ad-hoc network under the existence of randomly distributed eavesdroppers following a Poisson point process (PPP). Secrecy messages are delivered from a source to a destination through a multi-hop route connected by multiple legitimate relays in the network. Our goal is to minimize the end-to-end connection outage probability (COP) under the constraint of a secrecy outage probability (SOP) threshold, by optimizing the routing path and the transmit power of each hop jointly. We show tha…
In mobile wireless networks with blockage, different users, and/or a single user at different time slots, may be blocked by some common obstacles. Therefore the temporal correlation of interference does not depend only on the user displacement law but also on the spatial correlation introduced by the obstacles. In this letter, we show that in mobile networks with a high density of users, blockage increases the temporal correlation of interference, while in sparse networks blockage has the opposite effect.
We study a wireless ad-hoc sensor network (WASN) where $N$ sensors gather data from the surrounding environment and transmit their sensed information to $M$ fusion centers (FCs) via multi-hop wireless communications. This node deployment problem is formulated as an optimization problem to make a trade-off between the sensing uncertainty and energy consumption of the network. Our primary goal is to find an optimal deployment of sensors and FCs to minimize a Lagrange combination of the sensing uncertainty and energy consumption. To support arbitrary routing protocols in WASNs, the routing-depend…
This paper analyzes the performance of clustered decode-and-forward multi-hop relaying (CDFMR) wireless Rayleigh fading networks, and sheds light on their design principles for energy and spectral efficiency. The focus is on a general performance analysis (over all SNR range) of heterogeneous wireless networks with possibly different numbers of relays in clusters of various separations. For clustered multi-hop relaying systems, ad-hoc routing is known as an efficient decentralized routing algorithm which selects the best relay node on a hop-by-hop basis using local channel state information. I…
We propose and evaluate a scalable position-publish and an accompanying routing protocol which is efficient despite operating with imperfect information regarding the destination's location. The traffic generated by our position-publish protocol fits within the transport capacity of large mobile ad hoc networks (MANETs) with constant communication bandwidth allocated for routing overhead, even as the network size increases. The routing protocol guarantees, with high probability, routes whose lengths are within a constant "stretch" factor of the shortest path from source to destination. The key…
This paper investigates on the problem of combining routing scheme and physical layer security in multihop wireless networks with cooperative diversity. We propose an ad-hoc natured hop-by-hop best secure relay selection in a multihop network with several relays and an eavesdropper at each hop which provides a safe routing scheme to transmit confidential message from transmitter to legitimate receiver. The selection is based on the instantaneous channel conditions of relay and eavesdropper at each hop. A theoretical analysis is performed to derive new closed form expressions for probability of…
Relying on multi-hop communication techniques, aeronautical ad hoc networks (AANETs) seamlessly integrate ground base stations (BSs) and satellites into aircraft communications for enhancing the on-demand connectivity of planes in the air. In this integrated AANET context we investigate the shortest-path routing problem with the objective of minimizing the total delay of the in-flight connection from the ground BS subject to certain minimum-rate constraints for all selected links in support of low-latency and high-speed services. Inspired by the best-first search and priority queue concepts, w…
The application of physical layer security in ad hoc networks has attracted considerable academic attention recently. However, the available studies mainly focus on the single-hop and two-hop network scenarios, and the price in terms of degradation of communication quality of service (QoS) caused by improving security is largely uninvestigated. As a step to address these issues, this paper explores the physical layer security-aware routing and performance tradeoffs in a multi-hop ad hoc network. Specifically, for any given end-to-end path we first derive its connection outage probability (COP)…
Mobile ad hoc networks are expected to support voice traffic. The requirement for small delay and jitter of voice traffic poses a significant challenge for medium access control (MAC) in such networks. User mobility makes it more complex due to the associated dynamic path attenuation. In this paper, a MAC scheme for mobile ad hoc networks supporting voice traffic is proposed. With the aid of a low-power probe prior to DATA transmissions, resource reservation is achieved in a distributed manner, thus leading to small delay and jitter. The proposed scheme can automatically adapt to dynamic path …
