Movement Of Mobile Nodes Research Articles

DEHCIC: A distributed energy-aware hexagon based clustering algorithm to improve coverage in wireless sensor networks

Due to the random deployment of Wireless Sensor Network (WSN) nodes in dangerous and inaccessible environments and their sensing radius limitations, complete coverage of the monitoring area cannot be achieved. Clustering techniques, applying the mobile nodes, and adjusting the sensing radius of sensor nodes are regarded as practical techniques to improve the coverage and reduce the energy consumption. The challenges including, how to grouping the nodes, selecting the cluster heads, managing the mobility of mobile nodes, and scheduling sleep intervals should be considered in the hybrid techniques to improve the coverage with minimum overlapping. In this paper, we propose a DEHCIC (Distributed Energy-aware Hexagon based Clustering algorithm to Improve Coverage) algorithm that considers energy and topological features such as the number of mobile neighbor nodes and number of neighbor nodes for electing the cluster heads. In addition, DEHCIC attempts to cover the holes as much as possible by the static sensor nodes so that if it is not possible, the closest mobile will cover the coverage holes. Moreover, the DEHCIC algorithm retains the sensor nodes in the active mode that cover the interest points; also, it puts others into the low-powered sleep mode. The simulation results show that the proposed algorithm reduces dependency on the movement of mobile nodes and with the minimum number of active nodes can prolong the coverage lifetime and improve the network coverage effectively.

Simulation Process for Mobile Nodes Information Using Location Aided Routing in MANET

Location-aided routing protocol (LAR) utilizes the position information for routing. This system is simulated position information in specific areas by using mobile nodes. Movement of hosts results in routes, requiring some mechanism for determining new routes. This system finds position information using Location aided routing algorithm between each nodes. In real application, mobile nodes can apply without time consuming and saving cost to get location information using wireless sensor network. Each of the nodes is involved with calculating its position. If the position information is searched in the routing protocol, then position-based routing protocol is used. After creating the position table, all mobile nodes can transmit 64B data within active mobile nodes via Base station. The algorithm is determined locations of nodes based on the connectivity for every node in specific area. This system is demonstrated location information by using Location-Aided Routing (LAR) protocol for route discovery. This system can assist to detect location of the specific areas using mobiles nodes. Simulation results are used to draw conclusions regarding to the proposed routing algorithm. The simulation of system is implemented mobile nodes and node movement function by using C# programming language.

Location Information Based Destination Converging Routing Method (LIBDCR)

With the development of portable, wireless devices like PDA, laptop, mobile phone, the utility of mobile ad-hoc networks have been increased in last many years. Unlike in infrastructure based network, routing of information packets in mobile ad-hoc network is a challenging task because of the random movement of mobile nodes. Location information based routing proven an efficient routing methodology. In location information based routing, by the knowledge of location of source and destination node, packet forwarding region is reduced from complete network to a small geometric region, therefore the information packet routing cost is reduced considerably. Researchers have developed many procedures in this class like LARDAR and LBPAR that trims down the packet forwarding region to a triangular shape and reduces the routing overhead. In this work a “Location Information Based Destination Converging Routing Method (LIBDCR)” is proposed which exploit the location of nodes for routing the traffic and optimized over existing location information based routing strategies.

A Mobility Solution for Hazardous Areas Based on 6LoWPAN

In a critical environment, e.g. in a factory where an employee faces hazardous conditions, monitoring the health status of the employee is important. Thus, continuous connectivity of the employee to the network is the main concern of such networks. In this paper, we have proposed a decentralized approach for mobility management of mobile nodes in hazardous areas like factory. The proposed mobility structure for hazardous areas, called MSHA, organizes static nodes as a tree for an efficient routing, automatic addressing, and handling movement of mobile nodes. MSHA is capable of handling multiple failures of static nodes which disconnect a mobile node from the network. MSHA is highly scalable regarding the number of mobile nodes and the size of the covered monitoring area. The proposed scheme is evaluated based on different factors. The results reveal the superiority of MSHA compared with the previous works. The promising analytical results manifest the performance (about 20%) of MSHA specifically in reducing packet loss and hand-off delay caused by the failure of the static nodes. The performance does not degrade with increasing the number of mobile nodes.

