• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.3771-3788
• /
• 2015

This paper studies the distributed energy efficient resource management in the Internet of Things (IoT). Wireless communication networks support the IoT without limitation of distance and location, which significantly impels its development. We study the communication channel and energy management in the wireless communication network supported IoT to improve the ability of connection, communication, share and collaboration, by using the game theory and distributed learning algorithm. First, we formulate an energy efficient neighbor collaborative game model and prove that the proposed game is an exact potential game. Second, we design a distributed energy efficient channel selection learning algorithm to obtain the global optimum in a distributed manner. We prove that the proposed algorithm will asymptotically converge to the global optimum with geometric speed. Finally, we make the simulations to verify the theoretic analysis and the performance of proposed algorithm.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.04a
• /
• pp.607-608
• /
• 2012

Data aggregation is a fundamental problem in wireless sensor networks which attracts great attention in recent years. Delay and energy efficiencies are two crucial issues of designing a data aggregation scheme. In this paper, we propose a distributed, energy efficient algorithm for collecting data from all sensor nodes with the minimum latency called Delay-aware Power-efficient Data Aggregation algorithm (DPDA). The DPDA algorithm minimizes the latency in data collection process by building a time efficient data aggregation network structure. It also saves sensor energy by decreasing node transmission distances. Energy is also well-balanced between sensors to achieve acceptable network lifetime. From intensive experiments, the DPDA scheme could significantly decrease the data collection latency and obtain reasonable network lifetime compared with other approaches.

• International journal of advanced smart convergence
• /
• v.7 no.4
• /
• pp.197-205
• /
• 2018

Nowadays, wireless sensor networks (WSNs) have been widely adopted in structural health monitoring (SHM) systems for social overhead capital (SOC) public infrastructures. Structural health information, environmental disturbances and sudden changes of weather conditions, damage detections, and external load quantizing are among the capabilities required of SHM systems. These information requires an efficient transmission with which an efficient mobility management support for wireless networks can provide. This paper deals with the analysis of mobility management schemes in order to address the real-time requirement of data traffic delivery for critical SHM information. The host-based and network-based mobility management protocols have been identified and the advantages of network mobility (NEMO) enabled Proxy Mobile Internet Protocol version 6 (PMIPv6) have been leveraged in order to address the SHM information transmission needs. The scheme allows an efficient information transmission as it improves the handover performance due to shortened handover latency as well as reduced signaling overhead.

• Journal of Sensor Science and Technology
• /
• v.33 no.3
• /
• pp.147-151
• /
• 2024

The importance of Wireless Sensor Networks is becoming more evident owing to their practical applications in various areas. However, the energy problem remains a critical barrier to the progress of WSNs. By reducing the energy consumed by the sensor nodes that constitute WSNs, the performance and lifespan of WSNs will be enhanced. In this study, we introduce an energy-efficient ternary modulator that employs multi-threshold CMOS for logic conversion. We optimized the design with a low-power ternary gate structure based on a pass transistor using the MTCMOS process. Our design uses 71.69% fewer transistors compared to the previous design. To demonstrate the improvements in our design, we conducted the HSPICE simulation using a CMOS 180 nm process with a 1.8V supply voltage. The simulation results show that the proposed ternary modulator is more energy-efficient than the previous modulator. Power-delay product, a benchmark for energy efficiency, is reduced by 97.19%. Furthermore, corner simulations demonstrate that our modulator is stable against PVT variations.

• Management Science and Financial Engineering
• /
• v.8 no.1
• /
• pp.39-51
• /
• 2002

Special structure of flow networks can reduce the order of the relative existent algorithms. In this paper a special structure of flow network called self-similar f1ow networks is introduced, After describing such networks an efficient algorithm for finding maximum flow is presented. It is shown that this algorithm runs in O(m) time.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.3
• /
• pp.65-77
• /
• 2001

Survivability of a network is one of the most important issues in designing present-day communication networks. the k-edge survivability of a given network is defined as the percentage of total traffic surviving the worst case failure of k edges. Although several researches calculated k-edge survivability on small networks by enumeration, prior research has considered how to calculate k-edge survivability on large networks. In this paper, we develop an efficient procedure to obtain lower and upper bounds on the k-edge survivability of a network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.6
• /
• pp.2546-2566
• /
• 2016

This paper investigates an efficient transmission scheme for the remote wireless sensors to receive information which is rarely discussed in the integrated remote wireless sensor and multibeam satellite networks (IWSMSNs). The networks can be employed to exchange sensing information for emergency scenario, ocean scenario, and so on, which are isolated from available terrestrial networks. As the efficient transmission link is important to the IWSMSNs, we propose a hybrid full frequency (HFF) precoding by taking advantage of frequency reuse and multiple-input multiple-output (MIMO) precoding. Considering energy efficiency and sinks fairness are crucial to transmission link, thus the HFF precoding problems are formulated as transmit power minimization (TPM) and max-min fair (MMF) received signal to interference plus noise ratio (SINR) problems, which can be transformed to indefinite quadratic optimization programs. Then this paper presents a semi-definite programming (SDP) algorithm to solve the problems for the IWSMSNs. The promising potential of HFF for the real IWSMSNs is demonstrated through simulations.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.7
• /
• pp.1715-1724
• /
• 2013

The maximum lifetime data aggregation problem is to maximize the network lifetime as minimizing the transmission energy of all deployed nodes in wireless sensor networks. In this paper, we propose a simulated annealing algorithm to solve efficiently the maximum lifetime data aggregation 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 network lifetime and algorithm computation time. Experimental results show that the proposed algorithm is efficient for the maximum lifetime data aggregation problem in wireless sensor networks.

• Journal of Communications and Networks
• /
• v.10 no.1
• /
• pp.79-88
• /
• 2008

In this paper, we propose efficient peer assignment algorithms for low-latency transmission of scalable coded images in peer-to-peer networks, in which peers may dynamically join and leave the networks. The objective of our algorithm is to minimize the transmission time of a requested image that is scalable coded. When an image is scalable coded in different bit rates, the bit stream encoded in a lower bit rate is a prefix subset of the one encoded in a higher bit rate. Therefore, a peer with the same requested image coded in any bit rate, even when it is different from the requested rate, may work as a supplying peer. As a result, when a scalable coded image is requested, more supplying peers can be found in peer-to-peer networks to help with the transfer. However, the set of supplying peers is not static during transmission, as the peers in this set may leave the network or finish their transmission at different times. The proposed peer assignment algorithms have taken into account the above constraints. In this paper, we first prove the existence of an optimal peer assignment solution for a simple identity permutation function, and then formulate peer assignment with this identity permutation as a mixed-integer programming problem. Next, we discuss how to address the problem of dynamic peer departures during image transmission. Finally, we carry out experiments to evaluate the performance of proposed peer assignment algorithms.

• Journal of Internet Computing and Services
• /
• v.9 no.6
• /
• pp.15-25
• /
• 2008

Due to the differences between a mobile ad-hoc network and a sensor network, the pre-existing autoconfiguration for a mobile ad-hoc network cannot be simply applied to a sensor network. But. a mechanism is still necessary to assign locally unique addresses to sensor nodes efficiently. This paper proposes a hybrid IDs assignment scheme of local area sensor networks. The IDs assignment scheme of hybrid method combines a proactive IDs assignment with a reactive IDs assignment scheme. The proposed scheme considers efficient communication using reactive IDs assignment, and security for potential attacks using zone-based self-organized clustering with Byzantine Agreement in sensor networks. Thus, this paper has solved the shortage of security due to minimizing network traffic and the problem of repairing the network from the effects of an aberrant node in sensor networks.