• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.11
• /
• pp.2052-2067
• /
• 2011

Complementary trees are two spanning trees rooted at the sink node satisfying that any source node's two paths to the sink node on the two trees are node-disjoint. Complementary trees routing strategy is a special node-disjoint multi-path routing approach. Several complementary trees routing algorithms have been proposed, in which path discovery methods based on depth first search (DFS) or Dijkstra's algorithm are used to find a path for augmentation in each round of path augmentation step. In this paper, a novel path discovery method based on multi-tree-growing (MTG) is presented for the first time to our knowledge. Based on this path discovery method, a complementary trees routing algorithm is developed with objectives of low average path length on both spanning trees and low complexity. Measures are employed in our complementary trees routing algorithm to add a path with nodes near to the sink node in each round of path augmentation step. The simulation results demonstrate that our complementary trees routing algorithm can achieve low average path length on both spanning trees with low running time, suitable for wireless sensor networks in industrial scenarios.

• Journal of KIISE:Information Networking
• /
• v.32 no.6
• /
• pp.659-667
• /
• 2005

A Mobile Ad Hoc Network(MANET) is a multi hop wireless network with no prepared base stations or centralized administrations, where flocks of peer systems gather and compose a network. Each node operates as a normal end system in public networks. In addition to it, a MANET node is required to work as a router to forward traffic from a source or intermediate node to others. Each node operates as a normal end system in public networks, and further a MANET node work as a router to forward traffic from a source or intermediate node to the next node via routing path. Applications of MANET are extensively wide, such as battle field or any unwired place; however, these are exposed to critical problems related to network management, node's capability, and security because of frequent and dynamic changes in network topology, absence of centralized controls, restricted usage on network resources, and vulnerability oi mobile nodes which results from the special MANET's character, shared wireless media. These problems induce MANET to be weak from security attacks from eavesdropping to DoS. To guarantee secure authentication is the main part of security service In MANET because networks without secure authentication are exposed to exterior attacks. In this paper, a multistage authentication strategy based on CGSR is proposed to guarantee that only genuine and veritable nodes participate in communications. The proposed authentication model is composed of key manager, cluster head and common nodes. The cluster head is elected from secure nodes, and key manager is elected from cluster heads. The cluster head will verify other common nodes within its cluster range in MANET. Especially, ID of each node is used on communication, which allows digital signature and blocks non repudiation. For performance evaluation, attacks against node authentication are analyzed. Based on security parameters, strategies to resolve these attacks are drawn up.

• Journal of Communications and Networks
• /
• v.18 no.2
• /
• pp.261-269
• /
• 2016

In this paper, the impact of energy constraints on a two-hop network with a source, a relay and a destination under random medium access is studied. A collision channel with erasures is considered, and the source and the relay nodes have energy harvesting capabilities and an unlimited battery to store the harvested energy. Additionally, the source and the relay node have external traffic arrivals and the relay forwards a fraction of the source node's traffic to the destination; the cooperation is performed at the network level. An inner and an outer bound of the stability region for a given transmission probability vector are obtained. Then, the closure of the inner and the outer bound is obtained separately and they turn out to be identical. This work is not only a step in connecting information theory and networking, by studying the maximum stable throughput region metric but also it taps the relatively unexplored and important domain of energy harvesting and assesses the effect of that on this important measure.

• International Journal of Computer Science & Network Security
• /
• v.21 no.8
• /
• pp.342-352
• /
• 2021

Multicast Routings is a big challenge due to limitations such as node power and bandwidth Mobile Ad-hoc Network (MANET). The path to be chosen from the source to the destination node requires protocols. Multicast protocols support group-oriented operations in a bandwidth-efficient way. While several protocols for multi-cast MANETs have been evolved, security remains a challenging problem. Consequently, MANET is required for high quality of service measures (QoS) such infrastructure and application to be identified. The goal of a MANETs QoS-aware protocol is to discover more optimal pathways between the network source/destination nodes and hence the QoS demands. It works by employing the optimization method to pick the route path with the emphasis on several QoS metrics. In this paper safe routing is guaranteed using the Secured Multicast Routing offered in MANET by utilizing the Ant Colony Optimization (ACO) technique to integrate the QOS-conscious route setup into the route selection. This implies that only the data transmission may select the way to meet the QoS limitations from source to destination. Furthermore, the track reliability is considered when selecting the best path between the source and destination nodes. For the optimization of the best path and its performance, the optimized algorithm called the micro artificial bee colony approach is chosen about the probabilistic ant routing technique.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.3
• /
• pp.16-21
• /
• 2010

