• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.9
• /
• pp.4242-4263
• /
• 2017

Multi-User Multiple-Input Multiple-Output (MU-MIMO) technology has recently attracted significant attention from academia and industry because of it is increasingly important role in improving networks' capacity and data rate. Moreover, MU-MIMO systems for the Fifth Generation (5G) have already been researched. High Quality of Service (QoS) and efficient operations at the Medium Access Control (MAC) layer have become key requirements. In this paper, we propose a downlink MU-MIMO MAC protocol based on adaptive Channel State Information (CSI) feedback (called MMM-A) for Wireless Local Area Networks (WLANs). A modified CSMA/CA mechanism using new frame formats is adopted in the proposed protocol. Specifically, the CSI is exchanged between stations (STAs) in an adaptive way, and a packet selection strategy which can guarantee a fairer QoS for scenarios with differentiated traffic is also included in the MMM-A protocol. We then derive the expressions of the throughput and access delay, and analyze the performance of the protocol. It is easy to find that the MMM-A protocol outperforms the commonly used protocols in terms of the saturated throughput and access delay through simulation and analysis results.

• Current Optics and Photonics
• /
• v.1 no.4
• /
• pp.315-324
• /
• 2017

In recent years, multicast services such as high-definition television (HDTV), video conferencing, interactive distance learning, and distributed games have increased exponentially, and wavelength-division multiplexing (WDM) networks are considered to be a promising technology due to their support for multicast applications. Multicast survivability in WDM networks has been the focus of extensive attention since a single-link failure in an optical network may result in a massive loss of data. But the improvement of network survivability increases energy consumption due to more resource allocation for protection. In this paper, an energy-efficient multicast algorithm (EEMA) is proposed to reduce energy consumption in WDM networks. Two cost functions are defined based on the link state to determine both working and protection paths for a multicast request in WDM networks. To increase the number of sleeping links, the link cost function of the working path aims to integrate new working path into the links with more working paths. Sleeping links indicate the links in sleep mode, which do not have any working path. To increase bandwidth utilization by sharing spare capacity, the cost function of the protection path is defined to use sleeping fibers for establishing new protection paths. Finally, the performance of the proposed algorithm is evaluated in terms of energy consumption, and also the blocking probability is evaluated under various traffic environments through OPNET. Simulation results show that our algorithm reduces energy consumption while maintaining the quality of service.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.4B
• /
• pp.236-244
• /
• 2012

The minimum energy broadcast problem is for all deployed nodes to minimize a total transmission energy for performing a broadcast operation in wireless networks. In this paper, we propose a Tabu search algorithm to solve efficiently the minimum energy broadcast problem on the basis of meta-heuristic approach in wireless sensor networks. In order to make a search more efficient, we propose a novel neighborhood generating method and a repair function of the proposed algorithm. We compare the performance of the proposed algorithm with other existing algorithms through some experiments in terms of the total transmission energy of nodes and algorithm computation time. Experimental results show that the proposed algorithm is efficient for the minimum energy broadcast problem in wireless sensor networks.

• Smart Media Journal
• /
• v.5 no.1
• /
• pp.55-60
• /
• 2016

Mobility of the sensor networks proposed a new way to the efficient design of sensor networks and improvement of network system performance. Mobility results in a number of functional changes in the MAC protocol and routing protocol. Especially, the mobility of the nodes may occur the increase of the overhead of transmission or disconnection of the link. Therefore, the study of the energy efficient transmission is very important in mobile sensor networks. This paper proposed adaptive transmission mechanism on the distance-based power control. The proposed mechanism was analyzed better than conventional method in the average energy consumption and network life by simulation results.

• Journal of Information Processing Systems
• /
• v.7 no.2
• /
• pp.221-240
• /
• 2011

Vehicular networks are a promising application of mobile ad hoc networks. In this paper, we introduce an efficient broadcast technique, called CB-S (Cell Broadcast for Streets), for vehicular networks with occlusions such as skyscrapers. In this environment, the road network is fragmented into cells such that nodes in a cell can communicate with any node within a two cell distance. Each mobile node is equipped with a GPS (Global Positioning System) unit and a map of the cells. The cell map has information about the cells including their identifier and the coordinates of the upper-right and lower-left corner of each cell. CB-S has the following desirable property. Broadcast of a message is performed by rebroadcasting the message from every other cell in the terrain. This characteristic allows CB-S to achieve an efficient performance. Our simulation results indicate that messages always reach all nodes in the wireless network. This perfect coverage is achieved with minimal overhead. That is, CB-S uses a low number of nodes to disseminate the data packets as quickly as probabilistically possible. This efficiency gives it the advantage of low delay. To show these benefits, we give simulations results to compare CB-S with four other broadcast techniques. In practice, CB-S can be used for information dissemination, or to reduce the high cost of destination discovery in routing protocols. By also specify the radius of affected zone, CB-S is also more efficient when broadcast to a subset of the nodes is desirable.

