• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.4
• /
• pp.2002-2019
• /
• 2017

RPL routing protocol for low-power and lossy networks is an Internet Engineering Task Force (IETF) recommended IPv6 based protocol for routing over Low power Lossy Networks (LLNs). RPL is proposed for networks with characteristics like small packet size, low bandwidth, low data rate, lossy wireless links and low power. RPL is a proactive routing protocol that creates a Directed Acyclic Graph (DAG) of the network topology. RPL is increasingly used for Internet of Things (IoT) which comprises of heterogeneous networks and applications. RPL proposes a single path routing strategy. The forwarding technique of RPL does not support multiple paths between source and destination. Multipath routing is an important strategy used in both sensor and ad-hoc network for performance enhancement. Multipath routing is also used to achieve multi-fold objectives including higher reliability, increase in throughput, fault tolerance, congestion mitigation and hole avoidance. In this paper, M-RPL (Multi-path extension of RPL) is proposed, which aims to provide temporary multiple paths during congestion over a single routing path. Congestion is primarily detected using buffer size and packet delivery ratio at forwarding nodes. Congestion is mitigated by creating partially disjoint multiple paths and by avoiding forwarding of packets through the congested node. Detailed simulation analysis of M-RPL against RPL in both grid and random topologies shows that M-RPL successfully mitigates congestion and it enhances overall network throughput.

• ETRI Journal
• /
• v.31 no.5
• /
• pp.534-544
• /
• 2009

Finding link-disjoint or node-disjoint paths under multiple constraints is an effective way to improve network QoS ability, reliability, and so on. However, existing algorithms for such scheme cannot ensure a feasible solution for arbitrary networks. We propose design principles of an algorithm to fill this gap, which we arrive at by analyzing the properties of optimal solutions for the multi-constrained link-disjoint path pair problem. Based on this, we propose the link-disjoint optimal multi-constrained paths algorithm (LIDOMPA), to find the shortest link-disjoint path pair for any network. Three concepts, namely, the candidate optimal solution, the contractive constraint vector, and structure-aware non-dominance, are introduced to reduce its search space without loss of exactness. Extensive simulations show that LIDOMPA outperforms existing schemes and achieves acceptable complexity. Moreover, LIDOMPA is extended to the node-disjoint optimal multi-constrained paths algorithm (NODOMPA) for the multi-constrained node-disjoint path pair problem.

• The KIPS Transactions:PartC
• /
• v.17C no.5
• /
• pp.433-440
• /
• 2010

Energy efficiency, low latency and scalability for wireless sensor networks are important requirements, especially, the wireless sensor network consist of a large number of sensor nodes should be minimized energy consumption of each node to extend network lifetime with limited battery power. An efficient algorithm and energy management technology for minimizing the energy consumption at each sensor node is also required to improve transfer rate. Thus, this paper propose no-overlap multi-pass protocol provides for sensor data transmission in the wireless sensor network environment. The proposed scheme should minimize network overhead through reduced a sensor data translation use to searched multi-path and added the multi-path in routing table. Proposed routing protocol may minimize the energy consumption at each node, thus prolong the lifetime of the sensor network regardless of where the sink node is located outside or inside the received signal strength range. To verify propriety proposed scheme constructs sensor networks adapt to current model using the real data and evaluate consumption of total energy.

• Journal of Korea Multimedia Society
• /
• v.19 no.5
• /
• pp.910-917
• /
• 2016

Sensors have limited resources in sensor networks, so efficient use of energy is important. Representative clustering methods, LEACH, LEACHC, TEEN generally use direct transmission methods from cluster headers to the sink node to pass collected data. However, the communication distance of the sensor nodes at low cost and at low power is not long, it requires a data transfer through the multi-hop to transmit data to the sink node. In the existing cluster-based sensor network studies, cluster process and route selection process are performed separately in order to configure the routing path to the sink node. In this paper, in order to use the energy of the sensor nodes that have limited resources efficiently, a cluster-based multi-hop routing protocol which merges the clustering process and routing process is proposed. And the proposed method complements the problem of uneven cluster creation that may occur in probabilistic cluster methods and increases the energy efficiency of whole sensor nodes.

• Journal of Communications and Networks
• /
• v.5 no.3
• /
• pp.230-239
• /
• 2003

