• Journal of Communications and Networks
• /
• v.18 no.5
• /
• pp.713-724
• /
• 2016

Energy consumption has become a main problem of sustainable development in communication networks and how to communicate with high energy efficiency is a significant topic that researchers and network operators commonly concern. In this paper, an energy-efficient multicast algorithm in multi-hop wireless networks is proposed aiming at new generation wireless communications. Traditional multi-hop wireless network design only considers either network efficiency or minimum energy consumption of networks, but rarely the maximum energy efficiency of networks. Different from previous methods, the paper targets maximizing energy efficiency of networks. In order to get optimal energy efficiency to build network multicast, our proposed method tries to maximize network throughput and minimize networks' energy consumption by exploiting network coding and sleeping scheme. Simulation results show that the proposed algorithm has better energy efficiency and performance improvements compared with existing methods.

• Journal of Communications and Networks
• /
• v.16 no.4
• /
• pp.371-377
• /
• 2014

Localized topology control is attractive for obtaining reduced network graphs with desirable features such as sparser connectivity and reduced transmit powers. In this paper, we focus on studying how to prolong network lifetime in the context of localized topology control for wireless multi-hop networks. For this purpose, we propose an energy efficient localized topology control algorithm. In our algorithm, each node is required to maintain its one-hop neighborhood topology. In order to achieve long network lifetime, we introduce a new metric for characterizing the energy criticality status of each link in the network. Each node independently builds a local energy-efficient spanning tree for finding a reduced neighbor set while maximally avoiding using energy-critical links in its neighborhood for the local spanning tree construction. We present the detailed design description of our algorithm. The computational complexity of the proposed algorithm is deduced to be O(mlog n), where m and n represent the number of links and nodes in a node's one-hop neighborhood, respectively. Simulation results show that our algorithm significantly outperforms existing work in terms of network lifetime.

• Journal of IKEEE
• /
• v.13 no.1
• /
• pp.71-76
• /
• 2009

As one of the most important requirements for wireless sensor networks, prolonging network lifetime can be realized by minimizing energy consumption in cluster heads as well as sensor nodes. While most of the previous researches have focused on the energy of sensor nodes, we devote our attention to cluster heads because they are most dominant source of power consumption in the cluster-based sensor networks. Therefore, we seek to minimize energy consumption by minimizing the maximum(MINMAX) energy dissipation at each cluster heads. This work requires energy-efficient clustering of the sensor nodes while satisfying given energy constraints. In this paper, we present a constraint satisfaction modeling of cluster-based routing in a heterogeneous sensor networks because mixed integer programming cannot provide solutions to this MINMAX problem. Computational experiments show that substantial energy savings can be obtained with the MINMAX algorithm in comparison with a minimum total energy(MTE) strategy.

• Journal of Information Processing Systems
• /
• v.1 no.1 s.1
• /
• pp.49-54
• /
• 2005

With the recent advances in Micro Electro Mechanical System (MEMS) technology, low cost and low power consumption wireless micro sensor nodes have become available. However, energy-efficient routing is one of the most important key technologies in wireless sensor networks as sensor nodes are highly energy-constrained. Therefore, many researchers have proposed routing protocols for sensor networks, especially cluster-based routing protocols, which have many advantages such as reduced control messages, bandwidth re-usability, and improved power control. Some protocols use information on the locations of sensor nodes to construct clusters efficiently. However, it is rare that all sensor nodes know their positions. In this article, we propose another cluster-based routing protocol for sensor networks. This protocol does not use information concerning the locations of sensor nodes, but uses the remaining energy of sensor networks and the desirable number of cluster heads according to the circumstances of the sensor networks. From performance simulation, we found that the proposed protocol shows better performance than the low-energy adaptive clustering hierarchy (LEACH).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.7
• /
• pp.3064-3094
• /
• 2018

Currently, the Underwater Sensor Networks (UWSNs) is mainly an interesting area due to its ability to provide a technology to gather many valuable data from underwater environment such as tsunami monitoring sensor, military tactical application, environmental monitoring and many more. However, UWSNs is suffering from limited energy, high packet loss and the use of acoustic communication. In UWSNs most of the energy consumption is used during the forwarding of packet data from the source to the destination. Therefore, many researchers are eager to design energy efficient routing protocol to minimize energy consumption in UWSNs. As the opportunistic routing (OR) is the most promising method to be used in UWSNs, this paper focuses on the existing proposed energy efficient OR protocol in UWSNs. This paper reviews the existing proposed energy efficient OR protocol, classifying them into 3 categories namely sender-side-based, receiver-side-based and hybrid. Furthermore each of the protocols is reviewed in detail, and its advantages and disadvantages are discussed. Finally, we discuss potential future work research directions in UWSNs, especially for energy efficient OR protocol design.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.4
• /
• pp.626-648
• /
• 2011

