• International Journal of Computer Science & Network Security
• /
• v.23 no.9
• /
• pp.111-119
• /
• 2023

Mobile Ad-hoc Network (MANET) is an infrastructure-less network that can configure itself without any centralized management. The topology of MANET changes dynamically which makes it open for new nodes to join it easily. The openness area of MANET makes it very vulnerable to different types of attacks. One of the most dangerous attacks is the Resource Consumption Attack (RCA). In this type of attack, the attacker consumes the normal node energy by flooding it with bogus packets. Routing in MANET is susceptible to RCA and this is a crucial issue that deserves to be studied and solved. Therefore, the main objective of this paper is to study the impact of RCA on two routing protocols namely, Ad hoc On-Demand Distance Vector (AODV) and Dynamic Source Routing (DSR); as a try to find the most resistant routing protocol to such attack. The contribution of this paper is a new RCA model (RCAM) which applies RCA on the two chosen routing protocols using the NS-2 simulator.

• Journal of Advanced Marine Engineering and Technology
• /
• v.8 no.1
• /
• pp.17-36
• /
• 1984

Since 1973, the competition on the development of fuel saving type internal combustion engines has become severe by the two times oil shock, and new type engines are reported every several months. Whenever these new type engines are developed, new designs are required and they will be offered in the market after performing the endurance test for a long time. But the engine market is faced with a heavy burden of finance, as the developing of a new engine requires tremendous expenses. For this reason, the computer simulation method has been lately developed to cope with it. The computer simulation method can be available to perform the reasonable research works by the theoretical analysis before carrying out practical experiments. With these processes, the developing expenses are cut down and the period of development is curtailed. The object of this study is the development of simulation computer program for the small naturally aspirated four-stroke diesel engine which is intended to product by the original design of our country. The process of simulation is firstly investigated for the ideal engine cycle, and secondly for the real engine cycle. In the ideal engine cycle, each step of the cycle is simulated by the energy balance according to the first law of thermodynamics, and then the engine performance is calculated. In the real cycle imulation program, the injection rate, the preparation rate and the combustion rate of fuel and the heat transfer through the wall of combustion chamber are considered. In this case, the injection rate is supposed as constant through the crank angle interval of injection and the combustion rate is calculated by the Whitehouse-Way equation and the heat transfer is calculated by the Annand's equation. The simulated values are compared with measured values of the YANMAR NS90(C) engine and Mitsubishi 4D30 engine, and the following conclusions are drawn. 1. The heat loss by the exhaust gas is well agree with each other in the lower load, but the measured value is greater than the calculated value in the higher load. The maximum error rate is about 15% in the full load. 2. The calculated quantity of heat transfer to the cooling water is greater than the measured value. The maximum error rate is about 11.8%. 3. The mean effective pressure, the fuel consumption, the power and the torque are well agree with each other. The maximum error is occurred in the fuel consumption, and its error rate is about 7%. From the above remarks, it may be concluded that the prediction of the engine performance is possibly by using the developed program, although the program needs to reform by adding the simulation of intake and exhaust process and assumping more reliable mechanical efficiency, volumetric efficiency, preparation rate and combustion rate.

• The Journal of Korean Society for Radiation Therapy
• /
• v.11 no.1
• /
• pp.53-59
• /
• 1999

The aim of this study is to improve the accuracy of field placement and junction between adjacent fields and block shielding through the use of a computed tomography(CT) simulator and virtual simulation. The information was acquired by assessment of Alderson Rando phantom image using CT simulator (I.Q. Xtra - Picker), determination of each field by virtual fluoroscopy of voxel IQ workstation AcQsim and colored critical structures that were obtained by contouring in virtual simulation. And also using a coronal, sagittal and axial view can determine the field and adjacent field gap correctly without calculation during the procedure. With the treatment planning by using the Helax TMS 4.0, the dose in the junction among the adjacent fields and the spinal cord and cribriform plate of the critical structure was evaluated by the dose volume histogram. The pilot image of coronal and sagittal view took about 2minutes and 26minutes to get 100 images. Image translation to the virtual simulation workstation took about 6minutes. Contouring a critical structure such as cribriform plate, spinal cord using a virtual fluoroscopy were eligible to determine a correct field and shielding. The process took about 20 minutes. As the result of the Helax planning, the dose distribution in adjacent field junction was ideal, and the dose level shows almost 100 percentage in the dose volume histogram of the spinal cord and cribriform plate CT simulation can get a correct therapy area due to enhancement of critical structures such as spinal cord and cribriform plate. In addition, using a Spiral CT scanner can be saved a lot of time to plan a simulation therefore this function can reduce difficulties to keep the patient position without any movements to the patient, physician and radiotherapy technician.

