• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.11
• /
• pp.1084-1093
• /
• 2012

For large multihop networks, large time synchronization (TS) errors can accumulate with conventional methods, such as TPSN, RBS, and FTSP, since they need a large number of hops to cover the network. In this paper, a method combining Concurrent Cooperative Transmission (CCT) and Semi- Cooperative Spectrum Fusion (SCSF) is proposed to reduce the number of hops to cover the large network. In CCT, cooperating nodes transmit the same digitally encoded message in orthogonal channels simultaneously, so receivers can benefit from array and diversity gains. SCSF is an analog cooperative transmission method where different cooperators transmit correlated information simultaneously. The two methods are combined to create a new distributed method of network TS, called the Cooperative Analog and Digital (CANDI) TS protocol, which promises significantly lower network TS errors in multi-hop networks. CANDI and TPSN are compared in simulation for a line network.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.5
• /
• pp.196-208
• /
• 2005

In multiprocessor systems, interconnection network design is critical for overall system performance. Popular interconnection networks, which are generally considered, are meshes, rings, and hierarchical rings. In this paper, we propose (')Torus Ring('), which is a modified version of hierarchical ring. Torus Ring has the same complexity as the hierarchical rings, but the only difference is the way it connects the local rings. It has an advantage over the hierarchical rings when the destination of a packet is the neighbor local ring in the reverse direction. Though the average number of hops in Torus Ring is equal to that of the hierarchical rings when assuming the uniform distribution of each transaction, the benefits of the number of hops are expected to be larger because of the spatial locality in the real environment of parallel programming. In the simulation results, latencies in the interconnection network are reduced by up to 19$\%$, and the execution times are reduced by up to 10$\%$.

• Journal of Internet Computing and Services
• /
• v.7 no.6
• /
• pp.175-183
• /
• 2006

An ad-hoc network is a group of mobile nodes acting as routers. The of hoc node has a precondition of mobility, allowing path to be easily disconnected when transmitting data, thereby increasing network overhead. However, most of hoc routing protocols set up the path based only on the number of hops without considering other practical factors. Here we consider a path with the least substantial number of transmission (SNT) from source to destination based on reliabilities of links. This includes retransmissions due to unreliable links. In this paper, an efficient ad-hoc link reliability based routing (PU) protocol suitable for mobile ah-hoc network in terms of SNT, is proposed. The network overhead and data transmission delay ore reduced, by considering both ad-hoc link reliability and the number of hops. Our empirical performance evaluation comparing to AODV (8) shows that the enhancement is up to about 31% for SNT depending upon the mobility of nodes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.7B
• /
• pp.469-476
• /
• 2008

In this paper we analyze the packet interference probability and the aggregated throughput of a WPAN in which a number of Bluetooth piconets share the ISM band with WLANS. Using an Adaptive Frequency Hopping algorithm, when the AFH is employed, the number of hops available to the Bluetooth piconets varies depending on the number of independent WLANs within the piconet's radio range. Using a packet collision model in a piconet cluster, we give an analysis of the packet interference probability and the aggregated throughput as a function of the available hops for the AFH algorithm. We also present an analytical model of packet interference with multi-path fading channel in a cluster of piconets. Through analysis, we obtain the packet collision probability and aggregated throughput assuming capture effect. Numerical examples are given to demonstrate the effect of various Parameters such as capture ratio, Rice factor and cluster size on the system performance.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.815-818
• /
• 2015

AODV routing protocol, one of the most studied routing protocols for the Mobile Ad hoc Network (MANET), uses the number of hops as the metric to choose a path from a source node to a destination node. If the path is deteriorated, it will cause many problems to the communication. In order to improve the performance of the network, we propose AuM-AODV routing protocol that contains an auxiliary metric besides the number of hops. Nodes using AuM-AODV use control packets such as Route Request (RREQ), Route Reply (RREP), and HELLO to exchange information about network topology like AODV routing protocol. AuM-AODV routing protocol is implemented in NS-3 for performance evaluation. We use three performance metrics, that is to say, throughput, packet delivery ratio, and average end-to-end delay. According to numerical results, the new AuM-AODV routing protocol has better performance over three performance metrics than AODV routing protocol.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.9 no.1
• /
• pp.115-125
• /
• 1998

