Mobile Nodes In Wireless Networks Research Articles

Bio-inspired wireless sensor networks - a protocol for an enhanced hybrid energy optimization routing

Recently, there has been a focus on the significance of swarm intelligence-inspired routing algorithms for achieving optimum solutions in biologically inspired wireless sensor networks (WSNs). These protocols depict a network of wireless mobile nodes forming an infrastructure that is agile, dynamic, and independent of a central administrative facility. Among the challenges faced by bio-inspired WSNs, mobility awareness and excessive energy consumption (EC) stand out as significant hurdles, particularly in dynamic models with intermittent connections. This project seeks to tackle these obstacles by deploying the hybrid energy efficiency (HEED) approach to distributed clustering for network system cluster formation, along with fusion routing protocol of particle swarm optimization (PSO) and PIO to select cluster-heads and optimize solutions in bio-inspired WSNs. The success of the suggested approach is assessed using a variety of criteria, such as energy usage, rate of packet delivery, EC, and routing overhead and network lifetime. The methods like ad hoc on-demand distance vector's (AODV) and ant colony optimization (ACO) methods are employed in the testing and validation. In comparison to the reactive AODV routing protocol and ACO, the suggested routing protocol (HPSOPIO) reduces energy usage and increases network lifespan.

A Dual Attack Detection Technique to Identify Black and Gray Hole Attacks Using an Intrusion Detection System and a Connected Dominating Set in MANETs

A mobile ad-hoc network (MANET) is a temporary network of wireless mobile nodes. In a MANET, it is assumed that all of the nodes cooperate with each other to transfer data packets in a multi-hop fashion. However, some malicious nodes don’t cooperate with other nodes and disturb the network through false routing information. In this paper, we propose a prominent technique, called dual attack detection for black and gray hole attacks (DDBG), for MANETs. The proposed DDBG technique selects the intrusion detection system (IDS) node using the connected dominating set (CDS) technique with two additional features; the energy and its nonexistence in the blacklist are also checked before putting the nodes into the IDS set. The CDS is an effective, distinguished, and localized approach for detecting nearly-connected dominating sets of nodes in a small range in mobile ad hoc networks. The selected IDS nodes broadcast a kind of status packet within a size of the dominating set for retrieving the complete behavioral information from their nodes. Later, IDS nodes use our DDBG technique to analyze the collected behavioral information to detect the malicious nodes and add them to the blacklist if the behavior of the node is suspicious. Our experimental results show that the quality of the service parameters of the proposed technique outperforms the existing routing schemes.

Analysis of Congestion using mobile nodes in Wireless Network

This article discusses the work plan of wireless ad hoc network and the problems related to it during congestion. The congestion in wireless network congestion will vary with different topologies, methods of network deployment, mobility, channel utilization and power consumption at node level. This might lead to degradation of TCP performance of packet loss. In this research the proposed work plan the use of different number of nodes and their effect on congestion in wireless network. The reason for loss in wireless network could be overload of packets in node buffer space. This research will also enable us to conduct a deeper study to understand network congestion in ad-hoc networks. We will try to simulate various network environments with different number of users and then study the network on parameters like throughput, good put; packets dropped etc.

Link-Disjoint Multipath Routing for Network Traffic Overload Handling in Mobile Ad-hoc Networks

Mobile Ad-hoc Networks (MANETs) is the network of wireless mobile nodes with self-organizing, dynamic network connectivity without any pre-defined infrastructure for wireless communication. Error-less data broadcasting is the major role in MANET transmission. With the salient feature of dynamic topology and the distributed infrastructure, multipath routing is of great interests in MANETs. Multipath routing methods are dependable on adjacent nodes for finding the shortest path that several data packets are fallen to network traffic. Attention on the adjacent nodes can have the end-to-end delay while broadcasting the data packets into other nodes that finish up being fallen to congestion. It will also reduce network throughput and cause the network optimality problem. In this paper, we propose a new link-disjoint multipath routing method to solve the optimization problem in the real-time network environment. Hence, the proposed method is used to choose the shortest path from multiple paths in MANETs. Simulation results proved that the proposed method performs well in the dynamic network environment.

Distributed Algorithmic Foundations of Dynamic Networks

