• International Journal of Computer Science & Network Security
• /
• v.22 no.7
• /
• pp.13-20
• /
• 2022

Basically Mobile Ad Hoc Network (MANET) is an autonomous system with the collection of mobile nodes, these nodes are connected to each other by using wireless networks. A mobile ad hoc network poses this quality which makes topology in dynamic manner. As this type of network is Ad Hoc in nature hence it doesn't have fixed infrastructure. If a node wishes to transfer data from source node to a sink node in the network, the data must be passed through intermediate nodes to reach the destination node, hence in this process data packet loss occurs in various MANET protocols. This research study gives a comparison of various Mobile Ad Hoc Network routing protocols like proactive (DSDV) and reactive (AODV, DSR) by using random topology with more intermediate nodes using CBR traffic. Our simulation used 50, 100, and 150 nodes variations to examine the performance of the MANET routing protocols. We compared the performance of DSDV, AODV and DSR, MANET routing protocols with the result of existing protocol using NS-2 environment, on the basis of different performance parameters like Packet Delivery Ratio, average throughput and average end to end delay. Finally we found that our results are better in terms of throughput and packet delivery ratio along with low data loss.

• Journal of Communications and Networks
• /
• v.14 no.6
• /
• pp.653-661
• /
• 2012

High-availability seamless redundancy (HSR) is a redundancy protocol for Ethernet networks that provides two frame copies for each frame sent. Each copy will pass through separate physical paths, pursuing zero fault recovery time. This means that even in the case of a node or a link failure, there is no stoppage of network operations whatsoever. HSR is a potential candidate for the communications of a smart grid, but its main drawback is the unnecessary traffic created due to the duplicated copies of each sent frame, which are generated and circulated inside the network. This downside will degrade network performance and might cause network congestion or even stoppage. In this paper, we present two approaches to solve the above-mentioned problem. The first approach is called quick removing (QR), and is suited to ring or connected ring topologies. The idea is to remove the duplicated frame copies from the network when all the nodes have received one copy of the sent frame and begin to receive the second copy. Therefore, the forwarding of those frame copies until they reach the source node, as occurs in standard HSR, is not needed in QR. Our example shows a traffic reduction of 37.5%compared to the standard HSR protocol. The second approach is called the virtual ring (VRing), which divides any closed-loop HSR network into several VRings. Each VRing will circulate the traffic of a corresponding group of nodes within it. Therefore, the traffic in that group will not affect any of the other network links or nodes, which results in an enhancement of traffic performance. For our sample network, the VRing approach shows a network traffic reduction in the range of 67.7 to 48.4%in a healthy network case and 89.7 to 44.8%in a faulty network case, compared to standard HSR.

• East Asian mathematical journal
• /
• v.22 no.2
• /
• pp.163-170
• /
• 2006

In networking, it is essential to analyse the nodes along with their neighbours. The properties of fuzzy finite graphs are very much useful in obtaining solutions to many problems like traffic congestion problem. In this paper, free nodes and busy nodes are defined and the properties of nodes are examined at various levels of their degrees.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.4
• /
• pp.313-319
• /
• 2000

As the interest of flexible manufacturing systems and computer integrated manufacturing systems increase, the distribution of centralized control systems using industrial control networks is getting more attention. In this paper, we investigate the rate-based traffic control of industrial control networks to improve the performance regarding the throughput, fairness, and error rates. Especially, we consider the protocol of Lon-$Works^{(TM)}$ which consists of all OSI 7-layers and supports various communication media at a low cost. Basically, the proposed rate-based traffic control system is closed loop by utilizing the feedback channel errors, which shows improved performance when compared with other industrial control networks commonly operated in open loop. To this end, an additional network node called monitoring node is introduced to check the channel status without increasing the channel load. The Proposed control loop is in effect whenever the feedback channel error becomes greater than an admittable value. We demonstrate the improved performance of the controlled network system in view of throughput and fairness measures by implementing the lab-scale network system based on LonWorks and through the experimentation upon it.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4205-4227
• /
• 2018

