An implementation framework for trajectory-based routing in ad hoc networks

Routing in ad hoc networks is a complicated task because of many reasons. The nodes are low-memory, low-powered, and they cannot maintain routing tables large enough for well-known routing protocols. Because of that, greedy forwarding at intermediate nodes is desirable in ad hoc networks. Also, for traffic engineering, multi-path capabilities are important. So, it is desirable to define routes at the source like in source based routing (SBR) while performing greedy forwarding at intermediate nodes.We investigate trajectory-based routing (TBR) which was proposed as a middle-ground between SBR and greedy forwarding techniques. In TBR, source encodes trajectory to be traversed and embeds it into each packet. Upon the arrival of each packet, intermediate nodes decode the trajectory and employ greedy forwarding techniques such that the packet follows its trajectory as much as possible.In this paper, we address various issues regarding implementation of TBR. We also provide techniques to efficiently forward packets along a trajectory defined as a parametric curve. We use the well-known Bezier parametric curve for encoding trajectories into packets at source. Based on this trajectory encoding, we develop and evaluate various greedy forwarding algorithms     

Reduced-order modeling for hyperthermia control

This paper analyzes the feasibility of using reduced-order modeling techniques in the design of multiple-input, multiple-output (MIMO) hyperthermia temperature controllers. State space thermal models are created based upon a finite difference expansion of the bioheat transfer equation model of a scanned focused ultrasound system (SFUS). These thermal state space models are reduced using the balanced realization technique, and an order reduction criterion is tabulated. Results show that a drastic reduction in model dimension can be achieved using the balanced realization. The reduced-order model is then used to design a reduced-order optimal servomechanism controller for a two-scan input, two thermocouple output tissue model. In addition, a full-order optimal servomechanism controller is designed for comparison and validation purposes. These two controllers are applied to a variety of perturbed tissue thermal models to test the robust nature of the reduced-order controller. A comparison of the two controllers validates the use of open-loop balanced reduced-order models in the design of MIMO hyperthermia controllers.     

Segmented Dynamic Element Matching for High-Resolution Digital-to-Analog Conversion

Dynamic element matching (DEM) is widely used in multibit digital–analog converters (DACs) to prevent mismatches among nominally identical components from introducing nonlinear distortion. It has long been used as a performance- enabling technique in delta-sigma data converters which require low-resolution but high-linearity DACs. More recently, segmented DEM architectures have made high-resolution Nyquist-rate DEM DACs practical. However, the previously published segmented DEM DAC designs have been ad hoc. Systematic techniques for synthesizing segmented DEM DACs and analyses of their design tradeoffs have not been published previously. This paper quantifies a fundamental power dissipation versus complexity tradeoff implied by segmentation and provides a systematic method of synthesizing segmented DEM DACs that are optimal in terms of the tradeoff.      

Real-world environment models for mobile network evaluation

Simulation environments are an important tool for the evaluation of new concepts in networking. The study of mobile ad hoc networks depends on understanding protocols from simulations, before these protocols are implemented in a real-world setting. To produce a real-world environment within which an ad hoc network can be formed among a set of nodes, there is a need for the development of realistic, generic and comprehensive mobility, and signal propagation models. In this paper, we propose the design of a mobility and signal propagation model that can be used in simulations to produce realistic network scenarios. Our model allows the placement of obstacles that restrict movement and signal propagation. Movement paths are constructed as Voronoi tessellations with the corner points of these obstacles as Voronoi sites. Our mobility model also introduces a signal propagation model that emulates properties of fading in the presence of obstacles. As a result, we have developed a complete environment in which network protocols can be studied on the basis of numerous performance metrics. Through simulation, we show that the proposed mobility model has a significant impact on network performance, especially when compared with other mobility models. In addition, we also observe that the performance of ad hoc network protocols is effected when different mobility scenarios are utilized.     

Multi-user Synchronisation in ad hoc OFDM-based Wireless Personal Area Networks

