• Title/Summary/Keyword: Path lifetime

Search Result 130, Processing Time 0.02 seconds

An Energy Effective Protocol for Clustering Ad Hoc Network

  • Lee, Kang-Whan;Chen, Yun
    • Journal of information and communication convergence engineering
    • /
    • v.6 no.2
    • /
    • pp.117-121
    • /
    • 2008
  • In ad hoc network, the scarce energy management of the mobile devices has become a critical issue in order to extend the network lifetime. Therefore, the energy consumption is important in the routing design, otherwise cluster schemes are efficient in energy conserving. For the above reasons, an Energy conserving Context aware Clustering algorithm (ECC) is proposed to establish the network clustering structure, and a routing algorithm is introduced to choose the Optimal Energy Routing Protocol (OERP) path in this paper. Because in ad hoc network, the topology, nodes residual energy and energy consuming rate are dynamic changing. The network system should react continuously and rapidly to the changing conditions, and make corresponding action according different conditions. So we use the context aware computing to actualize the cluster head node, the routing path choosing. In this paper, we consider a novel routing protocol using the cluster schemes to find the optimal energy routing path based on a special topology structure of Resilient Ontology Multicasting Routing Protocol (RODMRP). The RODMRP is one of the hierarchical ad hoc network structure which combines the advantage of the tree based and the mesh based network. This scheme divides the nodes in different level found on the node energy condition, and the clustering is established based on the levels. This protocol considered the residual energy of the nodes and the total consuming energy ratio on the routing path to get the energy efficiently routing. The proposed networks scheme could get better improve the awareness for data to achieve and performance on their clustering establishment and messages transmission. Also, by using the context aware computing, according to the condition and the rules defined, the sensor nodes could adjust their behaviors correspondingly to improve the network routing.

A Robust Energy Saving Data Dissemination Protocol for IoT-WSNs

  • Kim, Moonseong;Park, Sooyeon;Lee, Woochan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.12
    • /
    • pp.5744-5764
    • /
    • 2018
  • In Wireless Sensor Networks (WSNs) for Internet of Things (IoT) environment, fault tolerance is a most fundamental issue due to strict energy constraint of sensor node. In this paper, a robust energy saving data dissemination protocol for IoT-WSNs is proposed. Minimized energy consumption and dissemination delay time based on signal strength play an important role in our scheme. The representative dissemination protocol SPIN (Sensor Protocols for Information via Negotiation) overcomes overlapped data problem of the classical Flooding scheme. However, SPIN never considers distance between nodes, thus the issue of dissemination energy consumption is becoming more important problem. In order to minimize the energy consumption, the shortest path between sensors should be considered to disseminate the data through the entire IoT-WSNs. SPMS (Shortest Path Mined SPIN) scheme creates routing tables using Bellman Ford method and forwards data through a multi-hop manner to optimize power consumption and delay time. Due to these properties, it is very hard to avoid heavy traffic when routing information is updated. Additionally, a node failure of SPMS would be caused by frequently using some sensors on the shortest path, thus network lifetime might be shortened quickly. In contrast, our scheme is resilient to these failures because it employs energy aware concept. The dissemination delay time of the proposed protocol without a routing table is similar to that of shortest path-based SPMS. In addition, our protocol does not require routing table, which needs a lot of control packets, thus it prevents excessive control message generation. Finally, the proposed scheme outperforms previous schemes in terms of data transmission success ratio, therefore our protocol could be appropriate for IoT-WSNs environment.

Estimation of Time-dependent Damage Paths of Armors of Rubble-mound Breakwaters using Stochastic Processes (추계학적 확률과정을 이용한 경사제 피복재의 시간에 따른 피해 경로 추정)

  • Lee, Cheol-Eung
    • Journal of Korean Society of Coastal and Ocean Engineers
    • /
    • v.27 no.4
    • /
    • pp.246-257
    • /
    • 2015
  • The progressive degradation paths of structures have quantitatively been tracked by using stochastic processes, such as Wiener process, gamma process and compound Poisson process, in order to consider both the sampling uncertainty due to the usual lack of damage data and the temporal uncertainty associated with the deterioration evolution. Several important features of stochastic processes which should carefully be considered in application of the stochastic processes to practical problems have been figured out through assessing cumulative damage and lifetime distribution as a function of time. Especially, the Wiener process and the gamma process have straightforwardly been applied to armors of rubble-mound breakwaters by the aid of a sample path method based on Melby's formula which can estimate cumulative damage levels of armors over time. The sample path method have been developed to calibrate the related-parameters required in the stochastic modelling of armors of rubble-mound breakwaters. From the analyses, it is found that cumulative damage levels of armors have surely been saturated with time. Also, the exponent of power law in time, that plays a significant role in predicting the cumulative damage levels over time, can easily be determined, which makes the stochastic models possible to track the cumulative damage levels of armors of rubble-mound breakwaters over time. Finally, failure probabilities with respect to various critical limits have been analyzed throughout its anticipated service life.

