• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.652-653
• /
• 2016

In ad hoc networks, the neighbors of a transmitter often experience very different propagation and channel conditions, and therefore these neighbors will differ in their ability to recover information from a transmitted message. In this paper, the properties of a multiple routing scheme in ad hoc networks, based on a simulcast transmission that allocates randomly unequal transmission rates on multiple links according to the simulcast capabilities, are investigated.

• Journal of the Semiconductor & Display Technology
• /
• v.20 no.2
• /
• pp.67-72
• /
• 2021

MANET(Mobile Ad Hoc Network) is the structure in which a source node communicates with a destination node by establishing a route with neighbor nodes without using the existing wired or wireless network. Therefore, the routing protocol for MANET must correspond well to changes in the channel state of moving nodes, and should have simple operation, high reliability, and no routing loop. In this paper, the simulation was perform by using a traffic model with on/off two states provided by the NS-3 network simulator. Also, the duration of the ON state and the duration of the OFF state used the traffic where inter arrival time of data is irregular by generating random values with constant, exponential distribution, and Pareto distribution. The performance of the DSDV, OLSR, and AODV protocols was compare and analyzed using the generated traffic model.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.23 no.4
• /
• pp.557-564
• /
• 1986

This paper describes a standard cell placement strategy which consists of three kconsecutive steps` initial placement, iterative placement improvement, and string placement. In the initial placement step, cell placement was done by solving the linear ordering problem for a one-dimensional layout of standard cells and then zigzaging the resultant linear order width in the chip plane. The iterative placement improvement step is based on the iterative pairwise interchange using the estimated total routing length as a figure-or -merit. The string placement is used to reorder cells and terminals in each etandard cell row such that channel routing in the adjacent channels is not blocked by cyclic constraints and needs fewer routing tracks. The placement program is coded in PASCAL and kimplemented on a VAX-11/750 computer. Experimental results for several examples are included.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.1
• /
• pp.68-82
• /
• 2011

Wireless mesh networks (WMNs) provide high-speed backbone networks without any wired cable. Many researchers have tried to increase network throughput by using multi-channel and multi-radio interfaces. A multi-radio multi-channel WMN requires channel assignment algorithm to decide the number of channels needed for each link. Since the channel assignment affects routing and interference directly, it is a critical component for enhancing network performance. However, the optimal channel assignment is known as a NP complete problem. For high performance, most of previous works assign channels in a centralized manner but they are limited in being applied for dynamic network environments. In this paper, we propose a simple flow estimation algorithm and a hybrid channel assignment algorithm. Our flow estimation algorithm obtains aggregated flow rate information between routers by packet sampling, thereby achieving high scalability. Our hybrid channel assignment algorithm initially assigns channels in a centralized manner first, and runs in a distributed manner to adjust channel assignment when notable traffic changes are detected. This approach provides high scalability and high performance compared with existing algorithms, and they are confirmed through extensive performance evaluations.

• International journal of advanced smart convergence
• /
• v.13 no.1
• /
• pp.1-11
• /
• 2024

Cognitive small cell networks, consisting of macro-cells and small cells, are foreseen as a promising candidate solution to address 5G spectrum scarcity. Recently, many technological issues (such as spectrum sensing, spectrum sharing) related to cognitive small cell networks have been studied, but the common control channel (CCC) establishment problem has been ignored. CCC is an indispensable medium for control message exchange that could have a huge significant on transmitter-receiver handshake, channel access negotiation, topology change, and routing information updates, etc. Therefore, establishing CCC in cognitive small cell networks is a challenging problem. In this paper, we propose a potential game theory-based approach for CCC establishment in cognitive radio networks. We design a utility function and demonstrate that it is an exact potential game with a pure Nash equilibrium. To maintain the common control channel list (CCL), we develop a CCC update algorithm. The simulation results demonstrate that the proposed approach has good convergence. On the other hand, it exhibits good delay and overhead of all networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.2
• /
• pp.447-460
• /
• 1996

Network optimization and design procedures often separate quality of service (QOS) performance measures from reliability issues. This paper considers channel allocation and flow assignment (routing) in a network subject to link failures. Fault-tolerant channel allocation and flow assingments are determined which minimize network cost while maintaining QOS performance requirements. this approach is shown to yield significant network cost reductions compared to previous heuristic methods used in the design of packet switched network with unreliable links.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.04a
• /
• pp.249-251
• /
• 2014

This paper proposes a channel diversity based load-balancing cross-layer routing scheme for Wireless Mesh Networks (WMNs). The proposed scheme deals with channel diversity phase and load balancing phase in WMNs. Channel diversity factor $metric_{ch-d}$ and load balancing factor $f_{load}$ are defined and employed cooperatively as a combined path selection policy.

• Journal of Korea Water Resources Association
• /
• v.45 no.3
• /
• pp.243-252
• /
• 2012

The objective of this study is to analyze lateral inflow hydrologically. The IUH of lateral inflow is sum of the impulse responses of total cells in basin. This IUH bases on the Muskingum channel routing method, which hydrologically re-analysed to represent it as a linear combination of the linear channel model considering only the translation and the linear reservoir model considering only the storage effect. Rectangular and triangular basins were used as imaginary basins and IUH of each basin were derived. The derived IUH have different characteristics with respect to basin's shape. The storage coefficient of lateral inflow was also derived mathematically using general definitions of concentration time and storage coefficient. As a result, the storage coefficient of lateral inflow could be calculated easily using basin's width, length and hydrological characteristics of channel.

• Journal of KIISE:Information Networking
• /
• v.36 no.5
• /
• pp.456-469
• /
• 2009

We develop a new wireless link quality metric, ECOT(Estimated Channel Occupancy Time) that enables a high throughput route setup in wireless mesh networks. The key feature of ECOT is to be applicable to diverse mesh network environments where IEEE 802.11 MAC (Medium Access Control) variants are used. We take into account the exact operational features of 802.11 MAC protocols, such as 802.11 DCF(Distributed Coordination Function), 802.11e EDCA(Enhanced Distributed Channel Access) with BACK (Block Acknowledgement), and 802.11n A-MPDU(Aggregate MAC Protocol Data Unit), and derive the integrated link metric based on which a high throughput end-to-end path is established. Through extensive simulation in random-topology settings, we evaluate the performance of proposed link metric and present that ECOT shows 8.5 to 354.4% throughput gain over existing link metrics.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.8 no.1
• /
• pp.1088-1096
• /
• 1966

The following is a method of synthetic unitgraph derivation based on the routing of a time area diagram through channel storage, studied by Clark-Jonstone and Laurenson. Unithy drograph (or unitgraph) is the hydrograph that would result from unit rainfall\ulcorner excess occuring uniformly with respect to both time and area over a catchment in unit time. By thus standarzing rainfall characteristics and ignoring loss, the unitgraph represents only the effects of catchment characteristics on the time distribution of runoff from a catchment The situation abten arises where it is desirable to derive a unitgraph for the design of dams, large bridge, and flood mitigation works such as levees, floodways and other flood control structures, and are also used in flood forecasting, and the necessary hydrologie records are not available. In such cases, if time and funds permit, it may be desirable to install the necessary raingauges, pruviometers, and stream gaging stations, and collect the necessary data over a period of years. On the otherhand, this procedure may be found either uneconomic or impossible on the grounds of time required, and it then becomes necessary to synthesise a unitgraph from a knowledge of the physical charcteristics of the catchment. In the preparing the approach to the solution of the problem we must select a number of catchment characteristic(shape, stream pattern, surface slope, and stream slope, etc.), a number of parameters that will define the magnitude and shape of the unit graph (e.g. peak discharge, time to peak, and base length, etc.), evaluate the catch-ment characteristics and unitgraph parameters selected, for a number of catchments having adequate rainfall and stream data and obtain Correlations between the two classes of data, and assume the relationships derived in just above question apply to other, ungaged, Catchments in the same region and, knowing the physical characteritics of these catchments, substitute for them in the relation\ulcorner ships to determine the corresponding unitgraph parameters. This method described in this note, based on the routing of a time area diagram through channel storage, appears to provide a logical line of research and they allow a readier correlation of unitgraph parameters with catchment characteristics. The main disadvantage of this method appears to be the error in routing all elements of rainfall excess through the same amount of storage. evertheless, it should be noted that the synthetic unitgraph method is more accurate than the rational method since it takes account of the shape and tophography of the catchment, channel storage, and temporal variation of rainfall excess, all of which are neglected in rational method.