• 제목/요약/키워드: Network Life Time

검색결과 601건 처리시간 0.028초

Transmission Interval Optimization by Analysis of Collision Probability in Low Power TPMS (저전력 운영 TPMS에서 충돌 확률 분석을 통한 전송주기 최적화)

  • Lim, Sol;Choi, Han Wool;Kim, Dae Jin
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • 제10권5호
    • /
    • pp.364-371
    • /
    • 2017
  • TPMS is a vehicle electric system that measures the air pressure of a tire, and informs the driver of current tire states. The TPMS sensor typically uses unidirectional communication for small size, light weight, and low power. The transmission period of the sensor indicates the service quality of monitoring the tire. In order to determine the optimal transmission period, frame collision probability and the life time of the sensor should be analyzed. In this paper, collision probability model using Venn diagram is designed in low power TPMS with the normal and warning mode. And the life time and a collision probability were analyzed with the ratio(n) of the normal mode to warning mode transmission period. As a result, $T_{nP}=31sec$ and $T_{wP}=2.4sec$ at 5 years, and $T_{nP}=71sec$ and $T_{wP}=2.5sec$ at 7 years.

Smart pattern recognition of structural systems

  • Hassan, Maguid H.M.
    • Smart Structures and Systems
    • /
    • 제6권1호
    • /
    • pp.39-56
    • /
    • 2010
  • Structural Control relies, with a great deal, on the ability of the control algorithm to identify the current state of the system, at any given point in time. When such algorithms are designed to perform in a smart manner, several smart technologies/devices are called upon to perform tasks that involve pattern recognition and control. Smart pattern recognition is proposed to replace/enhance traditional state identification techniques, which require the extensive manipulation of intricate mathematical equations. Smart pattern recognition techniques attempt to emulate the behavior of the human brain when performing abstract pattern identification. Since these techniques are largely heuristic in nature, it is reasonable to ensure their reliability under real life situations. In this paper, a neural network pattern recognition scheme is explored. The pattern identification of three structural systems is considered. The first is a single bay three-story frame. Both the second and the third models are variations on benchmark problems, previously published for control strategy evaluation purposes. A Neural Network was developed and trained to identify the deformed shape of structural systems under earthquake excitation. The network was trained, for each individual model system, then tested under the effect of a different set of earthquake records. The proposed smart pattern identification scheme is considered an integral component of a Smart Structural System. The Reliability assessment of such component represents an important stage in the evaluation of an overall reliability measure of Smart Structural Systems. Several studies are currently underway aiming at the identification of a reliability measure for such smart pattern recognition technique.

Energy-Efficient Cluster Head Selection Method in Wireless Sensor Networks (무선 센서 네트워크에서 에너지 효율적 클러스터 헤드 선정 기법)

  • Nam, Choon-Sung;Jang, Kyung-Soo;Shin, Ho-Jin;Shin, Dong-Ryeol
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • 제10권2호
    • /
    • pp.25-30
    • /
    • 2010
  • Wireless sensor networks is composed of many similar sensor nodes with limited resources. They are randomly scattered over a specific area and self-organize the network. For guarantee of network life time, load balancing and scalability in sensor networks, sensor networks needs the clustering algorithm which distribute the networks to a local cluster. In existing clustering algorithms, the cluster head selection method has two problems. One is additional communication cost for finding location and energy of nodes. Another is unequal clustering. To solve them, this paper proposes a novel cluster head selection algorithm revised previous clustering algorithm, LEACH. The simulation results show that the energy compared with the previous clustering method is reduced.

An Efficient Clustering Scheme Considering Node Density in Wireless Sensor Networks (무선 센서 네트워크에서 노드 밀도를 고려한 효율적인 클러스터링 기법)

  • Kim, Chang-Hyeon;Lee, Won-Joo;Jeon, Chang-Ho
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • 제46권4호
    • /
    • pp.79-86
    • /
    • 2009
  • In this paper, we propose a new clustering scheme that provides optimal data aggregation effect and reduces energy consumption of nodes by considering the density of nodes when forming clusters. Since the size of the cluster is determined to ensure optimal data aggregation rate, our scheme reduces transmission range and minimizes interference between clusters. Moreover, by clustering using locally adjacent nodes and aggregating data received from cluster members, we reduce energy consumption of nodes. Through simulation, we confirmed that energy consumption of the whole network is minimized and the sensor network life-time is extended. Moreover, we show that the proposed clustering scheme improves the performance of network compared to previous LEACH clustering scheme.

