• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.1015-1016
• /
• 2015

VANET is a technology for building a robust ad-hoc network between mobile vehicles as well as, between vehicles and RSU. Vehicles are moving and they only stay in the RSU area for a short time. When the number of requests is increased, an important challenge is to implement a suitable scheduling algorithm which serves as more requests as possible. $D^*S$ algorithm uses a priority weight, DS_Value, for selection of a request to get service. Priority weight is influenced only by deadline and data size parameters. We propose a packet scheduling using multilevel queue and show that using this idea leads to higher service ratio compare to previous algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.4
• /
• pp.793-797
• /
• 2004

Wireless sensor networks use battery-operated computing and sensing devices. And It can be expected to be deployed in an ad hoc networs. MAC is different from traditional wireless MACs such as IEEE 802.11 in almost every way. so self-configuration and power saving in sensor network are very important goals, while per-node fairness and latency are less important. In this paper, so we use a given prototype for efficient energy conservation to reduce power consumtion that is one of the important character in sensor network and compare energy consumption and collision with IEEE 802.11 MAC. finally we conclude the paper and analyze it.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.182-185
• /
• 2004

Wireless sensor networks use battery-operated computing and sensing devices. And It can be expected to be deployed in an ad hoc networs. MAC is different from traditional wireless MACs such as IEEE 802.11 in almost every way. so self-configuration and power saving in sensor network are very important goals, while per-node fairness and latency are less important. In this paper, so we use a given prototype for efficient energy conservation to reduce power consumtion that is one of the important character in sensor network and compare energy consumption and collision with IEEE 802.11 MAC. Finally we conclude the paper and analyze it.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.10a
• /
• pp.609-610
• /
• 2017

Cognitive radio communication techniques have been attracting attention to efficiently use the scarce spectrum as the wireless communication service increases. In cognitive radio communication, efforts to minimize interference to the primary user are important technical factors. In a multi-hop wireless ad hoc network, multi-hop transmission requires path and channel selection considering channel interference as well as collision with primary users. In the multi-channel environment, cognitive radio network has different capacities depending on the inter-channel interference and collision with the main users. In this paper, we propose a multi-hop transmission scheme that minimizes inter-channel interference and reduce collision with primary users.

• Cross-Cultural Studies
• /
• v.34
• /
• pp.71-92
• /
• 2014

This article presents a study on the concept of "Photogenie", which refers to the duality and mentality of the photographic image, with the viewpoint regarding the photographic image by Edgar Morin. First, we will look at the evolution of the concept of "Photogenie". From the field of photography, the term "Photogenie" means objects that produce light, enough to impress the photographic plate. But theorists of cinema at the beginning of the 20th century have changed the meaning of the term. For Louis Delluc, the "Photogenie" means the effect of union between the reproduction of real and artistic genius. For Jean Epstein, the "Photogenie" means mental quality, nonmaterial or inderterminable, of the photographic and cinematographic image. But Morin synthesized the arguements of Delluc and Epstein. For him, the "Photogenie" indicates both a double character of the photographic image and its mental quality. Then, based on this concept of "Photogenie," Morin said on particular aspects in the photographic image. Considering photography as a double in the anthropological sense, it puts emphasis not only the dual nature of the photographic image but also mental and spiritual quality. Combining the theory of the mage Henri Bergson and Jean-Paul Sartre, he builds his own theory of the mage that concerns both photography and cinema. In short, to Morin, the photographic image is a place where coexist absence and presence, the real and the imaginary, perception and memory, the material and mental, as well that a place of mentality which appear all our memories, hallucinations, dreams, imagination etc.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.1178-1181
• /
• 2009

