• Journal of Environmental Policy
• /
• v.14 no.3
• /
• pp.75-94
• /
• 2015

The purpose of this study is to analyze the major issues discussed among Parties and provide a framework for predicting the agreements on those issues, prior to the final negotiation on a new legally-binding agreement on climate change adaptation in the United Nations Framework Convention on Climate Change (UNFCCC). The analyses of documents, adaptation actions, and work of the Ad Hoc Working Group on the Durban Platform for Enhanced Action (ADP) under the UNFCCC informed that the adaptation issue has primarily been focused on the support of developed country Parties for the adaptation of developing country Parties following the principle of the Convention, Common but Differentiated Responsibilities and Respective Capabilities (CBDR-RC). Three-year work of the ADP acknowledged the major issues on adaptation in the new climate agreement, which would be categorized as long-term and global aspects, commitments/contributions/actions, monitoring and evaluation, institutional arrangements, and loss and damage. A final agreement on each issue could be predicted by setting a zone of possible agreement in-between the two extremes of developing and developed country Parties and considering three major elements affecting the Parties' positions, national priority, adaptation action, and social expectation, which are proposed in this study. The three major elements should be considered in a balanced manner by Parties to draw a durable agreement that will enhance global adaptation actions from a long-term perspective. That is, the agreement needs to reflect adaptation actions occurring outside the Convention as well as social expectations for adaptation. It is expected that the new agreement on climate change adaptation, from a long-term and global perspective, would be an opportunity to reduce vulnerability and build resilience to climate change by incorporating global expectations.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.24 no.5
• /
• pp.795-807
• /
• 2014

Vehicular Ad hoc Network (VANET) has gone through a rich amount of research and currently is making its way towards the deployment. However, surprisingly it evolved to rather more applications and services-rich breed referred to as VANET-based clouds due to the advancements in the automobile and communication technologies. Security and privacy have always been the challenges for the think tanks to deploy this technology on mass scale. It is even worse that some security issues are orthogonally related to each other such as privacy, revocation and route tracing. In this paper, we aim at a specific VANET-based clouds framework proposed by Hussain et al. namely VANET using Clouds (VuC) where VANET and cloud infrastructure cooperate with each other in order to provide VANET users (more precisely subscribers) with services. We specifically target the aforementioned conflicted privacy, route tracing, and revocation problem in VANET-based clouds environment. We propose a multiple pseudonymous approach for privacy reasons and leverage the beacons stored in the cloud infrastructure for both route tracing and revocation. In the proposed scheme, revocation authorities after colluding, can trace the path taken by the target node for a specified timespan and can also revoke the identity if needed. Our proposed scheme is secure, conditional privacy preserved, and is computationally less expensive than the previously proposed schemes.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.24 no.6
• /
• pp.1147-1157
• /
• 2014

Intelligent transportation system (ITS) is realized through a highly ephemeral network, i.e. vehicular ad hoc network (VANET) which is on its way towards the deployment stage, thanks to the advancements in the automobile and communication technologies. However, it has not been successful, at least to date, to install the technology in the mass of vehicles due to security and privacy challenges. Besides, the users of such technology do not want to put their privacy at stake as a result of communication with peer vehicles or with the infrastructure. Therefore serious privacy measures should be taken before bringing this technology to the roads. To date, privacy issues in ephemeral networks in general and in VANET in particular, have been dealt with through various approaches. So far, multiple pseudonymous approach is the most prominent approach. However, recently it has been found out that even multiple pseudonyms cannot protect the privacy of the user and profilation is still possible even if different pseudonym is used with every message. Therefore, another privacy-aware mechanism is essential in vehicular networks. In this paper, we propose a novel identity exchange mechanism to preserve conditional privacy of the users in VANET. Users exchange their pseudonyms with neighbors and then use neighbors' pseudonyms in their own messages. To this end, our proposed scheme conditionally preserves the privacy where the senders of the message can be revoked by the authorities in case of any dispute.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.5
• /
• pp.1087-1096
• /
• 2011

