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

• Journal of Information Processing Systems
• /
• v.13 no.6
• /
• pp.1544-1553
• /
• 2017

The network coding mechanism has attracted much attention because of its advantage of enhanced network throughput which is a desirable characteristic especially in a multi-hop wireless network with limited link capacity such as the device-to-device (D2D) communication network of 5G. COPE proposes to use the XOR-based network coding in the two-hop wireless network topology. For multi-hop wireless networks, the Distributed Coding-Aware Routing (DCAR) mechanism was proposed, in which the coding conditions for two flows intersecting at an intermediate node are defined and the routing metric to improve the coding opportunity by preferring those routes with longer queues is designed. Because the routes with longer queues may increase the delay, DCAR is inefficient in delivering real-time multimedia traffic flows. In this paper, we propose a network coding-aware routing protocol for multi-hop wireless networks that enhances DCAR by considering traffic load distribution and link quality. From this, we can achieve higher network throughput and lower end-to-end delay at the same time for the proper delivery of time-sensitive data flow. The Qualnet-based simulation results show that our proposed scheme outperforms DCAR in terms of throughput and delay.

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

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.121-124
• /
• 2001

Dynamic Source Route(DSR) protocol is a simple and efficient routing protocol designed specially for use of the multi-hop Ad Hoc Network. DSR allows the network to be completely self-organized and self-configured without the need for any existing infrastructure or administration. DSR protocol consists of the two mechanisms of Router discovery and Router Maintenance, works entirely On-demand in all aspects. In this paper, we will present the performance of DSR protocol on the multi-hop wireless Ad Hoc Networks, illustrate it with simulation, and then analysis the algorism of DSR.

• The KIPS Transactions:PartC
• /
• v.15C no.4
• /
• pp.289-296
• /
• 2008

In wireless mesh network, studies on routing protocols have been actively carried out recently, and hop count is used as a major routing metric in destination-sequenced distance-vector (DSDV) routing protocol, which is a representative proactive routing protocol. Although hop-by-hop multi-path (HMP) DSDV and enhanced HMP (EHMP) DSDV routing protocols perform routing by considering both hop count and residual bandwidth within one hop distance nodes, it has a shortcoming that routing is carried out via non-optimal path from the aspect of end-to-end routing. In order to overcome the shortcoming, a cost-aware multi-path (CAMP) DSDV routing protocol is proposed in this paper, which considers hop count and end-to-end minimum residual bandwidth. Simulation results based on NS-2 show that the proposed routing protocol performs better than DSDV, HMP DSDV, and EHMP DSDV protocols from the aspect of throughput and packet delivery ratio, by appropriately using hop count and end-to-end minimum residual bandwidth information and has the same number of management messages with HMP DSDV and EHMP DSDV protocols.

• Journal of Korea Multimedia Society
• /
• v.18 no.8
• /
• pp.909-914
• /
• 2015

In wireless sensor networks, sensor nodes have a short transmission range and data is transferred from source to destination node using the multi-hop transmission. Sensor nodes are powered by battery and the link qualities are different, and the routing protocol in the wireless sensor network is one of the important technical issues. Multipath routing was proposed to reduce the data congestion and increase data throughput. In the multipath routing, however, each path can be interfered by the other path, and it can aggravate network performance. In this paper, we propose the multipath routing scheme for multi-rate wireless sensor networks. The multipath routing selects transmission paths to minimize transmission delay and path interference.

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

• Proceedings of the KIEE Conference
• /
• 2005.05a
• /
• pp.206-208
• /
• 2005

Wireless sensor network's value has increased greatly in recent years in the fields of Ubiquitous Computing that function as solution to reduce both the limitation and collision about RFID Technology. The research for wireless sensor network technology is proceeding with the research for various sensor nodes, powerful routing algorithms, securities for data transmission, and valid applications. This paper suggests that we make the new multi-hop routing algorithm using RSS in order to implement enhanced multi-hop routing algorithm. This paper should demonstrate that the routing algorithm using suggested RSS is superior to routing algorithm based on established BSDV(Destination Sequenced Distance Vector).

• ETRI Journal
• /
• v.36 no.6
• /
• pp.960-967
• /
• 2014

In this paper, an analytical framework is proposed for the optimization of network performance through joint congestion control, channel allocation, rate allocation, power control, scheduling, and routing with the consideration of fairness in multi-channel wireless multihop networks. More specifically, the framework models the network by a generalized network utility maximization (NUM) problem under an elastic link data rate and power constraints. Using the dual decomposition technique, the NUM problem is decomposed into four subproblems - flow control; next-hop routing; rate allocation and scheduling; power control; and channel allocation - and finally solved by a low-complexity distributed method. Simulation results show that the proposed distributed algorithm significantly improves the network throughput and energy efficiency compared with previous algorithms.