• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.2
• /
• pp.846-864
• /
• 2017

Software Defined Network (SDN) realizes management and control over the underlying forwarding device, along with acquisition and analysis of network topology and flow characters through south bridge protocol. Data path Identification (DPID) is the unique identity for managing the underlying device, so forged DPID can be used to attack the link of underlying forwarding devices, as well as carry out DoS over the upper-level controller. This paper proposes a dynamic defense method based on Client-Puzzle model, in which the controller achieves dynamic management over requests from forwarding devices through generating questions with multi-level difficulty. This method can rapidly reduce network load, and at the same time separate attack flow from legal flow, enabling the controller to provide continuous service for legal visit. We conduct experiments on open-source SDN controllers like Fluid and Ryu, the result of which verifies feasibility of this defense method. The experimental result also shows that when cost of controller and forwarding device increases by about 2%-5%, the cost of attacker's CPU increases by near 90%, which greatly raises the attack difficulty for attackers.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.10
• /
• pp.2658-2681
• /
• 2023

In edge computing scenarios, IoT end devices play a crucial role in relaying and forwarding data to significantly improve IoT network performance. However, traditional routing mechanisms are not applicable to this scenario due to differences in network size and environment. Therefore, it becomes crucial to establish an effective and reliable data transmission path to ensure secure communication between devices. In this paper, we propose a trusted path selection strategy that comprehensively considers multiple attributes, such as link stability and edge cooperation, and selects a stable and secure data transmission path based on the link life cycle, energy level, trust level, and authentication status. In addition, we propose the Stability-based On-demand Multipath Distance Vector (STAOMDV) protocol based on the Ad hoc AOMDV protocol. The STAOMDV protocol implements the collection and updating of link stability attributes during the route discovery and maintenance process. By integrating the STAOMDV protocol with the proposed path selection strategy, a dependable and efficient routing mechanism is established for IoT networks in edge computing scenarios. Simulation results validate that the proposed STAOMDV model achieves a balance in network energy consumption and extends the overall network lifespan.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.6
• /
• pp.1058-1069
• /
• 2015

In wireless sensor networks, geographic routing is known as an efficient method to transmit the data packet using the location information. Geographic routing relies on two techniques: greedy forwarding and face routing. Face routing helps to recover from greedy routing fail and is based on the planar graph in which does not cross each edge. However, the planarization causes frequently short transmission of data packet because it removes other edges except the shortest one. In other words, since the planarization removes the long edges, face routing could not exploit the efficient removed edges of communication graph. This problem brings about the excessive energy consumption of nodes. In this paper, we propose an energy efficient face routing protocol in wireless sensor networks. This proposed protocol searches the removed edges and transmits them via the edges. Simulation shows that the proposed protocol is more efficient in terms of energy consumption than the previous face routing.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.8 no.5
• /
• pp.419-428
• /
• 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 cooperative multipath routing protocol with a small number of paths based on an inter path communication. The inter path communication (namely, cooperative multipath routing) in the proposed protocol helps to reinforce the multipath reliability and reduce the use of network resources. In addition, the proposed protocol provides a reliable end-to-end transmission time by using a transmission recovery method based on the local decision for the path or transmission failures.

• Journal of the Korea Society for Simulation
• /
• v.6 no.2
• /
• pp.45-57
• /
• 1997