Much of the well-established theory of distributed algorithms focuses on static networks, where nodes do not crash and edges maintain operational status forever. On the other hand, large real-world networks are inherently dynamic: the participants in peer-to-peer networks and social networks change over time, mobile nodes in wireless networks move in and out of each other’s transmission range, and, in distributed data center networks, faulty machines need to be replaced by new machines without interrupting the operation of the remaining network. Dynamic network models, where the communication topology varies over time but where the set of nodes is fixed, have been studied extensively in literature.

Modelling and simulation of predictive handover control mechanisms for fast moving mobile nodes in wireless networks

When a mobile node (MN) is moving at a high speed from one network to another network, internet connectivity is degraded as MN cannot complete the handover within the required time owing to delayed triggering of handover request. To ensure seamless connectivity without performance degradation, traditional handover mechanism needs to be enhanced. In this paper, a media independent handover (MIH)-based handover triggering scheme is proposed based on the mobility prediction of MN. Handover triggering is predicted by calculating link expiration time that depends on velocity, direction and distance of MN from the access point. Scanning process required for traditional MIH networks is eliminated using information server (IS) that estimates the received signal strength (RSS) of candidate networks based on the location of MN. Simulation results show that the proposed scheme reduces the handover latency and improves the throughput in homogenous networks at varying velocities of MN.

DLBMRP: Design of Load Balanced Multicast Routing Protocol for Wireless Mobile Ad-hoc Network

A mobile ad-hoc network (MANETs) is a wireless network of mobile nodes without any fixed base-station or any centralized administration. When a node sends a data packet to more than one node at a time, it is called multicasting, multicast often used to utilize the network resources like channel bandwidth and node energy to improve the network efficiency. Multicast in MANETs have several challenges due to frequent changes in the network such as node mobility, reliability, limited resources, etc. The MANETs is widely used in several fields like emergency searches, rescues operation, and military battlefields where sharing of information is mandatory. These operations often require a rapid deployable and quick reconfigurable routing protocols. Since mobile nodes in wireless ad-hoc network have limited resources so an efficient multicast routing protocol is needed to reduce the wastage of resources. This paper proposes a traffic load balanced multicast routing protocol (LBMRP) in order to reduce the network overhead and increases the network life. In this scheme all mobile nodes are randomly classified into multi group (three groups) and create a tree for each group in order to achieve efficient data transmission. Simulation results shows that the proposed LBMRP scheme outperforms with some existing multicast routing protocols as multicast ad-hoc on-demand distance vector routing protocol, reliability of the multicast ad-hoc on demand distance vector and Parallel multiple nearly-disjoint trees multicast routing schemes.

Selfish Node Detection and Low Cost Data Transmission in MANET using Game Theory

Abstract Mobile Ad hoc Network (MANET) is infrastructure less, dynamic, decentralized network of wireless mobile nodes. Although MANET is very much useful but it suffers from different security issues. Dropping packets by selfish nodes is one of them. Presence of selfish nodes in MANET may damage the entire communication system. So, it is highly required to detect those selfish nodes and promote cooperation in MANET. Here, a new game theoretic scheme has been proposed for selfish node detection in MANET. Besides detection of selfish nodes, using Least Total Cost Factor (LTCF), data packets will be transmitted from source to destination node through least cost path only. Due to the presence of selfish nodes in the network, if a path has been broken, then the next best path will be automatically selected for data transmission. So, this scheme guarantees secure low cost data transfer and smallest amount of idle time.

A manifold flattening approach for anchorless localization

We present a new method for anchorless localization of mobile nodes in wireless networks using only measured distances between pairs of nodes. Our method relies on the completion of the Euclidean distance matrix, followed by multidimensional scaling in order to compute the relative locations of the nodes. The key element of novelty of our algorithm is the method of completing the Euclidean distance matrix, which consists of gradually inferring the unknown distances, such as to align all nodes on a k-hyperplane, where typically k is 2 or 3. Our method leads to perfect anchorless localization for noise-free range measurements, if the network is sufficiently connected. We introduce refinements to the algorithm to make it robust to noisy and outlier range measurements. We present results from several localization tests, using both simulated data and experimental results measured using a large indoor network deployment of our WASP platform. Our results show improvements in localization using our algorithm over previously published techniques.

