• Title/Summary/Keyword: Forwarding Node

Search Result 178, Processing Time 0.022 seconds

OBPF: Opportunistic Beaconless Packet Forwarding Strategy for Vehicular Ad Hoc Networks

  • Qureshi, Kashif Naseer;Abdullah, Abdul Hanan;Lloret, Jaime;Altameem, Ayman
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.5
    • /
    • pp.2144-2165
    • /
    • 2016
  • In a vehicular ad hoc network, the communication links are unsteady due to the rapidly changing topology, high mobility and traffic density in the urban environment. Most of the existing geographical routing protocols rely on the continuous transmission of beacon messages to update the neighbors' presence, leading to network congestion. Source-based approaches have been proven to be inefficient in the inherently unstable network. To this end, we propose an opportunistic beaconless packet forwarding approach based on a modified handshake mechanism for the urban vehicular environment. The protocol acts differently between intersections and at the intersection to find the next forwarder node toward the destination. The modified handshake mechanism contains link quality, forward progress and directional greedy metrics to determine the best relay node in the network. After designing the protocol, we compared its performance with existing routing protocols. The simulation results show the superior performance of the proposed protocol in terms of packet delay and data delivery ratio in realistic wireless channel conditions.

Energy Efficiency Enhancement of TICK -based Fuzzy Logic for Selecting Forwarding Nodes in WSNs

  • Ashraf, Muhammad;Cho, Tae Ho
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.9
    • /
    • pp.4271-4294
    • /
    • 2018
  • Communication cost is the most important factor in Wireless Sensor Networks (WSNs), as exchanging control keying messages consumes a large amount of energy from the constituent sensor nodes. Time-based Dynamic Keying and En-Route Filtering (TICK) can reduce the communication costs by utilizing local time values of the en-route nodes to generate one-time dynamic keys that are used to encrypt reports in a manner that further avoids the regular keying or re-keying of messages. Although TICK is more energy efficient, it employs no re-encryption operation strategy that cannot determine whether a healthy report might be considered as malicious if the clock drift between the source node and the forwarding node is too large. Secure SOurce-BAsed Loose Synchronization (SOBAS) employs a selective encryption en-route in which fixed nodes are selected to re-encrypt the data. Therefore, the selection of encryption nodes is non-adaptive, and the dynamic network conditions (i.e., The residual energy of en-route nodes, hop count, and false positive rate) are also not focused in SOBAS. We propose an energy efficient selection of re-encryption nodes based on fuzzy logic. Simulation results indicate that the proposed method achieves better energy conservation at the en-route nodes along the path when compared to TICK and SOBAS.

An Intrusion Detection Technique Suitable for TICN (전술정보통신체계(TICN)에 적합한 침입탐지 기법)

  • Lee, Yun-Ho;Lee, Soo-Jin
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.14 no.6
    • /
    • pp.1097-1106
    • /
    • 2011
  • Tactical Information Communication Network(TICN), a concept-type integrated Military Communication system that enables precise command control and decision making, is designed to advance into high speed, large capacity, long distance wireless relay transmission. To support mobility in battlefield environments, the application of Ad-hoc networking technology to its wireless communication has been examined. Ad-hoc network works properly only if the participating nodes cooperate in routing and packet forwarding. However, if selfish nodes not forwarding packets of other nodes and malicious nodes making the false accusation are in the network, it is faced to many threats. Therefore, detection and management of these misbehaving nodes is necessary to make confident in Ad-hoc networks. To solve this problem, we propose an efficient intrusion detection technique to detect and manage those two types of attacks. The simulation-based performance analysis shows that our approach is highly effective and can reliably detect a multitude of misbehaving node.

A Study on Impementing a Raspberry Pi-based IoT Gateway using the Mobius Platform (Mobius platform을 활용한 Raspberry PI 기반 IoT Gateway 구현에 관한 연구)

  • So-Haeng Lee;Kwon-Yeon Lee
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.18 no.5
    • /
    • pp.809-816
    • /
    • 2023
  • The purpose of this study is to implement a device using the Raspberry Pi that can transmit and supervise data between devices and servers using the oneM2M standard platform, Mobius. Operating under the same concept as a Gateway or Router, this device performs the role of forwarding packets sent from end nodes to other networks. Theoretical functionality has been achieved to concurrently connect and supervise up to 65536 devices. The communication methods for end nodes connected to the Gateway include ZigBee and WiFi, and for long-distance communication, tests were conducted using LoRa modules.

Energy-efficient Joint Control of Epidemic Routing in Delay Tolerant Networks

  • Wu, Yahui;Deng, Su;Huang, Hongbin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.2
    • /
    • pp.234-252
    • /
    • 2013
  • Due to the uncertain of connections in Delay Tolerant Networks (DTNs), most routing algorithms in DTNs need nodes to forward the message to others based on the opportunistic contact. The contact is related with the beaconing rate. In particular, nodes have more chances to encounter with each other with bigger beaconing rate, but more energy will be used. On the other hand, if the nodes forward the message to every node all the time, the efficiency of the routing algorithm is better, but it needs more energy, too. This paper tries to exploit the optimal beaconing rate and forwarding rate when the total energy is constraint. First, a theoretical framework is proposed, which can be used to evaluate the performance with different forwarding rate and beaconing rate. Then, this paper formulates a joint optimization problem based on the framework. Through Pontryagin's Maximal Principle, this paper obtains the optimal policy and proves that both the optimal forwarding and beaconing rates conform to threshold form. Simulation results show the accuracy of the theoretical framework. Extensive numerical results show that the optimal policy obtained in this paper is the best.