• Journal of KIISE:Information Networking
• /
• v.34 no.6
• /
• pp.475-482
• /
• 2007

Mobile nodes in ad-hoc wireless networks play roles of router as well as host. Movement of nodes causes network topology changes, which make existing routing information be modified. Therefore many routing protocols for ad-hoc networks were suggested in the literature. In this paper, we suggest an enhanced automatic route shortening method for dynamic source routing(DSR) protocol. DSR is a request/response based protocol which has low routing overhead owing to node movement. The current automatic route shortening is performed on the only nodes which belong to the source route of packets. On the contrary, our suggested method allows all neighbor nodes hearing the packet to participate in automatic route shortening. It makes all possible route shortenings be performed. So we maintain maximal shortened routes of ongoing data connections. Simulation results with ns2 show that our method pays small extra protocol overhead for ARS, but increases the ratio of successful packet transmissions and the number of ARSs performed in our mechanism is from 2 to 5 times higher than in original ARS mechanism and therefore it will improve the network-wide energy consumption in wireless ad-hoc networks.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.10 s.352
• /
• pp.8-17
• /
• 2006

Recently, the high-speed Internet users increase rapidly and broadband networks have been widely deployed. However, the current TCP congestion control algorithm was designed for relatively narrowband network environments, and thus its performance is inefficient for traffic transport in broadband networks. To remedy this problem, the TCP having an enhanced congestion control algorithm is required for broadband networks. In this paper, we propose an improved TCP congestion control that can sufficiently utilize the large available bandwidth in broadband networks. The proposed algorithm predicts the available bandwidth by using ACK information and RTT variation, and prevents large packet losses by adjusting congestion window size appropriately. Also, it can rapidly utilize the large available bandwidth by enhancing the legacy TCP algorithm in congestion avoidance phase. In order to evaluate the performance of the proposed algorithm, we use the ns-2 simulator. The simulation results show that the proposed algorithm improves not only the utilization of the available bandwidth but also RTT fairness and the fairness between contending TCP flows better than the HSTCP in high bandwidth delay product network environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.11
• /
• pp.1060-1073
• /
• 2013

In this paper, we present a cluster-based routing scheme for efficiently delivering data to group mobile users by extracting and clustering mobile user group simply from beacon message information in wireless ad-hoc networks. First, we propose an online-clustering mechanism that uses a local neighbor table on each node by recursively transmitting to neighbor nodes, and forms a group table where a set of listed nodes are classified as group members, without incurring much overhead. A node that appears the most frequently from neighbor tables throughout the network is selected as the cluster-head node, serving as a data gateway for the intra-cluster. Second, we design an inter-cluster routing that delivers data from stationary data sources to the selected cluster-head node, and a intra-cluster routing to deliver from the cluster-head node to users. Simulation results based on ns-2 in the ad-hoc networks consisting of 518 stationary nodes and 20 mobile nodes show that our proposed clustering mechanism achieves high clustering accuracy of 96 % on average. Regarding routing performance, our cluster-based routing scheme outperforms a naive one-to-one routing scheme without any clustering by reducing routing cost up to 1/20. Also, our intra-cluster routing utilizing a selected cluster-head node reduces routing cost in half as opposed to a counterpart of the intra-cluster routing through a randomly-selected internal group member.

• 대한공업교육학회지
• /
• v.33 no.2
• /
• pp.287-299
• /
• 2008

