Adaptive playout scheduling algorithm tailored for real-time packet-based voice conversations over wireless ad-hoc networks

The effective provision of real-time, packet-based voice conversations over multi-hop wireless ad-hoc networks faces several stringent constraints not found in conventional packet-based networks. Indeed, MANETs (mobile ad-hoc networks) are characterized by mobility of all nodes, bandwidth-limited channel, unreliable wireless transmission medium, etc. This environment will surely induce a high delay variation and packet loss rate impairing dramatically the user experienced quality of conversational services such as VoIP. Indeed, such services require the reception of each media unit before its deadline to guarantee a synchronous playback process. This requirement is typically achieved by artificially delaying received packets inside a de-jitter buffer. To enhance the perceptual quality the buffering delay should be adjusted dynamically throughout the vocal conversation.In this work, we describe the design of a playout algorithm tailored for real-time, packet-based voice conversations delivered over multi-hop wireless ad-hoc networks. The designed playout algorithm, which is denoted MAPA (mobility aware playout algorithm), adjusts the playout delay according to node mobility, which characterizes mobile ad-hoc networks, and talk-spurt, which is an intrinsic feature of voice signals. The detection of mobility is done in service passively at the receiver using several metrics gathered at the application layer. The perceptual quality is estimated using an augmented assessment approach relying on the ITU-T E-Model paradigm while including the time varying impairments observed by users throughout a packet-based voice conversation. Simulation results show that the tailored playout algorithm significantly outperforms conventional playout algorithms, specifically over a MANET with a high degree of mobility.     

Transient chaotic neural network-based disjoint multipath routing for mobile ad-hoc networks

Due to mobility of wireless hosts, routing in mobile ad-hoc networks (MANETs) is a challenging task. Multipath routing is employed to provide reliable communication, load balancing, and improving quality of service of MANETs. Multiple paths are selected to be node-disjoint or link-disjoint to improve transmission reliability. However, selecting an optimal disjoint multipath set is an NP-complete problem. Neural networks are powerful tools for a wide variety of combinatorial optimization problems. In this study, a transient chaotic neural network (TCNN) is presented as multipath routing algorithm in MANETs. Each node in the network can be equipped with a neural network, and all the network nodes can be trained and used to obtain optimal or sub-optimal high reliable disjoint paths. This algorithm can find both node-disjoint and link-disjoint paths with no extra overhead. The simulation results show that the proposed method can find the high reliable disjoint path set in MANETs. In this paper, the performance of the proposed algorithm is compared to the shortest path algorithm, disjoint path set selection protocol algorithm, and Hopfield neural network (HNN)-based model. Experimental results show that the disjoint path set reliability of the proposed algorithm is up to 4.5 times more than the shortest path reliability. Also, the proposed algorithm has better performance in both reliability and the number of paths and shows up to 56% improvement in path set reliability and up to 20% improvement in the number of paths in the path set. The proposed TCNN-based algorithm also selects more reliable paths as compared to HNN-based algorithm in less number of iterations.     

Link stability based multicast routing scheme in MANET

The group-oriented services are one of the primary application classes that are addressed by Mobile Ad hoc Networks (MANETs) in recent years. To support such services, multicast routing is used. Thus, there is a need to design stable and reliable multicast routing protocols for MANETs to ensure better packet delivery ratio, lower delays and reduced overheads. In this paper, we propose a mesh based multicast routing scheme that finds stable multicast path from source to receivers. The multicast mesh is constructed by using route request and route reply packets with the help of multicast routing information cache and link stability database maintained at every node. The stable paths are found based on selection of stable forwarding nodes that have high stability of link connectivity. The link stability is computed by using the parameters such as received power, distance between neighboring nodes and the link quality that is assessed using bit errors in a packet. The proposed scheme is simulated over a large number of MANET nodes with wide range of mobility and the performance is evaluated. Performance of the proposed scheme is compared with two well known mesh-based multicast routing protocols, i.e., on-demand multicast routing protocol (ODMRP) and enhanced on-demand multicast routing protocol (EODMRP). It is observed that the proposed scheme produces better packet delivery ratio, reduced packet delay and reduced overheads (such as control, memory, computation, and message overheads).     

Simulation modeling and analysis of the hop count distribution in cognitive radio ad-hoc networks with beamforming

