• ETRI Journal
• /
• v.36 no.2
• /
• pp.313-316
• /
• 2014

Energy consumption is an important issue in body area networks (BANs). In this letter, we propose an energy efficient transmission power control scheme for IEEE 802.15.6 BANs, which can improve energy efficiency by adaptively adjusting the transmit power in an on-demand way to adapt to varying channel environments. Simulations are performed to evaluate the performance, and it is shown that the proposed power control scheme outperforms traditional ones in terms of energy efficiency without significant reliability degradation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.9B
• /
• pp.792-802
• /
• 2006

In this paper, we propose an energy-efficient proactive data dissemination protocol with relatively low delay to cope well with highly mobile sink environments in sensor networks. In order for a dissemination tree to continuously pursue a dynamic sink, we exploit two novel algorithms: forward sink advertisement and distributed fast recovery. In our protocol, the tree is shared with the other slave sinks so that we call it Dynamic Shared Tree (DST) protocol. DST can conserve considerable amount of energy despite maintaining robust connection from all sources to sinks, since tree maintenance of DST is accomplished by just distributed local exchanges. In addition, since the DST is a kindof sink-oriented tree, each source on the DST disseminates data with lower delay along the tree and it also facilitates in-network processing. Through simulations, it is shown that the presented DST is considerably energy-efficient, robust protocol with low delay compared to Directed Diffusion, TTDD, and SEAD, in highly mobile sink environment.

• Journal of information and communication convergence engineering
• /
• v.7 no.4
• /
• pp.475-479
• /
• 2009

In ad hoc network, the scarce energy management of the mobile devices has become a critical issue in order to extend the network lifetime. Current research activity for the Minimum Energy Multicast (MEM) problem has been focused on devising efficient centralized greedy algorithms for static ad hoc networks. In this paper, we consider mobile ad hoc networks(MANETs) that could provide the reliable monitoring and control of a variety of environments for remote place. Mobility of MANET would require the topology change frequently compared with a static network. To improve the routing protocol in MANET, energy efficient routing protocol would be required as well as considering the mobility would be needed. In this paper, we propose a new method, the CACH(Context-aware Clustering Hierarchy) algorithm, a hybrid and clustering-based protocol that could analyze the link cost from a source node to a destination node. The proposed analysis could help in defining the optimum depth of hierarchy architecture CACH utilize. The proposed CACH could use localized condition to enable adaptation and robustness for dynamic network topology protocol and this provide that our hierarchy to be resilient. As a result, our simulation results would show that CACH could find energy efficient depth of hierarchy of a cluster.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.3
• /
• pp.31-36
• /
• 2007

This paper proposes Co-MAC (Coexistence MAC), an energy efficient medium access control protocol designed for large-scale sensor networks. In Co-MAC protocol, an overall network is divided into independent subnets, and each subnet orthogonally operates on time line in a temporal fashion. The basic idea of Co-MAC is to evenly distribute sensor nodes in a certain geographic area based on subnets to minimize overhearing which means the reception of unnecessary data packets from neighboring nodes. In our simulation, it was observed that energy efficiency of Co-MAC outperforms conventional MAC protocols under the given conditions.

• International Journal of Advanced Culture Technology
• /
• v.1 no.2
• /
• pp.18-23
• /
• 2013

In this paper, we consider the problem of designing optimal sensing time and the minimization of energy consumption in the Cognitive radio Network. Trade-off between throughput and the sensing time are observed, and the equations are derived for the optimal choice of design variables. In this paper, we also look at the optimization problem involving all the design parameters together. The advantages of the proposed scheme for the spectrum sensing and access process are shown through simulation.

• Journal of electromagnetic engineering and science
• /
• v.9 no.3
• /
• pp.111-117
• /
• 2009

This paper presents an energy-efficient and bandwidth-efficient 2-1-1 relaying scheme in which a sensor node(SN) assists two others in their data transmission to a clusterhead in WSNs(Wireless Sensor Networks) using LEACH (Low-Energy Adaptive Clustering Hierarchy). We derive the closed-form BER expression of this scheme which is also a general BER one for the decode-and-forward cooperative protocol and prove that the proposed scheme performs the same as the conventional relaying scheme but obtains higher channel utilization efficiency. A variety of numerical results reveal the relaying can save the network energy up to 11 dB over single-hop transmission at BER of $10^{-3}$.

• Journal of Korea Multimedia Society
• /
• v.19 no.3
• /
• pp.573-584
• /
• 2016

Recent application range of sensor networks is becoming diverse. It means collected sensor data types are becoming diverse too. These sensor data have their own characteristics. Thus achieving energy efficiency, existing sensor network management policy consider their own characteristics. However, it is inefficient to apply the existing network management schemes for controlling such kind of data at the same time. Because, existing network management schemes considered one type of data only. Therefore, we propose a novel routing scheme that is able to efficient energy conservation through effective data controlling on multi-sensor application environment.

• Journal of Information Processing Systems
• /
• v.8 no.4
• /
• pp.589-602
• /
• 2012

With the increasing demand for real time applications in the Wireless Senor Network (WSN), real time critical events anticipate an efficient quality-of-service (QoS) based routing for data delivery from the network infrastructure. Designing such QoS based routing protocol to meet the reliability and delay guarantee of critical events while preserving the energy efficiency is a challenging task. Considerable research has been focused on developing robust energy efficient QoS based routing protocols. In this paper, we present the state of the research by summarizing the work on QoS based routing protocols that has already been published and by highlighting the QoS issues that are being addressed. The performance comparison of QoS based routing protocols such as SAR, MMSPEED, MCMP, MCBR, and EQSR has also been analyzed using ns-2 for various parameters.

• Journal of Internet Computing and Services
• /
• v.9 no.5
• /
• pp.131-140
• /
• 2008

In this paper, we present a data dissemination protocol that guarantees energy-efficient data transmission and maximizes network lifetime. SPMS that outperforms the well-known protocol SPIN uses the shortest path to minimize the energy consumption. However, since it repeatedly uses the same path, maximizing the network lifetime is impossible. In this paper, we propose a protocol for data dissemination called the protocol Considering Between Energy and Distance (ConBED). It solves the network lifetime problem using the residual energy and the distance between nodes to determine a path for data dissemination. The simulation results show that ConBED guarantees energy-efficient transmission and increases the network lifetime by approximately 69% than that of SPMS.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.3
• /
• pp.155-161
• /
• 2015

Efficient energy consumption is a one of the key issues in wireless sensor networks. Clustering-based routing algorithms have been popular solutions for such an issue. Re-clustering is necessary for avoiding early energy drain of cluster head nodes in such routing strategies. The re-clustering process itself, however, is another source of energy consumption. It is suggested in this work to adaptively set the frequency of re-clustering by comparing the energy levels of cluster heads and a threshold value. The algorithm keeps the clusters if all the cluster heads' energy levels are greater than the threshold value. We confirm through simulations that the suggested algorithm shows better energy efficiency than the existing solutions.