Energy consumption of wireless access networks is in permanent increase, which necessitates development of more energy-efficient network management approaches. Such management schemes must result with adaptation of network energy consumption in accordance with daily variations in user activity. In this paper, we consider possible energy savings of wireless local area networks (WLANs) through development of a few integer linear programming (ILP) models. Effectiveness of ILP models providing energy-efficient management of network resources have been tested on several WLAN instances of different sizes. To cope with the problem of high computational time characteristic for some ILP models, we further develop several heuristic algorithms that are based on greedy methods and local search. Although heuristics obtains somewhat higher results of energy consumption in comparison with the ones of corresponding ILP models, heuristic algorithms ensures minimization of network energy consumption in an amount of time that is acceptable for practical implementations. This confirms that network management algorithms will play a significant role in practical realization of future energy-efficient network management systems.

• Journal of Information Processing Systems
• /
• v.6 no.4
• /
• pp.501-510
• /
• 2010

Wireless sensor networks consist of sensor nodes which are expected to be battery-powered and are hard to replace or recharge. Thus, reducing the energy consumption of sensor nodes is an important design consideration in wireless sensor networks. For the implementation of an energy-efficient MAC protocol, a Sensor-MAC based on the IEEE 802.11 protocol, which has energy efficient scheduling, has been proposed. In this paper, we propose a Dynamic S-MAC that adapts dynamically to the network-traffic state. The dynamic S-MAC protocol improves the energy consumption of the S-MAC by changing the frame length according to the network-traffic state. Using an NS-2 Simulator, we compare the performance of the Dynamic S-MAC with that of the S-MAC protocol.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.6
• /
• pp.1357-1378
• /
• 2013

Energy constraint of wireless sensor networks makes energy saving and prolonging the network lifetime become the most important goals of routing protocols. In this paper, we propose an Energy Efficient Chain-based Routing Protocol (EECRP) for wireless sensor networks to minimize energy consumption and transmission delay. EECRP organizes sensor nodes into a set of horizontal chains and a vertical chain. Chain heads are elected based on the residual energy of nodes and distance from the header of upper level. In each horizontal chain, sensor nodes transmit their data to their own chain head based on chain routing mechanism. EECRP also adopts a chain-based data transmission mechanism for sending data packets from the chain heads to the base station. The simulation results show that EECRP outperforms LEACH, PEGASIS and ECCP in terms of network lifetime, energy consumption, number of data messages received at the base station, transmission delay and especially energy${\times}$delay metric.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.1
• /
• pp.3-8
• /
• 2016

Wireless networks have evolved to the appearance of heterogeneous wireless networks(HetNet), where various networks provide data services with various data rates and coverage. One of technical issues for HetNet is efficient utilization of radio resources for system performance enhancement. For the next generation wireless networks, energy saving has become one of key performance indices, so energy-efficient resource management schemes for HetNet need to be developed. This paper addresses an energy-efficient scheduling for HetNet in order to improve the energy efficiency while maintaining similar system throughput as existing scheme, for which an energy-efficient scheduling that energy efficiency factor is included. Simulation results show that the proposed scheme achieves the reduction of energy consumption while admitting limited ragne of throughput degradation in comparison with the conventional proportional fair scheduling.

• ETRI Journal
• /
• v.43 no.3
• /
• pp.427-435
• /
• 2021

Data filtering is an essential task for improving the energy efficiency of radiofrequency identification (RFID) networks. Among various energy-efficient approaches, clustering-based data filtering is considered to be the most effective solution because data from cluster members can be filtered at cluster heads before being sent to base stations. However, this approach quickly depletes the energy of cluster heads. Furthermore, most previous studies have assumed that readers are fixed and interrogate mobile tags in a workspace. However, there are several applications in which readers are mobile and interrogate fixed tags in a specific area. This article proposes a model for dynamic clustering-based data filtering (DCDF) in mobile RFID networks, where mobile readers are re-clustered periodically and the cluster head role is rotated among the members of each cluster. Simulation results show that DCDF is effective in terms of balancing energy consumption among readers and prolonging the lifetime of the mobile RFID networks.