This paper examined the feasibility of adding a new NGSO/MSS(Non-Geostationary orbit/Mobile satellite service) service link to a frequency band which is already allocated to fixed-service microwave(M/W) system. To achieve this goal, the NGSO/MSS handset performance under the influence of the M/W multiple stations and the influence of handsets on the M/W station were both analyzed. Sharing criterions were also obtained by means of coordination contour in the former case, and handset capacity in the latter case. As the results, it was proven that sharing was feasible only when the vertical distance between handset and trendline was above 4 km except front and back points of M/W antenna bore sight under influence of 9 hops(the distance between hops = 50 km) M/W system on the NGSO/MSS handset, and only when the capacity of handset was below $7.0\times10^{-14}$ handsets/ $m^{2}$ under influence of handsets on the M/W station.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.2
• /
• pp.254-259
• /
• 2008

Mesh WLANs, which consist of wireless mesh routers connecting each other in a mesh topology and self-operate after their autoconfiguration, have several advantages in convenience, swiftness and flexibility of deployment and operation over existing WLANs the expansions of which are done by connecting the APs with wires. However, many technical issues still remain to be solved. Among them, network performance degradations due to the interference between the adjacent hops in multi-hop mesh WLANs, and the reusability of the existing wireless network protocols are critical problems to be answered. This work evaluates the VoIP support performance of IEEE 802.11a/g-based mesh WLANs with multiple wireless interfaces with simulations. The results show that there exit an unfairness in VoIP packet delay performances among mobile routers located at different hops, and that although the capacity of the admitted calls can be increased by increasing the size of voice packet payload it is far less than the expected one. This suggests that the existing 802.11 MAC protocols have their limitation when applied in mesh networks and their enhancement or even a newer one nay be required.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4A
• /
• pp.579-585
• /
• 2000

This paper analyzes and compares the blocking performance of all-optical wavelength-routed networks providing circuit switching among users. A connection between two nodes along a particular path must use a single wavelength on all hops, or links, within the path. We then calculate the blocking probability along a lightpath with wavelength conversion in a network with an arbitrary topology and show the network performance improvement offered by node with limited translation technology. We also propose a new schematic method for the performance analysis of different types of network architecture which is composed of nodes with or without wavelength conversion(NC, FC or LC).

• IEMEK Journal of Embedded Systems and Applications
• /
• v.2 no.3
• /
• pp.138-144
• /
• 2007

Wireless Sensor Network(WSN) consists of a lot of light-weight sensor nodes with the capability of wireless communication. Studies have been done to improve stability and fault-tolerancy of WSN because the sensor nodes are basically vulnerable to the harsh environment. Specially, the time synchronization among sensor nodes becomes a challenging issue in WSN. All the local times should always keep the same with each other in the sensor field to perform data aggregation and energy-aware communication in WSN. In this paper, a new time synchronization technique is proposed to operate efficiently irrespective of the number of sensor nodes and the number of hops needed to cover all sensor nodes for synchronization. Simulation results show that the proposed technique has the lowest amount of packet traffic among the several time synchronization techniques.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.10
• /
• pp.2548-2566
• /
• 2012

This paper derives two main end-to-end performance metrics, namely the spatial capacity density and the average end-to-end delay of the multi-hop wireless ad hoc networks with multi-antenna communications. Based on the closed-form expressions of these performance metrics, three hopping strategies, i.e., the closest neighbor, the furthest neighbor and the randomly selected neighbor hopping strategies have been investigated. This formulation provides insights into the relations among node density, diversity gains, number of hops and some other network design parameters which jointly determine network performances, and a method of choosing the best hopping strategy which can be formulated from a network design perspective.