Multipath Routing Method for QoS Support in WMSNs (WMSN에서 QoS 지원을 위한 다중 경로 라우팅 기법)

  • Bae, Si-Yeong;Lee, Sung-Keun;Park, Kyoung-Wook
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.8 no.3
    • /
    • pp.453-458
    • /
    • 2013
  • Aside from the issues like energy saving and maximizing network lifetime. WMSN has another issue to deal with: support of quality of service(QoS) which is required especially for handling real-time data such as object tracking and data gathering. This paper proposes a multipath routing algorithm considering the distance to sink node, energy level and link quality of neighbour nodes. Proposed algorithm supports multipath routing path with high quality links. Hence it helps to reduce a power consumption concentration that happens in particular set of nodes along the frequently selected route. It also specifies a service quality pattern and a service quality level depending on traffic pattern. By doing this, the proposed algorithm can realize a differentiated service with QoS guaranteed data transmission.

Cluster-Based Mobile Sink Location Management Scheme for Solar-Powered Wireless Sensor Networks

  • Oh, Eomji;Kang, Minjae;Yoon, Ikjune;Noh, Dong Kun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.22 no.9
    • /
    • pp.33-40
    • /
    • 2017
  • In this paper, we propose a sink-location management and data-routing scheme to effectively support the mobile sink in solar-powered WSN. Battery-based wireless sensor networks (WSNs) have a limited lifetime due to their limited energy, but solar energy-based WSNs can be supplied with energy periodically and can operate forever. On the other hand, introduction of mobile sink in WSNs can solve some energy unbalance problem between sink-neighboring nodes and outer nodes which is one of the major challenges in WSNs. However, there is a problem that additional energy should be consumed to notify each sensor node of the location of the randomly moving mobile sink. In the proposed scheme, one of the nodes that harvests enough energy in each cluster are selected as the cluster head, and the location information of the mobile sink is shared only among the cluster heads, thereby reducing the location management overhead. In addition, the overhead for setting the routing path can be removed by transferring data in the opposite direction to the path where the sink-position information is transferred among the heads. Lastly, the access node is introduced to transmit data to the sink more reliably when the sink moves frequently.

Sensor Network Routing using Data Aggregation (데이터 병합을 이용한 센서 네트워크 라우팅)

  • Kim, Young-Kyun
    • Journal of the Korea Computer Industry Society
    • /
    • v.8 no.4
    • /
    • pp.237-244
    • /
    • 2007
  • In this paper we investigate the benefits of a data aggregation to prolong the lifetime of wireless sensor networks. To reduce the overload of messages from source node to sink node, data aggregation technique is generally used at intermediate node in path. The DD-G(Directed Diffusion-Greedy) can diminish the consumption of node energy by establishing energy effective single path from source to destination. In this case, the nodes near sink node have some problems, i) overly concentration of energy consumption, ii) increase of message delay time. To solve these problems, we propose a new data aggregation method which consider distribution of network overload, especially at the nodes close to sink node. The result shows that it can save energy and network delay time.

  • PDF

