• 제목/요약/키워드: Node Energy

Search Result 1,276, Processing Time 0.023 seconds

An Energy and Delay Efficient Hybrid MAC Protocol for Multi-Hop Wireless Sensor Networks (멀티 홉 무선센서네트워크에서 에너지와 지연에 효율적인 하이브리드 MAC 프로토콜)

  • Jeon, Jun-Heon;Kim, Seong-Cheol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.2
    • /
    • pp.471-476
    • /
    • 2015
  • In this paper, we propose an energy efficient hybrid MAC protocol for multi-hop wireless sensor networks. The proposed MAC protocol used a hybrid mechanism, in which contention-based MAC protocol and contention free MAC protocol are combined. The sensor nodes located far from the sink node usually send few data packet since they try to send measured data by themselves. So contention-based MAC protocol is useful among them. But other nodes located near sink node usually have lots of data packets since they plays as a relay node. Contention-based MAC protocol among them is not suitable. Using contention-based MAC protocol in heavy data traffic environment, packet collisions and transmission delay may increase. In this paper, slot assignment between sender nodes by sink node is used. The proposed mechanism is efficient in energy and latency. Results showed that our MAC protocol outperformed other protocol in terms of data packet delivery delay and energy consumption.

An Adaptive Routing Protocol with a Balanced Energy Consumption For Wireless Ad-hoc Networks (애드혹 네트워크에서 에너지 소비 균형을 고려한 적응형 라우팅 프로토콜)

  • Kim, Yong-Hyun;Hong, Youn-Sik
    • The KIPS Transactions:PartC
    • /
    • v.15C no.4
    • /
    • pp.303-310
    • /
    • 2008
  • To increase the lifetime of ad-hoc networks, a ratio of energy consumption for each node should be kept constant by equally distributing network traffic loads into all of the nodes. In this paper, we propose a modified AODV routing protocol to determine a possible route by considering a remaining battery capacity of a node and the degree of its usage. In addition, to reduce the amount of energy consumption during the path rediscovery process due to the huge amount of the AODV control messages the limited number of possible routes are stored into a routing table of a source node. When some links of a route fail, another possible path can be looked up in the table before the route discovery process should be initiated. We have tested our proposed method with a conventional AODV and a MMBCR method which is one of the power-efficient energy routing protocols based on the three performance metrics, i.e., the total remaining battery capacity, network lifetime and the ratio of data packets received by the destination node to compare their performance.

Dynamic Single Path Routing Mechanism for Reliability and Energy-Efficiency in a Multi Hop Sensor Network (다중 홉 센서 네트워크에서 신뢰성과 에너지 효율성을 고려한 동적 단일경로 설정기법)

  • Choi, Seong-Yong;Kim, Jin-Su;Jung, Kyung-Yong;Han, Seung-Jin;Choi, Jun-Hyeog;Rim, Kee-Wook;Lee, Jung-Hyun
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.9
    • /
    • pp.31-40
    • /
    • 2009
  • What are important in wireless sensor networks are reliable data transmission, energy efficiency of each node, and the maximization of network life through the distribution of load among the nodes. The present study proposed DSPR, a dynamic unique path routing machanism that considered these requirements in wireless sensor networks. In DSPR, data is transmitted through a dynamic unique path, which has the least cost calculated with the number of hops from each node to the sink, and the average remaining energy. At that time, each node monitors its transmission process and if a node detects route damage it changes the route dynamically, referring to the cost table, and by doing so, it enhances the reliability of the network and distributes energy consumption evenly among the nodes. In addition, when the network topology is changed, only the part related to the change is restructured dynamically instead of restructuring the entire network, and the life of the network is extended by inhibiting unnecessary energy consumption in each node as much as possible. In the results of our experiment, the proposed DSPR increased network life by minimizing energy consumption of the nodes and improved the reliability and energy efficiency of the network.

Performance Comparison and Analysis of Non-Coherent Cooperative Relays for Wireless Sensor Networks (무선 센서네트워크에서 비 위상동기 협동 릴레이 특성의 비교분석)

  • Kwon, Eun-Mi;Kim, Jeong-Ho
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.49 no.5
    • /
    • pp.72-76
    • /
    • 2012
  • In this paper, the capacity criteria have been proposed in order to select a cooperative relay node in WSNs, under the environment where direct path has a poor link gain. This process may ensure the efficiency improvement of signal transfer between source and destination and reduction of energy consumption as well. Two criteria are incorporated to select a cooperative relay node. Firstly, calculate the energy gain ratio between the relay path and the direct path. Secondly, investigate the effects of relay node's usage in WSNs through the simulation in terms of energy consumption. In the simulation, the relationship between energy consumption and direct path gain, uniformly generated in the certain range and its positive effects have been identified.

A Time Tree Scheduling Scheme for Energy Efficiency and Collision Avoidance in Sensor Networks (센서 네트워크에서 에너지 효율과 충돌 회피를 위한 타임 트리 스케줄링)

  • Lee, Kil-Hung
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.7
    • /
    • pp.962-970
    • /
    • 2009
  • This paper presents a data gathering and scheduling scheme for wireless sensor networks. We use a data gathering tree for sending the data from the sensor node to the base station. For an energy efficient operation of the sensor networks in a distributed manner, a time tree is built in order to reduce the collision probability and to minimize the total energy required to send data to the base station. A time tree is a data gathering tree where the base station is the root and each sensor node is either a relaying or a leaf node of the tree. Each tree operates in a different time schedule with possible different activation rate. Through the simulation, we found that the proposed scheme that uses time trees shows better characteristics in energy and data arrival rate when compared with other schemes such as SMAC and DMAC.

  • PDF

