scholarly journals Alleviation of Binding Update Re-registration Handoff Latency at Home Agent Failure in MIPv6 Network

2015 ◽  
Vol 10 (4) ◽  
pp. 463
Author(s):  
A. Avelin Diana ◽  
K. Sundarakantham ◽  
S. Mercy Shalinie
Keyword(s):  
Network Architecture ◽  
Mobile Node ◽  
Delivery Ratio ◽  
Home Agent ◽  
Theoretical Evaluation ◽  
Packet Delivery ◽  
Handoff Latency ◽  
Correspondent Node ◽  
Edge Router ◽  
Binding Update

Home Agent (HA) is an indispensable entity for binding connectivity to route packets between Mobile Node (MN) and Correspondent Node (CN). MIPv6 allows the deployment of redundant HAs to overcome HA failure. Different approaches resolve this issue to recuperate binding association information. This paper compares the effect of handoff latency in various methods and proposes a Reliable HA delivery (RHAD) mechanism to mitigate the Binding Update (BU) registration latency in HA at the time of active HA failure. We use BGP domain in network architecture and apply IBGP protocol to transmit packets between Edge Router (ER) and HA. Both the theoretical evaluation and simulation results reveal that RHAD effectively reduces BU re-registration handoff latency and increases packet delivery ratio.

scholarly journals Greedy Data Transportation Scheme with Hard Packet Deadlines for Wireless Ad Hoc Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
HyungJune Lee
Keyword(s):  
Wireless Ad Hoc Networks ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Mobile Node ◽  
Network Services ◽  
Delivery Ratio ◽  
Mobile Nodes ◽  
Packet Delivery ◽  
Hoc Networks ◽  
Ad Hoc Sensor Networks

We present a greedy data transportation scheme with hard packet deadlines in ad hoc sensor networks of stationary nodes and multiple mobile nodes with scheduled trajectory path and arrival time. In the proposed routing strategy, each stationary ad hoc node en route decides whether to relay a shortest-path stationary node toward destination or a passing-by mobile node that will carry closer to destination. We aim to utilize mobile nodes to minimize the total routing cost as far as the selected route can satisfy the end-to-end packet deadline. We evaluate our proposed routing algorithm in terms of routing cost, packet delivery ratio, packet delivery time, and usability of mobile nodes based on network level simulations. Simulation results show that our proposed algorithm fully exploits the remaining time till packet deadline to turn into networking benefits of reducing the overall routing cost and improving packet delivery performance. Also, we demonstrate that the routing scheme guarantees packet delivery with hard deadlines, contributing to QoS improvement in various network services.

scholarly journals Analisis Kinerja Video Conference pada Jaringan Mobile IPv6 Dengan Triangle Tunneling Method

EXPLORE ◽  
2019 ◽  
Vol 9 (2) ◽  
Author(s):  
Muhammad Multazam
Keyword(s):  
Packet Loss ◽  
Mobile Ip ◽  
Mobile Node ◽  
Mobile Ipv6 ◽  
Video Conference ◽  
Home Agent ◽  
Delay Jitter ◽  
Tunneling Method ◽  
Correspondent Node

Mobile IP merupakan protocol yang mendukung mobilitas dari user, dengan mobile IP sebuah node dapat terus berkomunikasi dengan node yang lain dimanapun dia berada. Mobile IPv6 memperbolehkan node yang telah mempunyai dukungan terhadap IPv6 untuk meninggalkan jaringan asalnya sementara node tersebut sedang memperbarui koneksinya ke internet. Hal ini berarti bahwa mobile IPv6 bisa mengidentifikasi tiap-tiap node dengan static address-nya, tanpa memperhatikan point of attachment nya ke internet.Mobile IPv6 yang digunakan pada makalah ini memakai metode triangle tunneling yaitu metode perutean pengiriman paket dimana ketika correspondent node (CN) mengirimkan paket menuju mobile node (MN), home agent (HA) mengambil alih paket tersebut dan mengirimkannya ke care of address dari MN dengan tunneling, sedangkan MN dapat mengirimkan langsung menuju CN. Pada makalah ini dilakukan pengujian video conference (multipont) pada jaringan Mobile IPv6 dengan metode triangle tunneling untuk diukur parameter-parameter QoS meliputi packet loss, delay, jitter, throughput dan MOS.Berdasarkan hasil uji coba dengan memperhatikan parameter-parameter QoS yang dianalisa terlihat bahwa kualitas MN yang berada di jaringan asalnya (homenet) lebih baik ketika berada di jaringan yang sedang dikunjungi (visitnet), hal ini disebabkan dengan metode triangle tunneling paket yang dikirim menuju MN dirutekan ke HA terlebih dahulu sehingga meningkatkan trafik jaringan, selain itu pada uji coba handover terdapat nilai rata-rata delay yang cukup besar yaitu 3.367 detik untuk paket video dan 3.269 detik untuk paket audio, karena pada saat handover, MN membutuhkan waktu untuk memperbaharui koneksi dan melakukan konfigurasi ulang jaringan yang ada.