In this paper, the linear source and relay precoders are designed for AF MIMO relay systems. In order to minimize mean squared error (MSE) of received symbol vector, the source and relay precoders are proposed, and MMSE receiver which is suitable to those precoders is utilized at the destination node. As the optimal precoders for source and relay nodes are not represented in closed form and induced by iterative method, we suggest a simple precoder design scheme. Simulation results show that the performance of the proposed precoding scheme is comparable with that of optimal scheme and outperforms other relay precoding schemes. Moreover, in high SNR region, it is revealed that SNR between source and relay node is more influential than SNR between relay and destination node in terms of bit error rate.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.5
• /
• pp.53-58
• /
• 2011

In this paper, we firstly propose a novel cooperative transmission protocol, which utilizes the advantages of mid-notes in the route from the source to the destination. Taking benefits from balancing between the received packet from the source and acknowledge message from the destination, the mid-node between the source and the destination is firstly considered to be the broadcaster. If its signal is successfully received from the source, it leads to consider the next nodes, which has closer distance to the destination than it. If one of these nodes correctly receives the signal, it performs broadcasting the signal to the destination instead of mid-node. Otherwise, the mid-node directs attention to these nodes being near to the destination. As the result, some nodes are unnecessary to be considered and passed over time. After that, we analyze some published selection relaying schemes based on geographic information to choose the best nodes instead of the instantaneous SNR as before. Finally, simulation results are given to demonstrate the correctness of the performance analyses and show the significant improvement of the selection relaying schemes based geographic information compared to the other ones.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.9B
• /
• pp.847-856
• /
• 2009

In geographic routing for wireless sensor networks, sources need the location of sinks destined for delivering their data packets. Most of the existing geographic routing protocols merely assume that the sources can get the locations of sinks by some location service. How source nodes find out the location of sinks is not easy. In this paper, we propose a sink location dissemination scheme in geographic routing for wireless sensor networks. In this scheme, a source node and a sink node send sink location announcement and query messages along two paths respectively by geographic routing. The node located on the crossing point of the two paths informs the source about the sink location. Then the source can send data packet to the sink by geographic routing. How to guarantee that these two paths have at least one crossing point in any irregular profile of sensor network is the challenge of this paper Simulation results show that our protocol is significantly superior to other protocols in terms of energy consumption and control overhead.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.7A
• /
• pp.562-567
• /
• 2009

In this paper, two-hop beamforming relay system, with source, relay, and destination nodes, is considered and the transmit- and receive-beamforming vectors and the relay processing matrix are designed for minimizing a mean square error (MMSE) between the transmit and receive signals. Here, to reduce the transmit power of the source or the relay, two local inequality constraints are involved with MMSE problem. By adopting the Lagrange method, closed formed Karush-Kuhn-Tucker (KKT) conditions (equalities) are derived and an iterative algorithm is developed to solve the entangled KKT equalities. Due to the inequality power constraints, the source or the relay can reduce its transmit power when the received signal-to-noise ratios (SNRs) of the first- and the second-hop are different. Meanwhile, the destination can achieve almost identical bit-error-rate performance compared to an optimal beamforming system maximizing the received SNR. This claim is supported by a computer simulation.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.1
• /
• pp.55-62
• /
• 1996

MRNS network is a general algebraic structure of Hypercube network which has recently drawn considerable attention to supercomputing and message-passing communication. In this paper, we investigate the routing of a message in an n- dimensional MRNS network that is a key to the performance of this network. On the n-dimensional MRNS network we would like to transmit packets from a source node to a destination node simultaneously along a fixed number of paths, where the superscript packet will traverse along the superscript path. In order for all packets to arrive at the destination node quickly and securely, the ith path must be node-disjoint from all other paths. By investigating the conditions of node-disjoint paths, we will employ the special matrices called as the Hamiltonian Circuit Latin Square(HCLS) described in 〔1〕to construct a set of node-disjoint paths and suggest a linear-time parallel routing algorithm for the MRNS network.

• Journal of Digital Convergence
• /
• v.12 no.1
• /
• pp.339-345
• /
• 2014

This study has a purpose that improves efficiency of energy management and adaptation followed by movement of node better than the various early studied routing techniques. The purpose of this paper is the technique that uses RSSI value and location of sensor that is received by each sensor node to routing. This sduty does not save node information of 1-hop distance. And it solves energy-inefficient traffic problem that happens during data exchange process for middle node selection in close range multi hop transmission technique. The routing protocol technique that is proposed in this study selects a node relevant to the range of transmission which is set for RSSI value that is received by each node and selects the closest node as a middle node followed by location data. Therefore, it is for not exhaustion of node's energy by managing energy efficiently and cutting data transmission consuming until the destination node.