• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1685-1688
• /
• 2002

Application Routing Load Balancing (ARLB) is a novel load balancing mode that combines QoS routing and load balancing in per application to support QoS far real-time application based on wired network. Zone Routing Protocol (ZRP) is a recent hybrid proactive/reactive routing approach in an attempt to achieve scalability of ad-hoc network. This routing approach has the potential to be efficient in the generation of control traffic than traditional routing schemes. Up to now, without proper load balancing tools, the ZRP can actually guarantee QoS for delay-sensitive applications when congestion occurred in ad-hoc network. In this paper, we propose the ARLB to improve QoS fur delay-sensitive applications based on ZRP in ad-hoc network when congestion occurred and to be forwarding mechanism fur route coupling to support QoS for real-time applications. The critical point is that the routing metric of ARLB is originally designed for wired network environment. Therefore, we study and present an appropriate metric or cost computation routing of ARLB for recently proposed ZRP over ad-hoc network environment.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.1 no.1
• /
• pp.8-13
• /
• 2006

In mobile ad hoc networks, most of on demand routing protocols such as DSR and AODV do not deal with traffic load during the route discovery procedure. To achieve load balancing in networks, many protocols have been proposed. However, existing load balancing schemes do not consider the remaining available buffer size of the interface queue, which still results in buffer overflows by congestion in a certain node which has the least available buffer size in the route. To solve this problem, we propose a load balancing protocol called Dynamic Congestion Aware Routing Protocol (DCAR) which monitors the remaining buffer length of all nodes in routes and excludes a certain congested node during the route discovery procedure. We also propose two buffer threshold values to select an optimal route selection metric between the traffic load and the minimum hop count. Through simulation study, we compare DCAR with other on demand routing protocols and show that the proposed protocol is more efficient when a network is heavily loaded.

• IEIE Transactions on Smart Processing and Computing
• /
• v.5 no.6
• /
• pp.445-453
• /
• 2016

Fixed robust routing is attracting attention as routing that achieves high robustness against changes in traffic patterns without conducting traffic measurement and performing dynamic route changes. Fixed robust routing minimizes the worst-case maximum link load by distributing traffic of every source-destination (s-d) router pair onto multiple candidate paths (multipath routing). Multipath routing, however, can result in performance degradation of Transmission Control Protocol (TCP) because of frequent out-of-order packet arrivals. In this paper, we first investigate the influence of multipath routing on TCP performance under fixed robust routing with a simulation using ns-2. The simulation results clarify that TCP throughput greatly degrades with multipath routing. We next propose a candidate path selection method to improve TCP throughput while suppressing the worst-case maximum link load to less than the allowed level under fixed robust routing. The method selects a single candidate path for each of a predetermined ratio of s-d router pairs in order to avoid TCP performance degradation, and it selects multiple candidate paths for each of the other router pairs in order to suppress the worst-case maximum link load. Numerical examples show that, provided the worst-case maximum link load is less than 1.0, our proposed method achieves about six times the TCP throughput as the original fixed robust routing.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.9
• /
• pp.3094-3109
• /
• 2014

This paper proposes a load balanced reliable routing protocol called LBR (Load Balanced Reliable routing) in wireless networks. The LBR protocol transmits messages through a reliable path considering the balancing of the traffic load. Recently, the authors have proposed a multipath-based reliable routing protocol called MRFR, which is an appealing protocol for fault tolerant reliable data transmission. However, However, MRFR has no concern with the problem of load balancing, which results in increasing congestion and consuming high energy at some network nodes. As a result, the problem affects negatively the performance of the network. Taking account of load balancing as a route selection criteria can avoid routing through the congested nodes and allows to find better routes. In this paper, we extend MRFR by considering load balancing in the route discovery process of reliable communication. The simulation results showed that the proposed protocol outperforms AODV in terms of end-to-end delay, packet delivery radio, and average jitter. Compared to MRFR, the LBR protocol has the same packet delivery ratio, and obtains a better efficiency of load balancing.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.9
• /
• pp.2340-2349
• /
• 2009