In this paper, we propose a framework to study how to route packets efficiently in multipath communication networks. Two traffic congestion control techniques, namely, flow assignment and packet scheduling, have been investigated. The flow assignment mechanism defines an optimal splitting of data traffic on multiple disjoint paths. The resequencing delay and the usage of the resequencing buffer can be reduced significantly by properly scheduling the sending order of all packets, say, according to their expected arrival times at the destination. To illustrate our model, and without loss of generality, Gaussian distributed end-to-end path delays are used. Our analytical results show that the techniques are very effective in reducing the average end-to-end path delay, the average packet resequencing delay, and the average resequencing buffer occupancy for various path configurations. These promising results can form a basis for designing future adaptive multipath protocols.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.855-857
• /
• 2011

In this paper, we proposed EEAR(Efficient Energy Alternative Routing). This is a method of selecting a backup node for path routing management. When some node disconnection on the path routing, using pre-selected backup node provides immediately recover the path recovery. When selecting a Step-Parents node on the path management, the node' s energy level and distance information are cared in context-awareness. This not only increased the system' s capacity cost effectively, but also reduce transmission power entire nodes consume energy. As a result, each node could efficiently management and improves the life time for mobile host and extends system coverage.

• Journal of Communications and Networks
• /
• v.16 no.2
• /
• pp.155-161
• /
• 2014

Mobility can lead to continual loss of data and service interruptions during communications in multi-hop cognitive radio networks. Mobility of primary users (PUs) or cognitive users (CUs) requires adjustment of multi-hop communications among CUs to avoid any interference to PUs. To provide durable and reliable data routing that ensures continuous network service, we propose mobility-aware cognitive routing (MCR) for multi-hop cognitive radio networks. MCR examines the risk level of each node against interference regions and selects the most reliable path for data delivery using a Markov predictor. Through simulation, we verify that the proposed scheme can avoid route destruction preemptively and achieve reliable data delivery.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.14 no.1
• /
• pp.57-67
• /
• 2015

A large amount of work has been done in the areas of routing, MAC, QoS, capacity, location service, cooperative communication, fault tolerance, mobility models and various applications of mesh networks thanks to their merits of cost-effective way of deployment and flexibility in extending wireline services. Although multi-path routing protocols have been proposed to be used to provide QoS and fault-tolerance, there has not been any significant results discussed that support both in the literature to our best knowledge as they are often required in military and public safety applications. In this paper, we present a novel routing protocol for a mesh network based on the OFDM-TDMA collision-free MAC that discovers and maintains multiple paths that allows retransmitting and forwarding packets that have been blocked due to a link failure using an alternative next-hop node such that the delay-capacity tradeoff is reduced and the reliability is enhanced. Simulation results show that the proposed protocol performs well in terms of both the QoS and delivery ratio.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.8B
• /
• pp.482-491
• /
• 2007

This paper proposes a k-disjoint-path routing algorithm that provides energy efficient and reliable message transmission in wireless sensor networks. The proposed algorithm sends messages through a single path without the occurrence of critical events. However, it sends through k disjoint paths(k>1) under the occurrence of critical events. The proposed algorithm detects the occurrence of critical events by monitoring changing data patterns, and calculates k from a well-defined fault model and the target-delivery ratio. Our simulations reveal that the proposed algorithm is more resilient to node failure than other routing algorithms, and it also decreases energy consumption and reduces the average delay much more than multi-path and path-repair algorithms.

• ETRI Journal
• /
• v.43 no.4
• /
• pp.674-683
• /
• 2021

A trust-aware secure routing protocol (TSRP) for wireless sensor networks is proposed in this paper to defend against varieties of attacks. First, each node calculates the comprehensive trust values of its neighbors based on direct trust value, indirect trust value, volatilization factor, and residual energy to defend against black hole, selective forwarding, wormhole, hello flood, and sinkhole attacks. Second, any source node that needs to send data forwards a routing request packet to its neighbors in multi-path mode, and this continues until the sink at the end is reached. Finally, the sink finds the optimal path based on the path's comprehensive trust values, transmission distance, and hop count by analyzing the received packets. Simulation results show that TSRP has lower network latency, smaller packet loss rate, and lower average network energy consumption than ad hoc on-demand distance vector routing and trust based secure routing protocol.