• Journal of Industrial Technology
• /
• v.27 no.B
• /
• pp.43-51
• /
• 2007

In mobile multi-hop wireless networks, the authentication between a base station and a mobile multi-hop node, between multi-hop nodes, and between user a station and a multi-hop node is needed for the reliable and secure network operation. In this paper, we survey various authentication schemes which can be considered to be adopted in mobile multi-hop wireless networks and propose a concept of novel mutual authentication scheme applicable to mobile multi-hop network architecture. The scheme should resolve the initial trust gain problem of a multi-hop node at its entry to the network, the problem of rogue mobile multi-hop node and the problem of hop-by-hop authentication between multi-hop nodes. Effectively, the scheme is a hybrid scheme of the distributed authentication method and the centralized authentication method which are considered to be deployed in the wireless ad-hoc network and the wireless network connected to wired authentication servers, respectively.

• Journal of Advanced Marine Engineering and Technology
• /
• v.33 no.1
• /
• pp.120-130
• /
• 2009

In recent years, many mobile wireless communication devices and applications have been deployed on the planet. The mobile multi-hop wireless network models appeared to provide means to access to networks where few infrastructure exists. However, the mobile multi-hop wireless networks have weaker points in attacks and intrusions than the wired and one-hop wireless networks. In this paper, the secure routing issues in most mobile multi-hop wireless network models are surveyed in depth. The state-of-the-art technologies and research activities are explained. Finally, the issues and technologies for the secure routing specific to a maritime network model are sufficiently discussed as conclusions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2499-2522
• /
• 2017

Multi-hop networks are a low-setup-cost solution for enlarging an area of network coverage through multi-hop routing. Carrier sense multiple access with collision avoidance (CSMA/CA) is frequently used in multi-hop networks. Multi-hop networks face multiple problems, such as a rise in contention for the medium, and packet loss under heavy-load, saturated conditions, which consumes more bandwidth due to re-transmissions. The number of re-transmissions carried out in a multi-hop network plays a major role in the achievable quality of service (QoS). This paper presents a statistical, analytical model for the end-to-end delay of contention-based medium access control (MAC) strategies. These strategies schedule a packet before performing the back-off contention for both differentiated heterogeneous data and homogeneous data under saturation conditions. The analytical model is an application of Markov chain theory and queuing theory. The M/M/1 model is used to derive access queue waiting times, and an absorbing Markov chain is used to determine the expected number of re-transmissions in a multi-hop scenario. This is then used to calculate the expected end-to-end delay. The prediction by the proposed model is compared to the simulation results, and shows close correlation for the different test cases with different arrival rates.

• Proceedings of the KIEE Conference
• /
• 2003.11b
• /
• pp.279-282
• /
• 2003

This paper proposes a medium-access control(MAC) protocol designed for wireless multi-hop sensor networks which is used for connecting physical world and cyber computing space. Wireless multi-hop sensor networks use battery-operated computing and sensing device. We expect sensor networks to be deployed in an ad hoc fashion, with nodes remaining inactive for long time, but becoming suddenly active when specific event is detected. These characteristics of multi-hop sensor networks and applications motivate a MAC that is different from traditional wireless MACs about power conservation scheme, such as IEEE 802.11. Proposed MAC uses a few techniques to reduce energy consumption. Result show that proposed MAC obtains more energy sayings.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.1
• /
• pp.5-25
• /
• 2009

In recent years the popularity of multi-hop wireless networks has been growing. Its flexible topology and abundant routing path enables many types of applications. However, the lack of a centralized controller often makes it difficult to design a reliable service in multi-hop wireless networks. While packet routing has been the center of attention for decades, recent research focuses on data discovery such as file sharing in multi-hop wireless networks. Although there are many peer-to-peer lookup (P2P-lookup) schemes for wired networks, they have inherent limitations for multi-hop wireless networks. First, a wired P2P-lookup builds a search structure on the overlay network and disregards the underlying topology. Second, the performance guarantee often relies on specific topology models such as random graphs, which do not apply to multi-hop wireless networks. Past studies on wireless P2P-lookup either combined existing solutions with known routing algorithms or proposed tree-based routing, which is prone to traffic congestion. In this paper, we present two wireless P2P-lookup schemes that strictly build a topology-dependent structure. We first propose the Ring Interval Graph Search (RIGS) that constructs a DHT only through direct connections between the nodes. We then propose the ValleyWalk, a loosely-structured scheme that requires simple local hints for query routing. Packet-level simulations showed that RIGS can find the target with near-shortest search length and ValleyWalk can find the target with near-shortest search length when there is at least 5% object replication. We also provide an analytic bound on the search length of ValleyWalk.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.6
• /
• pp.114-121
• /
• 2008

