• Title/Summary/Keyword: Ns-2

Search Result 1,725, Processing Time 0.024 seconds

Design and Implementation of a protocol for stable transmission of emergency information in WBAN environment (WBAN 환경에서 응급 정보의 안정적 전송을 위한 프로토콜 설계 및 구현)

  • Lee, Dong Ho;Wang, Jong Soo
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.6 no.4
    • /
    • pp.57-65
    • /
    • 2010
  • Application of WBAN technology in medical field facilitates the prevention of diseases by collecting the vital signs remotely. It also enables to prevent the accidental emergency situation in advance plus long-tem monitoring of patients with chronic diseases such as heart diseases, hypertension, or the elderly and infirm. For emergency patients, major vital signal information collected by the 'Sensing' should have the top priority and such information should be transferred as promptly as possible without competition. In addition, when an emergency occurs to a patient, a priority mechanism is necessitated for a urgent message to get through to the final destination. However, LR-WPAN IEEE 802.15.4 technology does not consider such emergency message handling features. To deal with aforementioned issues, the IEEE 802.15.4 super frame protocol structure has been designed for stable transfer of emergency information in WBAN environment in this study, and alternation to super frame structures have been made, allowing GTS(Guaranteed Time Slot) can be used first at CFP (Contention Free Period) by reserving the resources in advance and prioritize the emergency signals. NS-2 has been utilized for the performance test and analysis.

Job-aware Network Scheduling for Hadoop Cluster

  • Liu, Wen;Wang, Zhigang;Shen, Yanming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.1
    • /
    • pp.237-252
    • /
    • 2017
  • In recent years, data centers have become the core infrastructure to deal with big data processing. For these big data applications, network transmission has become one of the most important factors affecting the performance. In order to improve network utilization and reduce job completion time, in this paper, by real-time monitoring from the application layer, we propose job-aware priority scheduling. Our approach takes the correlations of flows in the same job into account, and flows in the same job are assigned the same priority. Therefore, we expect that flows in the same job finish their transmissions at about the same time, avoiding lagging flows. To achieve load balancing, two approaches (Flow-based and Spray) using ECMP (Equal-Cost multi-path routing) are presented. We implemented our scheme using NS-2 simulator. In our evaluations, we emulate real network environment by setting background traffic, scheduling delay and link failures. The experimental results show that our approach can enhance the Hadoop job execution efficiency of the shuffle stage, significantly reduce the network transmission time of the highest priority job.

Recurrent Ant Colony Optimization for Optimal Path Convergence in Mobile Ad Hoc Networks

  • Karmel, A;Jayakumar, C
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.9
    • /
    • pp.3496-3514
    • /
    • 2015
  • One of the challenging tasks in Mobile Ad hoc Network is to discover precise optimal routing solution due to the infrastructure-less dynamic behavior of wireless mobile nodes. Ant Colony Optimization, a swarm Intelligence technique, inspired by the foraging behaviour of ants in colonies was used in the past research works to compute the optimal path. In this paper, we propose a Recurrent Ant Colony Optimization (RECACO) that executes the actual Ant Colony Optimization iteratively based on recurrent value in order to obtain an optimal path convergence. Each iteration involves three steps: Pheromone tracking, Pheromone renewal and Node selection based on the residual energy in the mobile nodes. The novelty of our approach is the inclusion of new pheromone updating strategy in both online step-by-step pheromone renewal mode and online delayed pheromone renewal mode with the use of newly proposed metric named ELD (Energy Load Delay) based on energy, Load balancing and end-to-end delay metrics to measure the performance. RECACO is implemented using network simulator NS2.34. The implementation results show that the proposed algorithm outperforms the existing algorithms like AODV, ACO, LBE-ARAMA in terms of Energy, Delay, Packet Delivery Ratio and Network life time.

A Two level Detection of Routing layer attacks in Hierarchical Wireless Sensor Networks using learning based energy prediction

  • Katiravan, Jeevaa;N, Duraipandian;N, Dharini
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.11
    • /
    • pp.4644-4661
    • /
    • 2015
  • Wireless sensor networks are often organized in the form of clusters leading to the new framework of WSN called cluster or hierarchical WSN where each cluster head is responsible for its own cluster and its members. These hierarchical WSN are prone to various routing layer attacks such as Black hole, Gray hole, Sybil, Wormhole, Flooding etc. These routing layer attacks try to spoof, falsify or drop the packets during the packet routing process. They may even flood the network with unwanted data packets. If one cluster head is captured and made malicious, the entire cluster member nodes beneath the cluster get affected. On the other hand if the cluster member nodes are malicious, due to the broadcast wireless communication between all the source nodes it can disrupt the entire cluster functions. Thereby a scheme which can detect both the malicious cluster member and cluster head is the current need. Abnormal energy consumption of nodes is used to identify the malicious activity. To serve this purpose a learning based energy prediction algorithm is proposed. Thus a two level energy prediction based intrusion detection scheme to detect the malicious cluster head and cluster member is proposed and simulations were carried out using NS2-Mannasim framework. Simulation results achieved good detection ratio and less false positive.

