• IEMEK Journal of Embedded Systems and Applications
• /
• v.14 no.3
• /
• pp.113-121
• /
• 2019

Algorithms for geographical routing and location update attract the researchers' interests in wireless ad hoc networks. Even though many various schemes have been proposed, most of them cause scalability problem in small groups of nodes. To defeat this problem, flooding algorithm is widely utilized due to low complexity. However, there is no previous research work to evaluate flooding algorithm through implementation instead of simulation. In this paper, we present implementation of flooding algorithm on Raspberry Pi and performance evaluation results.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.6
• /
• pp.43-48
• /
• 2009

Wireless mesh networks, unlike Ad-hoc network, has low mobility and multi-path communication between terminals and other networks because it has the backbone structures. Most studies are advanced on finding the optimal routing path in multi-hop wireless mesh network environment. Various routing metric, minimum number of hops(Hop_count) and ETX, ETT metric, are proposed to wireless mesh networks. However, most metrics cannot identify the high throughput routing paths because this metric uses a different measurement parameters in each direction. So actual delivery rate does not provide to this metric. This paper describes the metric and implementation of IETC as a metric. This paper shows the improvement in performance.

• The Journal of Engineering Research
• /
• v.7 no.1
• /
• pp.37-51
• /
• 2005

An and hoc network is a collection of wireless mobile nodes forming a temporary network without the centralized administration. Due to the limited transmission range of wireless work interface, multiple networks "hops" maybe needed for one node to exchange data with adjacent node. In recent years, a variety of new routing protocol about ad hoc network was developed. This paper presents a new routing protocol based on the Dynamic Source Routing which is not suitable for the high mobility ad hoc network. The Enhanced DR adapts quickly to routing changes when node movement is frequent. When a trunk route is broken, this protocol will utilize the alternative route saved in the route to discovery quickly the new route. It improves the performance of the existing DSR algorithm, so that the negative impacts from weakness of DSR are reduced.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.1
• /
• pp.92-101
• /
• 2012

Security support is a significant factor in ad hoc networks. Especially in dynamic topologies, key agreement with private key updating is essential in providing a secure system. And it is also necessary to protect the identities of individual nodes in wireless environments to avoid personal privacy problems. However, many of the existing key agreement schemes for ad hoc networks do not consider these issues concurrently. This paper proposes an anonymous ID-based private key update scheme and a key agreement scheme for mobile ad hoc networks. We also suggest a method of rekeying between different domains using service-coordinators. These schemes are secure against various attacks and are suitable for service-oriented mobile ad hoc networks.

• Journal of Advanced Navigation Technology
• /
• v.11 no.1
• /
• pp.118-126
• /
• 2007

An ad hoc network is a system of wireless mobile nodes that dynamically self-organize in arbitrary and temporary network topologies allowing people and devices to internetwork without any preexisting communication infrastructure. Although ad hoc network is attractive solution, there are still some major flaws that prevent commercial growth. Security is one of these main barriers; ad hoc networks are known to be particularly vulnerable to security attack. It is difficult to establish a centralized key distribution center and a trusted certification authority to provide cryptographic keys and digital certificates to nodes. To prevent attacks in ad hoc routing protocols, many algorithms have been used. In this paper, we have depicted a secure framework for multipath routing in wireless multihop network, which is comprehensive solution for secure data forwarding in wireless multihop networks. With the simulation results, the proposed scheme is compared with existing source routing scheme.

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

Mobile IP has been designed to have mobile host users move from place to plate without changing their IP address. Ad-hoc network is a provisional network whose mobile host users construct networks by themselves without any assistance of infra structure network, using wireless interface. In this paper we discuss the scheme with which Ad-hoc network users ran access the Internet freely, using mobile IP protocol, and Ad-hot networks are access networks in the spotlight. In this paper we propose algorithm that support enhanced mobility between two Ad-hoc networks applying mobile IP at Ad-hoc routing protocol.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.3
• /
• pp.25-33
• /
• 2008

In this paper, the transmit power minimization for Poisson distributed wireless ad-hoc relay networks in Rayleigh fading channels is considered. We investigate two power allocation methods one is a minimum power allocation (MPA) strategy and the other is an equal outage power allocation (EOPA) strategy. We analyze the total transmit power of two allocation methods under the given end-to-end outage probability constraint. Our results show that the MPA achieves more power saving than EOPA, and the power saving is more significant as the number of relay nodes increases.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2000.11a
• /
• pp.97-101
• /
• 2000

Energy consumption is considered as a principal ingredient in mobile wireless ad-hoc networks. In such a network, most of mobile nodes takes a role in forwarding messages received from neighbor nodes. Energy of these nodes is consumed in different rates depending on message traffic routes. This paper proposes a scheme to balance routing energy consumption by transferring routing function from node with small residual energy to node with enough residual energy. This scheme requires additional local message transfer, increasing the energy consumption of nodes to transfer routing function, and increasing total energy consumption of ad-hoc network. But balancing of energy consumption make the system lifetime the longer and increase the average node lifetime.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.23 no.8
• /
• pp.976-984
• /
• 2012

Ad hoc networks can be used under difficult conditions, where it is difficult to construct infrastructures, such as shadowing areas, disaster areas, war area, and so on. In order to support to considerable and various wireless services, more spectrum resources are needed. However, efficient utilization of the frequency resource is difficult because of spectrum scarcity and the conventional frequency regulation. Ad-hoc networks employing cognitive radio(CR) system that guarantee high spectrum utilization provide effective way to increase the network capacity. However, there is a problem that all CR user do not fairly use the primary user's idle bandwidth which has been sensed. In this paper, to solve this problem, we propose the spectrum sharing algorithm which uses the multiple orthogonal sequences based on the code division multiple access(CDMA). From the proposed algorithm, it is expected that system performance of CR based ad-hoc network is improved significantly and it can be applied to the implementation of CR based ad-hoc network system.

• 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.