In this paper, a procedure for dealing with the multi-user synchronisation problem in Orthogonal Frequency Division Multiple Access (OFDMA)-based systems for ad hoc environments is proposed and analysed. We show with this novel approach that it is possible to re-use much of the already extent literature for single-user synchronisation in OFDM and apply it to multi-user ad hoc scenarios. Also a distributed version of the procedure is proposed in order to fairly share out the power consumption among all the devices. The proposed procedure makes use of higher layer capabilities in a cross-layer design and it does not incur too much complexity or power. This issue is specially critical in wireless heterogeneous ad hoc networks where devices can be very limited in terms of transmission and/or computational power.     

ATP: a reliable transport protocol for ad hoc networks

Existing works have approached the problem of reliable transport in ad hoc networks by proposing mechanisms to improve TCP's performance over such networks, In this paper, we show through detailed arguments and simulations that several of the design elements in TCP are fundamentally inappropriate for the unique characteristics of ad hoc networks. Given that ad hoc networks are typically stand-alone, we approach the problem of reliable transport from the perspective that it is justifiable to develop an entirely new transport protocol that is not a variant of TCP. Toward this end, we present a new reliable transport layer protocol for ad hoc networks called ATP (ad hoc transport protocol). We show through ns2-based simulations that ATP outperforms default TCP as well as TCP-ELFN and ATCP.     

OMAR: Utilizing Multiuser Diversity in Wireless Ad Hoc Networks

One of the most promising approaches to improving communication efficiency in wireless communication systems is the use of multiuser diversity. Although it has been widely investigated and shown feasible and efficient in cellular networks, there is little work for the ad hoc networks, especially in real protocol and algorithm design. In this paper, we propose a novel scheme, namely, the opportunistic medium access and auto rate (OMAR), to efficiently utilize the shared medium in IEEE 802.11-based ad hoc networks by taking advantage of diversity, distributed scheduling, and adaptivity. In an ad hoc network, especially in a heterogeneous ad hoc network or a mesh network, some nodes may need to communicate with multiple one-hop nodes. We allow such a node with a certain number of links to function as a clusterhead to locally coordinate multiuser communications. We introduce a CDF-based (cumulative distribution function) K-ary opportunistic splitting algorithm and a distributed stochastic scheduling algorithm to resolve intra and intercluster collisions, respectively. Fairness is formulated and solved in terms of social optimality within and across clusters. Analytical and simulation results show that our scheme can significantly improve communication efficiency while providing social fairness     

Simulation of Ad Hoc Routing Protocols using OMNeT++

Mobile Ad Hoc Networks (MANETs) have evolved in the last years into standards in the communication world. By definition, they do not need any network infrastructure to facilitate communication between participating nodes. Therefore, MANETs are dealing with new challenges in the context of ad hoc routing. Simulation techniques are one of the fundamental methodologies to support the protocol engineering process, especially in the early stages of ad hoc network protocol design. In this paper, we set out common criteria that may serve as guidelines for meaningful simulative evaluations of ad hoc routing protocols. We present typical and necessary measures for ad hoc routing in general and MANET routing in particular. As a case study, we demonstrate a comprehensive performance evaluation of the Dynamic MANET On Demand (DYMO) routing protocol using a model we implemented for the popular OMNeT+ + discrete event simulation environment.     

基于OPNET的Ad hoc路由协议比较与分析

在过去的几年中，人们对于Ad hoc网络进行了大量的研究，由于Ad hoc网络自身的特殊性，其路由协议的设计与传统固定网络有很大不同，因而也成了研究的焦点之一。丈中首先介绍了Ad hoc网络中的路由协议设计的几种策略，接着介绍了几种典型的Ad hoc路由协议，最后通过OPNET仿真并获取数据，通过考察路由发现时间、传输时延、路由跳数及网络吞吐量等性能指标，对两种典型路由协议进行综合评测，进而给出了结论，并对未来的研究指出了方向。     

Parametric optimization of software defined radio configurations using design of experiments

Cognitive radio (CR) systems incorporate learning and decision making into wireless and networking systems with the goal of improving performance and interoperability. Research has focused on artificial intelligence control and optimization of radio input parameters with little attention placed on identifying initialization parameters of cognitive engines or on testing methods. While CR techniques continue to advance, calibration and testing remain largely stagnant with reliance on ad hoc and highly application specific approaches. Given that cognitive radio will be deployed in a variety of environments with each requiring unique calibration, systematic procedures are needed. An approach founded in design of experiments provides a purposeful framework for performing testing and identification of initialization parameters with an efficient number of test cases. Response surface methodology designs identify representative knowledge of system performance including input parameter significance and quadratic estimation models of output metrics. An example of calibrating transmit-and-receive gain settings on a software-defined radio illustrates the use of the framework.     

