• Journal of information and communication convergence engineering
• /
• v.10 no.4
• /
• pp.359-364
• /
• 2012

Harvesting energy from the environment is essential for many applications to slow down the deterioration of energy of the devices in sensor networks and in general, the network itself. Energy from the environment is an inexhaustible supply which, if properly managed and harvested from the sources, can allow the system to last for a longer period - more than the expected lifetime at the time of deployment, or even last indefinitely. The goal of this study is to develop a simple algorithm for ns-2 to simulate energy harvesting in wireless sensor network simulations. The algorithm is implemented in the energy module of the simulator. Energy harvesting algorithms have not yet been developed for ns-2. This study will greatly contribute to the existing knowledge of simulating wireless sensor networks with energy harvesting capabilities in ns-2. This paper will also serve as a basis for future research papers that make use of energy harvesting.

• Journal of information and communication convergence engineering
• /
• v.10 no.4
• /
• pp.365-371
• /
• 2012

In recent years, researchers have been attracted to clustering methods to improve communication and data transmission in a network. Compared with traditional wireless networks, wireless sensor networks are energy constrained and have lower data rates. The concept of implementing a clustering algorithm in an existing project on gateway relocation is being explored here. Low energy adaptive clustering hierarchy (LEACH) is applied to an existing study on relocating a gateway. The study is further improved by moving the gateway to a specific cluster based on the number or significance of the events detected. The protocol is improved so that each cluster head can communicate with a mobile gateway. The cluster heads are the only nodes that can communicate with the mobile gateway when it (the mobile gateway) is out of the cluster nodes' transmission range. Once the gateway is in range, the nodes will begin their transmission of real-time data. This alleviates the load of the nodes that would be located closest to the gateway if it were static.

• Journal of IKEEE
• /
• v.23 no.4
• /
• pp.1203-1207
• /
• 2019

As the number of IP cores has been increasing in a System-on-Chip (SoC), multiple routers are included in on-chip-networks. Each router has its own arbitration policy and it is difficult to obtain a desired arbitration result by combining multiple routers. Allocating desired bandwidths to the ports across the routers is more difficult. In this paper, a guaranteed bandwidth allocation scheme using an IP-level QoS control is proposed to overcome the limitations of existing local arbitration policies. Each IP can control the priority of a packet depending on the data communication requirement within the allocated bandwidth. The experimental results show that the proposed mechanism guarantees for IPs to utilize the allocated bandwidth in multiple router on-chip-networks. The maximum error rate of bandwidth allocation of the proposed scheme is only 1.9%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10A
• /
• pp.1023-1033
• /
• 2007

This study considers a joint congestion control, routing and power control for energy-constrained wireless networks. A mathematical model is introduced which includes maximization of network utility, maximization of network lifetime, and trade-off between network utility and network lifetime. The framework would maximize the overall throughput of the network where the overall throughput depends on the data flow rates which in turn is dependent on the link capacities. The link capacity on the other hand is a function of transmit power levels and link Signal-to-Interference-plus-Noise-Ratio (SINR) which makes the power allocation problem inherently difficult to solve. Using dual decomposition techniques, subgradient method, and logarithmic transformations, a joint algorithm for rate and power allocation problems was formulated. Numerical examples for each optimization problem were also provided.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.2
• /
• pp.195-208
• /
• 2009

In this paper, we introduce a grid-based key pre-distribution scheme in wireless sensor networks, which aims to improve the connectivity and resiliency while maintaining a reasonable overhead. We consider simplification of the key establishment logic and enhancement of the connectivity via plat polynomial assignment on a three-dimensional grid for node allocation and keying material assignment. We demonstrate that our scheme results in improvements via a detailed discussion on the connectivity, resource usage, security features and resiliency. A comparison with other relevant works from the literature along with a demonstrated implementation on typical sensor nodes shows the feasibility of the introduced scheme and its applicability for large networks.

• Smart Media Journal
• /
• v.3 no.1
• /
• pp.28-32
• /
• 2014