Rotordynamic Design and Analysis of the Rotor-Bearing System of a 500Wh Flywheel Energy Storage Device (플라이휠 에너지 저장장치 회전체계의 동역학적 설계 및 해석)

  • 최상규;김영철;경진호
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 1997.04a
    • /
    • pp.283-289
    • /
    • 1997
  • A 500Wh class high-speed Flywheel Energy Storage System (FESS) driven by a built-in BLDC motor/generator has been designed, which runs from 30000 to 60000rpm nominally. Due to the motor/generator inside, the flywheel rotor made of composites supported by PM/EM hybrid bearing system has a shape of bell or pendulum and thus requires accurate rotordynamic analyses and prediction of its dynamic behavior to secure the operating reliability. Rotordaynamic analyses of the flywheel rotor-bearing system revealed that the bell shaped rotor has two conical rigid-body modes in the system operating range and the first conical mode, of which nodal point lies in the radial EM bearing position, can adversely affect the dynamic response of the rotor at the corresponding critical speed. To eliminate the possibility of wild behavior of the rotor, two guide bearings are adopted at the upper end of the rotor and motor/generator. It was also revealed that the EM bearing stiffness of 0.5~1.0E+6 N/m and damping of 2000 Ns/m are favorable for smooth operation of the system around the 2nd critical speed.

  • PDF

Studies on the Skarn-type Ore Deposits and Skarn Minerals in Gyeongnam Province (경남지구(慶南地區)의 스카른형(型) 광상(鑛床)의 성인(成因)과 스카른광물(鑛物)에 관(關)한 연구(硏究))

  • Woo, Young Kyun;Lee, Min Sung;Park, Hee-In
    • Economic and Environmental Geology
    • /
    • v.15 no.1
    • /
    • pp.1-16
    • /
    • 1982
  • Many skarn type iron ore deposits are distributed in Kimhae-Mulgeum area of Gyeongnam Province. Integrated field, mineralogic, geochemical and fluid inclusion studies were undertaken to illustrate the character and origin of the ores in this area. The iron ore deposits in this area are NS or NNE trending fracture filling magnetite veins which are developed in andesitic rocks near the contact with late Cretaceous micrographic granite bodies. Symmetrically zoned skarns are commonly developed in the magnetite veins of this area. Zoning of skarn from center to margin of the vein are as follows; garnet quartz skarn-epidote skarn-epidote orthoclase skarn-altered andesitic rocks. Major ore mineral is magnetite and small amount of hematite, pyrite, pyrrhotite, chalcopyrite and sphalerite are associated. Vein paragenesis reveals four depositional stages; 1) skarn stage, 2) iron sulfide and oxide stage, 3) skarn stage, 4) sulfide stage Minute halite-bearing polyphase inclusions and liquid inclusions are contained in quartz. Filling temperatures range from $257^{\circ}$ to $370^{\circ}C$.

  • PDF

Position-based Routing Algorithm for Improving Reliability of Inter-Vehicle Communication

  • Ryu, Min-Woo;Cha, Si-Ho;Koh, Jin-Gwang;Kang, Seok-Joong;Cho, Kuk-Hyun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.8
    • /
    • pp.1388-1403
    • /
    • 2011
  • A vehicular ad-hoc network (VANET) consists of vehicles that form a network without any additional infrastructure, thus allowing the vehicles to communicate with each other. VANETs have unique characteristics, including high node mobility and rapidly changing network topology. Because of these characteristics, routing algorithms based on greedy forwarding such as greedy perimeter stateless routing (GPSR) are known to be very suitable for a VANET. However, greedy forwarding just selects the node nearest to the destination node as a relay node within its transmission range. This increases the possibility of a local maximum and link loss because of the high mobility of vehicles and the road characteristics in urban areas. Therefore, this paper proposes a reliability-improving position-based routing (RIPR) algorithm to solve those problems. The RIPR algorithm predicts the positions, velocities, and moving directions of vehicles after receiving beacon messages, and estimates information about road characteristics to select the relay node. Thus, it can reduce the possibility of getting a local maximum and link breakage. Simulation results using ns-2 revealed that the proposed routing protocol performs much better than the existing routing protocols based on greedy forwarding.