Obstacle-Avoiding Connectivity Restoration based on Node’S Movement and Deploying New Relay Node in Disjoint Mobile Sensor Networks

Mobile sensor networks (MSNs) have many applications in recent years, especially in some harsh environment, such as coastal and border protection, search-and-rescue, battlefield reconnaissance and so on. MSNs may suffer from a large-scale damage which causes many nodes to fail and the network to get partitioned into isolate islands. So, in order to avoid negative effects on the application, restoring network connectivity is crucial in such case. In this paper, we propose a novel method, OACRNMDR, which avoid obstacle to restore the networks based on deploying new relay node and node’s movement. In OACRNMDR mainly include three phases: firstly, detecting the boundary nodes of every isolate island, then moving mobile nodes that avoid obstacle to the appropriate location to restore the connectivity and finally deploying new relay node to restore the connection of the entire network. Extensive simulation experiments demonstrate that the proposed method can guarantee network connectivity and reduce the total distance in practical environment and the number of deploying relay node.

An Efficient Localization Method for Mobile Nodes in Wireless Sensor Networks

With the development of electronic technology and communication protocols, wireless sensor network technology is developing rapidly. In a sense, the traditional static wireless sensor network has been unable to meet the needs of new applications. However, the introduction of mobile nodes extends the application of wireless sensor networks, despite the technical challenges. Because of its flexibility, the mobile wireless sensor network has attracted great attention, and even small, self-controlled mobile sensor devices have appeared. At present, mobile node localization has become one of the hotspots in wireless sensor networks. As the storage energy of wireless sensor network nodes is limited, and the communication radius is small, many scientists have focused their research direction on the location algorithm of mobile nodes. According to the continuity principle of mobile node movement, in this paper we propose an improved mobile node localization algorithm based on the Monte Carlo Location (MCL) algorithm, and the method can reduce the sampling interval effectively. First of all, this paper introduces the structure and classification of wireless sensor localization technology. Secondly, the principle of the Monte Carlo Location algorithm is described in detail. Thirdly, we propose an efficient method for mobile node localization based on the MCL algorithm. Finally, the effectiveness and accuracy of the new algorithm are verified by comparative analysis.

An Analysis of Link Disjoint and Node Disjoint Multipath Routing for Mobile Ad Hoc Network

In Mobile Ad hoc Network, path between source and destination node changes too frequently due to unpredictable behavior and movement of mobile nodes. The data delivery to the intended destination becomes very challenging. The paths exist between source and destination node may be various types. Data delivery may be done with single or multiple paths. Single path sometimes not guaranteed about data delivery, so one of the better solution is multipath data delivery. Here, in this paper, we have considered Link Disjoint and Node Disjoint multipath for data delivery. For this AOMDV protocol with node and link disjoint is considered to evaluate performance. To evaluate their performance different node pause time considered with varying number of nodes. We have computed various QoS network metrics like throughput, average end-to-end delay, routing overhead to identify in which method of data delivery perform better and in what conditions. The results obtain shows that Node Disjoint multipath method AOMDV performs better than Link Disjoint method. The simulation work carried out using Simulator NS-2.34. Index Terms—Link-Disjoint, Node-Disjoint, Throughput, end-to-end delay, routing overhead, pause time.

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.

Location Determination of Dynamically Moving Mobile Nodes in Real Time

In today’s world as the internet users become more mobile, hence the need for location determination is a key need to provide services based on location, but many devices do not have GPS receivers or transmitters, hence the location determination of these devices is important to provide the location based services, like Advertisements, security, so forth. Location determination of mobile devices has been there for some time but most approaches are based on client intervention, so they are not suitable for integrating in security related components like intrusion detection systems or access control systems. In this paper we propose an approach based on that works on concept of trilateration to determine client location without his/her intervention.

Localized Motion Abetment Sensor Deployment Method for Hole Recognition and Curative