"A Performance Study of Proactive, Reactive and Hybrid Routing Protocols using Qualnet Simulator"

The advancement in information technology and the need for large-scale communication infrastructures has triggered the era of Wireless Sensor Networks (WSNs). Mobile ad-hoc network (MANET) is a network of wireless mobile nodes which communicate with each other without any centralized control or established infrastructure. Routing is the process of selecting paths in a network along which data is to be sent. Routing is a critical task in MANET where the nodes are mobile. Dynamic and reliable routing protocols are required in the ad-hoc wireless networks, as they have no infrastructure (base station) and their network topology changes. There are various protocols for handling the routing problem in the ad-hoc wireless network environment. In this paper focus is given on studying the performance evaluation of various routing protocols using Qualnet simulator 5.0.2. The performance of the proactive, reactive and hybrid protocols are analyzed with different node densities for mobile and stationary nodes. The metrics used for the performance evaluation include average jitter, throughput, packet delivery ratio and average end to end delay.

Distributed Dynamic Host Configuration Protocol (D2HCP)

Mobile Ad Hoc Networks (MANETs) are multihop wireless networks of mobile nodes without any fixed or preexisting infrastructure. The topology of these networks can change randomly due to the unpredictable mobility of nodes and their propagation characteristics. In most networks, including MANETs, each node needs a unique identifier to communicate. This work presents a distributed protocol for dynamic node IP address assignment in MANETs. Nodes of a MANET synchronize from time to time to maintain a record of IP address assignments in the entire network and detect any IP address leaks. The proposed stateful autoconfiguration scheme uses the OLSR proactive routing protocol for synchronization and guarantees unique IP addresses under a variety of network conditions, including message losses and network partitioning. Simulation results show that the protocol incurs low latency and communication overhead for IP address assignment.

Localization of Mobile Nodes in Wireless Networks with Correlated in Time Measurement Noise

Wireless sensor networks are an inherent part of decision making, object tracking, and location awareness systems. This work is focused on simultaneous localization of mobile nodes based on received signal strength indicators (RSSIs) with correlated in time measurement noises. Two approaches to deal with the correlated measurement noises are proposed in the framework of auxiliary particle filtering: with a noise augmented state vector and the second approach implements noise decorrelation. The performance of the two proposed multimodel auxiliary particle filters (MM AUX-PFs) is validated over simulated and real RSSIs and high localization accuracy is demonstrated.

Distributional Convergence of Intermeeting Times under the Generalized Hybrid Random Walk Mobility Model

The performance of a mobile wireless network depends on the time-varying connectivity of the network as nodes move around. Hence, there has been a growing interest in the distribution of intermeeting times between two nodes in mobile wireless networks. We study the distribution of intermeeting times under the generalized Hybrid Random Walk mobility model. We show that when 1) the (conditional) probability that two nodes can communicate directly with each other given that they are in the same cell is small and 2) node's transitions in locations are independent over time, the distribution of intermeeting times can be well approximated using an exponential distribution. Moreover, the mean of intermeeting times can be estimated using the number of cells in the network and the aforementioned conditional probability of having a communication link when the two nodes are in the same cell. We also offer some insight behind the emergence of an exponential distribution, borrowing well-known results in existing literature on rare events.

Effect of mobility models on infrastructure based wireless networks

The tremendous demand is pushing the development of wireless mobile communications faster than ever before. Handoff management has widely been recognized as one of the most important and challenging problems for a seamless access to wireless network and mobile services. Mobility Models plays an important role in handoff management. In this paper, the effect of handoff procedure on the performance of random mobile nodes in wireless networks was investigated. Mobility of node is defined by various mobility models. Evaluating mobility models within an infrastructured network gives solution to performance measures like blocking probability, dropping probability to evaluate the performance of handoff algorithm. Handoff algorithm based on Absolute and Relative Measurement was used to examine the effect of Random Walk and Gauss Markov mobility models on performance of Infrastructure based Wireless Network. Keywords - Call blocking probability, Call dropping probability, Mobility models

Cooperative Bayesian Self-Tracking for Wireless Networks