HTTP is one of the most widely used protocols of the WWW. Currently it uses TCP as the transport layer protocol to provide reliability. The HTTP uses separate TCP connection for each file request and adds unnecessary head-of-line blocking overhead for the file retrieval. The web application is short sized and affected by the increased handover latency of TCP in wireless environment. SCTP has attractive features such as multi-streaming and multi-homing. SCTP's multi-streaming and multi-homing avoid head-of-line blocking problem of TCP and reduce handover latency of TCP in wired and wireless environment. Mean response time is the important measure in most web application. In this paper, we present the comparison of mean response time between HTTP over SCTP with that of HTTP over TCP in wired and wireless environments using NS-2 simulator. We measured mean response time for varying packet loss rate, bandwidth, RTT, and the number of web objects in wired environment and mean response time and packet loss rate for varying moving speed and region size in wireless environment. Our experimental result shows that SCTP reduces the mean response time of TCP based web traffic.

• Journal of Advanced Marine Engineering and Technology
• /
• v.39 no.7
• /
• pp.760-764
• /
• 2015

Wireless sensors, installed on machinery, and Time Division Multiple Access (TDMA) transmission make an ideal system for monitoring machine conditions in industrial plants because there is no need for electronic wiring. However, there has not yet been a successful field application of such a system, capable of continuously transmitting data at sample rates greater than 100 Hz. In this research, a TDMA network protocol capable of acquiring data from multiple sensors at sample rates greater than 100 Hz was developed for field application. The protocol was implemented in a single cluster-star topology network, and the system was evaluated based on the node number and transmission distance. Network simulator 2 (ns-2) was used for a real field simulation. Non-TDMA and TDMA protocol cases were compared using four sensor nodes. In the cases of 20-s and 40-s transmission times, there was little difference between the reception rates of the non-TDMA and TDMA systems. However, the difference was much greater when using a 60-s transmission time.

• Journal of KIISE:Information Networking
• /
• v.37 no.5
• /
• pp.374-385
• /
• 2010

Wireless mesh networks can be deployed for various networks from home networking to last-mile broadband Internet access. Wireless mesh networks are composed of mesh routers and mesh clients. In these networks, static nodes form a multi-hop backbone of a large wireless access network that provides connectivity to end-users' mobile terminals. The network nodes cooperate with each other to relay data traffic to its destinations. In order to increase connectivity and better performance, researchers are getting interested in multi-channel and multi-interface wireless mesh networks. In these networks, non-overlapping multiple frequency channels are used simultaneously to increase the aggregate bandwidth available to end-users. Recently, researches have focused on finding suitable channel assignments for wireless network interfaces, equiped in a mesh node, together with efficient routing to improve overall system throughput in wireless mesh networks. This goal can be achieved by minimize channel interference. Less interference among using channels in a network guarantees more aggregated channel capacity and better connectivity of the networks. In this thesis, we propose interference aware channel assignment and routing algorithms for multi-channel multi-hop wireless mesh networks. We propose Channel Assignment and Routing algorithms using Traffic Profiles(CARTP) and Routing algorithms allowing detour routing(CARTP+2). Finally, we evaluate the performance of proposed algorithms in comparison to results from previous methods using ns-2 simulations. The simulation results show that our proposed algorithms can enhance the overall network performance in wireless mesh networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.4
• /
• pp.720-740
• /
• 2011

Wi-Fi-enabled portable devices have recently been introduced into the consumer electronics market. These devices download or upload content, from or to a host machine, such as a personal computer, a laptop, a home gateway, or a media server. This paper investigates the fairness among multiple Wi-Fi-enabled portable devices in a home network when they are simultaneously communicated with the host machine. First, we present that, a simple IEEE 802.11-based home network suffers from unfairness, and the fairness is exaggerated by the wireless link errors. This unfairness is due to the asymmetric response of the TCP to data-packet loss and to acknowledgment-packet loss, and the wireless link errors that occur in the proximity of any node; the errors affect other wireless devices through the interaction at the interface queue of the home gateway. We propose a QoS-provisioning framework in order to achieve per-device fairness and service differentiation. For this purpose, we introduce the medium access price, which denotes an aggregate value of network-wide traffic load, per-device link usage, and per-device link error rate. We implemented the proposed framework in the ns-2 simulator, and carried out a simulation study to evaluate its performance with respect to fairness, service differentiation, loss and delay. The simulation results indicate that the proposed method enforces the per-device fairness, regardless of the number of devices present and regardless of the level of wireless link errors; furthermore it achieves high link utilization with only a small amount of frame losses.