• Title/Summary/Keyword: Forwarding nodes

Search Result 189, Processing Time 0.022 seconds

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.

Collaboration Model Design to Improve Malicious Node Detection Rate in MANET (MANET에서 악의적 노드 탐지율 향상을 위한 협업모델 설계)

  • Shin, Eon-Seok;Jeon, Seo-In;Park, Gun-Woo;Ryu, Keun-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.3
    • /
    • pp.35-45
    • /
    • 2013
  • MANET has a weak point because it allows access from not only legal nodes but also illegal nodes. Most of the MANET researches had been focused on attack on routing path or packet forwarding. Nevertheless, there are insuffcient studies on a comprehensive approach to detect various attacks on malicious nodes at packet forwarding processes. In this paper, we propose a technique, named DTecBC (detection technique of malicious node behaviors based on collaboration), which can handle more effciently various types of malicious node attacks on MANET environment. The DTecBC is designed to detect malicious nodes by communication between neighboring nodes, and manage malicious nodes using a maintain table. OPNET tool was used to compare with Watchdog, CONFIDANT, SRRPPnT for verifying effectiveness of our approach. As a result, DTecBC detects various behaviors of malicious nodes more effectively than other techniques.

Dynamic AOI Management for P2P MMOGs (P2P MMOGs에 대한 동적 AOI 관리기법)

  • Lim, Chae-Gyun;Rho, Kyung-Taeg
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.6
    • /
    • pp.269-273
    • /
    • 2010
  • Massively Multiplayer Online Game (MMOG) is one of diverse applications where more than hundreds of users enjoy experiencing virtual worlds. Voronoi-based Overlay Network (VON) is proposed to reduce a bandwidth consumption in P2P MMOGs and Vorocast also is made using message forwarding in VON. We propose a dynamic area of interest (AOI) management method that solves problems such as less consistency and high latency due to sending position updates to more neighbor nodes from the message originator in forwarding scheme. Our scheme provides the higher consistency and reduces latency by combining direct connection scheme and Vorocast scheme compared to existing schemes. The proposed model is evaluated through simulations.

A performance Enhancement of VANET Warning Message Propagation on Electric Wave Blind Area Problem in the Urban Environment (도심의 전파 사각 지역 문제 해결을 위한 VANET 경고 메시지 전달 기능의 개선)

  • Lee, Won Yeoul
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.10
    • /
    • pp.1220-1228
    • /
    • 2014
  • Emergency Warning Service will be the most important service of VANET. Transmission delay is the most important performance criteria of the warning service. Most legacy research takes a way to minimize the packet collision. However those approach has a critical weak point on urban environment where there is a blind area of electric wave. So another issue is required in order to provide enhanced warning message propagation technique to overcome the urban environment problem. In this paper, I proposed an enhanced warning message propagation scheme in the poor electric wave environment as the intersection area. Proposed scheme forwards the warning message to the blind area by enhanced forwarding node selection technique. For efficiency of warning message propagation, I suggest forwarding priority for decision of forwarding node. And the node has a direct mode or redirect mode depending on neighbor nodes. The simulation was carried out to evaluate the performance. The simulation results show that proposed scheme has the superior performance compared to legacy warning message technique.

Optimal Control Of Two-Hop Routing In Dtns With Time-Varying Selfish Behavior

  • Wu, Yahui;Deng, Su;Huang, Hongbin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.9
    • /
    • pp.2202-2217
    • /
    • 2012
  • The transmission opportunities between nodes in Delay Tolerant Network (DTNs) are uncertain, and routing algorithms in DTNs often need nodes serving as relays for others to carry and forward messages. Due to selfishness, nodes may ask the source to pay a certain reward, and the reward may be varying with time. Moreover, the reward that the source obtains from the destination may also be varying with time. For example, the sooner the destination gets the message, the more rewards the source may obtain. The goal of this paper is to explore efficient ways for the source to maximize its total reward in such complex applications when it uses the probabilistic two-hop routing policy. We first propose a theoretical framework, which can be used to evaluate the total reward that the source can obtain. Then based on the model, we prove that the optimal forwarding policy confirms to the threshold form by the Pontryagin's Maximum Principle. Simulations based on both synthetic and real motion traces show the accuracy of our theoretical framework. Furthermore, we demonstrate that the performance of the optimal forwarding policy with threshold form is better through extensive numerical results, which conforms to the result obtained by the Maximum Principle.

