The impact of mobility models on the performance of mobile Ad Hoc network routing protocol

A mobility model represents nodes distribution and movement over the network. Several research works have shown that a selection of mobility model can affect the outcome of routing performance simulation in Mobile Ad Hoc Networks. Thus, a routing protocol may only be effective in a particular mobility model or scenario but performs inferiorly in another. As a result, analyses of routing protocol performance are often based on inadequate information leading to inaccurate argument and conclusion. In this paper, three different mobility models have been selected, where each of them is highly distinctive in terms of nodes movement behavior. In addition, a new measurement technique called probability of route connectivity is introduced. The technique is used to quantify the success rate of route established by a routing protocol. Extensive simulation runs are done and results are compared between each mobility model

Fuzzy Analysis for Nodes Deployment Strategies in Wireless Sensor Network

The objective of a best sensor deployment policy is to have a fully connected network while optimizing coverage area at the same time. By optimizing the different parameters like distance, energy level, transmission loss and density of sensor nodes. the deployment plan would guarantee the optimum connectivity of sensor nodes, as required by the essential applications. By making sure that the network is connected, it is also ensured that the sensed data is transmitted to other nodes and perhaps to a centralized base station that can make important decisions for the application. This paper investigates the fundamental parameters of a wireless sensor network: that is optimization of node density, transmission range, transmission loss, residual energy and connectivity

On the minimum hop count and connectivity in one-dimensional ad hoc wireless networks

This paper investigates connectivity in one-dimensional ad hoc networks by means of the distribution of the minimum hop count between source and destination nodes. We derive the exact probability distribution of the minimum hop count from the location density of relay nodes in the multihop path selected with the Most Forward within Radius (MFR) scheme. The probability that the source and destination nodes are connected (provided by Ghasemi and Nader-Esfahani [IEEE Commun. Lett. 10(4):251–253, 2006]) can be obtained by summing the probability masses for each possible value of the minimum hop count, which provides new insights to the connectivity probability. Numerical results show the effect of the number of nodes and the transmission range on the minimum hop count

Research on Wireless Multi-hop Networks: Current State and Challenges

Wireless multi-hop networks, in various forms and under various names, are being increasingly used in military and civilian applications. Studying connectivity and capacity of these networks is an important problem. The scaling behavior of connectivity and capacity when the network becomes sufficiently large is of particular interest. In this position paper, we briefly overview recent development and discuss research challenges and opportunities in the area, with a focus on the network connectivity.Comment: invited position paper to International Conference on Computing, Networking and Communications, Hawaii, USA, 201

Modeling the connectivity of Data-Channel-based Bluetooth Low Energy mesh networks

© 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.Bluetooth Low Energy (BLE) has become one of the most popular low-power wireless technologies. While BLE was originally designed for star topology networks only, recent developments have focused on enabling mesh network topology support for BLE. An emerging category of BLE mesh network initiatives is based on routing data units over BLE data channels. This letter investigates the fundamental connectivity parameters of data-channel-based BLE mesh networks, such as the probability of no isolation of a node and network K-connectivity. We provide an analytical model for both parameters which is validated by means of extensive simulations.Postprint (author's final draft

Effective Handover Technique in Cluster Based MANET Using Cooperative Communication

Mobile ad hoc networks (MANETs) are becoming increasingly common now a days and typical network loads considered for MANETs are increasing as applications evolve. This increases the importance of bandwidth efficiency and requirements on energy consumption delay and jitter. Coordinated channel access protocols have been shown to be well suited for MANETs under uniform load distributions. However, these protocols are not well suited for non-uniform load distributions as uncoordinated channel access protocols due to the lack of on-demand dynamic channel allocation mechanisms that exist in infrastructure based coordinated protocols. We have considered a lightweight dynamic channel allocation algorithm and a cooperative load balancing strategy that are helpful for the cluster based MANETs and an effective handover technique to improve the increased packet transmission mechanism. This helps in reduce jitter, packet delay and packet transfer speed, we use a novel handover algorithm to address this problem We present protocols that utilize these mechanisms to improve performance in terms of throughput, energy consumption and inter-packet delay variation (IPDV)

An Analytical Expression for k-connectivity of Wireless Ad Hoc Networks

Over the last few years coverage and connectivity of wireless ad hoc networks have fascinated considerable attention. The presented paper analyses and investigates the issues of k-connectivity probability and its robustness in wireless ad hoc-network while considering fading techniques like lognormal fading, Rayleigh fading, and nakagami fading in the ad hoc communication environment, by means of shadowing and fading phenomenon. In case of k-connected wireless sensor network (WSNs), this technique permits the routing of data packets or messages via individual (one or more) of minimum k node disjoint communication paths, but the other remaining paths can also be used. The major contribution of the paper is mathematical expressions for k-connectivity probability