Analytical Approach of New Random-walk Based Mobility Management Scheme in IP-based Mobile Networks

  • Song, Myungseok;Cho, Jun-Dong;Jeong, Jongpil
    • International Journal of Advanced Culture Technology
    • /
    • 제2권1호
    • /
    • pp.1-13
    • /
    • 2014
  • In next-generation wireless networks, provisioning of IP-based network architecture and seamless transmission services are very important issues for mobile nodes. For this reason, a mobility management mechanism to support global roaming is highly regarded. These technologies bring a broader life by using a global roaming account through the connection of multiple devices or technology to mobile users; they also provide real-time multimedia services. This paper presents a comprehensive performance analysis of fast handover for hierarchical mobile IPv6 (F-HMIPv6), hierarchical mobile IPv6 (HMIPv6), Proxy Mobile IPv6 (PMIPv6), and fast Proxy Mobile IPv6 (FPMIPv6) using the fluid-flow model and random-walk model. As a result, the location update cost of the PMIPv6 and FPMIPv6 is better than that of HMIPv6 and F-HMIPv6. These results suggest that the network-based mobility management technology is superior to the hierarchical mobility management technology in the mobility environment.

Link Budget Analysis of Communication System for Reliable WBAN (신뢰성있는 WBAN을 위한 통신 시스템의 링크 버짓 분석)

  • Roh, Jae-sung
    • Journal of Advanced Navigation Technology
    • /
    • 제23권6호
    • /
    • pp.584-588
    • /
    • 2019
  • Wireless body area network (WBAN) is a networking technology that enables early detection of abnormal health conditions, real-time medical monitoring, and telemedicine support systems. The internet of things (IoT) for healthcare, which has become an issue recently, is one of the most promising areas for improving the quality of human life. It must meet the high QoS requirements of the medical communication system like any other communication system. Therefore, the bit error rate (BER) threshold was chosen to accommodate the QoS requirements of the WBAN communication system. In this paper, we calculated BER performance of WBAN channel using IR-UWB PPM modulation and analyzed link budget and system margin of WBAN according to various system parameters.

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)
    • /
    • 제9권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.

Adaptation Experience and Social Support Network of Adolescent Cancer Survivors (청소년 암 생존자의 적응 경험과 사회적 지지망)

  • Cho, Eunji;Park, Eun Sook
    • Child Health Nursing Research
    • /
    • 제23권2호
    • /
    • pp.238-248
    • /
    • 2017
  • Purpose: The main purpose of this study was to explore the adaptation experience of adolescent cancer survivors during and after cancer treatment, and their perceived social support networks. Methods: This study was a qualitative descriptive study using the in-depth interview. Eight adolescent cancer survivors who were diagnosed with cancer between 11 to 18 years old participated in the study. Results: The adaptation experiences of adolescent cancer survivors over time were identified within five categories for during their treatment such as "being catapulted from one's life," "standing at the center of discomfort," "falling behind the line," "accepting the change," "being developed", and another five categories for after the treatment including "being shackled," "encountering the forgotten reality," "overcoming and emerging from the reality," "growing into adulthood," "entering into a new orbit." Participants reported the various members of their social support network and their roles during and after the treatment as well. Conclusion: While adolescent cancer survivors adjusted to their changing situations after the cancer diagnosis, their internalized adaptation, as well as perceived social support from their diverse surrounding network, played significant roles. These findings will become a valuable asset for developing age-appropriate nursing interventions to promote psychosocial adjustment of adolescents with cancer.

Super Cluster based Routing Protocol in Sensor Network

  • Noh Jae-hwan;Lee Byeong-jik;Kim Kyung-jun;Lee Ick-soo;Lee Suk-gyu;Han Ki-jun
    • Proceedings of the IEEK Conference
    • /
    • 대한전자공학회 2004년도 ICEIC The International Conference on Electronics Informations and Communications
    • /
    • pp.193-198
    • /
    • 2004
  • In variety of environments for applications, wireless sensor networks have received increasing attention in the recent few years. But, sensor nodes have many limitations including battery power and communication range. These networks require robust wireless communicant protocols that are energy efficient and provide low latency. In this paper, we propose new protocol as is defined SCP. The key idea of SCP is that only one node which is defined as a Super-Cluster Header sends the combined data to the BS. We evaluated the effectiveness of SCP through experiments which have several parameter violations. Simulation results shows that performance of SCP is through better than other legacy protocol within the framework of energy cost, life time of the sensor network and fair distribution of the energy consumption.

  • PDF

A Study on Efficient Routing Method with Location-based Clustering in Wireless Sensor Networks (무선센서네트워크에서의 위치기반 클러스터 구성을 통한 효율적인 라우팅 방안 연구)

  • Lim, Naeun;Joung, Jinoo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • 제15권6호
    • /
    • pp.103-108
    • /
    • 2015
  • Maintaining efficient energy consumption and elongating network lifetime are the key issues in wireless sensor networks. Existing routing protocols usually select the cluster heads based on the proximity to the sensor nodes. In this case the cluster heads can be placed farther to the base station, than the distance between the sensor nodes and the base station, which yields inefficient energy consumption. In this work we propose a novel algorithm that select the nodes in a cluster and the cluster heads based on the locations of related nodes. We verify that the proposed algorithm gives better performance in terms of network life time than existing solutions.