Enhanced Hybrid Routing Protocol for Load Balancing in WSN Using Mobile Sink Node

  • Kaur, Rajwinder;Shergi, Gurleen Kaur
    • Industrial Engineering and Management Systems
    • /
    • v.15 no.3
    • /
    • pp.268-277
    • /
    • 2016
  • Load balancing is a significant technique to prolong a network's lifetime in sensor network. This paper introduces a hybrid approach named as Load Distributing Hybrid Routing Protocol (LDHRP) composed with a border node routing protocol (BDRP) and greedy forwarding (GF) strategy which will make the routing effective, especially in mobility scenarios. In an existing solution, because of the high network complexity, the data delivery latency increases. To overcome this limitation, a new approach is proposed in which the source node transmits the data to its respective destination via border nodes or greedily until the complete data is transmitted. In this way, the whole load of a network is evenly distributed among the participating nodes. However, border node is mainly responsible in aggregating data from the source and further forwards it to mobile sink; so there will be fewer chances of energy expenditure in the network. In addition to this, number of hop counts while transmitting the data will be reduced as compared to the existing solutions HRLBP and ZRP. From the simulation results, we conclude that proposed approach outperforms well than existing solutions in terms including end-to-end delay, packet loss rate and so on and thus guarantees enhancement in lifetime.

FRChain: A Blockchain-based Flow-Rules-oriented Data Forwarding Security Scheme in SDN

  • Lian, Weichen;Li, Zhaobin;Guo, Chao;Wei, Zhanzhen;Peng, Xingyuan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.1
    • /
    • pp.264-284
    • /
    • 2021
  • As the next-generation network architecture, software-defined networking (SDN) has great potential. But how to forward data packets safely is a big challenge today. In SDN, packets are transferred according to flow rules which are made and delivered by the controller. Once flow rules are modified, the packets might be redirected or dropped. According to related research, we believe that the key to forward data flows safely is keeping the consistency of flow rules. However, existing solutions place little emphasis on the safety of flow rules. After summarizing the shortcomings of the existing solutions, we propose FRChain to ensure the security of SDN data forwarding. FRChain is a novel scheme that uses blockchain to secure flow rules in SDN and to detect compromised nodes in the network when the proportion of malicious nodes is less than one-third. The scheme places the flow strategies into blockchain in form of transactions. Once an unmatched flow rule is detected, the system will issue the problem by initiating a vote and possible attacks will be deduced based on the results. To simulate the scheme, we utilize BigchainDB, which has good performance in data processing, to handle transactions. The experimental results show that the scheme is feasible, and the additional overhead for network performance and system performance is less than similar solutions. Overall, FRChain can detect suspicious behaviors and deduce malicious nodes to keep the consistency of flow rules in SDN.

A Multi-Chain Based Hierarchical Topology Control Algorithm for Wireless Sensor Networks

  • Tang, Hong;Wang, Hui-Zhu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.9
    • /
    • pp.3468-3495
    • /
    • 2015
  • In this paper, we present a multi-chain based hierarchical topology control algorithm (MCHTC) for wireless sensor networks. In this algorithm, the topology control process using static clustering is divided into sensing layer that is composed by sensor nodes and multi-hop data forwarding layer that is composed by leader nodes. The communication cost and residual energy of nodes are considered to organize nodes into a chain in each cluster, and leader nodes form a tree topology. Leader nodes are elected based on the residual energy and distance between themselves and the base station. Analysis and simulation results show that MCHTC outperforms LEACH, PEGASIS and IEEPB in terms of network lifetime, energy consumption and network energy balance.

Detection of False Data Injection Attacks in Wireless Sensor Networks (무선 센서 네트워크에서 위조 데이터 주입 공격의 탐지)

  • Lee, Hae-Young;Cho, Tae-Ho
    • Journal of the Korea Society for Simulation
    • /
    • v.18 no.3
    • /
    • pp.83-90
    • /
    • 2009
  • Since wireless sensor networks are deployed in open environments, an attacker can physically capture some sensor nodes. Using information of compromised nodes, an attacker can launch false data injection attacks that report nonexistent events. False data can cause false alarms and draining the limited energy resources of the forwarding nodes. In order to detect and discard such false data during the forwarding process, various security solutions have been proposed. But since they are prevention-based solutions that involve additional operations, they would be energy-inefficient if the corresponding attacks are not launched. In this paper, we propose a detection method that can detect false data injection attacks without extra overheads. The proposed method is designed based on the signature of false data injection attacks that has been derived through simulation. The proposed method detects the attacks based on the number of reporting nodes, the correctness of the reports, and the variation in the number of the nodes for each event. We show the proposed method can detect a large portion of attacks through simulation.