• Title/Summary/Keyword: packet delivery ratio

Search Result 175, Processing Time 0.023 seconds

A Reactive Routing Scheme based on the Prediction of Link State for Communication between UAV Squadrons in a Large-Scale FANET (대규모 FANET에서 UAV 편대간 통신을 위한 링크 상태 예측에 기반한 반응적 라우팅 기법)

  • Hwang, Heedoo;Kwon, Oh Jun
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.4
    • /
    • pp.593-605
    • /
    • 2017
  • In applications which are covered wide range, it is possible that one or more number of Unmanned Aerial Vehicle(UAV) squadrons are used to perform a mission. In this case, it is most important to communicate seamlessly between the UAV squadrons. In this paper, we applied the modified OLSR(OSLR-Pds) which can prediction for state of the link for the communication in UAV squadron, and applied the modified AOMDV which can build multi-path for the communication between UAV Squadrons. The mobility of nodes are modeled using Gauss-Markov algorithm, and relative speed between nodes were calculated by derive equation of movement, and thereby we can predict link state for in a squadron and between squadrons. An experiment for comparing AODV, AOMDV and the proposed routing protocol was conducted by three factors such as packet delivery ratio, end to end delay, and routing overhead. In experiment result, we make sure that the proposed protocol performance are superior in these three factors. However, if the density of the nodes constituting FANET are too low, and if the moving speed of node is very slow, there is no difference to others protocols.

A Ring-based Multicast Routing Architecture for Mobile Ad Hoc Networks (모바일 애드혹 네트워크를 위한 링 기반 멀티캐스트 라우팅 구조)

  • Heo Joon;Hong Choong Seon;Yang Yubai
    • The KIPS Transactions:PartC
    • /
    • v.11C no.7 s.96
    • /
    • pp.895-904
    • /
    • 2004
  • Due to the frequent and unpredictable topology changes, multicast still remains as challenge and no one-size-fits-all protocol could serve all kinds of needs in mobile ad hoc network. In this paper, we propose a novel scheme of Hierarchical Eulerian Ring Oriented Multicast Architecture (HEROMA) over mobile ad hoc network. It has features that concentrate on efficiency and robustness simultaneously. It is also an application-driven proposal for hazard detection. Architectures including Eulerian ring, hierarchy and multicast agent are investigated in detail Simulation results different level of improvements on control traffic, end-to-end delay and packet delivery ratio by comparing with tree-based and mesh-based multicast protocols.

Recurrent Ant Colony Optimization for Optimal Path Convergence in Mobile Ad Hoc Networks

  • Karmel, A;Jayakumar, C
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.9
    • /
    • pp.3496-3514
    • /
    • 2015
  • One of the challenging tasks in Mobile Ad hoc Network is to discover precise optimal routing solution due to the infrastructure-less dynamic behavior of wireless mobile nodes. Ant Colony Optimization, a swarm Intelligence technique, inspired by the foraging behaviour of ants in colonies was used in the past research works to compute the optimal path. In this paper, we propose a Recurrent Ant Colony Optimization (RECACO) that executes the actual Ant Colony Optimization iteratively based on recurrent value in order to obtain an optimal path convergence. Each iteration involves three steps: Pheromone tracking, Pheromone renewal and Node selection based on the residual energy in the mobile nodes. The novelty of our approach is the inclusion of new pheromone updating strategy in both online step-by-step pheromone renewal mode and online delayed pheromone renewal mode with the use of newly proposed metric named ELD (Energy Load Delay) based on energy, Load balancing and end-to-end delay metrics to measure the performance. RECACO is implemented using network simulator NS2.34. The implementation results show that the proposed algorithm outperforms the existing algorithms like AODV, ACO, LBE-ARAMA in terms of Energy, Delay, Packet Delivery Ratio and Network life time.

Security Model for Tree-based Routing in Wireless Sensor Networks: Structure and Evaluation

  • Almomani, Iman;Saadeh, Maha
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.4
    • /
    • pp.1223-1247
    • /
    • 2012
  • The need for securing Wireless Sensor Networks (WSNs) is essential especially in mission critical fields such as military and medical applications. Security techniques that are used to secure any network depend on the security requirements that should be achieved to protect the network from different types of attacks. Furthermore, the characteristics of wireless networks should be taken into consideration when applying security techniques to these networks. In this paper, energy efficient Security Model for Tree-based Routing protocols (SMTR) is proposed. In SMTR, different attacks that could face any tree-based routing protocol in WSNs are studied to design a security reference model that achieves authentication and data integrity using either Message Authentication Code (MAC) or Digital Signature (DS) techniques. The SMTR communication and processing costs are mathematically analyzed. Moreover, SMTR evaluation is performed by firstly, evaluating several MAC and DS techniques by applying them to tree-based routing protocol and assess their efficiency in terms of their power requirements. Secondly, the results of this assessment are utilized to evaluate SMTR phases in terms of energy saving, packet delivery success ratio and network life time.

Trust Based Authentication and Key Establishment for Secure Routing in WMN

  • Akilarasu, G.;Shalinie, S. Mercy
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.12
    • /
    • pp.4661-4676
    • /
    • 2014
  • In Wireless Mesh Networks (WMN), an authentication technique can be compromised due to the distributed network architecture, the broadcast nature of the wireless medium and dynamic network topology. Several vulnerabilities exist in different protocols for WMNs. Hence, in this paper, we propose trust based authentication and key establishment for secure routing in WMN. Initially, a trust model is designed based on Ant Colony Optimization (ACO) to exchange the trust information among the nodes. The routing table is utilized to select the destination nodes, for which the link information is updated and the route verification is performed. Based on the trust model, mutual authentication is applied. When a node moves from one operator to another for accessing the router, inter-authentication will be performed. When a node moves within the operator for accessing the router, then intra-authentication will be performed. During authentication, keys are established using identity based cryptography technique. By simulation results, we show that the proposed technique enhances the packet delivery ratio and resilience with reduced drop and overhead.