An energy-efficient MAC protocol based on IEEE 802.11 in wireless ad hoc networks

Energy efficiency is a measure of the performance of IEEE 802.11 wireless multihop ad hoc networks. The IEEE 802.11 standard, currently used in wireless multihop ad hoc networks, wastes bandwidth capacity and energy resources because of many collisions. Therefore, controlling the contention window size at a given node will increase not only the operating life of the battery but also the overall system capacity. It is essential to develop effective backoff schemes for saving power in IEEE 802.11 wireless multihop ad hoc networks. In this paper, we propose an energy-efficient backoff scheme and evaluate its performance in an ad hoc network. Our contention window mechanism devised by us grants a node access to a channel on the basis of the node’s percentage of residual energy. We use both an analytical model and simulation experiments to evaluate the effective performance of our scheme in an ad hoc network. Our extensive ns-2-based simulation results have shown that the proposed scheme provides excellent performance in terms of energy goodput, end-to-end goodput, and packet delivery ratio, as well as the end-to-end delay.     

Simulation of Rayleigh-faded mobile-to-mobile communication channels

Mobile-to-mobile channels find increasing applications in futuristic intelligent transport systems, ad hoc mobile wireless networks, and relay-based cellular networks. Their statistical properties are quite different from typical cellular radio channels, thereby requiring new methods for their simulation. This paper proposes a "double-ring" model to simulate the mobile-to-mobile local scattering environment, and develops sum-of-sinusoids (SoS)-based models for simulating such channels. The proposed models produce waveforms having desired statistical properties with good accuracy, and also remove some drawbacks of an existing model derived by using the discrete line spectrum simulation method.     

Information theoretic framework of trust modeling and evaluation for ad hoc networks

The performance of ad hoc networks depends on cooperation and trust among distributed nodes. To enhance security in ad hoc networks, it is important to evaluate trustworthiness of other nodes without centralized authorities. In this paper, we present an information theoretic framework to quantitatively measure trust and model trust propagation in ad hoc networks. In the proposed framework, trust is a measure of uncertainty with its value represented by entropy. We develop four Axioms that address the basic understanding of trust and the rules for trust propagation. Based on these axioms, we present two trust models: entropy-based model and probability-based model, which satisfy all the axioms. Techniques of trust establishment and trust update are presented to obtain trust values from observation. The proposed trust evaluation method and trust models are employed in ad hoc networks for secure ad hoc routing and malicious node detection. A distributed scheme is designed to acquire, maintain, and update trust records associated with the behaviors of nodes' forwarding packets and the behaviors of making recommendations about other nodes. Simulations show that the proposed trust evaluation system can significantly improve the network throughput as well as effectively detect malicious behaviors in ad hoc networks.     

Smart antenna techniques and their application to wireless ad hoc networks

In this article the use of smart antennas in mobile ad hoc and mesh networks is discussed. We first give a brief overview of smart antenna techniques and describe the issues that arise when applying these techniques in ad hoc networks. We consider ad hoc/mesh networks with directional antennas, beamforming/adaptive antennas, and/or multiple-input-multiple-output (MIMO) techniques. We then show how the MAC/routing techniques can be modified to get the maximum benefit with smart antennas, while also showing examples of degradation in system performance, rather than improvement, when smart antenna techniques are added to networks with standard MAC/routing techniques.     

A heterogeneous‐network aided public‐key management scheme for mobile ad hoc networks