• Journal of KIISE:Information Networking
• /
• v.33 no.2
• /
• pp.165-174
• /
• 2006

Data dissemination using either flooding or legacy ad-hoc routing protocol is not realistic approach in the wireless sensor networks, which are composed of sensor nodes with very weak computing power, small memory and limited battery. In this paper, we propose the ELF(Energy-efficient Localized Flooding) protocol. The ELF is energy-efficient data dissemination protocol for wireless sensor networks. In the ELF protocol, there are two data delivery phases between fixed source and mobile sink node. The first phase, before the tracking zone, sensing data are forwarded by unicasting. After that, within the tracking zone, sensing data are delivered by localized flooding. Namely, the ELF Properly combines advantages from both unicasting and flooding. According to evaluation results by simulation, the proposed ELF protocol maintains very high data delivery ratio with using a little energy. Also, the property of average delay is better than others. From our research results, the ELF is very effective data dissemination protocol for wireless sensor networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.4883-4901
• /
• 2016

Energy efficiency in Wireless Sensor Networks (WSNs) is very appealing research area due to serious constrains on resources like storage, processing, and communication power of the sensor nodes. Due to limited capabilities of sensing nodes, such networks are composed of a large number of nodes. The higher number of nodes increases the overall performance in data collection from environment and transmission of packets among nodes. In such networks the nodes sense data and ultimately forward the information to a Base Station (BS). The main issues in WSNs revolve around energy consumption and delay in relaying of data. A lot of research work has been published in this area of achieving energy efficiency in the network. Various techniques have been proposed to divide such networks; like grid division of network, group based division, clustering, making logical layers of network, variable size clusters or groups and so on. In this paper a new technique of group based WSNs is proposed by using some features from recent published protocols i.e. "Energy-Efficient Multi-level and Distance Aware Clustering (EEMDC)" and "Energy-Efficient Multi-level and Distance Aware Clustering (EEUC)". The proposed work is not only energy-efficient but also minimizes the delay in relaying of data from the sensor nodes to BS. Simulation results show, that it outperforms LEACH protocol by 38%, EEMDC by 10% and EEUC by 13%.

• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.292-300
• /
• 2008

In multi-hop wireless networks like Wireless Mesh Networks (WMN) and Wireless Sensor Networks (WSN), nodes often rely on batteries as their power source. In such cases, energy efficient routing is critical. Many schemes have been proposed to find the most energy efficient path, but most of them do not achieve optimality on network lifetime. Once found, the energy efficient path is constantly used such that the energy of the nodes on the path is depleted quickly. As an alternative, the approaches that dynamically change the path at run time have also been proposed. These approaches, however, involve high overhead of establishing multiple paths. In this paper, we first find an optimal multi-path routing using LP. Then we apply an approximation algorithm to derive a near-optimal solution for single-path routing. We compare the performance of the proposed scheme with several other existing algorithms through simulation.

• The KIPS Transactions:PartC
• /
• v.13C no.6 s.109
• /
• pp.741-748
• /
• 2006

Due to the continuous development of sensor technology, Wireless Sensor Networks are rapidly growing and are expected to be applied to various applications. One of the most important factors in Wireless Sensor Networks is energy-efficient management of network resources. For this purpose, a lot of researches have been ongoing in the development of energy-efficient routing protocol. In this paper, a cluster head selection algorithm considering node density in addition to the cluster head selection algorithm of LEACH-C is proposed and simulated. This algorithm gives nearly the same computational speed compared to that of LEACH-C and shows improvement of network lifetime about 11% better than LEACH-C. The simulation result shows that consideration of density as well as distance between nodes in cluster head selection can be more energy-efficient than considering only the distance between nodes as LEACH-C in energy usage of Wireless Sensor Networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8A
• /
• pp.791-800
• /
• 2010

Recently wireless sensor networks as a field of ubiquitous computing technology was in the limelight. To use and collect the necessary information, Sink node mobility is essential. TTDD(Two-Tier Data Dissemination) proposed most common technique associated with Mobile sink node in wireless sensor networks, but issues exist that the use of many control packet falls into the energy efficiency. The technique for solving problems is Cluster-Based Energy-efficient Routing protocol (CBPER). But CBPER does not transmit the data correctly to sink node or source node. In this paper, we propose An Energy-Efficient Routing Protocol based on Static Grid using mobile sink nodes in order to solve the data transmission failure and reduce the energy consumption in Wireless Sensor Networks. We have evaluated it with the NS-2 simulator. Our results show that the proposed protocol saves the energy consumption up to 34% in comparison with CBPER. We also prove that the proposed protocol can transmit more accurate data to the sink de than CBPER.