Seungjin Park

Bio: Seungjin Park is an academic researcher from University of Southern Indiana. The author has contributed to research in topics: Mobile ad hoc network & Wireless ad hoc network. The author has an hindex of 8, co-authored 27 publications receiving 648 citations. Previous affiliations of Seungjin Park include Michigan Technological University & Merrimack College.

Black hole attack in mobile Ad Hoc networks

Abstract: The black hole problem is one of the security attacks that occur in mobile ad hoc networks (MANETs). We present two possible solutions. The first is to find more than one route to the destination. The second is to exploit the packet sequence number included in any packet header. Computer simulation shows that compared to the original ad hoc on-demand distance vector (AODV) routing scheme, the second solution can verify 75% to 98% of the route to the destination depending on the pause times at a minimum cost of the delay in the networks.

An efficient reliable one-hop broadcast in mobile ad hoc networks

Abstract: A reliable one-hop broadcast is a fundamental communication primitive in mobile ad hoc networks in which a message from the source node is guaranteed to be delivered to all nodes within the source node's transmission range. Despite the importance of it, reliable one-hop broadcast is not easy to accomplish due to collisions in wireless networks known as Hidden Terminal Problem. This paper presents a MAC protocol that not only guarantees reliable one-hop broadcast but also achieves it efficiently by exploring as many simultaneous executions of the communication as possible. In addition to the data packets, the proposed algorithm utilizes the control packets that prevent packet collisions, and at the same time, make the simultaneous communications possible to improve the network throughput. Simulation results show the effectiveness of the proposed algorithm.

Fault-tolerant wormhole routing algorithms in meshes in the presence of concave faults

Abstract: A fault ring is a connection of only nonfaulty adjacent nodes and links such that the interior of the ring contains only faulty components. This paper proposes two wormhole routing algorithms that deal with more relaxed shapes of fault rings than previously known algorithms in the mesh networks. As a result, the number of components to be made disabled would be reduced considerably in some cases. First algorithm, called F4, uses four virtual channels and allows all four sides of fault rings to contain concave shapes. Second algorithm, F3, permits up to three sides to contain concave shapes using only three virtual channels. Both F3 and F4 are free of deadlock and livelock and guarantee the delivery of messages between any pair of nonfaulty and connected nodes in the network.

Reliable one-hop broadcasting (ROB) in mobile ad hoc networks

Abstract: Although many algorithms are built on the existence of reliable one-hop broadcasting, reliability is very hard to achieve in MANETs due to the node mobility and hidden terminal problem. This paper proposes a new reliable one-hop broadcast algorithm, called Reliable One-Hop Broadcasting (ROB). Unlike other algorithms that consider the collisions as useless, ROB utilizes the collisions as an indication and measurement of completion of the broadcast. Our simulation results using ns-2 show that ROB outperforms unreliable broadcasting by up to 400% in terms of number of retransmissions when network density is high.

Anticipated route maintenance (ARM) in location-aided mobile ad hoc networks

Abstract: Mobile ad hoc networks are composed of moving wireless hosts which, when within range of each other, form wireless networks. For communication to occur between hosts that are not within each other's range, routes involving intermediate nodes must be established; however, since the hosts may be in motion, a host that was part of a route may move away from its upstream and downstream partners, thus breaking the route. Our work shows that by utilizing only local geographic information (now a part of some route finding algorithms), a host can anticipate its neighbor's departure and, if other hosts are available, choose a host to bridge the gap, keeping the path connected. We present a distributed algorithm that anticipates route failure and performs preventative route maintenance using location information to increase a route lifespan. The benefits are that this reduces the need to find new routes (which is very expensive) and prevents interruptions in service. Simulation shows that as the density of nodes increase the chance to successfully utilize our route maintenance approach increases, and so does the savings.

Security in mobile ad hoc networks: challenges and solutions

Abstract: Security has become a primary concern in order to provide protected communication between mobile nodes in a hostile environment. Unlike the wireline networks, the unique characteristics of mobile ad hoc networks pose a number of nontrivial challenges to security design, such as open peer-to-peer network architecture, shared wireless medium, stringent resource constraints, and highly dynamic network topology. These challenges clearly make a case for building multifence security solutions that achieve both broad protection and desirable network performance. In this article we focus on the fundamental security problem of protecting the multihop network connectivity between mobile nodes in a MANET. We identify the security issues related to this problem, discuss the challenges to security design, and review the state-of-the-art security proposals that protect the MANET link- and network-layer operations of delivering packets over the multihop wireless channel. The complete security solution should span both layers, and encompass all three security components of prevention, detection, and reaction.

A survey of routing attacks in mobile ad hoc networks s ecurity i n w ireless m obile a d h oc a nd s ensor n etworks

Abstract: Recently, mobile ad hoc networks became a hot research topic among researchers due to their flexibility and independence of network infrastructures, such as base stations. Due to unique characteristics, such as dynamic network topology, limited bandwidth, and limited battery power, routing in a MANET is a particularly challenging task compared to a conventional network. Early work in MANET research has mainly focused on developing an efficient routing mechanism in such a highly dynamic and resource-constrained network. At present, several efficient routing protocols have been proposed for MANET. Most of these protocols assume a trusted and cooperative environment. However, in the presence of malicious nodes, the networks are vulnerable to various kinds of attacks. In MANET, routing attacks are particularly serious. In this article, we investigate the state-of-the-art of security issues in MANET. In particular, we examine routing attacks, such as link spoofing and colluding misrelay attacks, as well as countermeasures against such attacks in existing MANET protocols.

A survey of routing attacks in mobile ad hoc networks

Abstract: Recently, mobile ad hoc networks became a hot research topic among researchers due to their flexibility and independence of network infrastructures, such as base stations. Due to unique characteristics, such as dynamic network topology, limited bandwidth, and limited battery power, routing in a MANET is a particularly challenging task compared to a conventional network. Early work in MANET research has mainly focused on developing an efficient routing mechanism in such a highly dynamic and resource-constrained network. At present, several efficient routing protocols have been proposed for MANET. Most of these protocols assume a trusted and cooperative environment. However, in the presence of malicious nodes, the networks are vulnerable to various kinds of attacks. In MANET, routing attacks are particularly serious. In this article, we investigate the state-of-the-art of security issues in MANET. In particular, we examine routing attacks, such as link spoofing and colluding misrelay attacks, as well as countermeasures against such attacks in existing MANET protocols.

A survey of black hole attacks in wireless mobile ad hoc networks

Abstract: The black hole attack is one of the well-known security threats in wireless mobile ad hoc networks. The intruders utilize the loophole to carry out their malicious behaviors because the route discovery process is necessary and inevitable. Many researchers have conducted different detection techniques to propose different types of detection schemes. In this paper, we survey the existing solutions and discuss the state-of-the-art routing methods. We not only classify these proposals into single black hole attack and collaborative black hole attack but also analyze the categories of these solutions and provide a comparison table. We expect to furnish more researchers with a detailed work in anticipation.