Self-tracking of mobile nodes in wireless networks has the potential to revolutionize the wireless communications industry. This letter presents a cooperative self-tracking algorithm for mobile nodes in wireless networks. The presented algorithm is fully distributed and cooperative. It is derived using network factor graphs (Net-FGs) and results in the sum-product algorithm over a wireless network (SPAWN). Numerical results show that it is robust and can significantly outperform conventional non- cooperative self-tracking techniques.

Multipath passive data acknowledgement on-demand multicast protocol

Ad hoc network is a multihop wireless network of mobile nodes without fixed infrastructure. We have proposed PDAODMRP (Passive Data Acknowledgement ODMRP) to adapt the limited bandwidth and frequently changing topology of ad hoc network. PDAODMRP defines the adjacent un-forwarding nodes of forwarding nodes as pool nodes to reduces its local route maintenance scope, and its local route maintenance scope is at least one-hop smaller than that of PatchODMRP. However, PDAODMRP does not make full use of its multiple paths by distributing its data load to these paths. Therefore, in this paper, we propose MPDAODMRP (Multipath PDAODMRP) to extend PDAODMRP. MPDAODMRP distributes data overhead to multipath based on diversity coding. The simulation results show that the data overhead and the data delivery delay of MPDAODMRP are much lower than that of PDAODMRP.

An Adaptive Routing Algorithm for Ad hoc Mobile Networks

This research has examined the issues of routing in multi-hop wireless networks of mobile nodes without the need for any existing network infrastructure or administration. This is called ad hoc. The key point of this research article are selecting routing protocols which adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently. This research article considers different methods of optimization of selected algorithm. The Dynamic Source Routing is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes. The DSR protocol is designed mainly for networks of up to about two hundred nodes. It works well with even very high rates of mobility.

MANET

This paper presents the current state of the art of mobile ad hoc network and some important problems and challenges related to routing, power management, location management as well as multimedia over ad hoc networks. A mobile ad hoc network (MANET) is a temporary self-organizing network of wireless mobile nodes without the support of any existing infrastructure that may be readily available on the conventional networks. Since there is no fixed infrastructure available for MANET with nodes being mobile, routing becomes a very important issue. In addition, we also explain the various emerging applications and future trends of MANET.

EPDAODMRP: AN EXTENDED PDAODMRP PROTOCOL

An ad hoc network is a multi-hop wireless network of mobile nodes without fixed infrastructure. Its limited bandwidth and frequently changing topology require that its protocol should be robust, simple and energy conserving. We have proposed PDAODMRP (Passive Data Acknowledgement ODMRP) based on the passive acknowledgement function of data packets. PDAODMRP defines the adjacent un-forwarding nodes of forwarding nodes as pool nodes. With the help of pool nodes, PDAODMRP reduces its local route maintenance scope to at least one-hop. Although PDAODMRP has reduced its control overhead and data delivery delay greatly, it still selects multiple paths between a source and a member. And, its data overhead is still high. Hence, in this paper, we propose EPDAODMRP (Extended PDAODMRP) to extend PDAODMRP. Compared PDAODMRP, EPDAODMRP only selects the shortest path between a source and a member instead of all disjoint paths between a source and a member; its local route maintenance is as strong as that of PDAODMRP, which can amend all link failures. The simulation results show that EPDAODMRP has lower data overhead and lower data delivery delay.

An ad hoc multicast protocol based on passive data acknowledgement

An ad hoc network is a multi-hop wireless network of mobile nodes without fixed infrastructure. Its limited bandwidth and frequently changing topology require that its protocol should be robust, simple and energy conserving. In this paper, we propose a new ad hoc multicast protocol based on Passive Data Acknowledgement (PDAODMRP). PDAODMRP has the following contributions: (1) it knows the status of its downstream forwarding nodes by route information collected from data packets instead of BEACON signal of MAC layer, and reduces the waste of wireless bandwidth created by the BEACON signal; (2) it adopts a new route information collection from data packets to reduce the CPU usage of data route information collection; and (3) it adopts a dynamic local route maintenance to enforce its local route maintenance. From simulation results, it can be seen that PDAODMRP has low control overhead and low data delivery delay.