Vehicular Ad Hoc Network(VANET) using wireless network is offering the communications between vehicle and vehicle(V2V) or vehicle and infrastructure(V2I). VANET is being actively researched from industry field and university because of the rapid developments of the industry and vehicular automation. Information, collected from VANET, of velocity, acceleration, condition of road and environments provides various services related with safe drive to the drivers, so security over network is the inevitable factor. For the secure message authentication, a number of authentication proposals have been proposed. Among of them, a scheme, proposed by Jung, applying database search algorithm, Bloom filter, to RAISE scheme, is efficient authentication algorithm in a dense space. However, k-anonymity used for obtaining the accurate vehicular identification in the paper has a weak point. Whenever requesting the righteous identification, all hash value of messages are calculated. For this reason, as the number of car increases, a amount of hash operation increases exponentially. Moreover the paper does not provide a complete key exchange algorithm while the hand-over operation. In this paper, we use a Received Signal Strength Indicator(RSSI) based velocity and distance estimation algorithm to localize the identification and provide the secure and efficient algorithm in which the problem of hand-over algorithm is corrected.

• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.3
• /
• pp.67-76
• /
• 2020

With the fast development in wireless communications and vehicular technologies, vehicular ad hoc networks (VANETs) have enabled to deliver data between vehicles. Recently, VANETs introduce a Vehicular Cloud (VC) model for collaborating to share and use resources of vehicles to create value-added services. To construct a VC, a vehicle should search vehicles that intend to provide their own resource. The single-hop search cannot search enough provider vehicles due to a small coverage and non-line-of-sights of communications. On the other hand, the multi-hop search causes very high traffics for large coverage searching and frequent connection breakages. Recently, many Roadside Units (RSUs) have been deployed on roads to collect the information of vehicles in their own coverages and to connect them to Internet. Thus, we propose a RSU-aided vehicular resource search and cloud construction mechanism in VANETS. In the proposed mechanism, a RSU collects the information of location and mobility of vehicles and selects provider vehicles enabled to provide resources needed for constructing a VC of a requester vehicle based on the collected information. In the proposed mechanism, the criteria for determining provider vehicles to provide resources are the connection duration between each candidate vehicle and the requester vehicle, the resource size of each candidate vehicle, and its connection starting time to the requester vehicle. Simulation results verify that the proposed mechanism achieves better performance than the existing mechanism.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.417-420
• /
• 2006

UPnP presents home network middleware for local home electrical appliances basedon internet protocols that is available access and control electrical appliances just in local home network. Itis designed to bring easy-to-use, flexible, standards-based connectivity to ad-hoc or unmanaged networks in the home, a small business, public spaces, or attached to the Internet. In this paper, Internet Gateway expands UPnP IGD(Internet Gateway Device) DCP(Device Control protocol) and UPnP IGP Bridge for Internet Home Network Electrical Appliance Control. UPnP IGD DCP is configurable initiation and sharing of internet connections, advanced connection-management features, management of host configuration service, and supports transparent Internet access by non-UPnP-certified devices. UPnP Bridge search for local home network devices by sending control messages. Control Point of UPnP Bridge search for devices of interest on the network and can control or be controlled all of functions by IGD DCP with control commands. Outside client, approach to UPnP IGD DCP, send control messages UPnP Bridge, and invoke each UPnP device. As a result, Electrical Appliance of Home Network base on UPnP, can control and be controlled via the Internet like ones in the one Home Network without modification of existing UPnP.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.11
• /
• pp.1021-1030
• /
• 2010

In the sensor network, many tiny nodes construct Ad-Hoc network using wireless interface. As this type of system consists of thousands of nodes, managing each sensor node in real world after deploying them is very difficult. In order to install the sensor network successfully, it is necessary to verify its software using a simulator beforehand. In fact Sensor network simulators require high fidelity and timing accuracy to be used as a design, implementation, and evaluation tool of wireless sensor networks. Cycle-accurate, instruction-level simulation is the known solution for those purposes. In this paper, we developed an instruction-level sensor network simulator for Telos sensor node as named TeloSlM. It consists of MSP430 and CC2420. Recently, Telos is the most popular mote because MSP430 can consume the minimum energy in recent motes and CC2420 can support Zigbee. So that TeloSlM can provide the easy way for the developers to verify software. It is cycle-accurate in instruction-level simulator that is indispensable for OS and the specific functions and can simulate scalable sensor network at the same time. In addition, TeloSlM provides the GUI Tool to show result easily.