A Hexagon Tessellation Approach for the Transmission Energy Efficiency in Underwater Wireless Sensor Networks

  • Kim, Sung-Un;Cheon, Hyun-Soo;Seo, Sang-Bo;Song, Seung-Mi;Park, Seon-Yeong
    • Journal of Information Processing Systems
    • /
    • v.6 no.1
    • /
    • pp.53-66
    • /
    • 2010
  • The energy efficiency is a key design issue to improve the lifetime of the underwater sensor networks (UWSN) consisting of sensor nodes equipped with a small battery of limited energy resource. In this paper, we apply a hexagon tessellation with an ideal cell size to deploy the underwater sensor nodes for two-dimensional UWSN. Upon this setting, we propose an enhanced hybrid transmission method that forwards data packets in a mixed transmission way based on location dependent direct transmitting or uniform multi-hop forwarding. In order to select direct transmitting or uniform multi-hop forwarding, the proposed method applies the threshold annulus that is defined as the distance between the cluster head node and the base station (BS). Our simulation results show that the proposed method enhances the energy efficiency compared with the existing multi-hop forwarding methods and hybrid transmission methods

Interactive Multipath Routing Protocol for Improving the Routing Performance in Wireless Sensor Networks

  • Jung, Kwansoo
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.11 no.3
    • /
    • pp.79-90
    • /
    • 2015
  • Multipath routing technique is recognized as one of the effective approaches to improve the reliability of data forwarding. However, the traditional multipath routing focuses only on how many paths are needed to ensure a desired reliability. For this purpose, the protocols construct additional paths and thus cause significant energy consumption. These problems have motivated the study for the energy-efficient and reliable data forwarding. Thus, this paper proposes an energy-efficient concurrent multipath routing protocol with a small number of paths based on interaction between paths. The interaction between paths helps to reinforce the multipath reliability by making efficient use of resources. The protocol selects several nodes located in the radio overlapped area between a pair of paths as bridge nodes for the path-interaction. In order to operate the bridge node efficiently, when the transmission failure has detected by overhearing at each path, it performs recovery transmission to recover the path failure. Simulation results show that proposed protocol is superior to the existing multipath protocols in terms of energy consumption and delivery reliability.

Fuzzy Based Multi-Hop Broadcasting in High-Mobility VANETs

  • Basha, S. Karimulla;Shankar, T.N.
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.3
    • /
    • pp.165-171
    • /
    • 2021
  • Vehicular Ad hoc Network (VANET) is an extension paradigm of moving vehicles to communicate with wireless transmission devices within a certain geographical limit without any fixed infrastructure. The vehicles have most important participation in this model is usually positioned quite dimly within the certain radio range. Fuzzy based multi-hop broadcast protocol is better than conventional message dissemination techniques in high-mobility VANETs, is proposed in this research work. Generally, in a transmission range the existing number of nodes is obstacle for rebroadcasting that can be improved by reducing number of intermediate forwarding points. The proposed protocol stresses on transmission of emergency message projection by utilization subset of surrounding nodes with consideration of three metrics: inter-vehicle distance, node density and signal strength. The proposed protocol is fuzzy MHB. The method assessment is accomplished in OMNeT++, SUMO and MATLAB environment to prove the efficiency of it.

A Wireless Location-Based Routing Algorithm in Multi-User Game Environments

  • Lee, Jong-Min;Kim, Seong-Woo;Lee, Jung-Hwa
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.12
    • /
    • pp.1733-1740
    • /
    • 2007
  • In this paper, we propose a wireless location-based routing algorithm which uses the location information of its neighbor nodes and a destination node. At first, the proposed routing algorithm forwards a packet to the X direction by selecting a closest node to its destination as a next hop in terms of the X coordinate until the packet reaches closely to the packet's destination. Then the packet is forwarded to the Y direction by selecting a closest node to its destination in terms of the Y coordinate. We use a back off mechanism in case that a next hop cannot be found using the proposed routing algorithm, which resolves loops while forwarding. The experimental results show that the proposed routing algorithm performs well like the existing routing algorithms Ad hoc On-demand Distance Vector and Greedy Perimeter Stateless Routing. It is expected to use the proposed routing algorithm in the digital battlefield of military environments and survival games of commercial environments.

  • PDF

An Optimized Address Lookup Method in the Multi-way Search Tree (멀티웨이 트리에서의 최적화된 어드레스 룩업 방법)

  • 이강복;이상연;이형섭
    • Proceedings of the IEEK Conference
    • /
    • 2001.06a
    • /
    • pp.261-264
    • /
    • 2001
  • This paper relates to a node structure of a multiway search tree and a search method using the node structure and, more particularly, to a search method for accelerating its search speed by reducing the depth of each small tree in a multi-way search tree. The proposed idea can increase the number of keys capable of being recorded on a cache line by using one pointer at a node of the multi-way search tree so that the number of branches in a network address search is also increased and thus the tree depth is reduced. As a result, this idea can accelerate the search speed and the speed of the forwarding engine and accomplish a further speed-up by decreasing required memories and thus increasing a memory rate.

  • PDF