• Journal of KIISE:Information Networking
• /
• v.35 no.3
• /
• pp.192-206
• /
• 2008

Multihop is the main communication style for wireless sensor networks composed of tiny sensor nodes. Until now, most applications have treated the periodic small sized sensing data. Recently, the burst traffic with the transient and continuous nature is increasingly introduced due to the advent of wireless multimedia sensor networks. Therefore, the efficient communication protocol to support this trend is required. In this paper, we propose a novel PIGAB(Packet Interval Gap based on Adaptive Backoff) protocol to efficiently transmit the burst data in multihop wireless sensor networks. The contention-based PIGAB protocol consists of the PIG(Packet Interval Gap) control algorithm in the source node and the MF(MAC-level Forwarding) algorithm in the relay node. The PIGAB is on basis of the newly proposed AB(Adaptive Backoff), CAB(Collision Avoidance Backoff), and UB(Uniform Backoff). These innovative algorithms and schemes can achieve the performance of network by adjusting the gap of every packet interval, recognizing the packet transmission of the hidden node. Through the simulations and experiments, we identify that the proposed PIGAB protocol considerably has the stable throughput and low latency in transmitting the burst data in multihop wireless sensor networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.6A
• /
• pp.802-812
• /
• 2000

Multihop lightwave networks are the optical-fiber based local communication systems that employ WDM(Wavelength Division Multiplexing) technology to fully use the enormous fiber bandwidth without requiring any tunable tranceives. In this paper, we introduce a novel ShuffleNet topology, asymmetric bilayered ShuffleNet(ABS) topology as a multihop WDM network technique. For 1Gb/s transmission system, we compared ABS topology with previously reported ones in terms of common network parameters such as average number of hops, throughput, time delay, and network power function. Through the analysis, the performance of ABS topology was proven to be superior to the existing ones. To decrease the amount of hardware required for implementing ABS system, we also proposed a new WDM channel sharing scheme. For (2, 3) ShuffleNet topology system, the number of wavelengths needed in the system can be reduced dramatically from 96 to 4 by using new scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.2A
• /
• pp.133-138
• /
• 2011

This paper presents an information theoretic outage analysis for physical layer of a cooperative multihop wireless network. Our analysis shows that cooperation by selecting a proper relay at each hop increases the coverage or data rate of the network. In our analysis we consider both symmetric and asymmetric network model. We also investigate the availability of cooperative relay at each hop and show that end-to-end performance of the network depends on the relay selection procedure at each hop. We also verify our analytical results with simulations.

• ETRI Journal
• /
• v.35 no.2
• /
• pp.234-244
• /
• 2013

Internet protocol television (IPTV) service depends on the network quality of service (QoS) and bandwidth of the broadband service provider. IEEE 802.16j mobile multihop relay Worldwide Interoperability for Microwave Access networks have the opportunity to offer high bandwidth capacity by introducing relay stations. However, to actually satisfy QoS requirements for offering IPTV services (HDTV, SDTV, Web TV, and mobile TV) for heterogeneous users' requests, providers must use a video server for each IPTV service type, which increases the network load, especially bandwidth consumption and forwarding time. In this paper, we present a solution for forwarding IPTV video streaming to diverse subscribers via an 802.16j broadband wireless access network. In particular, we propose a new multicast tree construction and aggregation mechanism based on the unique property of prime numbers. Performance evaluation results show that the proposed scheme reduces both bandwidth consumption and forwarding time.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.05a
• /
• pp.77-80
• /
• 2017

One of the fundamental limits of Bluetooth Low Energy(BLE) is that the data transmission is available via singlehop connection. In this research, we suggested the stable multihop transmission method to overcome this limitation. In multihop connection situation, multiple singlehop connection should be made and disconnected dynamically. Therefore, we stored the data within the GATT layer and tried to send it dynamically. We divided whole process as 4 states, and let each nodes transfers around each states to make data connection safely. Also, we set the transfer policy between each states during the transmission to make a robust system. From the experiment in real-time environment, we proved that our method showed high rate of packet delivery in a multihop network, which consists of more than 3 nodes.

• Journal of KIISE
• /
• v.42 no.6
• /
• pp.791-800
• /
• 2015

In this paper, we propose the contribution-level-based opportunistic flooding in a wireless multihop network which achieves outstanding transmission efficiency and reliability. While the potential of the the predetermined relay node to fail in its receipt of broadcast packets is due to the inherent instability in wireless networks, our proposed flooding actually increases network reliability by applying the concept of opportunistic routing, whereby relay-node selection is dependent on the transmission result. Additionally, depending on the contribution level for the entire network, the proposed technique enhances transmission efficiency through priority adjustment and the removal of needless relay nodes. We use the NS-3 simulator to compare the proposed scheme with dominant pruning. The analysis results show the improved performance in both cases: by 35% compared with blind flooding from the perspective of the transmission efficiency, and by 20~70% compared to dominant pruning from the perspective of the reliability.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.2774-2796
• /
• 2015

Quality-of-service (QoS) provisioning for a cognitive mesh network (CMN) with heterogeneous services has become a challenging area of research in recent days. Considering both real-time (RT) and non-real-time (NRT) traffic in a multihop CMN, [1] studied cross-layer resource management, including joint access control, route selection, and resource allocation. Due to the complexity of the formulated resource allocation problems, which are mixed-integer non-linear programming, a low-complexity yet efficient algorithm was proposed there to approximately solve the formulated optimization problems. In contrast, in this work, we present an application of genetic algorithm (GA) to re-address the hard resource allocation problems studied in [1]. Novel initialization, selection, crossover, and mutation operations are designed such that solutions with enough randomness can be generated and converge with as less number of attempts as possible, thus improving the efficiency of the algorithm effectively. Simulation results show the effectiveness of the newly proposed GA-based algorithm. Furthermore, by comparing the performance of the newly proposed algorithm with the one proposed in [1], more insights have been obtained in terms of the tradeoff among QoS provisioning for RT traffic, throughput maximization for NRT traffic, and time complexity of an algorithm for resource allocation in a multihop network such as CMN.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.2
• /
• pp.303-310
• /
• 2014

We show improved throughput scaling laws for an ultra-wide band (UWB) ad hoc network, in which n wireless nodes are randomly located. First, we consider the case where a modified hierarchical cooperation (HC) strategy is used. Then, in a dense network of unit area, our result indicates that the derived throughput scaling depends on the path-loss exponent ${\alpha}$ for certain operating regimes due to the power-limited characteristics. It also turns out that the HC protocol is dominant for 2 < ${\alpha}$ < 3 while using the nearest multihop (MH) routing leads to a higher throughput for ${\alpha}{\geq}3$. Second, the impact and benefits of infrastructure support are analyzed, where m base stations (BSs) are regularly placed in UWB networks. In this case, the derived throughput scaling depends on ${\alpha}$ due to the power-limited characteristics for all operating regimes. Furthermore, it is shown that the total throughput scales linearly with parameter m as m is larger than a certain level. Hence, the use of either HC or infrastructure is helpful in improving the throughput of UWB networks in some conditions.

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

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.6
• /
• pp.229-234
• /
• 2007

In the IEEE 802.11 Wireless Local Area Networks (WLANs), network nodes experiencing collisions on the shared channel need to backoff for a random period of time. which is uniformly selected from the Contention Window (CW) This contention window is dynamically controlled by the Binary Exponential Backoff (BEB) algorithm. The BEB scheme suffers from a unfairness problem and low throughput under high traffic load. In this paper, I propose a new backoff algorithm for use with the IEEE 802.11 Distributed Coordination Function.