Due to the spatial–temporal spectrum mobility in cognitive radio ad-hoc networks (CRAHNs), multi-hop communication paths among secondary users have to detour or even be disconnected to avoid interfering with primary users. Consequently, the hop count in CRAHNs shows distinguishing characteristics compared with those in conventional ad-hoc networks (AHNs). Although the influences of beamforming on the connectivity of CRAHNs have been studied in the literature, no research works on investigating the hop count in cognitive environment under the joined effect of beamforming have been conducted. In this paper, we model CRAHNs where SUs are equipped with directional antennas as geometric random graphs and then propose a framework for simulation analysis of the hop count distribution. Our proposed framework comprises of two components. The first one is an algorithm which finds all possible paths between two random secondary users selected as source node and destination node then returns the hop count of the shortest path between them by using the random values of node location and active state, antenna gain, and channel fading as input data. The second one is a methodology which returns the hop count distribution and connection probability of these two nodes from vast number of examined random network topology trials. We show that the hop count and the connectivity between two secondary users greatly depend on the number of antenna elements of directional antenna. Moreover, only a specific combination of direction antenna and beamforming scheme gives better performance than omnidirectional antenna. The observed results in this paper provide useful guidelines on designing and evaluating hop count based applications in CRAHNs with beamforming.     

Simulation modeling and analysis of the hop count distribution in cognitive radio ad-hoc networks with shadow fading

The number of hops between source node and destination node is a key parameter in studying multi-hop wireless networks. Although hop count in wireless ad-hoc networks (AHNs) has been studied in the literature, no works on investigating the hop count characteristics in cognitive environments have been carried out. In this paper, we model cognitive radio ad-hoc networks (CRAHNs) as geometric random graphs and then propose a framework for studying the hop count distribution and correlated connectivity of communication path between two arbitrary nodes in CRAHNs with shadow fading. The framework consists of an algorithm and a methodology. Specifically, from the perspective of geometric random graph, the algorithm finds all possible paths between two arbitrary nodes and returns the hop count of the shortest path between them by using the global location information of nodes, i.e. primary users – PUs and secondary users – SUs, and the active states of PUs as input data. Meanwhile, through huge number of random network topology trials, the methodology returns the hop count distribution and connection status of communication path between two arbitrary nodes in CRAHNs with shadow fading. From the evaluating scenarios in this paper, important features of hop count distribution and connectivity and their correlating relationship in CRAHNs with shadow fading are revealed and compared with those in AHNs and in CRAHNs without shadow fading.     

基于时间距离与拓扑距离的连通性模型

网络连通性是描述网络性能的一项重要指标.机会传感网络中,节点移动导致网络的拓扑呈动态变化,这使得机会传感网络连通性的表征面临挑战.建立机会传感网络的连通性模型,有助于对机会传感网络的优化和维护.针对机会传感网络拓扑频繁变化的特点,基于时空图理论构建其连通性模型,描述拓扑演化规律;根据消息的可达性,考虑消息传输的时间特性和空间特性,定义了时间距离和拓扑距离,采用统计产品与服务解决方案软件（SPSS）分析其相关性,结果表明,时间距离和拓扑距离无明显相关性;采用网络快照间的时间距离与拓扑距离构建整网连通性模型.实验结果表明,所提出的模型能够从整体上刻画出机会传感网络的连通性;与基于Katz中心性的网络连通度模型相比,该模型能够更好地反映整网连通度的变化.     

Connectivity and Inference Problems for Temporal Networks

Many network problems are based on fundamental relationships involving time. Consider, for example, the problems of modeling the flow of information through a distributed network, studying the spread of a disease through a population, or analyzing the reachability properties of an airline timetable. In such settings, a natural model is that of a graph in which each edge is annotated with a time label specifying the time at which its endpoints “communicated.” We will call such a graph a temporal network. To model the notion that information in such a network “flows” only on paths whose labels respect the ordering of time, we call a path time-respecting if the time labels on its edges are non-decreasing. The central motivation for our work is the following question: how do the basic combinatorial and algorithmic properties of graphs change when we impose this additional temporal condition? The notion of a path is intrinsic to many of the most fundamental algorithmic problems on graphs; spanning trees, connectivity, flows, and cuts are some examples. When we focus on time-respecting paths in place of arbitrary paths, many of these problems acquire a character that is different from the traditional setting, but very rich in its own right. We provide results on two types of problems for temporal networks. First, we consider connectivity problems, in which we seek disjoint time-respecting paths between pairs of nodes. The natural analogue of Menger's Theorem for node-disjoint paths fails in general for time-respecting paths; we give a non-trivial characterization of those graphs for which the theorem does hold in terms of an excluded subdivision theorem, and provide a polynomial-time algorithm for connectivity on this class of graphs. (The problem on general graphs is NP-complete.) We then define and study the class of inference problems, in which we seek to reconstruct a partially specified time labeling of a network in a manner consistent with an observed history of information flow.     

GeoSpray: A geographic routing protocol for vehicular delay-tolerant networks