basic service in Wireless sensor network is monitoring of particular region of interest .since due to the nature of WSN random development hole in the ROI is obvious .So for these reason ROI should be completely and continuously covered. And in this paper we have attended and covered the issue of hole detection and healing in mobile WSNs. The main drawbacks of existing systems are selecting the boundary of ROI, finding coverage holes and estimating their characteristics, finding best location for relocating mobile nodes for repairing holes, and moving mobile nodes to safe location with minimum moving and messaging cost And to handle all these problems a novel technique is present named hole detection and healing. The computational complexity of HEAL is given as (v2), in which is the average number of 1-hop neighbors. In Heal there are Two Stages first, it detects boundary nodes and finds holes and in second, it treats hole healing. A distributed virtual forces-based local healing methodology is presented in which the nodes in a suitable distance from the hole will be included in the healing procedure and also presented wakeup scheduling algorithm. with the help of wakeup scheduling algorithm energy utilization of sensor nodes is reduced and increases the life of network. Keywordsdetection and healing, Border nodes, Region of Interest, Wireless sensor network, Wake up Scheduling.

DirMove: direction of movement based routing in DTN architecture for post-disaster scenario

Network architecture based on opportunistic Delay Tolerant Network (DTN) is best applicable for post-disaster scenarios, where the controlling point of relief work is any fixed point like a local school building or a hospital, whose location is known to everyone. In this work, 4-tier network architecture for post-disaster relief and situation analysis is proposed. The disaster struck area has been divided into clusters known as Shelter Points (SP). The architecture consists of mobile Relief Workers (RW) at tier 1, Throw boxes (TB) at tier 2 placed at fixed locations within SPs. Data Mules (DM) like vehicles, boats, etc. operate at tier 3 that provide inter-SP connectivity. Master Control Station (MCS) is placed at tier 4. The RWs are provided with smart-phones that act as mobile nodes. The mobile nodes collect information from the disaster incident area and send that information to the TB of its SP, using DTN as the communication technology. The messages are then forwarded to the MCS via the DMs. Based on this architecture, a novel DTN routing protocol is proposed. The routing strategy works by tracking recent direction of movement of mobile nodes by measuring their consecutive distances from the destination at two different instants. If any node moves away from the destination, then it is very unlikely to carry its messages towards the destination. For a node, the fittest node among all its neighbours is selected as the next hop. The fittest node is selected using parameters like past history of successful delivery and delivery latency, current direction of movement and node's recent proximity to the destination. Issues related to routing such as fitness of a node for message delivery, buffer management, packet drop and node energy have been considered. The routing protocol has been implemented in the Opportunistic Networks Environment (ONE) simulator with customized mobility models. It is compared with existing standard DTN routing protocols for efficiency. It is found to reduce message delivery latency and improve message delivery ratio by incurring a small overhead .

NETWORK MOBILITY SUPPORTED PROXY MOBILE IPV6

Proxy Mobile IPV6 (PMIPV6) is a network-based mobility management protocol, designed to keep track of individual mobile node’ movement. So a mobile node can easily roam in PMIPV6 network without changing it’s IP address. Network Mobility-Basic Support Protocol (NEMO-BSP), based on MIPV6, is the protocol designed for mobility management of NEMO in MPIV6 network. But NEMO-BSP cannot be directly used in PMIPV6 due to differences in the underlying protocols. To make PMIPV6 as a complete mobility management protocol, functionality of PMIPV6 should be enhanced to support network mobility in PMIPV6. This work enhances functionality of PMIPV6 and NEMO-BSP protocols and proposes a new architecture called NEMO supported PMIPV6 that supports movement of mobile nodes as well as network mobility in PMIPV6 network.

Combining Power Adjustment and Node’s Movement for Connectivity Restoration in Sensor Networks

Mobile sensor networks (MSNs) have many applications in recent years, especially in some harsh environment, such as battlefield reconnaissance. MSNs may suffer from a large-scale damage which causes many nodes to fail and the network to get partitioned into isolate islands. So in order to avoid negative effects on the application, restoring network connectivity is crucial in such case. In this paper, we propose a novel method, CPANMCR, which combines power adjustment and node’s movement to restore the network connectivity. In CPANMCR mainly include three phases: firstly detecting the boundary nodes of every isolate island, then adjusting the power of boundary node to restore the connection, and finally moving mobile nodes to the appropriate location to restore the connectivity of the entire network. Extensive simulation experiments demonstrate that the proposed method can guarantee network connectivity and reduce the total travel distance.