scholarly journals The improvement of node Mobility in RPL to increase transmission efficiency

2019 ◽  
Vol 9 (5) ◽  
pp. 4238 ◽  
Author(s):  
Pak Satanasaowapak ◽  
Chatchai Khunboa
Keyword(s):  
Healthcare Services ◽  
Mobile Node ◽  
Transmission Efficiency ◽  
Industrial Applications ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Node Mobility ◽  
Lossy Networks ◽  
Packet Delivery ◽  
Cost Metrics

The Internet of Thing has gained interested to use for daily devices to industrial applications. Mission-critical applications such as connected car and healthcare services require real-time communications and mobility support. The 6LoWPAN protocol and IPv6 Routing Protocol for Low Power and Lossy Networks (RPL) have become the standard for the IoT. However, the RPL protocol is unable to support the application requirement causing from the high network overhead, long message latency and high packet loss rate due to mobility. Thus, in this paper, we propose a new cost metric combining the number of hops, RSSI values, and the summation of delay to enhance RPL mobility. In addition, we define the movement notification for the mobile node to activate mobile detection and parent selection processes. Finally, we presented a comparative study of the improved RPL protocols in terms of packet delivery ratio, end-to-end delay and the number of control messages. The result shows that improved RPL protocol with the new cost metrics provides a high packet delivery ratio and offers a low message latency.

scholarly journals Trust Computation using Belief Model in Mobile Ad Hoc Network Avoiding Ballot Stuffing and Bad Mouthing

2020 ◽  
Vol 9 (4) ◽  
pp. 1057-1066
Keyword(s):  
Trust Management ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Mobile Node ◽  
Delivery Ratio ◽  
Packet Dropping ◽  
Packet Delivery ◽  
Computational Overhead ◽  
Shafer Theory ◽  
Belief Model

Trusted path in MANET ensures packet delivery and reduces the packet dropping which results in a saving of bandwidth and energy of the mobile node. Trust path finding mechanism has been proposed in the literature based on direct and indirect observations and applying Bayesian theory, Dempster-Shafer theory involving probability logic. In this paper, we studied trust computation problem in MANET with predefined fixed movement and random movement (frMANET) to compute trust to get over bad mouthing and ballot stuffing. Our scheme(frMANET scheme) is based on subjective logic based belief model involving uncertainty in behavior. We use consensus for parallel paths and discounting for transitive paths. We use public key based digital signature to deal with nonrepudiation. This identifies the node if denying that it is bad mouthing or ballot stuffing. Unlike trust management in a conventional scheme that computes trust based on packet dropping and forwarding, we have added a parameter - state of the node indicating priority work and unable to participate notification. We include service rating as well considering file sharing and file downloading as service rating parameter. We have evaluated University case study of a course offered by a professor in university to the enrolled and not enrolled students. The simulation results show an increase in packet delivery ratio with marginal overhead in average message transmission. The scheme helps in avoiding unnecessary fluctuations in trust values of trustworthy nodes and also ensures less computational overhead. This research is helpful when communication is frequent and failure of delivery of message is not tolerable in MANET and nodes need to be rated for goodness.

scholarly journals Research on Mobility Management Based on MIP Table in Mixed IPv4/v6 Networks

2013 ◽  
Vol 347-350 ◽  
pp. 2038-2042
Author(s):  
Zheng Xiang ◽  
Zheng Ming Ma
Keyword(s):  
Data Structure ◽  
Mobility Management ◽  
Mobile Ip ◽  
Mobile Node ◽  
Mobile Ipv6 ◽  
Home Agent ◽  
Ipv6 Network ◽  
Correspondent Node ◽  
Mobile Ipv4 ◽  
The Creation

