• Journal of the Korea Society of Computer and Information
• /
• v.16 no.10
• /
• pp.165-173
• /
• 2011

In Mobile Ad-hoc Network(MANET), mobile nodes are operated by limited batteries. Therefore, it is very important to consume the battery power efficiently to prevent termination of the network. In this paper, we propose Energy-aware Dynamic Source Routing(EDSR) which is based on the Dynamic Source Routing(DSR) to increase the packet transmission and lifetime of the network. If the battery power of a node reaches threshold level, then the node gives up the function of relaying to save battery power except as a source and a destination node. While the conventional DSR doesn't consider the battery consumptions of the nodes, EDSR blocks the nodes from relaying whose battery powers are below the threshold level. Simulation results show the proposed EDSR is more efficient in packet transmission and network lifetime through the balanced battery consumption of the mobile nodes.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.541-543
• /
• 2004

TCP does not distinguish between congestion and packet losses due to route change and link failures, which are prevalent in mobile ad hoc networks. So, TCP does not show satisfactory performance in ad hoc networks since it assumes that all packet losses are due to network congestions. In particular, when a route is reestablished it needs to be adaptively determined CWND according to the new route features. In this paper, we proposed CWND adjustment scheme to improve the TCP performance overad hoc networks. TCP sender effectively adjusts CWND by monitoring the network situation using control packets. Simulation results using NS-2 show that the proposed scheme increases TCP throughput compared with those of general TCP.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.565-567
• /
• 2004

All IP,NGN(Next Generation Network)으로 대변되는 차세대 네트워크의 특징 중 하나는 이동성이며 노드의 이동뿐만 아니라 네트워크 전체가 이동하는 모바일 네트워크로 진화하고 있다. 차세대 네트워크의 하위 구조를 이루게 될 MANET에 IPv6를 적용하기 위해, 보다 확장성 있고, 유연하며. 빠르고 가벼운 IPv6의 자동 주소 지정 및 중복 주소 탐지에 관해 논의한다.

• Review of KIISC
• /
• v.19 no.1
• /
• pp.134-142
• /
• 2009

VANET(Vehicular Ad-hoc Network)은 MANET(Mobile Ad-hoc Network)의 한 형태로, 다수의 차량들이 무선통신을 이용하여 차량 간 통신 또는 차량과 노변장치(Roadside Equipment) 간의 통신을 제공하는 차세대 네트워킹 기술이다. VANET은 주로 사고를 예방하기 위해 사용된다. VANET은 사람의 안전과 생명을 보호하는 중요한 역할을 하기 때문에 보안을 반드시 고려해야 한다. 본 고에서는 VANET에서의 보안과 관련된 고려사항 및 제약사항과 위협을 서술하고 VANET이 만족해야 할 보안요구사항에 대해 분석한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.5
• /
• pp.1752-1767
• /
• 2015

As a special type of mobile ad-hoc network, Vehicular Ad-hoc Network (VANET) is considered as an attractive topic by many researchers. In VANETs, vehicles act as routers and clients, which are connected with each other through unreliable wireless links. Due to the dynamic nature of vehicles, developing communication protocols for VANETs is a challenging task. In this paper, we tackle the problem of real-world VANET operations and propose a new dual-level communication scheme through the combination of power and rate control algorithms. Based on the game theoretic approach, the proposed scheme effectively formulates the interactive situation among several vehicles. With a simulation study, it is confirmed that the proposed scheme can achieve better performance than other existing schemes under widely diverse VANET environments.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.9
• /
• pp.1829-1836
• /
• 2009

A wireless Ad-hoc network is willing to send and receive data and for other nodes, and it is a temporal network where the nodes with mobility are automatically constituted. This network has been studied to construct networks in the state where there is no infrastructure. The limited nodes and its frequent moving in a wireless Ad-hoc network have resulted in frequent network disconnection. Therefore, the data transmission rate should be secured in a wireless Ad-hoc network. This study proposes the method to improve QoS of data transmission considering the mobility of nodes that respond to path searching by means of AOMDV routing protocol. By applying the suggested method, it is possible to raise the transmission rate by improving the reliability of transmission path.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.11
• /
• pp.105-111
• /
• 2009

The study aims to propose the intelligent clustering technique that calculates the distance by improving the problems of multi-hop clustering technique for inter-vehicular secure communications. After calculating the distance between vehicles with no connection for rapid transit and clustering it, the connection between nodes is created through a set distance vale. Header is selected by the distance value between nodes that become the identical members, and the information within a group is transmitted to the member nodes. After selecting the header, when the header is separated due to its mobility, the urgent situation may occur. At this time, the information transfer is prepared to select the new cluster header and transmit it through using the intelligent cluster provided from node by the execution of programs included in packet. The study proposes the cluster technique of the intelligent distance estimation for the mobile Ad-hoc network that calculates the cluster with the Store-Compute-Forward method that adds computing ability to the existing Store-and-Forward routing scheme. The cluster technique of intelligent distance estimation for the mobile Ad-hoc network suggested in the study is the active and intelligent multi-hop cluster routing protocol to make secure communications.

• Journal of Korea Multimedia Society
• /
• v.8 no.12
• /
• pp.1613-1622
• /
• 2005

Broadcasting is fundamental and effective data dissemination mechanism for route discovery, address resolution, and many other network services in mobile ad hoc networks. Although many approaches for broadcasting have been proposed to minimize the number of retransmissions, none of them guarantee the best-suited bounds of retransmissions. Appropriate use of probabilistic method can lower the chance of contention and collision among neighboring nodes, so that it reduces the number of rebroadcasts. In this paper, we propose a probabilistic approach that dynamically adjusts the rebroadcasting probability according to the distance between the sender and the receiver. While the rebroadcast probabilities of a mobile node close to sender will be set lower, the rebroadcast probabilities of a mobile node far away from sender wi1l be set to higher, The rebroadcast probability of a node wi1l be set according to the distance from sender. We evaluate the performance of proposed approach by comparing it with flooding as well as a fixed probabilistic broadcast approach. Simulation results showed that the performance of proposed scheme outperforms by about $70\%$ than flooding scheme and outperforms by about $20\%$ than fixed probabilistic scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5A
• /
• pp.474-481
• /
• 2010

In this paper, we present an effective cross layer-based video transmission algorithm over multi-hop mobile ad hoc networks. The proposed algorithm selects the most efficient PHY mode of wireless LAN multi-rate service at each node in a distributed way based on the available information at application, MAC, and physical layers in order to minimize end-to-end delay and maintain packet loss rate in tolerable range at the receiver. Finally, experimental results are provided to show superior performance of the proposed algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.489-491
• /
• 2009

Recently, a range of diverse networks are undergoing speedy evolution and inspiring variety applications. Among many networks, mobile Ad-Hoc networks (MANETs) are active working with a part of routing protocols. But, the majority of routing protocols have required a unique identifier, such as an IP address. At this while, IP address assignment scheme in MANET remains unsolved. When a centralized agent server is not exist, IP address is an critical issue such as a single MANET. This paper look over previous work about basic principles, also we suggest simple solution to overcome the power of two ($2^m$).