MAC (media access control) bridge is used to interconnect separate LANs and to relay frames between the BLANs (bridged LANs). Bridge architecture consists of MAC entity, MAC relay entity and bridge protocol entity protocol entity and performs learning, filtering and forwarding functions using filtering database. In this paper, we simulate these functions of bridge and the STP (spanning tree protocol). The STP derives an active topology from an arbitrarily connected BLAN. Our simulation model assumes a BLAN consisted of three bridge forming a closed loop. In order to remove the loop, each bridge process exchanges configruation BPDU (bridge protocol data unit0 with other bridge processes connected to the bridge itself. To simulate the communication between bridges, we implement the IPC (inter-process communication) server using message queues. Our simulation results show that the assumed BLAN contains no closed loop and then there is no alternative route and no unnecessary traffic.

• Journal of Communications and Networks
• /
• v.6 no.4
• /
• pp.362-375
• /
• 2004

An ad hoc network is a multi-hop wireless network. Its limited bandwidth and frequently changing topology require that its protocol should be robust, simple, and energy conserving. We have proposed PoolODMRP to reduce its control overhead greatly by its one-hop local route maintenance. However, PoolODMRP still has some shortcomings. In this paper, we propose PDAODMRP (passive data acknowledgement ODMRP) to extend PoolODMRP. Compared with PoolODMRP, PDAODMRP has the following contributions: (1) It knows the status of its downstream forwarding nodes by route information collected from data packets instead of BEACON signal of MAC layer; (2) it max simplifies the route information collected from data packets by pool nodes; (3) it adopts a dynamic local route maintenance to enforce its local route maintenance; (4) it adopts the route evaluation policy of NSMP (neighbor supporting multicast protocol). Compared with PoolODMRP, PDAODMRP has lower control overhead, lower data delivery delay, and lower data overhead.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.7
• /
• pp.3064-3094
• /
• 2018

Currently, the Underwater Sensor Networks (UWSNs) is mainly an interesting area due to its ability to provide a technology to gather many valuable data from underwater environment such as tsunami monitoring sensor, military tactical application, environmental monitoring and many more. However, UWSNs is suffering from limited energy, high packet loss and the use of acoustic communication. In UWSNs most of the energy consumption is used during the forwarding of packet data from the source to the destination. Therefore, many researchers are eager to design energy efficient routing protocol to minimize energy consumption in UWSNs. As the opportunistic routing (OR) is the most promising method to be used in UWSNs, this paper focuses on the existing proposed energy efficient OR protocol in UWSNs. This paper reviews the existing proposed energy efficient OR protocol, classifying them into 3 categories namely sender-side-based, receiver-side-based and hybrid. Furthermore each of the protocols is reviewed in detail, and its advantages and disadvantages are discussed. Finally, we discuss potential future work research directions in UWSNs, especially for energy efficient OR protocol design.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.8 no.5
• /
• pp.405-411
• /
• 2015

In this paper, we propose routing protocol for mobile wireless sensor networks with a mobile sink in cluster configuration. The proposed protocol extends LEACH-ME by introducing a mobile sink. The mobile sink moves to the cluster head with the highest number of member nodes to collect sensed data from cluster heads within its vicinity, which results in reducing energy consumption in forwarding packets to the sink. The simulation results show that the proposed protocol outperform LEACH-ME in terms of energy efficiency.

• Journal of Communications and Networks
• /
• v.16 no.6
• /
• pp.613-619
• /
• 2014

Multicast routing algorithms designed for wireline networks are not suitable for wireless environments since they cannot efficiently exploit the inherent characteristics of wireless networks such as the broadcast advantage. There are many routing protocols trying to use these advantages to decrease the number of required transmissions or increase the reception probability of data (e.g., opportunistic routing).Reducing the number of transmissions in a multicast tree directly decreases the bandwidth consumption and interference and increases the overall throughput of the network. In this paper, we introduce a distributed multicast routing protocol for wireless mesh networks called NCast which take into account the data delivery delay and path length when constructing the tree. Furthermore, it effectively uses wireless broadcast advantage to decrease the number of forwarding nodes dynamically when a new receiver joins the tree.Our simulation results show that NCast improves network throughput, data delivery ratio and data delivery delay in comparison with on demand multicast routing protocol. It is also comparable with multichannel multicast even though it does not use channeling technique which eliminates the interference inherently.

• Journal of Internet Technology
• /
• v.20 no.4
• /
• pp.1157-1166
• /
• 2019

A Wireless Body Area Network (WBAN) allows the seamless integration of miniaturized sensor nodes in or around a human body, which may cause damage to the surrounding body issue due to high temperature. Although various temperature aware routing protocols have been proposed to prevent temperature rise of sensor nodes, most of them accommodate single traffic transmission with no mobility support. We propose a Forwarder based Temperature Aware Routing Protocol (FTAR) that supports multiple traffic transmission for normal and critical data. Normal data is forwarded directly to the sink through forwarding nodes which are selected among mobile nodes attached to the arms and legs, while critical data is forwarded to the sink through static nodes attached to fixed body parts with no mobility. We conduct extensive simulations of FTAR, and conclude that FTAR has good performance in terms of hot spot generation ratio, hot spot duration time, and packet delivery ratio.