Characteristics of High Speed Optical Transmitter Module Fabricated by Using Laser welding Technique (레이저웰딩기술을 이용한 고속 광통신용 송신모듈 제작 및 특성 연구)

  • Kang, Seung-Goo;Song, Min-Kyu;Jang, Dong-Hoon;Pyun, Kwang-Eui
    • Proceedings of the KIEE Conference
    • /
    • 1995.11a
    • /
    • pp.552-554
    • /
    • 1995
  • In long-haul high speed optical communications, the distance between a transmitter and a receiver depends on the amount of light coupled to a single mode optical fiber from the laser diode(LD) as well as the LD characteristic itself. And the transmitter module must have long lifetime. high reliability, and even simple structure. Such points have induced laser welding technique to be a first choice in opto-electronic module packaging because it can provide strong weld joint in a short time with very small coupling loss. In this paper, packaging considerations and characteristics for high speed LD modules are discussed. They include optical path design factors for larger aligning tolerance, and novel laser welding processes for component assembly. For low coupling loss after laser welding processes, the optical path for optimum coupling of a single mode optical fiber into the LD chip was designed with the GRIN lens system providing sufficiently large aligning tolerance both in the radial and axial directions. The measured sensitivity of the LD module was better than -33.7dBm(back to back) at a BER of $10^{-10}$ with a 2.5Gbps NRZ $2^{23}-1$ PRBS.

  • PDF

Packet-Level Scheduling for Implant Communications Using Forward Error Correction in an Erasure Correction Mode for Reliable U-Healthcare Service

  • Lee, Ki-Dong;Kim, Sang-G.;Yi, Byung-K.
    • Journal of Communications and Networks
    • /
    • v.13 no.2
    • /
    • pp.160-166
    • /
    • 2011
  • In u-healthcare services based on wireless body sensor networks, reliable connection is very important as many types of information, including vital signals, are transmitted through the networks. The transmit power requirements are very stringent in the case of in-body networks for implant communication. Furthermore, the wireless link in an in-body environment has a high degree of path loss (e.g., the path loss exponent is around 6.2 for deep tissue). Because of such inherently bad settings of the communication nodes, a multi-hop network topology is preferred in order to meet the transmit power requirements and to increase the battery lifetime of sensor nodes. This will ensure that the live body of a patient receiving the healthcare service has a reduced level of specific absorption ratio (SAR) when exposed to long-lasting radiation. We propose an efficientmethod for delivering delay-intolerant data packets over multiple hops. We consider forward error correction (FEC) in an erasure correction mode and develop a mathematical formulation for packet-level scheduling of delay-intolerant FEC packets over multiple hops. The proposed method can be used as a simple guideline for applications to setting up a topology for a medical body sensor network of each individual patient, which is connected to a remote server for u-healthcare service applications.

A Method for Constructing Multi-Hop Routing Tree among Cluster Heads in Wireless Sensor Networks (무선 센서 네트워크에서 클러스터 헤드의 멀티 홉 라우팅 트리 구성)

  • Choi, Hyekyeong;Kang, Sang Hyuk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.11
    • /
    • pp.763-770
    • /
    • 2014
  • In traditional routing protocols including LEACH for wireless sensor networks, nodes suffer from unbalanced energy consumption because the nodes require large transmission energy as the distance to the sink node increase. Multi-hop based routing protocols have been studied to address this problem. In existing protocols, each cluster head usually chooses the closest head as a relay node. We propose LEACH-CHT, in which cluster heads choose the path with least energy consumption to send data to the sink node. In our research, each hop, a cluster head selects the least cost path to the sink node. This method solves the looping problem efficiently as well as make it possible that a cluster head excludes other cluster heads placed farther than its location from the path, without additional energy consumption. By balancing the energy consumption among the nodes, our proposed scheme outperforms existing multi-hop schemes by up to 36% in terms of average network lifetime.

An Energy Efficient Routing Protocol using MAC-layer resources in Mobile Ad Hoc Networks (이동 애드혹 네트워크에서 MAC 계층 자원을 이용한 에너지 효율 라우팅 프로토콜)

  • Yoo, Dae-Hun;Choi, Woong-Chul
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.6
    • /
    • pp.219-228
    • /
    • 2007
  • End-to-end path setup and maintenance are very important for mobile ad-hoc wireless communications, because of the mobility and the limited battery capacity of the nodes in the networks. the AODV routing protocol is the one of mary proposed protocols. However, there are route failure problem with the Proposed protocols between intermediate nodes due to such mobility and exhausted battery characteristics, and this is because only the shortest hop count is considered for the route setup. If route failure happens. Problem such as the waste of bandwidth and the increment of the energy consumption occur because of the discarding data packets in the intermediate nodes and the path re-setup process required by the source node. In addition, it obviously causes the network lifetime to be shortened. This paper proposes a routing protocol based on the AODV routing protocol that it makes use of the remaining energy, signal strength and SNR of the MAC layer resources to setup a path.

  • PDF