• Journal of Internet Computing and Services
• /
• v.17 no.6
• /
• pp.17-23
• /
• 2016

In the future network such as Internet of Things (IoT), the number of computing devices are expected to grow exponentially, and each of the things communicates with the others and acquires information by itself. Due to the growing interest in IoT applications, the broadcasting in Opportunistic ad-hoc networks such as Machine-to-Machine (M2M) is very important transmission strategy which allows fast data dissemination. In distributed networks for IoT, the energy efficiency of the nodes is a key factor in the network performance. In this paper, we propose a fuzzy logic based probabilistic multi-hop broadcast (FPMCAST) algorithm which statistically disseminates data accordingly to the remaining energy rate, the replication density rate of sending node, and the distance rate between sending and receiving nodes. In proposed FPMCAST, the inference engine is based the fuzzy rule base which is consists of 27 if-then rules. It maps input and output parameters to membership functions of input and output. The output of fuzzy system defines the fuzzy sets for rebroadcasting probability, and defuzzification is used to extract a numeric result from the fuzzy set. Here Center of Gravity (COG) method is used to defuzzify the fuzzy set. Then, the performance of FPMCAST is evaluated through a simulation study. From the simulation, we demonstrate that the proposed FPMCAST algorithm significantly outperforms flooding and gossiping algorithms. Specially, the FPMCAST algorithm has longer network lifetime because the residual energy of each node consumes evenly.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.8
• /
• pp.3672-3679
• /
• 2012

Vehicle Ad hoc Network (VANET) is next-generation network technology to provide various services using V2V (Vehicle-to-Vehicle) and V2I (Vehicle-to-Infrastructure). In VANET, many researchers proposed various studies for the safety of drivers. In particular, using the emergency message to increase the efficiency of traffic safety have been actively studied. In order to efficiently transmit to moving vehicle, to send a quick message to as many nodes is very important via broadcasting belong to communication range of vehicle nodes. However, existing studies have suggested a message for transmission to the communication node through indiscriminate broadcasting and broadcast storm problems, thereby decreasing the overall performance has caused the problem. In addition, theses problems has decreasing performance of overall network in various form of road and high density of vehicle node as urban area. Therefore, this paper proposed Clustering based Routing Algorithm (CBRA) to efficiently transmit emergency message in high density of vehicle as urban area. The CBRA managed moving vehicle via clustering when vehicle transmit emergency messages. In addition, we resolve linkage problem between vehicles according to various form of road. The CBRA resolve link brokage problem according to various form of road as urban using clustering. In addition, we resolve broadcasting storm problem and improving efficacy using selection flooding method. simulation results using ns-2 revealed that the proposed CBRA performs much better than the existing routing protocols.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.27 no.1
• /
• pp.1-6
• /
• 2017

Recent researches on radio frequency energy harvesting networks(RF-EHNs) with limited energy resource like battery have been focusing on the development of a new scheme that can effectively extend the whole lifetime of a network to semipermanent. In order for considerable increase both in the amount of energy obtained from radio frequency energy harvesting and its charging effectiveness, it is very important to design a network that supports energy harvesting and data transfer simultaneously with the full consideration of various characteristics affecting the performance of a RF-EHN. In this paper, we proposes an interference-based charging aware routing protocol(ICARP) that utilizes interference information and charging time to maximize the amount of energy harvesting and to minimize the end-to-end delay from a source to the given destination node. To accomplish the research objectives, this paper gives a design of ICARP adopting new network metrics such as interference information and charging time to minimize end-to-end delay in energy harvesting wireless networks. The proposed method enables a RF-EHN to reduce the number of packet losses and retransmissions significantly for better energy consumption. Finally, simulation results show that the network performance in the aspects of packet transmission rate and end-to-end delay has enhanced with the comparison of existing routing protocols.