It is practical nowadays to automate data recording in order to prevent loss and tampering of records. There are existing technologies that satisfy this needs and one of them is wireless sensor networks (WSN). Wireless body sensor networks (WBSN) are wireless networks and information-processing systems which are deployed to monitor medical condition of patients. In terms of performance, WBSNs are restricted by energy, and communication between nodes. In this paper, we focused in improving the performance of communication to achieve less energy consumption and to save power. The main idea of this paper is to prioritize nodes that exhibit a sudden change of vital signs that could put the patient at risk. Cluster head is the main focus of this study in order to be effective; its main role is to check the sent data of the patient that exceeds threshold then transfer to the sink node. The proposed scheme implemented added a time-based protocol to sleep/wakeup mechanism for the sensor nodes. We seek to achieve a low energy consumption and significant throughput in this study.

• Journal of Communications and Networks
• /
• v.13 no.4
• /
• pp.377-384
• /
• 2011

Cooperative beamforming has previously been proven to be an efficient way to improve the cooperative diversity. This method generally requires all relay nodes to participate in beamforming, which can be seen as "all participate" cooperative beamforming. However, not all relay nodes have constructive impacts on the end-to-end bit error rate (BER) performance. Based on this observation, we propose a new cooperative scheme which only selects those "appropriate" relay nodes to perform cooperative beamforming. Such relay nodes can be simply determined with mean channel gains. Therefore, the selection complexity is significantly reduced as global instantaneous channel state information is not required. This scheme guarantees that energy is only allocated to the "appropriate" relay nodes, and hence provides superior diversity. We also prove that power allocation among source and selected relay nodes is a convex problem, and can be resolved with lower computational complexity. Simulation results demonstrate that our scheme achieves an essential improvement in terms of BER performance for both optimal and limited feedback scenarios, as well as high energy-efficiency for the energy-constrained networks.

• Proceedings of the KIEE Conference
• /
• 1998.07c
• /
• pp.961-963
• /
• 1998

Power telecommunication networks, being used to support the operation and management of power utility services, exhibits different characteristics from those of public domain networks. KEPCO is planning to evolve its own power network infrastructure to exploit ATM (Asynchronous Transfer Mode) technology. The ATM network to be developed needs to effectively utilize existing network of KEPCO and to fully support new and emerging power-utility-services. This paper summarizes the features of power communication services and the characteristics of Power telecommunication networks, and reports our evolution methodology for KEPCO network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.4
• /
• pp.1424-1441
• /
• 2014

Two-tier femtocell networks, consisting of a conventional cellular network underlaid with femtocell hotspots, play an important role in the indoor coverage and capacity of cellular networks. However, the cross- and co-tier interference will cause an unacceptable quality of service (QoS) for users with universal frequency reuse. In this paper, we propose a novel downlink interference mitigation strategy for spectrum-shared two-tier femtocell networks. The proposed solution is composed of three parts. The first is femtocells clustering, which maximizes the distance between femtocells using the same slot resource to mitigate co-tier interference. The second is to assign macrocell users (MUEs) to clusters by max-min criterion, by which each MUE can avoid using the same resource as the nearest femtocell. The third is a novel adaptive power control scheme with femtocells downlink transmit power adjusted adaptively based on the signal to interference plus noise ratio (SINR) level of neighboring users. Simulation results show that the proposed scheme can effectively increase the successful transmission ratio and ergodic capacity of femtocells, while guaranteeing QoS of the macrocell.

• Proceedings of the Optical Society of Korea Conference
• /
• 2002.07a
• /
• pp.38-39
• /
• 2002

Optical telecommunication has been growing at a rate that exceeds even the "Moore′s Law". However, while the electronic revolution has allowed everyone to have his/her own PC, the optical revolution is still confined to the long-haul network such that the individual end users are still connected to an electronic metro/access networks. However, given the rapid increase in the data traffic (e.g., multimedia), the optical edge that separates the individual end users from optical networks will eventually have to include the metro/acces networks. (omitted)