Multi-path routing has been studied widely in wired networks. Multi-path routing is known to increase end-to-end throughput and provide load balancing in wired networks. However, its advantage is not obvious in wireless multi-hop network because the traffic along the multiple paths may interfere with adjacent paths. In the paper, we introduce a new multi-path routing scheme, Cluster-Based Multi-Path Routing for multi-hop wireless networks. The main idea of the proposed routing scheme is to extend the hop-by-hop multi-path to a cluster-by-cluster multi-path. In cluster network, each cluster can work independently from other clusters and hence reduce interference. The purpose of the proposed scheme is to find a less interfering path for wireless multi-hop networks. We also showed the throughput improvement of the proposed scheme through simulations.

• ETRI Journal
• /
• v.39 no.5
• /
• pp.729-736
• /
• 2017

This work investigates secure cluster-aided multi-hop randomize-and-forward networks. We present a hop-by-hop multi-hop transmission scheme with relay selection, which evaluates for each cluster the relays that can securely receive the message. We propose an analytical model to derive the secure connectivity probability (SCP) of the hop-by-hop transmission scheme. For comparison, we also analyze SCPs of traditional end-to-end transmission schemes with two relay-selection policies. We perform simulations, and our analytical results verify that the proposed hop-by-hop scheme is superior to end-to-end schemes, especially with a large number of hops or high eavesdropper channel quality. Numerical results also show that the proposed hop-by-hop scheme achieves near-optimal performance in terms of the SCP.

• Journal of Communications and Networks
• /
• v.13 no.1
• /
• pp.43-49
• /
• 2011

In this paper, a new medium access control (MAC) protocol entitled three-phase multiple access with continual contention resolution (TPMA-CCR) is proposed for wireless multi-hop ad hoc networks. This work is motivated by the previously known three-phase multiple access (TPMA) scheme of Hou and Tsai [2] which is the suitable MAC protocol for clustering multi-hop ad hoc networks owing to its beneficial attributes such as easy collision detectible, anonymous acknowledgment (ACK), and simple signaling format for the broadcast-natured networks. The new TPMA-CCR is designed to let all contending nodes participate in contentions for a medium access more aggressively than the original TPMA and with continual resolving procedures as well. Through the systematical performance analysis of the suggested protocol, it is also shown that the maximum throughput of the new protocol is not only superior to the original TPMA, but also improves on the conventional slotted carrier sense multiple access (CSMA) under certain circumstances. Thus, in terms of performance, TPMA-CCR can provide an attractive alternative to other contention-based MAC protocols for multi-hop ad hoc networks.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.15 no.1
• /
• pp.16-27
• /
• 2012

In multi-interface multi-channel(MIMC) based tactical ad hoc networks, QoS support for required operational capacity is one of the main challenging issues for multi-hop transmissions. To support QoS in such a harsh environment, we propose a novel MAC scheme to minimize multi-hop as well as per-hop delay. The current IEEE 802.11 MAC protocols should contend to reserve the channel resource at every hop by each sender. The every-hop channel contention results in a degradation of end-to-end delay for multi-hop transmissions. The basic idea of our scheme is to make a "multi-hop reservation" at the MAC layer by using the modified RTS frame. It contains additional information such as destination information, packet priority, and hop count, etc. In addition, we differentiate the contention window area according to the packet priority and the number of hops to deliver packets in the predefined allowed latency. Our scheme can minimize the multi-hop delay and support the QoS of the critical data in real time(i.e., VoIP, sensing video data, Video conference between commanders). Our simulation study and numerical analysis show that the proposed scheme outperforms the IEEE 802.11 MAC.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.5
• /
• pp.1091-1096
• /
• 2015

In this paper, WiMedia Distributed-MAC protocol is adopted for development of multi-hop N-screen wireless services. Furthermore, to provide the multi-hop OSMU (One Source Multi Use) N-screen service through P2P streaming in the D-MAC protocol, a new multi-hop resource reservation scheme is proposed and analyzed to reduce end to end delay. For this Multi-hop resource reservation scheme, a new MSCDRP (Multi-Stage Cooperative DRP) IE is proposed. Simulation results show that our multi-hop MSCDRP scheme reduces the end to end delay and increases throughput at various multi-hop N-screen network environment.