A Multi-Level Routing Protocol Based on Fixed Radio Wave Radius in Wireless Sensor Network (무선센서네트워크에서 전파범위를 기반으로 한 다단계 라우팅 프로토콜)

  • Jin, Shi-Mei;Li, Yong-Zhen;Rhee, Chung-Sei
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.8B
    • /
    • pp.630-635
    • /
    • 2008
  • Recently, in order to improve the energy efficiency of WSN(Wireless Sensor Network), widely research have teen carried on. But, up to the present, Majority of methods are based on direct communication between CH(cluster head) and sink node, and based on the assumption that node can regulate signal energy actively according to the distance between nodes. So it's hard to implement those methods. Based on the theory that node has fixed radio wave radius, this paper present a multi leveling routing protocol. According to the simulation of the presented protocol, we have proved the energy saving efficiency and the implementation in real WSN.

Novel Packet Switching for Green IP Networks

  • Jo, Seng-Kyoun;Kim, Young-Min;Lee, Hyun-Woo;Kangasharju, Jussi;Mulhauser, Max
    • ETRI Journal
    • /
    • v.39 no.2
    • /
    • pp.275-283
    • /
    • 2017
  • A green technology for reducing energy consumption has become a critical factor in ICT industries. However, for the telecommunications sector in particular, most network elements are not usually optimized for power efficiency. Here, we propose a novel energy-efficient packet switching method for use in an IP network for reducing unnecessary energy consumption. As a green networking approach, we first classify the network nodes into either header or member nodes. The member nodes then put the routing-related module at layer 3 to sleep under the assumption that the layer in the OSI model can operate independently. The entire set of network nodes is then partitioned into clusters consisting of one header node and multiple member nodes. Then, only the header node in a cluster conducts IP routing and its member nodes conduct packet switching using a specially designed identifier, a tag. To investigate the impact of the proposed scheme, we conducted a number of simulations using well-known real network topologies and achieved a more energy- efficient performance than that achieved in previous studies.

Efficient Energy and Position Aware Routing Protocol for Wireless Sensor Networks

  • Shivalingagowda, Chaya;Jayasree, P.V.Y;Sah, Dinesh.K.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.5
    • /
    • pp.1929-1950
    • /
    • 2020
  • Reliable and secure data transmission in the application environment assisted by the wireless sensor network is one of the major challenges. Problem like blind forwarding and data inaccessibility affect the efficiency of overall infrastructure performance. This paper proposes routing protocol for forwarding and error recovery during packet loss. The same is achieved by energy and hops distance-based formulation of the routing mechanism. The reachability of the intermediate node to the source node is the major factor that helps in improving the lifetime of the network. On the other hand, intelligent hop selection increases the reliability over continuous data transmission. The number of hop count is factor of hop weight and available energy of the node. The comparison over the previous state of the art using QualNet-7.4 network simulator shows the effectiveness of proposed work in terms of overall energy conservation of network and reliable data delivery. The simulation results also show the elimination of blind forwarding and data inaccessibility.

Current Conservation Factors for Consistent One-Dimensional Neutronics Modeling

  • Lee, Kibog;Joo, Han-Gyu;Cho, Byung-Oh;Zee, Sung-Quun
    • Nuclear Engineering and Technology
    • /
    • v.32 no.3
    • /
    • pp.235-243
    • /
    • 2000
  • A one-dimensional neutronics formulation is established within the framework of the nonlinear analytic nodal method such that it can result in consistent one-dimensional models that produce the same axial information as their corresponding reference three-dimension81 models. Consistency is achieved by conserving axial interface currents as well as the planar reaction rates of the three-dimensional case. For current conservation, flux discontinuity is introduced in the solution of the two-node problem. The degree of discontinuity, named the current conservation factor, is determined such that the surface averaged axial current of the reference three-dimensional case can be retrieved from the two-node calculation involving the radially collapsed group constants and the discontinuity factor. The current conservation factors are derived from the analytic nodal method and various core configurations are analyzed to show that the errors in K-eff and power distributions can be reduced by a order of magnitude by the use of the current conservation factor with no significant computational overhead.

  • PDF

A Sensing Resolution-based Grouping Communication Protocol for Wireless Sensor Networks (무선 센서 네트워크에서 센싱 정밀도에 기반 한 그룹화 통신 프로토콜)

  • Jeong Soon-Gyu;Li Poyuan;Yoo Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.2B
    • /
    • pp.107-116
    • /
    • 2006
  • In this paper, we propose a Sensing Resolution-based Grouping(SRG) protocol for wireless sensor networks. SRG is intended for meeting the application's sensing objectives, where sensor nodes are densely deployed and have the determinate accuracy requirement. The primary contribution of this paper is active group header node selection and round-robin procedure, which increase the sensing accuracy and evenly distribute the node energy consumption. The second contribution is use of energy efficient intermediate node selection by considering group size and energy consumption. We present the design principle of SRG and provide simulation results.