Routing Protocols for VANETs: An Approach based on Genetic Algorithms

  • Wille, Emilio C. G.;Del Monego, Hermes I.;Coutinho, Bruno V.;Basilio, Giovanna G.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.2
    • /
    • pp.542-558
    • /
    • 2016
  • Vehicular Ad Hoc Networks (VANETs) are self-configuring networks where the nodes are vehicles equipped with wireless communication technologies. In such networks, limitation of signal coverage and fast topology changes impose difficulties to the proper functioning of the routing protocols. Traditional Mobile Ad Hoc Networks (MANET) routing protocols lose their performance, when communicating between vehicles, compromising information exchange. Obviously, most applications critically rely on routing protocols. Thus, in this work, we propose a methodology for investigating the performance of well-established protocols for MANETs in the VANET arena and, at the same time, we introduce a routing protocol, called Genetic Network Protocol (G-NET). It is based in part on Dynamic Source Routing Protocol (DSR) and on the use of Genetic Algorithms (GAs) for maintenance and route optimization. As G-NET update routes periodically, this work investigates its performance compared to DSR and Ad Hoc on demand Distance Vector (AODV). For more realistic simulation of vehicle movement in urban environments, an analysis was performed by using the VanetMobiSim mobility generator and the Network Simulator (NS-3). Experiments were conducted with different number of vehicles and the results show that, despite the increased routing overhead with respect to DSR, G-NET is better than AODV and provides comparable data delivery rate to the other protocols in the analyzed scenarios.

The Method of Reducing the Delay Latency to Improve the Efficiency of Power Consumption in Wireless Sensor Networks

  • Ho, Jang;Son, Jeong-Bong
    • 한국정보컨버전스학회:학술대회논문집
    • /
    • 2008.06a
    • /
    • pp.199-204
    • /
    • 2008
  • Sensor nodes have various energy and computational constraints because of their inexpensive nature and ad-hoc method of deployment. Considerable research has been focused at overcoming these deficiencies through faster media accessing, more energy efficient routing, localization algorithms and system design. Our research attempts to provide a method of improvement MAC performance in these issues. We show that traditional carrier-sense multiple access(CSMA) protocols like IEEE 802.11 do not handle the first constraint adequately, and do not take advantage of the second property, leading to degraded latency and throughput as the network scales in size, We present more efficient method of a medium access for real-time wireless sensor networks. Proposed MAC protocol is a randomized CSMA protocol, but unlike previous legacy protocols, does not use a time-varying contention window from which a node randomly picks a transmission slot. To reduce the latency for the delivery of event reports, it carefully decides a fixed-size contention window, non-uniform probability distribution of transmitting in each slot within the window. We show that it can offer up to several times latency reduction compared to legacy of IEEE 802.11 as the size of the sensor network scales up to 256 nodes using widely used simulator ns-2. We, finally show that proposed MAC scheme comes close to meeting bounds on the best latency achievable by a decentralized CSMA-based MAC protocol for real-time wireless sensor networks which is sensitive to latency.

  • PDF

Microwave Negative Group Delay Circuit: Filter Synthesis Approach

  • Park, Junsik;Chaudhary, Girdhari;Jeong, Junhyung;Jeong, Yongchae
    • Journal of electromagnetic engineering and science
    • /
    • v.16 no.1
    • /
    • pp.7-12
    • /
    • 2016
  • This paper presents the design of a negative group delay circuit (NGDC) using the filter synthesis approach. The proposed design method is based on a frequency transformation from a low-pass filter (LPF) to a bandstop filter (BSF). The predefined negative group delay (NGD) can be obtained by inserting resistors into resonators. To implement a circuit with a distributed transmission line, a circuit conversion technique is employed. Both theoretical and experimental results are provided for validating of the proposed approach. For NGD bandwidth and magnitude flatness enhancements, two second-order NGDCs with slightly different center frequencies are cascaded. In the experiment, group delay of $5.9{\pm}0.5ns$ and insertion loss of $39.95{\pm}0.5dB$ are obtained in the frequency range of 1.935-2.001 GHz.