• Title/Summary/Keyword: Route Lifetime

Search Result 76, Processing Time 0.024 seconds

Localized Path Selection Algorithm for Energy Efficiency and Prolonging Lifetime in Ad-Hoc Networks (에드 혹 네트워크에서 에너지 효율성과 네트워크 수명 연장을 위한 지역적 경로 선택 알고리즘)

  • Lee, Ju-Young
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.6
    • /
    • pp.65-72
    • /
    • 2010
  • In ad-hoc network, the technique to efficiently consume the limited amounts of energy is an important issue since the wireless terminal node is operated on batteries as their energy resource. In order to extend the system lifetime, through a balanced energy consumption, we must delay the situation in which a particular terminal node's energy is depleted and results in system disconnection. Also, the link, which has low reliability due to the mobility of the node, should be avoided considering the key element when setting up the route. The proposed CMLR method in this paper enables to increase the efficiency of energy consumption with a new cost function considering the residue energy of node, error rate of link, and transmission energy consumption. This method is extending the network lifetime and increasing the energy efficiency by compromising the value between the minimization of the transmission energy consumption and maximization of the node's lifetime. Through the simulations the proposed CMLR algorithm was verified by showing better performance over the conventional methods in terms of network lifetime and path efficiency.

Dynamic Clustering Based on Location in Wireless Sensor Networks with Skew Distribution

  • Kim, Kyung-Jun;Kim, Jung-Gyu
    • Proceedings of the Korea Society of Information Technology Applications Conference
    • /
    • 2005.11a
    • /
    • pp.27-30
    • /
    • 2005
  • Because of unreplenishable power resources, reducing node energy consumption to extend network lifetime is an important requirement in wireless sensor networks. In addition both path length and path cost are important metrics affecting sensor lifetime. We propose a dynamic clustering scheme based on location in wireless sensor networks. Our scheme can localize the effects of route failures, reduce control traffic overhead, and thus enhance the reachability to the destination. We have evaluated the performance of our clustering scheme through a simulation and analysis. We provide simulation results showing a good performance in terms of approximation ratios.

  • PDF

Routing Protocol based on Connectivity Degree and Energy Weight (연결도와 에너지 가중치 기반의 라우팅 프로토콜)

  • Jeong, Yoon-Su
    • Journal of Convergence Society for SMB
    • /
    • v.4 no.1
    • /
    • pp.7-15
    • /
    • 2014
  • In this paper, we propose an efficient routing protocol to achieve an optimal route searching process of the network lifetime by balancing power consumption per node. The proposed protocols aim at finding energy-efficient paths at low protocol power. In our protocol, each intermediate node keeps power level and branch number of child nodes and it transmits the data the nearest neighbor node. Our protocol may minimize the energy consumption at each node, thus prolong the lifetime of the system regardless of the location of the sink outside or inside the cluster. In the proposed protocol for inter-cluster communication, a cluster head chooses a relay node from its adjacent cluster heads according to the node's residual energy and its distance to the base station. Simulation results show that proposed protocol successfully balances the energy consumption over the network, and achieves a remarkable network lifetime improvement as highly as 7.5%.

  • PDF

Design and Implementation of Flooding based Energy-Efficiency Routing Protocol for Wireless Sensor Network (무선 센서네트워크에서 에너지 효율을 고려한 단층기반 라우팅 프로토콜의 설계와 구현)

  • Lee, Myung-Sub;Park, Chang-Hyeon
    • The KIPS Transactions:PartC
    • /
    • v.17C no.4
    • /
    • pp.371-378
    • /
    • 2010
  • In this paper, we propose a new energy-efficient routing algorithm for sensor networks that selects a least energy consuming path among the paths formed by node with highest remaining energy and provides long network lifetime and uniform energy consumption by nodes. The pair distribution of the energy consumption over all the possible routes to the base station is one of the design objectives. Also, an alternate route search mechanism is proposed to cope with the situation in which no routing information is available due to lack of remaining energy of the neighboring nodes. Simulation results show that our algorithm extends the network lifetime and enhances the network reliability by maintaining relatively uniform remaining energy distribution among sensor nodes.

An Efficient Energy Charging Scheme for Wireless Sensor Networks Using a Mobile Sink Capable of Wireless Power Transmission

  • Park, Kyoung nam;Yoon, Ikjune
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.5
    • /
    • pp.1-9
    • /
    • 2019
  • In this paper, we propose the algorithms which determine 1) the efficient anchor-node visiting route of mobile sink in terms of energy supply and 2) the efficient energy amount to be charged to each anchor node, by using the information of each anchor node and the mobile sink. Wireless sensor networks (WSNs) using mobile sinks can be deployed in more challenging environments such as those that are isolated or dangerous, and can also achieve a balanced energy consumption among sensors which leads to prolong the network lifetime. Most mobile sinks visit only some anchor nodes which store the data collected by the nearby sensor nodes because of their limited energy. The problem of these schemes is that the lifetime of the anchor nodes can be shorten due to the increased energy consumption, which rapidly reduces the overall lifetime of WSN. This study utilizes a mobile sink capable of wireless power transmission to solve this problem, so a mobile sink can gather data from anchor nodes while charging energy to them. Through the performance verification, it is confirmed that the number of blackout nodes and the amount of collected data are greatly improved regardless of the size of the network.