Network Coding (NC) is an approach recently investigated for increasing the network throughput and thus enhancing the performance of wireless mesh networks. The benefits of NC can further be improved when routing decisions are made with the awareness of coding capabilities and opportunities. Typically, the goal of such routing is to find and exploit routes with new coding opportunities and thus further increase the network throughput. As shown in this paper, in case of proactive routing the coding awareness along with the information of the measured traffic coding success can also be efficiently used to support the congestion avoidance and enable more encoded packets, thus indirectly further increasing the network throughput. To this end, a new proactive routing procedure called Congestion-Avoidance Network Coding-Aware Routing (CANCAR) is proposed. It detects the currently most highly-loaded node and prevents it from saturation by diverting some of the least coded traffic flows to alternative routes, thus achieving even higher coding gain by the remaining well-coded traffic flows on the node. The simulation results confirm that the proposed proactive routing procedure combined with the well-known COPE NC avoids network congestion and provides higher coding gains, thus achieving significantly higher throughput and enabling higher traffic loads both in a representative regular network topology as well as in two synthetically generated random network topologies.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.12A
• /
• pp.975-983
• /
• 2011

In this paper, we investigate how the IEEE 802.16 based wireless system can adopt the network coding. To avoid the problem of overhearing, we focus on the bidirectional traffic, where each end node exchanges network coded data over a relay node. The bidirectional traffic is usually observed in Internet, where TCP makes congestion control and error recovery based on the acknowledgement from the opposite direction. Thus, enhancing the spectral efficiency of wireless Internet through the network coding is expected. Our simulation with realistic radio characteristics and TCP-like traffic shows that the network coding improves the throughput by an average of 36 percent compared to the simple relay case.

• Proceedings of the KAIS Fall Conference
• /
• 2003.11a
• /
• pp.236-242
• /
• 2003

ATM ABR service controls network traffic using feedback information on the network congestion situation in order to guarantee the demanded service qualities and the available cell rates. In this paper we apply the control method using queue length prediction to the formation of feedback information for more efficient ABR traffic control. If backward node receive the longer delayed feedback information on the impending congestion, the switch can be already congested from the uncontrolled arriving traffic and the fluctuation of queue length can be inefficiently high in the continuing time intervals. The feedback control method proposed in this paper predicts the queue length in the switch using the slope of queue length prediction function and queue length changes in time-series. The predicted congestion information is backward to the node. NLMS and neural network are used as the predictive control functions, and they are compared from performance on the queue length prediction. Simulation results show the efficiency of the proposed method compared to the feedback control method without the prediction. Therefore, we conclude that the efficient congestion and stability of the queue length controls are possible using the prediction scheme that can resolve the problems caused from the longer delays of the feedback information.

• The Journal of the Korea Contents Association
• /
• v.5 no.1
• /
• pp.169-178
• /
• 2005

This paper presented high-level function model to achieve traffic engineering to construct traffic engineering infrastructure in Internet. Function model presented include traffic management, capacity management, and network planing. It is ensured that network performance is maximized under all conditions including load shifts and failures by traffic management. It is ensured that the network is designed and provisioned to meet performance objectives for network demands at minimum cost by capacity management. Also it is ensured that node and transport capacity is planned and deployed in advance of forecasted traffic growth by network planning.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.3
• /
• pp.263-267
• /
• 2007

This study proposes a new methodology to estimate the traffic capacity of a personal rapid transit(PRT) system. The proposed method comprises three steps. The first step models the guideway network(GN) of PRT as a digraph, where its node and link represent a station and a one-way guideway link between two stations, respectively. Given local vehicle control strategies, the second step formulates the local traffic capacities through the nodes and links of the GN model. The third step estimates the worst-case local traffic demands based on a shortest-path routing algorithm and an empty vehicle allocation algorithm. By comparing the traffic estimates to the local traffic capacities, we can determine the feasibility of the given GN in traffic capacity.

• Journal of Korea Multimedia Society
• /
• v.8 no.3
• /
• pp.372-378
• /
• 2005

When a mobile node changes a sub network using Mobile IP, it must register its current location to the home agent. If a mobile node is far from its home network, the Binding Update (BU) time delay is longer and affects its connection state. To solve such a BU delay problem, a new component in HMIPv6, called MAP, supports the mobility of mobile node to reduce the signaling delay in handover However, in hierarchical MAP architecture, the register concentration to a specific MAP may be occurred, which affects the network management wholly. In this paper, we propose a MAP selection scheme based on ioad balancing by the mobility factor and the traffic property. By the mobility factor and the traffic property, a mobile node can select a adequate MAP on its mobility factor and traffic characteristic.