A mobile ad hoc network does not require fixed infrastructure to construct connections among nodes. Due to the particular characteristics of mobile ad hoc networks, most existing secure protocols in wired networks do not meet the security requirements for mobile ad hoc networks. Most secure protocols in mobile ad hoc networks, such as secure routing, key agreement and secure group communication protocols, assume that all nodes must have pre‐shared a secret, or pre‐obtained public‐key certificates before joining the network. However, this assumption has a practical weakness for some emergency applications, because some nodes without pre‐obtained certificates will be unable to join the network. In this paper, a heterogeneous‐network aided public‐key management scheme for mobile ad hoc networks is proposed to remedy this weakness. Several heterogeneous networks (such as satellite, unmanned aerial vehicle, or cellular networks) provide wider service areas and ubiquitous connectivity. We adopt these wide‐covered heterogeneous networks to design a secure certificate distribution scheme that allows a mobile node without a pre‐obtained certificate to instantly get a certificate using the communication channel constructed by these wide‐covered heterogeneous networks. Therefore, this scheme enhances the security infrastructure of public key management for mobile ad hoc networks. Copyright © 2006 John Wiley & Sons, Ltd.     

Scalable routing protocols for mobile ad hoc networks

The growing interest in mobile ad hoc network techniques has resulted in many routing protocol proposals. Scalability issues in ad hoc networks are attracting increasing attention these days. We survey the routing protocols that address scalability. The routing protocols included in the survey fall into three categories: flat routing protocols; hierarchical routing approaches; GPS augmented geographical routing schemes. The article compares the scalability properties and operational features of the protocols and discusses challenges in future routing protocol designs     

Network science based approaches to design and analyze MANETs for military applications

Mobile ad hoc networks have become the basis of the military?s network-centric warfare (NCW) approach. However, for NCW to be successful, it is imperative that the networks be designed in a robust manner with the capability to produce consistent predictable results despite the uncertainties of the underlying environment. This underscores the need for formal systematic methodologies to design and predict performance of such networks. The challenges of mobile ad hoc networking combined with those associated with the stringent requirements posed by NCW systems, however, are daunting, and thus no systematic design techniques for NCW system design exist. To address this problem, a joint project was initiated between CERDEC and Telcordia Technologies to develop the Network Engineering Design Analytic Toolset (NEDAT) ? a toolset that applies network-science- based approaches to design MANETs for use in NCW. Rooted in formal/analytic techniques, NEDAT can be used to design MANETs for use in NCW given information about available resources and performance objectives, analyze performance of a given NCW network, and understand design trades.     

A fuzzy‐based trust model for flying ad hoc networks (FANETs)

The use of unmanned aerial vehicles has significantly increased for forming an ad hoc network owing to their ability to perform in exciting environment such as armed attacks, border surveillance, disaster management, rescue operation, and transportation. Such types of ad hoc networks are popularly known as flying ad hoc networks (FANETs). The FANET nodes have 2 prominent characteristics—collaboration and cooperation. Trust plays an important role in predicting the behavior of such nodes. Researchers have proposed various methods (direct and indirect) for calculation of the trust value of a given node in ad hoc networks, especially in mobile ad hoc networks and vehicular ad hoc networks. The major characteristic that differentiates a FANET from other ad hoc networks is the velocity of the node; as a result, there are frequent losses in connection and topology change. Therefore, the existing methods of trust calculation are not efficient and effective. In this paper, a fuzzy‐based novel trust model has been proposed to handle the behavioral uncertainty of FANET nodes. Nodes are classified using a multicriteria fuzzy classification method based on node's behavior and performance in the fuzzy and complex environment. Quality of service and social parameter (recommendation) are considered for evaluating the trust value of each node to segregate the selfish and malicious nodes. With the node classification, FANET nodes are rewarded or punished to transform node behavior into a trust value. Compared with the existing trust techniques, the simulation results show that the proposed model has better adaptability, accuracy, and performance in FANETs.     

Modeling Mobility in Cooperative Ad Hoc Networks

This paper addresses issues concerned with design and managing of mobile ad hoc networks. We focus on self-organizing, cooperative and coherent networks that enable a continuous communication with a central decision unit and adopt to changes in an unknown environment to achieve a given goal. In general, it is very difficult to model a motion of nodes of a real-life ad hoc network. However, mobility modeling is a critical element that has great influence on the performance characteristics of a cooperative system. In this paper we investigate a novel approach to cooperative and fully connected networks design. We present an algorithm for efficient calculating of motion trajectories of wireless devices. Our computing scheme adopts two techniques, the concept of an artificial potential field and the concept of a particle-based mobility. The utility and efficiency of the proposed approach has been justified through simulation experiments. The results of presented case studies show a wide range of applications of our method starting from simple to more complex ad hoc networks.