• Title/Summary/Keyword: node lifetime

Search Result 375, Processing Time 0.027 seconds

A Study of Optimal path Availability Clustering algorithm in Ad Hoc network (에드 혹 네트워크에서 최적 경로의 유효성 있는 클러스터링 알고리즘에 관한 연구)

  • Oh, Young-Jun;Lee, Kang-Whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.05a
    • /
    • pp.278-280
    • /
    • 2012
  • We are propose the position of the node context-awareness information and the validity of the head node in the path according to the clustering how to elect one of the energy efficiency ECOPS (Energy Conserving Optimal path Schedule) algorithm. Existing LEACH algorithm to elect the head node when the node's energy probability distribution function based on the management of the head node is optional cycle. However, in this case, the distance of the relay node status information including context-awareness parameters does not reflect. These factors are not suitable for the relay node or nodes are included in the probability distribution, if the head node selects occurs. In particular, to solve the problems from the LEACH-based hierarchical clustering algorithms, this study defines location with the status context information and the residual energy factor in choosing topology of the structure adjacent nodes. ECOPS algorithm that contextual information is contributed for head node selection in topology protocols. The proposed ECOPS algorithm has the head node replacement situations from the candidate head node in the optimal path and efficient energy conservation that is the path of the member nodes. The new head node election show as the entire node lifetime and network management technique improving the network lifetime and efficient management the simulation results.

  • PDF

Lifetime Improvement of Wireless Sensor Network using the Distribution of a Transmission Distance in the SEP (SEP에서 전송 거리 분배를 이용한 무선 센서 네트워크 수명 개선)

  • Lee, Chang-Hee;Lee, Jong-Yong
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.5
    • /
    • pp.133-138
    • /
    • 2015
  • In this paper, we propose a method for improving the lifetime of the sensor network SEP through the wireless sensor network divided into two spaces by reducing the transmission distance of the cluster head in the layer in the distance. With reference to the position information of the node, the base station divides the layer based on the midpoint of the nearest node and the furthest distance away from the base station node. And the cluster head in the outer layer far from the base station is transmitted the data to the base station via the cluster head in the inner layer base station to transmit data. That is, we are proposed the layered SEP by reducing the transmission distance of the cluster head in the outer layer for the energy consumption to a minimum. The proposed algorithm is verified by comparison with the existing SEP.

A Branch and Bound Algorithm to Find a Routing Tree Having Minimum Wiener Index in Sensor Networks with High Mobile Base Node (베이스 노드의 이동성이 큰 센서 네트워크 환경에서 최소 Wiener 수를 갖는 라우팅 트리를 위한 분기한정 알고리즘)

  • Kang, Seung-Ho;Kim, Ki-Young;Lee, Woo-Young;Song, Iick-Ho;Jung, Min-A;Lee, Seong-Ro
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.5A
    • /
    • pp.466-473
    • /
    • 2010
  • Several protocols which are based on tree topology to guarantee the important metrics such as energy efficiency in sensor networks have been proposed. However, studies on the effect of topologies in sensor networks, where base node has a high mobility, are very few. In this paper, we propose a minimum Wiener index tree as a suitable topology to the wireless sensor networks with high mobile base node. The minimum Wiener index spanning tree problem which aims to find a tree with minimum Wiener index from a given weighted graph was proved to be NP-hard. We designed a branch and bound algorithm for this problem. To evaluate the performance of proposed tree, the comparisons with minimum spanning tree in terms of transmission distance, energy consumption during one round, and network lifetime was performed by simulations. Our proposed tree outperformed in transmission distance and energy efficiency but underperformed in lifetime.

A study on RFID Middleware protocol for management of sensor node and network implementation in Ubiquitous environment (유비쿼터스 환경에서 센서 노드의 관리와 망 구성을 위한 RFID 미들웨어 프로토콜에 관한 연구)

  • Choi, Yong-Sik;Kim, Sung-Sun;Shin, Seung-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.3
    • /
    • pp.155-163
    • /
    • 2007
  • In this paper, Though sensors of Ubiquitous Middle-ware System based on RFID/USN can usually be reacted from six mouths to two years, they can be exhausted their power of storage battery only one day by communication rates and ranges. That is, the lifetime of sensor node is depended on how much spending power under wireless communication that can communicate its sensing data to its destination. Therefore, it is necessary that each sensor should be designed the Routing path to its destination, in order to remote collecting data. But, in order to improve lifetime of sensor node and modify inner setting, it is opposite to simple searching path method of sensor node by entering external commands. accordingly, 1:n sensor arrangement of n form command and data send-receive that is possible simulation do without interference other sensors and research to different sensor data analysis and conversion ways to convert Sensing data that accept from sensors to actuality information.

  • PDF

An Energy-based PEGASIS Protocol for Efficient Routing in Wireless Sensor Networks (WSN에서의 효율적 라우팅을 위한 에너지 기반 PEGASIS 프로토콜)

  • Hyun-Woo Do;Tae-Wook Kwon
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.19 no.5
    • /
    • pp.809-816
    • /
    • 2024
  • In a Wireless Sensor Network (WSN) environment, where numerous small sensors are arranged in a certain space to form a wireless network, each sensor has limited battery power. Therefore, the lifetime of each sensor node is directly related to the network's lifetime, necessitating efficient routing to maximize the network's lifespan. This study proposes a routing protocol based on PEGASIS, a representative energy-efficient routing protocol in WSN environments. The proposed protocol categorizes nodes into groups based on their distance from the sink node, forms multiple chains within each group, and selects the leader node for each group by comparing the remaining energy levels. The proposed method ensures that each group's leader node is the one with the highest energy within that group, which has been shown to increase the network's lifespan compared to the traditional PEGASIS method.