IETF has specified Mobile IPv4 and Mobile IPv6 in RFC3344 and RFC3775 respectively, but not yet discussed Mobile IPv4/v6 in any published RFC. This paper proposes a scheme to solve one of Mobile IPv4/v6 problems which Home Agent (HA) locates in IPv6 network, and Correspondent Node (CN) locates in IPv4 network, while Mobile Node (MN) moves within IPv4 network. In the solution, a gateway called Mobile IPv4/v6 translation gateway (MIPv4/v6-TG) is introduced to bridge between IPv4 network and IPv6 network, which is made up of a traditional NAT-PT gateway and a Mobile IP application level gateway (MIP-ALG) built upon the NAT-PT gateway. MIP-ALG maintains a MIP table, a data structure, which is formed by entries. We use the MIP table to realize the communication between the IPv4 entities and the IPv6 entities. The creation, usage and update processes of MIP table are described in this paper. And it can work compatibly with RFC3344 and RFC3775.

Performance Evaluation of Fiber Wireless (FiWi) Access Network using Position Optimization of ONUs

2020 ◽  
Vol 10 ◽  
Author(s):  
Nitin Chouhan ◽  
Uma Rathore Bhatt ◽  
Raksha Upadhyay
Keyword(s):  
Power Consumption ◽  
Optimization Algorithm ◽  
Optical Network ◽  
Access Network ◽  
Whale Optimization Algorithm ◽  
Wireless Access ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
Whale Optimization ◽  
Wireless Access Network

: Fiber Wireless Access Network is the blend of passive optical network and wireless access network. This network provides higher capacity, better flexibility, more stability and improved reliability to the users at lower cost. Network component (such as Optical Network Unit (ONU)) placement is one of the major research issues which affects the network design, performance and cost. Considering all these concerns, we implement customized Whale Optimization Algorithm (WOA) for ONU placement. Initially whale optimization algorithm is applied to get optimized position of ONUs, which is followed by reduction of number of ONUs in the network. Reduction of ONUs is done such that with fewer number of ONUs all routers present in the network can communicate. In order to ensure the performance of the network we compute the network parameters such as Packet Delivery Ratio (PDR), Total Time for Delivering the Packets in the Network (TTDPN) and percentage reduction in power consumption for the proposed algorithm. The performance of the proposed work is compared with existing algorithms (deterministic and centrally placed ONUs with predefined hops) and has been analyzed through extensive simulation. The result shows that the proposed algorithm is superior to the other algorithms in terms of minimum required ONUs and reduced power consumption in the network with almost same packet delivery ratio and total time for delivering the packets in the network. Therefore, present work is suitable for developing cost-effective FiWi network with maintained network performance.

Catechize Global Optimization through Leading Edge Firefly Based Zone Routing Protocol

2020 ◽  
Vol 13 (2) ◽  
pp. 147-157 ◽  
Author(s):  
Neha Sharma ◽  
Sherin Zafar ◽  
Usha Batra
Keyword(s):  
Global Optimization ◽  
Routing Protocol ◽  
Firefly Algorithm ◽  
Leading Edge ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
Zone Routing Protocol ◽  
End To End Delay ◽  
End To End

Background: Zone Routing Protocol is evolving as an efficient hybrid routing protocol with an extremely high potentiality owing to the integration of two radically different schemes, proactive and reactive in such a way that a balance between control overhead and latency is achieved. Its performance is impacted by various network conditions such as zone radius, network size, mobility, etc. Objective: The research work described in this paper focuses on improving the performance of zone routing protocol by reducing the amount of reactive traffic which is primarily responsible for degraded network performance in case of large networks. The usage of route aggregation approach helps in reducing the routing overhead and also help achieve performance optimization. Methods: The performance of proposed protocol is assessed under varying node size and mobility. Further applied is the firefly algorithm which aims to achieve global optimization that is quite difficult to achieve due to non-linearity of functions and multimodality of algorithms. For performance evaluation a set of benchmark functions are being adopted like, packet delivery ratio and end-to-end delay to validate the proposed approach. Results: Simulation results depict better performance of leading edge firefly algorithm when compared to zone routing protocol and route aggregation based zone routing protocol. The proposed leading edge FRA-ZRP approach shows major improvement between ZRP and FRA-ZRP in Packet Delivery Ratio. FRA-ZRP outperforms traditional ZRP and RA-ZRP even in terms of End to End Delay by reducing the delay and gaining a substantial QOS improvement. Conclusion: The achievement of proposed approach can be credited to the formation on zone head and attainment of route from the head hence reduced queuing of data packets due to control packets, by adopting FRA-ZRP approach. The routing optimized zone routing protocol using Route aggregation approach and FRA augments the QoS, which is the most crucial parameter for routing performance enhancement of MANET.

Performance Analysis of TCP Variants using AODV and DSDV Routing Protocols in MANETs