Analytical model for Binding Refresh Request to reduce storage and communication overhead in MIPv6 network

SUMMARYHome agent is a key component of MIPv6 functionality that comprises binding cache to hold the mobile nodes current point of attachment to the Internet. This paper is concerned with binding cache support for home agents within MIPv6 network. Existing binding cache of home agent supports weak cache consistency by using fixed contract length for Binding Refresh Request, which functions reasonably well in normal situations. However, maintaining a strong binding cache consistency in home agent as a crucial exceptional handling mechanism has become more demanding for the following objectives: (i) to adapt increasingly frequent change of care‐of address due to mobile nodes movement detection update; (ii) to provide fine‐grain controls to balance the binding cache load distributions for better delivery services; and (iii) to reduce the overhead allowances around the binding cache. In this paper, we have first verified the effectiveness of Binding Refresh Request contract length, and on the basis of that, two dynamic contract algorithms are suggested to reduce the storage and communication overhead allowances in binding cache. We have also compared our technique with the existing fixed Binding Refresh Request contract length, and our simulation results reveals that the proposed approach provides an effective performance to reduce overhead within the network. Copyright © 2014 John Wiley & Sons, Ltd.

WPAN에서 최대 측정거리 값을 이용한 이동객체 위치추정 보정 알고리즘

최근, 스마트폰의 GPS (Global Positioning System) 및 Wi-Fi를 이용한 위치기반서비스 (Location Based Services : LBS)에 대한 관심과 수요가 국내외에서 증가하고 있다. 위치추정 실험결과, WPAN (Wireless Personal Area Network)에서 실내 위치추정의 경우 고정노드와 이동노드간의 거리 측정 시 빈번하게 많은 오차 값이 발생함을 확인하였다. 본 논문에서는 최대 측정거리 값을 이용하여 이동객체의 위치추정 성능을 향상시킬 수 있는 위치추정 보정 알고리즘 (<TEX>$LCA_{MMV}$</TEX>)을 제안하고, 이동노드가 이동하는 상황을 3가지 시나리오로 구성하여 실험을 통해 성능을 분석하였다. 성능분석 결과, 제안한 알고리즘의 평균 위치추정 정확도는 SDS-TWR (Symmetric Double-Sided Two-Way Ranging)과 삼변측량법 보다 시나리오 1-3에서 각각 40.9cm, 77.6cm, 6.3cm 더 정확하게 측정됨을 확인하였다. Concerns and demands for the Location Based Services (LBS) using Global Positioning System (GPS) and Wi-Fi are largely increased in the world in the present. In some experimental results, it was noted that many errors are frequently occurred when the distances between an anchor node and a mobile node acre measured in indoor localization environment of Wireless Personal Area Network (WPAN). In this paper, localization compensation algorithm based on maximum measurement value (<TEX>$LCA_{MMV}$</TEX>) for moving objects in WPAN is proposed, and the performance of the algorithm is analyzed by experiments on three scenarios for movement of mobile nodes. From the experiments, it was confirmed that the average localization accuracy of suggested algorithm was more increased than Symmetric Double-Sided Two-Way Ranging (SDS-TWR) and triangulation as average 40.9cm, 77.6cm and 6.3cm, respectively on scenario 1-3.

A Routing Protocol Based on Mobility Prediction for Mobile Ad Hoc Networks

In Mobile Ad hoc Networks (MANETs), where nodes have limited transmitting power, the transmission is typically multi-hop. The network topology changes frequently due to the unpredictable movement of mobile nodes because each node is free to move arbitrarily with different speeds. Thus, when one node enters in the transmission range of another node a link between those two nodes is established, and an existent link is broken when either node is out of the transmission range of the other. We refer as link duration, the time interval during in which the link still established.This paper presents a novel mobility metric for mobile ad hoc networks, called link duration (LD) that measures the stability of an active link. This mobility metric is introduced to represent relative mobility between nodes in multi-hop distance.

Mobility Aware Energy Efficient Congestion Control in Mobile Wireless Sensor Network