Routing Protocol for Wireless Sensor Networks Based on Virtual Force Disturbing Mobile Sink Node

  • Yao, Yindi;Xie, Dangyuan;Wang, Chen;Li, Ying;Li, Yangli
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.4
    • /
    • pp.1187-1208
    • /
    • 2022
  • One of the main goals of wireless sensor networks (WSNs) is to utilize the energy of sensor nodes effectively and maximize the network lifetime. Thus, this paper proposed a routing protocol for WSNs based on virtual force disturbing mobile Sink node (VFMSR). According to the number of sensor nodes in the cluster, the average energy and the centroid factor of the cluster, a new cluster head (CH) election fitness function was designed. At the same time, a hexagonal fixed-point moving trajectory model with the best radius was constructed, and the virtual force was introduced to interfere with it, so as to avoid the frequent propagation of sink node position information, and reduce the energy consumption of CH. Combined with the improved ant colony algorithm (ACA), the shortest transmission path to Sink node was constructed to reduce the energy consumption of long-distance data transmission of CHs. The simulation results showed that, compared with LEACH, EIP-LEACH, ANT-LEACH and MECA protocols, VFMSR protocol was superior to the existing routing protocols in terms of network energy consumption and network lifetime, and compared with LEACH protocol, the network lifetime was increased by more than three times.

A Study on Alternative Paths for Spread of Traffic (교통량 분산을 위한 대체경로 연구)

  • 서기성
    • Journal of the Korea Society for Simulation
    • /
    • v.6 no.1
    • /
    • pp.97-108
    • /
    • 1997
  • For the purpose of decreasing economic loss from the traffic jam, a car route guidance system efficiently utilizing the existing roads has attracted a great deal of attention. In this paper, the search algorithm for optimal path and alternative paths, which is the main function of a car route guidance system, was presented using evolution program. Search efficiency was promoted by changing the population size of path individuals in each generation, applying the concept of age and lifetime to path individuals. Through simulation on the virtual road-traffic network consisting of 100 nodes with various turn constraints and traffic volumes, not only the optimal path with the minimal cost was obtained, avoiding turn constraints and traffic congestion, but also alternative paths with similar costs and acceptable difference was acquired, compared with optimal path.

  • PDF

An Energy Efficient Explicit Disjoint Multipath Routing in Wireless Sensor Networks (무선 센서 네트워크에서 에너지 효율적인 명시적 분리형 다중경로 라우팅 방법)

  • Oh, Hyun-Woo;Jang, Jong-Hyun;Moon, Kyeong-Deok;Kim, Sang-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.12A
    • /
    • pp.1160-1170
    • /
    • 2010
  • Existing multipath routing mechanism has much overhead to maintain the state of nodes on the multipath route and does not guarantees completely disjoint multipath construction from source to destination. In this paper, we propose an Explicit Disjoint Multipath (EDM) routing algorithm to enhance energy efficiency through removing the flooding mechanism for route discovery process, minimizing the number of nodes participating in route update and balancing the traffic load for entire network. EDM constructs logical pipelines which can create disjoint multipaths in logical way. Then it physically performs anchor node based geographic routing along the logical pipeline in order to build multipath to the destination. EDM can provide the distribution effect of traffic load over the network, help to balance the energy consumption and therefore extend the network lifetime.

A Routing Protocol for Network Lifetime Extension in MANET (MANET에서 네트워크 수명 연장을 위한 라우팅 프로토콜)

  • Kim, Kyoung-Ja;Han, Sang-Hoon;Koo, Hyun-Woo
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.2
    • /
    • pp.120-129
    • /
    • 2010
  • MANET(Mobile Ad Hoc NETwork) is a collection of mobile nodes that are free to move and organize themselves in an arbitrary manner without any fixed infrastructures. These mobile nodes are connected by wireless links and act as routers for all other nodes in the network. As a router each node in MANET consumes its batteries when forwarding a message, and the selection of the best path to minimize the total power needed to route packets is needed to maximize the lifetime of all nodes. In this paper, we propose a routing protocol considering the remaining battery capacity of nodes in the routing paths. The proposed scheme prevents the battery of each node from being overused and increases the lifetime of the network.

Geographic and Energy Aware Geocasting in Ad-Hoc Networks (Ad-Hoc 네트워크에서 위치와 에너지를 고려한 지오캐스팅 알고리즘)

  • Lee Ju-Young
    • Journal of Internet Computing and Services
    • /
    • v.5 no.2
    • /
    • pp.75-84
    • /
    • 2004
  • Geocasting, a variant of the conventional multicasting problem, is one of communication type in which the data packets are delivered to a group of all nodes within a specified geographical region (i.e., the geocasting region) and is called location-based multicasting(LBM)(l). An Ad-hoc network is a dynamically reconfigurable and temporary wireless network where all mobile devices using batteries as energy resources cooperatively maintain network connectivity without central administration or the assistance of base stations. Consequently, the technique to efficiently consume the limited amounts of energy resources is an important problem so that the system lifetime is maximized. In this paper, we propose a LBPA(Location-Based Power Aware) geocasting algorithm that selects energy-aware neighbor to route a packet towards the target region In Ad-hoc network environments. The method Is such that the energy consumption is balanced among the nodes in proportion to their energy reserves. Through the simulations, the proposed LBPA algorithm shows better results, that is, as good as 40% on the average over the conventional LBM algorithm in terms of the network lifetime.

  • PDF