2019 ◽  
Vol 13 ◽  
Author(s):  
Rajnesh Singh ◽  
Neeta Singh ◽  
Aarti Gautam Dinker
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Packet Delivery Ratio ◽  
Transport Layer ◽  
Destination Node ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
Two Measures ◽  
Hoc Networks

TCP is the most reliable transport layer protocol that provides reliable data delivery from source to destination node. TCP works well in wired networks but it is assumed that TCP is less preferred for ad-hoc networks. However, for application in ad-hoc networks, TCP can be modified to improve its performance. Various researchers have proposed improvised variants of TCP by only one or two measures. These one or two measures do not seem to be sufficient for proper analysis of improvised version of TCP. So, in this paper, the performance of different TCP versions is investigated with DSDV and AODV routing Protocols. We analyzed various performance measures such as throughput, delay, packet drop, packet delivery ratio and number of acknowledgements. The simulation results are carried out by varying number of nodes in network simulator tool NS2. It is observed that TCP Newreno achieved higher throughput and packet delivery ratio with both AODV and DSDV routing protocols.Whereas TCP Vegas achieved minimum delay and packet loss with both DSDV and AODV protocol. However TCP sack achieved minimum acknowledgment with both AODV and DSDV routing protocols. In this paper the comparison of all these TCP variants shows that TCP Newreno provides better performance with both AODV and DSDV protocols.

scholarly journals Void Avoidance Opportunistic Routing Protocol for Underwater Wireless Sensor Networks

Sensors ◽  
2021 ◽  
Vol 21 (6) ◽  
pp. 1942
Author(s):  
Rogaia Mhemed ◽  
Frank Comeau ◽  
William Phillips ◽  
Nauman Aslam
Keyword(s):  
Sensor Networks ◽  
Routing Protocol ◽  
Opportunistic Routing ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Underwater Sensor Networks ◽  
Network Resources ◽  
Hop Count ◽  
Intermediate Node ◽  
Packet Delivery

Much attention has been focused lately on the Opportunistic Routing technique (OR) that can overcome the restrictions of the harsh underwater environment and the unique structures of the Underwater Sensor Networks (UWSNs). OR enhances the performance of the UWSNs in both packet delivery ratio and energy saving. In our work; we propose a new routing protocol; called Energy Efficient Depth-based Opportunistic Routing with Void Avoidance for UWSNs (EEDOR-VA), to address the void area problem. EEDOR-VA is a reactive OR protocol that uses a hop count discovery procedure to update the hop count of the intermediate nodes between the source and the destination to form forwarding sets. EEDOR-VA forwarding sets can be selected with less or greater depth than the packet holder (i.e., source or intermediate node). It efficiently prevents all void/trapped nodes from being part of the forwarding sets and data transmission procedure; thereby saving network resources and delivering data packets at the lowest possible cost. The results of our extensive simulation study indicate that the EEDOR-VA protocol outperforms other protocols in terms of packet delivery ratio and energy consumption

scholarly journals Highly Reliable Decision-Making Using Reliability Factor Feedback for Factory Condition Monitoring via WSNs

2018 ◽  
Vol 2018 ◽  
pp. 1-9 ◽  
Author(s):  
Zafar Iqbal ◽  
Heung-No Lee ◽  
Saeid Nooshabadi
Keyword(s):  
Decision Making ◽  
Power Consumption ◽  
Cluster Head ◽  
Base Station ◽  
False Alarms ◽  
Delivery Ratio ◽  
Probability Of Error ◽  
Reliability Factor ◽  
Packet Delivery ◽  
Low Level

Cooperation among sensors in a wireless sensor network, deployed for industrial monitoring in an indoor scenario, is a topic of interest in the smart factory and smart city research. The indoor wireless communication channel is very harsh and the observations of all the sensors cannot be sent reliably to the base station. Failure to transmit correct sensing results to the base station may result in false alarms or missed detection of events. Therefore, we propose a cooperation scheme for the wireless sensors to send the data reliably to the base station. Our aim is to increase the reliability of the received information, reduce the probability of error, lower the overall power consumption, and keep the latency to an acceptable low level. We propose a reliability factor feedback algorithm to adjust the weight of unreliable sensors in the decision-making process. The proposed scheme is analyzed based on its latency, power consumption, and packet delivery ratio. Our results show significant improvement in the reliability of the received data, improved packet delivery, and reduced false alarm ratio for full repetition and cluster head-based cooperation. The power consumption and latency in data transmission are also kept to an acceptable low level.

Sign in / Sign up

Export Citation Format

Share Document