Self-Adaptive On Demand Geographic Routing Protocols for Mobile Ad Hoc Networks

Abstract — It has been a big challenge to develop routing protocol that can meet different application needs and optimize routing paths according to the topology change in mobile ad hoc networks. Basing their forwarding decisions only on the local topology, geographic routing protocols have drawn a lot of attentions in recent years. However, inaccurate local topology knowledge and the outdated destination position information can lead to inefficient geographic forwarding and even routing failure. Proactive local position distribution can hardly adapt to the traffic demand. It is also difficult to pre-set protocol parameters correctly to fit in different environments. We have developed two self-adaptive on-demand geographic routing schemes. The local topology is updated in a timely manner according to network dynamics and traffic demands. Our route optimization scheme adapts the routing path according to both topology changes and actual data traffic requirements. Each node can determine and adjust the protocol parameter values independently according to different network environments, data traffic conditions and node’s own requirements. Our simulation studies have shown that the proposed routing protocols are more robust and outperform the existing geographic routing protocol. Specifically, the packet delivery latency is reduced almost four times as compared to GPSR at high mobility

Simulation study on the impact of the transmission power on the performance of routing protocols under different mobility models

© 2014 IEEE. the dynamic topology of a mobile ad hoc network poses a real challenge in designing the routing protocol. This paper examine through simulation the fundamental factors, mobility models and transmission power which have a major impacts on the performance of position based routing protocols. We analyse the effect of the transmission power of on the performance of protocols under two different mobility models. Using OPNET simulation tool, results show the evaluation and performance of the proposed protocol under a unified simulation environment for different scenarios

Robust and Scalable Geographic Multicast Protocol for Mobile Ad-hoc Networks

Abstract — Group communications are important in Mobile Ad hoc Networks (MANET). Multicast is an efficient method to implement the group communications. However, it is challenging to implement scalable, robust and efficient multicast in MANET due to the difficulty in group membership management, multicast packet forwarding and the maintenance of a tree- or mesh-based multicast structure over the dynamic topology for a large group size or network size. We propose a novel Robust and Scalable Geographic Multicast Protocol (RSGM). Scalable and efficient group membership management has been performed through zone-based structure, and the location service for group members is combined with membership management. Both the control messages and data packets are forwarded along efficient tree-shape paths, but there is no need to actively maintain a tree struc-ture, which efficiently reduces the maintenance overhead and makes the transmissions more robust to dynamics. Geographic forwarding is used to achieve further scalability and robustness. To avoid periodic flooding-based sources ’ announcements, an efficient source tracking mechanism is designed. Furthermore, we handle the empty zone problem faced by most zone-based routing protocols. Our simulation studies show that RSGM can scale to large group size and large network size, and a high delivery ratio is achieved by RSGM even under high dynamics. I

Trajectory-Aware Communication Solution for Underwater Gliders Using WHOI Micro-Modems

Abstract—The predictable trajectory of underwater gliders can be used in geographic routing protocols. Factors such as drifting and localization errors cause uncertainty when estimating a glider’s trajectory. Existing geographic routing protocols in underwater networks generally assume the positions of the nodes are accurately determined by neglecting position uncertainty. In this paper, a paradigm-changing geographic routing protocol that relies on a statistical approach to model position uncertainty is proposed. Our routing protocol is combined with practical cross-layer optimization to minimize energy consumption. Our solution’s performance is tested and compared with existing solutions using a real-time testbed emulation that uses underwater acoustic modems. I

Network Challenges of Novel Sources of Big Data

Networks and networking technologies are the key components of Big Data systems. Modern and future wireless sensor networks (WSN) act as one of the major sources of data for Big Data systems. Wireless networking technologies allow to offload the traffic generated by WSNs to the Internet access points for further delivery to the cloud storage systems. In this thesis we concentrate on the detailed analysis of the following two networking aspects of future Big Data systems: (i) efficient data collection algorithms in WSNs and (ii) wireless data delivery to the Internet access points.The performance evaluation and optimization models developed in the thesis are based on the application of probability theory, theory of stochastic processes, Markov chain theory, stochastic and integral geometries and the queuing theory.The introductory part discusses major components of Big Data systems, identify networking aspects as the subject of interest and formulates the tasks for the thesis. Further, different challenges of Big Data systems are presented in detail with several competitive architectures highlighted. After that, we proceed investigating data collection approaches in modern and future WSNs. We back up the possibility of using the proposed techniques by providing the associated performance evaluation results. We also pay attention to the process of collected data delivery to the Internet backbone access point, and demonstrate that the capacity of conventional cellular systems may not be sufficient for a set of WSN applications including both video monitoring at macro-scale and sensor data delivery from the nano/micro scales. Seeking for a wireless technology for data offloading from WSNs, we study millimeter and terahertz bands. We show there that the interference structure and signal propagation are fundamentally different due to the required use of highly directional antennas, human blocking and molecular absorption. Finally, to characterize the process of collected data transmission from a number of WSNs over the millimeter wave or terahertz backhauls we formulate and solve a queuing system with multiple auto correlated inputs and the service distribution corresponding to the transmission time over a wireless channel with hybrid automatic repeat request mechanism taken into account

Local Area Dynamic Routing Protocol: a Position Based Routing Protocol for MANET

A Mobile Ad Hoc Network (MANET) comprises mobile nodes (MNs), equipped with wireless communications devices; which form a temporary communication network without fixed network infrastructure or topology. The characteristics of MANET are: limited bandwidth; limited radio range; high mobility; and vulnerability to attacks that degrade the signal to noise ratio and bit error rates. These characteristics create challenges to MANET routing protocols. In addition, the mobility pattern of the MNs also has major impact on the MANET routing protocols. The issue of routing and maintaining packets between MNs in the mobile ad hoc networks (MANETs) has always been a challenge; i.e. encountering broadcast storm under high node density, geographically constrained broadcasting of a service discovery message and local minimum problem under low node density. This requires an efficient design and development of a lightweight routing algorithm which can be handled by those GPS equipped devices. Most proposed location based routing protocols however, rely on a single route for each data transmission. They also use a location based system to find the destination address of MNs which over time, will not be accurate and may result in routing loop or routing failure. Our proposed lightweight protocol, ‘Local Area Network Dynamic Routing’ (LANDY) uses a localized routing technique which combines a unique locomotion prediction method and velocity information of MNs to route packets. The protocol is capable of optimising routing performance in advanced mobility scenarios, by reducing the control overhead and improving the data packet delivery. In addition, the approach of using locomotion prediction, has the advantage of fast and accurate routing over other position based routing algorithms in mobile scenarios. Recovery with LANDY is faster than other location protocols, which use mainly greedy algorithms, (such as GPRS), no signalling or configuration of the intermediate nodes is required after a failure. The key difference is that it allows sharing of locomotion and velocity information among the nodes through locomotion table. The protocol is designed for applications in which we expect that nodes will have access to a position service (e.g., future combat system). Simulation results show that LANDY`s performance improves upon other position based routing protocols