In this paper, we introduce a mobility aware and energy efficient congestion control protocol “time sharing energy efficient congestion control (TSEEC) for mobile wireless sensor network.” TSEEC is based on hybrid scheme of time division multiple access protocol (TDMA) and statistical time division multiple access (STDMA) protocol that inform the sensor nodes when to wake up and to go to listening state so as to save energy. This management helps in minimizing congestion and improving network energy conservation through its load based allocation (LBA) and time allocation leister (TAL) techniques. LBA is typically based on STDMA that uses sensor node information for assignment of dynamic timeslots to the sensor, nodes, whereas TAL targets the mobility management of sensor nodes that further comprises three main strategies of cluster member node that is, joining cluster, leaving cluster, and absence of data/redundant data with extricated time allocation (ETA), shift back time allocation (SBTA), and eScaped Time Allocation (STA) subtechniques. In addition, TSEEC protocol introduces the mobility pattern to control the mobile sensor node (MSN) movement to enable the protocol to effectively adapt itself to change the traffic environments and mobility. Mathematical analysis and NS2 simulation show that TSEEC outperforms SMAC in terms of energy consumption and packet deliver ratio. Furthermore, a comparative analysis of TSEEC with various well-known related MAC protocols is also given.

High Quality GSM Voice based Analysis of the Prominent Routing Protocols of MANET

MANETs represent complex distributed systems which are comprised of free moving mobile nodes which use dynamic topology and are infrastructure less networks. The prime aim of this paper is to present the complete study on the performance and behavior of reactive, proactive and hybrid approach in MANETs. To evaluate the performance of these protocols different scenarios with varying nodes have been simulated using the NS-2 simulation tool. There are some performance metrics which are used to describe the performance of these given routing protocols . e. g. number of packets sent, number of packets received, number of packets dropped, Normalized routing Load, Network Overload etc.

MESSAGE AUTHENTICATION CODE BASED SECURE GROUP KEY MANAGEMENT PROTOCOL FOR MOBILE AD HOC NETWORKS

A mobile ad hoc network is a group of nodes which are communicating with each other with the use of radio frequencies. When there is high movement of mobile nodes, the nodes find difficult to reach other nodes. If the data are exchanged between nodes when there is high mobility, the data may be lost in transit. Therefore the security of data is needed for the transmission of data. Since the high dense of mobile nodes we cannot give better security, the mobile nodes must be formed as groups. For providing security, there are pre-requirements like key establishment, key agreement and key management and so on. Then these keys are used in the encryption/decryption algorithms such as symmetric key algorithms and asymmetric key algorithms. For this study, we have taken VBOR as the base protocol. VBOR consists of two phases namely, Route discovery and Route maintenance with the use of variable bit rate. In this study, the message authentication code is generated during route discovery phase then these data are exchanged between the nodes. In this proposed work, the performance analysis is done using some performance parameters like energy consumption, packet delivery ratio, overhead and delay.

Using mobile node speed changes for movement direction change prediction in a realistic category of mobility models

In order to evaluate performance of protocols for ad hoc networks, the protocols have to be tested under realistic conditions. These conditions may include a reasonable transmission range, a limited buffer size, and realistic movement of mobile users (mobility models). In this paper, we propose a new and realistic type of random mobility models in which the mobile node has to decelerate to reach the point of direction change and accelerates with a defined acceleration to reach its intended speed. This realistic mobility model is proposed based on random mobility models. In reality, mobile objects tend to change their speed when they are going to change their direction, i.e. decelerate when approaching a direction change point and accelerate when they start their movement in a new direction. Therefore, in this paper, we implement this behavior in random mobility models which lack such specification. In fact, this paper represents our effort to use this accelerated movement to anticipate a probable direction change of a mobile node with reasonable confidence. The simulation type of this paper is based on traces produced by a mobility trace generator tool. We use a data mining concept called association rule mining to find any possible correlations between accelerated movement of mobile node and the probability that mobile node wants to change its direction. We calculate confidence and lift parameters for this matter, and simulate this mobility model based on random mobility models. These simulations show a meaningful correlation between occurrence of an accelerated movement and event of mobile node's direction change.