• Journal of Communications and Networks
• /
• v.12 no.1
• /
• pp.67-73
• /
• 2010

Current on-demand ad-hoc routing protocols are not appropriate for wireless mesh networks (WMNs), because flooding-based route discovery is both redundant and expensive in terms of control message overhead. In this paper, we propose an efficient on-demand routing approach with directional flooding (DF), which is suitable for the WMNs with limited mobility. In the route discovery process to reach a gateway, our DF scheme can reduce the number of route request (RREQ) packets broadcast by using a restricted directional flooding technique. Simulation results show that ad hoc on-demand distance vector (AODV) with DF (AODV-DF) can significantly reduce routing overhead by RREQ packets and enhance overall performance compared with the original AODV.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.4
• /
• pp.17-22
• /
• 2013

In this paper, we propose a multi-hop cooperative transmission protocol over Rayleigh fading channels. In the proposed protocol, the multi-hop cooperative transmission is used to improve the system performance. Due to broadcast nature, we do not limit the receiving node to be only the next node, but the destination and all the nodes between the transmitting node and the destination. The proposed protocol can hence save the average transmit power, compared with multi-hop direct transmission protocol due to the skipped transmissions from some intermediate nodes or chosen relays. The proposed scheme is implemented and evaluated in mobile ad-hoc wireless networks.

• Journal of Information Technology Applications and Management
• /
• v.10 no.2
• /
• pp.61-71
• /
• 2003

Ad-hoc networks are characterized by multi-hop wireless links, frequently changing network topology and the need for efficient dynamic routing protocols. In an Ad-hoc network, each host assumes the role of a router and relays packets toward final destinations Because a packet is broadcast to all neighboring nodes, the optimality criteria of wireless network routing is different from that of wired network routing. tn this paper 1 point out the more important cost factor than the number of links in the Ad-hoc network. A class routing protocols called on-demand protocols has recently found attention because of their low routing overhead since it performs a blind flooding to look for a path. In this paper, 1 propose the method which reduces overhead by using the information of neighboring nodes and doing a selective flooding. Simulation results demonstrate better reduction of routing overheads with this scheme.

• Journal of Internet Computing and Services
• /
• v.2 no.3
• /
• pp.9-17
• /
• 2001

Ad-Hoc networks consist of a set of mobile hosts that communicate using wireless links, without the use of other communicate support facilities (such as base stations). The topology of an Ad-Hoc network changes due to the movement of mobile host. which may lead to sudden packet loss. Recently, a large amount of research has focused on the routing protocols needed in such an environment. but researches about Internet traffic performance analysis were unexhausted. Accordingly, we have simulated Ad-Hoc mobile network that using AODV routing protocol and Ad-Hoc mobile network topology size and node speed as simulation estimation-factor to analysis traffic performance. As the result of the simulation, we identify that TCP /Reno was more sensitive than TCP/Sack about node speed and a number of the node.

• The Journal of Korean Association of Computer Education
• /
• v.7 no.1
• /
• pp.45-53
• /
• 2004

Ad-Hoc network is wireless network architecture without infrastructure. We encounter new types of security problems in Ad-Hoc networks because such networks have little or no support from infrastructure. Thus, wireless communications need security mechanisms in order to guarantee the integrity and the privacy of the communication, as well as the authentication of the entities involved. Many practical systems have been proposed. The most familiar system is the Diffie-Hellman key distribution system. This algorithm allows the establishment of a cryptographic secret key between two entities. If more than two users want to compute a common key, then a group key agreement system is used. This paper discusses several group key agreement systems and presents two efficient fault tolerant methods to perform successful group key agreement.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.8
• /
• pp.1011-1017
• /
• 2019

This paper proposes reinforcement learning to solve the node-disjoint path problem which establishes multipath for reliable data transmission in wireless ad-hoc networks. The node-disjoint path problem is a problem of determining a plurality of paths so that the intermediate nodes do not overlap between the source and the destination. In this paper, we propose an optimization method considering transmission distance in a large-scale wireless ad-hoc network using Q-learning in reinforcement learning, one of machine learning. Especially, in order to solve the node-disjoint path problem in a large-scale wireless ad-hoc network, a large amount of computation is required, but the proposed reinforcement learning efficiently obtains appropriate results by learning the path. The performance of the proposed reinforcement learning is evaluated from the viewpoint of transmission distance to establish two node-disjoint paths. From the evaluation results, it showed better performance in the transmission distance compared with the conventional simulated annealing.

• The Journal of the Korea Contents Association
• /
• v.9 no.8
• /
• pp.49-56
• /
• 2009

In this paper, we propose a method of energy level, node degree and selection information based CDS(Connected Dominating Set) construction algorithm for more efficient routing in ad-hoc wireless networks. Constructing CDS in ad-hoc wireless network, it is necessary to make more efficient algorithm that is faster, more simple and has low power consumption. A CDS must be minimized because nodes in the CDS consume more energy in order to handle various bypass traffics than nodes outside the set. It is better not to reconstruct CDS after constructing the most efficient CDS. To overcome this problem, we proposed the CDS construction algorithms based on EL+ND+Sel method. We compared and estimated the performance in each situation of EL + ND and EL + ND + Sel.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.05a
• /
• pp.1179-1182
• /
• 2006

Ad Hoc 무선망은 기존 인프라에 영향을 받지 않으면서, 노드들이 네트워크를 구성하기 때문에 TCP의 혼잡(Congestion) 제어가 나쁜 영향을 미친다. 기존의 TCP에 무선망의 요소와 거리에 따른 노드 홉수의 영향을 반영해서 새로운 환경에 적합한 TCP를 개선해야한다. 본 논문에서는 혼잡의 원인을 구별하여, 패킷 손실을 최소화할 수 있는 알고리즘을 제안한다.

• 한국ITS학회:학술대회논문집
• /
• 2008.11a
• /
• pp.114-117
• /
• 2008

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3A
• /
• pp.276-287
• /
• 2004

An ad hoc network is infra(Base Sstation or Access Point) free wireless mobile communication technology. Mobile nodes function as routers and servers in ad hoc networks. Many routing protocols for ad hoc network have been proposed. If any route is broken owing to moving node, source must repair broken route again. But route repair technology after route collapses is not suitable to transmit real-time data packet for QoS guarantee. So this paper presents route repair technology that prevents route from breaking. If intermediate node moves to critical section, the node issues handoff packet and sends the packet to the next node. After next node receives handoff packet, the node broadcasts route request packet to the previous node for intermediate node. Finally, even if intermediate node moves out of the routing region, the source can continuously transmit data packets to the destination through the new path.