Geographic forwarding algorithms을 사용하는 Georouting protocol에서는 route maintenance을 위해서 고정된 주기마다 beacon message을 이웃노드에 전송하는 fixed periodical beacon based route algorithm을 사용하여 mobile node 정보를 습득한다. Fixed periodical beacon scheme에서의 기존 연구 이슈는 이웃노드 정보의 신뢰성을 유지하기 위해서 다양한 mobility environment 환경에 맞도록 beacon 전송주기를 적절히 결정하는 연구가 진행되어 왔다. 이와 같은 연구에서는 long periodical interval 사용 시 이웃노드의 위치정보 error을 발생시킬 확률이 높으며 또한 short periodical interval 의 경우 네트워크 내에 high route overhead 을 유발시키는 단점을 가지고 있다. 따라서 고정된 주기 방법은 다양한 mobility environment에 잘 적용되지 못하며 또한 mobility environment 에서 발생하는 route maintenance 내에 이웃노드 정보에 대한 불확실성 문제가 빈번이 발생하여 경로 설정에 잘못된 정보를 제공하여 경로 신뢰성(path reliability)과 낮은 전송률 (transmission rate)을 야기한다. 본 논문에서는 이런 이웃노드 정보의 불확실성 문제를 극복하기 위해서 mobile node가 스스로 자신의 위치를 체크하여 routing table을 능동적으로 갱신하는 방법을 이용하여 이 문제를 극복할 수 있도록 하였다. 모의 실험은 ns2를 이용하여 실시하였으며 결과는 low/high mobility scenario에서는 기존 방법 보다 routing overhead 을 줄이면서 높은 전송률 (transmission rate)을 보인다.

• The KIPS Transactions:PartC
• /
• v.13C no.4 s.107
• /
• pp.447-454
• /
• 2006

An ad-hoc network routing protocol, AODV(Ad-hoc On-demand Distance Vector) initially uses ERS(Expanding Ring Search) algorithm to control the RREQ(Route Request) retransmission in the route discovery process. Because ERS uses the fixed NTT(Node Travesal Time), it does not reflect accurately ad-hoc network environment. In this paper, we propose an improved ERS algorithm which lowers the retransmission rate. It uses RREP(Route Reply) and gives different weights in NTT of each node in accordance with the adjacency to an originating node. To show the effectiveness of the proposed algorithm, we perform a simulation using ns2. The simulation results showed that the proposed algorithm has better performance than existing algorithms.

• Journal of Korea Multimedia Society
• /
• v.16 no.8
• /
• pp.943-953
• /
• 2013

By the enormous increase in mobile nodes and diverse service requests on wireless networks, wireless mesh network(WMN) takes an interest as the solution for such requests. However, lots of issues which should be solved to deploy WMN are still remained. In the network layer, the performance improvement of routing protocols is the major issue of nowadays researches. WMN can be easily deployed by use of protocols for mobile ad-hoc networks(MANET) because it is much similar with MANET in multi-hop wireless routing and which node plays as host and router concurrently. Unfortunately, most routing protocols for MANET have drawbacks such as large traffic overhead and long delay time for route discovery due to the network extension. They are major factors of performance degradation of WMN and most researches are focused on them. In this paper, domain-based AODV which is amended AODV to be applied in hybrid WMN is proposed. The proposed scheme divides a hybrid WMN as several domains and performs route discovery by header layer domain. Therefore it can reduce the distance for route discovery as much as average hop count between domain header and member nodes. From the simulation, domain-based AODV was showed slowly increasing delay time due to the network extension.

• Journal of Digital Convergence
• /
• v.10 no.9
• /
• pp.325-332
• /
• 2012

VANET(Vehicular Ad-hoc Network), which is a technology to create a network among vehicles, decides the route to the destination using information of neighbors within the transmission range as transmission nodes. The existing routing protocol which uses geographical information can cause delay and disconnection of the network when the density of nodes is not high enough to communicate because it only considers the distance of the relay nodes or destination nodes from the source nodes. To solve the problem, this dissertation suggests a routing algorithm based on zones for stable communications among vehicles in the environment of VANET. I minimize the packet loss rate by dividing the city environment into zones and taking into account not only the distance of the destination but also the density of vehicles to choose the best communications environment. This results in a better performance than the established research when the performance evaluation is implemented.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.6
• /
• pp.1171-1176
• /
• 2016

VANET are a special kind of MANET adapted to the communications between vehicles. In this work, we propose the models used for representing the communication among vehicles, vehicles mobility features, and VANET simulator using realistic vehicular mobility models. VANET requires that a traffic and network simulator should be used together to perform this test. But, simulator tool has been preferred over traffic simulation because it simple, easy and cheap. Goal of this paper is to create a simulation of Vehicular Ad-Hoc network for urban scenario which can be used for testing purposes. Such environment can be used while designing better MAC protocols in VANETs. We are evaluating the performance of two routing protocols namely AODV and DSDV. The comparison was based on the throughout, packet loss and end-to-end delay. We found that DSDV has less throughput performance and high routing overhead than AODV. On average end-to-end delay and packet loss, AODV performs better than DSDV.