Efficient routing in multicast mesh by using forwarding nodes and weighted cost function

  • Vyas, Kapila;Khuteta, Ajay;Chaturvedi, Amit
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.12
    • /
    • pp.5928-5947
    • /
    • 2019
  • Multicast Mesh based Mobile Ad-hoc NETworks (MANETs) provide efficient data transmission in energy restraint areas without a fixed infrastructure. In this paper, the authors present an improved version of protocol SLIMMER developed by them earlier, and name it SLIMMER-SN. Most mesh-based protocols suffer from redundancy; however, the proposed protocol controls redundancy through the concept of forwarding nodes. The proposed protocol uses remaining energy of a node to decide its energy efficiency. For measuring stability, a new metric called Stability of Node (SN) has been introduced which depends on transmission range, node density and node velocity. For data transfer, a weighted cost function selects the most energy efficient nodes / most stable nodes or a weighted combination of both. This makes the node selection criteria more dynamic. The protocol works in two steps: (1) calculating SN and (2) using SN value in the weighted cost function for selection of nodes. The study compared the proposed protocol, with other mesh-based protocols PUMA and SLIMMER, based on packet delivery ratio (PDR), throughput, end-to-end delay and average energy consumption under different simulation conditions. Results clearly demonstrate that SLIMMER-SN outperformed both PUMA and SLIMMER.

R3: A Lightweight Reactive Ring based Routing Protocol for Wireless Sensor Networks with Mobile Sinks

  • Yu, Sheng;Zhang, Baoxian;Yao, Zheng;Li, Cheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.12
    • /
    • pp.5442-5463
    • /
    • 2016
  • Designing efficient routing protocols for a wireless sensor network with mobile sinks (mWSN) is a challenging task since the network topology and data paths change frequently as sink nodes move. In this paper, we design a novel lightweight reactive ring based routing protocol called R3, which removes the need of proactively maintaining data paths to mobile sinks as they move in the network. To achieve high packet delivery ratio and low transmission cost, R3 combines ring based forwarding and trail based forwarding together. To support efficient ring based forwarding, we build a ring based structure for a network in a way such that each node in the network can easily obtain its ring ID and virtual angle information. For this purpose, we artificially create a virtual hole in the central area of the network and accordingly find a shortest cycled path enclosing the hole, which serves as base ring and is used for generating the remaining ring based structure. We accordingly present the detailed design description for R3, which only requires each node to keep very limited routing information. We derive the communication overhead by ring based forwarding. Extensive simulation results show that R3 can achieve high routing performance as compared with existing work.

A Routing Method Using Swarm Intelligence in MANETs (MANET에서 군집지능을 이용한 라우팅 방안)

  • Woo, Mi-Ae;Dong, Ngo Huu;Roh, Woo-Jong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.7B
    • /
    • pp.550-556
    • /
    • 2008
  • Swam intelligence refers that a large group of simple and unsophisticated entities work together to achieve complex and significant tasks. Researches using such swarm intelligence has been performed in the network routing area. Expecially, it has been well known that routing in mobile ad-hoc networks whose features are dynamic topology and routing based on the local information is one of the applications of swarm intelligence. In this paper, we propose an ant-based routing method for MANET. The proposed method sets its goals to reduce overheads by managing ants efficiently, and to reduce route set up time. The results obtained from simulations proved that the proposed method provides shorter path set-up time and end-to-end delay and less overhead while providing comparable packet delivery ratio.

Adaptive OLSR Protocol Based on Average Node Distance in Airdropped Distributed Mobility Model (분산 낙하 이동 모델에서의 평균 노드 거리 기반 적응적 OLSR 프로토콜)

  • Lee, Taekmin;Lee, Jinhae;Wang, Jihyeun;Yoo, Joonhyuk;Yoo, Seong-eun
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.13 no.2
    • /
    • pp.83-91
    • /
    • 2018
  • With the development of IT (Information Technology) technology, embedded system and network technology are combined and used in various environments such as military environment as well as everyday life. In this paper, we propose a new airdropped distributed mobility model (ADMM) modeling the dispersion falling of the direct shot of a cluster bomb, and we compare and analyze some representative MANET routing protocols in ADMM in ns-3 simulator. As a result of the analysis, we show OLSR routing protocol is promising in ADMM environment in the view points of packet delivery ratio (PDR), end to end delay, and jitter. In addition, we propose a new adaptation scheme for OLSR, AND-OLSR (Average Node Distance based adaptive-OLSR) to improve the original OLSR in ADMM environment. The new protocol calculates the average node distance, adapts the period of the control message based on the average node distance increasing rate. Through the simulation study, we show that the proposed AND-OLSR outperforms the original OLSR in PDR and control message overhead.

A Priority-based Time Slot Allocation Protocol for Hybrid MAC in WSNs (WSN에서 하이브리드 MAC을 위한 우선순위기반 타임 슬롯 할당 프로토콜)

  • Nam, Jae-Hyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.6
    • /
    • pp.1435-1440
    • /
    • 2014
  • Nodes in WSNs must operate under limited energy resource. Controlling access to the channel in WSNs plays a key role in determining channel utilization and energy consumption. This paper introduces a priority-based time slot allocation protocol for hybrid TDMA/CSMA MAC in WSNs. This protocol combines both TDMA and CSMA techniques while introducing prioritization by (m,k)-firm constraint. The performance of this protocol is obtained through simulations for various number of nodes and show significant improvements in delay and packet delivery ratio compared to S-MAC.