Vehicular networks are characterized by a highly dynamic network topology, and disruptive and intermittent connectivity. In such network environments, a complete path from source to destination does not exist on the most part of the time. Vehicular delay-tolerant network (VDTN) architecture was introduced to deal with these connectivity constraints. VDTN assumes asynchronous, bundle-oriented communication, and a store-carry-and-forward routing paradigm. A routing protocol for VDTNs should make the best use of the tight resources available in network nodes to create a multi-hop path that exists over time. This paper proposes a VDTN routing protocol, called GeoSpray, which takes routing decisions based on geographical location data, and combines a hybrid approach between multiple-copy and single-copy schemes. First, it starts with a multiple-copy scheme, spreading a limited number of bundle copies, in order to exploit alternative paths. Then, it switches to a forwarding scheme, which takes advantage of additional contact opportunities. In order to improve resources utilization, it clears delivered bundles across the network nodes. It is shown that GeoSpray improves significantly the delivery probability and reduces the delivery delay, compared to traditional location and non location-based single-copy and multiple-copy routing protocols.     

The impact of mobility models on the performance of P2P content discovery protocols over mobile ad hoc networks

One of the challenges over mobile ad-hoc networks is content discovery. P2P content discovery techniques including structured and unstructured can be employed in MANETs by considering its special characteristics and limitations. The most important characteristic of MANETs is the mobility of the nodes which creates a dynamic topology. A novel framework is presented to evaluate the effect of mobility and its models on the resource discovery. By using several metrics, this framework is capable of evaluating the effect of mobility on the underlay structure and subsequent changes on the overlay structure. The results obtained from extensive simulation, presented here, clarify the significant role of the mobility models on the performance of P2P content discovery protocols. These results are supported by mathematical analysis of content discovery protocols.     

A cross-layer approach for partition detection at overlay layer for structured P2P in MANETs

Due to limited radio range and mobility of nodes in mobile ad hoc networks (MANETs), the network partitioning and merging could occur frequently. When structured peer-to-peer (P2P) overlays are running over MANETs, then network partition in the physical network can also cause network partition at the overlay layer. Existing approaches for structured P2P overlay over MANETs do not detect network partition at the overlay layer. This paper proposes a cross-layer approach to detect network partition at the overlay layer for structured P2P overlay over MANETs. Simulation results show that the proposed approach is highly effective and efficient in terms of routing overhead, success ratio and false-negative ratio.     

SmallWorld Model-Based Polylogarithmic Routing Using Mobile Nodes

The use of mobile nodes to improve network system performance has drawn considerable attention recently. The movement-assisted model considers mobility as a desirable feature,where routing is based on the store-carry-forward paradigm with random or controlled movement of resource rich mobile nodes.The application of such a model has been used in several emerging networks,including mobile ad hoc networks(MANETs),wireless sensor networks(WSNs),and delay tolerant networks(DTNs).It is well known that mobility increases the capacity of MANETs by reducing the number of relays for routing,prolonging the lifespan of WSNs by using mobile nodes in place of bottleneck static sensors,and ensuring network connectivity in DTNs using mobile nodes to connect different parts of a disconnected network.Trajectory planning and the coordination of mobile nodes are two important design issues aiming to optimize or balance several measures, including delay,average number of relays,and moving distance.In this paper,we propose a new controlled mobility model with an expected polylogarithmic number of relays to achieve a good balance among several contradictory goals,including delay,the number of relays,and moving distance.The model is based on the small-world model where each static node has"short"link connections to its nearest neighbors and"long"link connections to other nodes following a certain probability distribution.Short links are regular wireless connections whereas long links are implemented using mobile nodes.Various issues are considered,including trade-offs between delay and average number of relays,selection of the number of mobile nodes,and selection of the number of long links.The effectiveness of the proposed model is evaluated analytically as well as through simulation.     

MANETs节点移动异质性对病毒传播影响

为了研究MANETs节点移动异质性对病毒传播的影响,对节点移动模型进行刻画,并基于元胞自动机理论建立MANETs病毒传播模型。在维持相同期望值而方差相异的情况下,研究节点移动速度,移动持续时间,停留时间和转动角度异质性对MANETs病毒传播的影响。结果表明：减少网络中节点移动异质性,可以有效抑制MANETs病毒传播。     

An address assignment for the automatic configuration of mobile ad hoc networks

Mobile ad hoc networks (MANETs) are infrastructure-less, multi-hop wireless networks, which can be deployed without any pre-existing setup. MANETs are mobile in nature and any node can join and leave the network at any time. Due to mobility, MANETs must be able to configure themselves without human intervention. Configuration (such as address assignment) of a node in such a network is an important issue. In this paper, we present a solution for address assignment, which is distributed in nature and can be used for IP address configuration in MANETs. Each node can allocate the address independent of others. Although our solution uses broadcast messages, results show that by fixing a few parameter values we can reduce the number of broadcast messages. We simulate the protocol and results show that our solution yields better performance those of the earlier algorithms.