Prolonging Lifetime of the LEACH Based Wireless Sensor Network Using Energy Efficient Data Collection (에너지 효율적인 데이터 수집을 이용한 LEACH 기반 무전 센서 네트워크의 수명 연장)

  • Park, Ji-Won;Moh, Sang-Man;Chung, Il-Yong;Bae, Yong-Geun
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.3
    • /
    • pp.175-183
    • /
    • 2008
  • In wireless sensor networks with ad hoc networking capability, sensor nodes are battery operated and are usually disposable once deployed. As a result, each sensor node senses and communicates with limited energy and, thus, energy efficiency has been studied as a key design factor which determines lifetime of a wireless sensor network, and it is more improved recently by using so-called cross-layer optimization technique. In this paper, we propose and implement a new energy saving mechanism that reduces energy consumption during data collection by controlling transmission power at sensor nodes and then measure its performance in terms of lifetime improvement for the wireless sensor network platform ZigbeX. When every sensor node transmits sensed data to its clusterhead, it controls its transmission power down to as low level as communication is possible, resulting in energy saving. Each sensor node controls its transmission power based on RSSI(Received Signal Strength Indicator) of the packet received from its clusterhead. In other words, the sensor node can save energy by controlling its transmission power down to an appropriate level that its clusterhead safely receives the packet it transmits. According to the repetitive experiment of the proposed scheme on the ZigbeX platform using the packet analyzer developed by us, it is observed that the network lifetime is prolonged by up to 21.9% by saying energy during the data collection occupying most amount of network traffic.

Lifetime-based Clustering Communication Protocol for Wireless Sensor Networks (무선 센서 네트워크를 위한 잔여 수명 기반 클러스터링 통신 프로토콜)

  • Jang, Beakcheol
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.15 no.4
    • /
    • pp.2370-2375
    • /
    • 2014
  • Wireless sensor networks (WSNs) have a big potential for distributed sensing for large geographical area. The improvement of the lifetime of WSNs is the important research topic because it is considered to be difficult to change batteries of sensor nodes. Clustering communication protocols are energy-efficient because each sensor node can send its packet to the cluster head near from itself rather than the sink far from itself. In this paper, we present an energy-efficient clustering communication protocol, which chooses cluster heads based on the expected residual lifetime of each sensor node. Simulation results show that our proposed scheme increases average lifetimes of sensor nodes as much as 20% to 30% in terms of the traffic quantity and as much as 30% to 40% in terms of the scalability compared to the existing clustering communication protocol, LEACH.

An Energy Efficient Cluster Formation Algorithm for Wireless Sensor Networks (무선 센서 네트워크를 위한 에너지 효율적인 클러스터 구성 알고리즘)

  • Han, Uk-Pyo;Lee, Hee-Choon;Chung, Young-Jun
    • The KIPS Transactions:PartC
    • /
    • v.14C no.2
    • /
    • pp.185-190
    • /
    • 2007
  • The efficient node energy utilization is one of important performance factors in wireless sensor networks because sensor nodes operate with limited battery power. To extend the lifetime of the wireless sensor networks, maintaining balanced power consumption between sensor nodes is more important than reducing each energy consumption of the sensor node in the network. In this paper, we proposed a cluster formation algorithm to extend the lifetime of the networks and to maintain a balanced energy consumption of nodes. To obtain it, we add a tiny slot in a round frame, which enables to exchange the residual energy messages between the base station (BS). cluster heads, and nodes. The performance of the proposed protocol has been examined and evaluated with the NS 2 simulator. As a result of simulation, we have confirmed that our proposed algorithm show the better performance in terms of lifetime than LEACH. Consequently, our proposed protocol can effectively extend the network lifetime without other critical overhead and performance degradation.

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.

Energy Efficient Two-Tier Routing Protocol for Wireless Sensor Networks (센서 네트워크에서 에너지 효율성을 고려한 two-tier 라우팅 프로토콜)

  • Ahn Eun-Chul;Lee Sung-Hyup;Cho You-Ze
    • The KIPS Transactions:PartC
    • /
    • v.13C no.1 s.104
    • /
    • pp.103-112
    • /
    • 2006
  • Since sensor node has a limited energy supply in a wireless sensor network, it is very important to maximize the network lifetime through energy-efficient routing. Thus, many routing protocols have been developed for wireless sensor networks and can be classified into flat and hierarchical routing protocols. Recent researches focus on hierarchical routing scheme and LEACH is a representative hierarchical routing protocol. In this paper, we investigated the problems of the LEACH and proposed a novel energy efficient routing scheme, called ENTER(ENergy efficient Two-tiEr Routing protocol), to resolve the problem. ENTER reduces an energy consumption and increases a network lifetime by organizing clusters by the same distributed algerian as in the LEACH and establishing paths among cluster-heads to transmit the aggregated data to the sink node. We compared the performance of the ENTER with the LEACH through simulation and showed that the ENTER could enhance the network lifetime by utilizing the resources more efficiently.