In this paper we proposed a hopping routing scheme to resolve the hot spot problem for periodic monitoring services in wireless sensor networks. Our hopping routing scheme constructs load balanced routing path, where an amount of energy consumption of all nodes in the sensor networks is predictable. Load balanced routing paths can be obtained from horizontal hopping transmission scheme which balances the load of the sensor nodes in the same area, and also from vertical hopping transmission scheme which balances the load of the sensor nodes in the other area. The direct transmission count numbers as load balancing parameter for vertical hopping transmission are derived using the energy consumption model of the sensor nodes. The experimental results show that the proposed hopping scheme resolves the hot spot problem effectively. The efficiency of hopping routing scheme is also shown by comparison with other routing scheme such as multi-hop, direct transmission and clustering.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1433-1436
• /
• 2004

The ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure of centralized administration. Load-Balanced Ad hoc Routing(LBAR) protocol is an on-demand routing protocol intended for delay-sensitive applications where users are most concern with packet transmission delay. Although LBAR mechanism is a novel load balancing routing protocol for ad hoc network, it has own limitation in route path maintenance phase. Therefore, in this paper, we propose Advanced Load-Balanced Ad hoc Routing(A-LBAR) that is delay-sensitive and has an efficient path maintenance scheme. The robust path maintenance scheme is maintained by considering about nodal loads all over network and misbehavior of overloaded or selfish nodes. The proposed scheme provides good performance over DSR and AODV in terms of packet delay and packet loss rate when some misbehaving nodes exist in the network.

• Journal of Internet Technology
• /
• v.20 no.1
• /
• pp.293-300
• /
• 2019

The Internet of Things (IoT) enables embedded devices to connect to the internet either through IP or the web in a physical environment. The increase in performance of wireless access services, adaptive load balancing, and interference routing metric becomes the key challenges in Wireless Mesh Networks (WMN). However, in the case of IoT over WMN, a large number of users generate abundant net flows, which can result in network traffic jam. Therefore, in this paper, we propose a Load Balancing and Interference Delay Aware routing metric algorithm to efficiently address the issues present in the current work. The proposed scheme efficiently utilizes the available mesh station queue information and the number of mesh stations suffering from channel interference in the available path. The simulations results show that the proposed scheme performed superior to the existing routing metrics present in the current literature for similar purposes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.4
• /
• pp.651-669
• /
• 2013

In this paper, we study a novel routing algorithm based on load balancing for multi-channel wireless mesh networks. In order to increase the network capacity and reduce the interference of transmission streams and the communication delay, on the basis of weighted cumulative expected transmission time (WCETT) routing metric this paper proposes an improved routing metric based on load balancing and channel interference (LBI_WCETT), which considers the channel interference, channel diversity, link load and the latency brought by channel switching. Meanwhile, in order to utilize the multi-channel strategy efficiently in wireless mesh networks, a new channel allocation algorithm is proposed. This channel allocation algorithm utilizes the conflict graph model and considers the initial link load estimation and the potential interference of the link to assign a channel for each link in the wireless mesh network. It also utilizes the channel utilization percentage of the virtual link in its interference range as the channel selection standard. Simulation results show that the LBI_WCETT routing metric can help increase the network capacity effectively, reduce the average end to end delay, and improve the network performance.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.10
• /
• pp.1-7
• /
• 2003

In this paper, we propose load balanced routing and wavelength assignment (RWA) algorithm for static model. The proposed algorithm arranges the routing paths over the link uniformly and assigns routing paths according to the length of routing paths orderly. Thus, the proposed algorithm can efficiently utilize the network resources. Through the computer simulation on layered-graph model, we prove that the proposed algorithm improves network throughput and reduces blocking probability comparing to first-fit algorithm [1］. Moreover, the proposed algorithm considerably reduces computational time.

• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.671-678
• /
• 2002

In this paper, we propose hierarchical inter-domain load balanced QoS routing in a large scale of network. And a scheme of calculating resources'costs for precomputation schemes in hierarchical routing is proposed, and a scheme for selecting a path among multiple precomputed paths is proposed. We also propose a QoS routing scheme for transit and intra traffic in a large scale of domain-based network. For a domain in the network, the routing scheme first precomputes K multiple paths between all pairs of ingress and egress border routers while considering balancing of the expected load then selects paths with the probability of path selection. The routing scheme combines inter and intra domain routings seamlessly and uses the same cost calculation scheme. And these schemes make possible both global network resources' utilization and also load balancing.