节点移动性对MANETs网络拓扑特征的影响

在影响MANETs网络性能的众多因素之中,动态变化的网络拓扑结构是不可忽视的一个重要方面,而节点的移动特性是导致MANET网络拓扑变化的主要原因之一,因此研究节点的移动性对网络拓扑结构特性的影响具有重要的意义。采用复杂网络理论研究节点移动性对MANET网络拓扑结构统计特性的影响。介绍复杂网络的基本统计特性参数,通过仿真实验,详细分析了几种经典节点移动模型下,节点移动速度、信号辐射半径、节点密度等参数对MANET网络的平均度、聚类系数和调和平均最短路径长度的影响。结果表明节点的移动方式对MANET网络拓扑结构统计特性产生不同的影响。     

Video streaming application over WEAC protocol in MANET

Performance of wireless networks under video traffic is subjected to two main issues: power minimization and other QoS requirements such as delay jitter. Mobile Ad Hoc Networks (MANETs) are more sensitive to these issues where each mobile device acts like a router. Thus, routing delay adds significantly to overall end-to-end delay. This paper analyzes the performance of the Warning Energy Aware Clusterhead/Virtual Base Station-On demand (WEAC/VBS-O) protocol in terms of average delay, multi-hop communication and power minimization aspects that are subject to video traffic. H.263 and H.264 standards are utilized to model the simulated network. HCB model is also utilized to minimize the power consumption. The simulation results are demonstrated on a single hop and multi-hop settings. This includes the power consumption and the effect of sudden demise of cluster heads in the Warning Energy Aware Cluster head (WEAC) protocol.     

A novel mobility model based on semi-random circular movement in mobile ad hoc networks

When simulating a mobile ad hoc network (MANET), it is important to use a realistic mobility model to reflect the actual performance of a mobile system. The spatial distribution of node locations in a mobile model plays a key role when investigating the characteristics of a MANET. However, most existing mobility models with random and simple straight line movement lead to unrealistic scenarios and non-uniform distributions, and can not describe the actual movement of Unmanned Aerial Vehicles (UAVs) connected via a MANET. To address this issue, a novel mobility model based on semi-random circular movement (SRCM) is presented. The approximate node distribution function in SRCM is derived within a 2D disk region. The relationship between application performance and node distribution is investigated for a UAV MANET, with focus on scan coverage and network connectivity. A simulation using the NS2 tool is conducted. It is shown that the presented model with a uniform distribution performs better than the popular Random Waypoint mobility model. The SRCM model with the NS2 simulator provides a realistic way for simulation and performance evaluation of UAV MANETs.     

A survey of data replication techniques for mobile ad hoc network databases

A mobile ad hoc network (MANET) is a network that allows mobile servers and clients to communicate in the absence of a fixed infrastructure. MANET is a fast growing area of research as it finds use in a variety of applications. In order to facilitate efficient data access and update, databases are deployed on MANETs. These databases that operate on MANETs are referred to as MANET databases. Since data availability in MANETs is affected by the mobility and power constraints of the servers and clients, data in MANETs are replicated. A number of data replication techniques have been proposed for MANET databases. This paper identifies issues involved in MANET data replication and attempts to classify existing MANET data replication techniques based on the issues they address. The attributes of the replication techniques are also tabulated to facilitate a feature comparison of the existing MANET data replication works. Parameters and performance metrics are also presented to measure the performance of MANET replication techniques. In addition, this paper also proposes criteria for selecting appropriate data replication techniques for various application requirements. Finally, the paper concludes with a discussion on future research directions.     

无线多跳网络的延迟性能分析

多跳无线网络技术具有广阔的应用前景。研究如何精确地分析、预知和保证多跳无线通信路线的端到端延迟性能非常重要。通过引入一个延迟违约概率的下限,扩展链路层等效带宽模型,并在不同的信道服务速率和无线信道条件下进行模拟。分析和仿真发现,与信道服务速率相比,最大多普勒频移对多跳延迟性能的影响更大。     

移动多跳自组网多播路由协议的比较与分析

移动自组网在军用和紧急救援等特殊环境的应用前景非常广阔，其中的多播路由技术面临很迫切的挑战。文章介绍了当前的一些移动自组网的多播路由协议，将其分类比较，并详细介绍了比较优秀的按需多播路由协议（ODMRP）。最后探讨了泛洪在多播路由中的应用，以及多播路由的发展和面临的问题。