• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.12
• /
• pp.2243-2251
• /
• 2016

In this paper, we propose a theoretical model for characterization and upper bounds of [1,2]-domination set of network which has tree structure. In detail, we propose a theoretic model for upper bounds on [1,2]-domination set of a tree network which has some typical constrains. To that purpose, we introduce a graph theory to model and analyze the characteristics of tree structure networks. We assume a node subset D of a graph G=(V,E). We define that D is a [1,2]-dominant set if for any node v in set V which is not an element of a set D is adjacent to a node or two nodes of an element in a set D (that is, $1{\leq}{\mid}N({\upsilon}){\bigcap}D{\mid}{\leq}2$ for every node $v{\in}V-D$). The minimum cardinality of a [1,2]-dominating set of G, which is denoted by ${\gamma}_{[1,2]}(G)$, is called the [1,2]-domination number of G. In this paper, we show new upper bounds and characteristics about the [1,2]-domination number of tree.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.20 no.9
• /
• pp.914-923
• /
• 2009

Helix antennas have been widely applied to satellite TT&C, data communication and GPS receiver systems onboard military, remote sensing and communication purpose satellites. The helix antennas are known to be convenient to control impedance and radiation coverage characteristics with a maximum directivity in satellite z-axis. Waveguide horn is commonly used for radar system that needs ultra-wideband pulse for exploration ground radar and electromagnetic disability measurement etc. It has high efficiency and low reflection characteristics provided by the low-profile shape and suppressed radiation distortion. In this paper, a waveguide horn structure incorporated with helix antenna design is proposed for satellite applications that require ultra-wideband pulse radar and high rate RF data communication link to ground station over wide coverage area. The main design concern is to synthesize variable beam forming pattern based on modified horn-helix combination helicone structure such that multi-mission antenna is implemented applicable for TT&C, earth observation, high data rate transmission. Waveguide horn helps to reduce the overall antenna structure size by introduction fold type reflector connected to the tapered helix antenna. The next generation KOMPSAT satellite currently under development requires high-performance precision attitude control system. We present an initial design of a hybrid hern-helix antenna structure suitable for efficient RF communication module design of multi-purpose satellite systems.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.15 no.5
• /
• pp.62-70
• /
• 2016

Ensuring walkability in a city where pedestrians and vehicles coexist is an issue of critical importance. The relative relationship between vehicle transit and walkability improvements complicates the evaluation of walkability, which thus necessitates the formation of a quantitative standard by which a methodological measurement of walkability can be achieved inside the pedestrian network. Therefore, a model is determined whereby quantitative indices such as, but not limited to, experiences of accessibility, mobility, and convenience within the network are estimated. This research proposes the integration of space syntax theory and the logit path choice model in the evaluation of walkability. Space syntax theory assesses adequacy of the constructed pedestrian network through calculation of the link integration value, while the logit model estimates its safety, mobility, and accessibility using probability. The advantage of the integrated model hence lies in its ability to sufficiently reflect such evaluation measures as the integration value, mobility convenience, accessibility potential, and safety experienced by the demand in a quantitative manner through probability computation. In this research, the Dial Algorithm is used to arrive at a solution to the logit model. This process requires that the physical distance of the pedestrian network and the perceptive distance of space syntax theory be made equivalent. In this, the research makes use of network expansion to reflect wait times. The evaluation index calculated through the integrated model is reviewed and using the results of this sample network, the applicability of the model is assessed.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.1
• /
• pp.14-26
• /
• 2008

IP over Ethernet technology widely used as Internet access uses the ARP(Address Resolution Protocol) that translates an ip address to the corresponding MAC address. recently, there are ARP security attacks that intentionally modify the IP address and its corresponding MAC address, utilizing various tools like "snoopspy". Since ARP attacks can redirect packets to different MAC address other than destination, attackers can eavesdrop packets, change their contents, or hijack the connection. Because the ARP attack is performed at data link layer, it can not be protected by security mechanisms such as Secure Shell(SSH) or Secure Sockets Layer(SSL). Thus, in this paper, we classify the ARP attack into downstream ARP spoofing attack and upstream ARP redirection attack, and propose a new security mechanism using DHCP information for acquisition of IP address. We propose a "DHCP snoop mechanism" or "DHCP sniffing/inspection mechanism" for ARP spoofing attack, and a "static binding mechanism" for ARP redirection attack. The proposed security mechanisms for ARP attacks can be widely used to reinforce the security of the next generation internet access networks including BcN.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.8 s.350
• /
• pp.47-58
• /
• 2006

Due to the movement of nodes, ad-hoc networks suffer from the problems such as the decrease of data delivery ratio, the increase of end-to-end delay, and the increase of routing overhead. The backup routing schemes try to solve these problems by finding the backup routes during the route discovery phase and using them when a route fails. Generally the backup routing schemes outperform the single-path routing schemes in terms of data delivery ratio, end-to-end delay, and routing overhead when the nodes move rapidly. But when the nodes don't move rapidly, the backup routing schemes generate more routing traffics than the single-path routing schemes because they need to exchange packets to find the backup route. In addition, when the backup route fails earlier than the main route, it can not use the backup route because in many backup route algorithms, the backup route is found only at the initial route discovery phase. RBR(Reactive Backup Routing Algorithm) proposed in this paper is an algorithm that provides more stable data delivery than the previous backup routing schemes through the selective maintenance of backup route and the backup route rediscovery. To do that RBR prioritize the backup routes, and maintain and use them selectively Thus it can also decrease the routing overheads. Also, RBR can increase data delivery ratio and decrease delay because it reestablishes the backup route when the network topology changes. For the performance evaluation, OPNET simulator is used to compare RBR with the single-path routing scheme and some of the well known backup routing schemes.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.4
• /
• pp.131-138
• /
• 2015

One of the most conspicuous characteristics of a business model that pursues expanding customer relationship is that it tries to lock in customers by encouraging them to repeat purchase in the long-term with the help of "Follow" function in Social Networking Service (SNS), which enables producers to automatically register the customers as potentially important ones and to offer them customized marketing services. In the value chain of the agriculture sector, producers of agricultural products can use SNS functions to provide loyal customers with valuable information and experiences such as the real-time information of their farm and products, hidden stories about the whole process from seeding to harvesting, and the storage and cooking methods of their products. These activities help the producers invoke customers' desire to live in the farm and to grow the products themselves. They also raise the accessibility of the producers' websites as customers are able to share a variety of news and knowledge such as the release of new products. This means that the producers's websites are now functioning to enable the producers to perform sales and promotion related activities. It is a big leap from the traditional e-commerce business model where sales and promotion of a product were separated and could be connected only through outside links. This two-way, viral characteristics of marketing services using SNS facilitate customers to share product information and their purchase experience with each other, which leads to more effective and efficient communication within the customer community.

• Journal of Korean Society of Transportation
• /
• v.20 no.4
• /
• pp.135-150
• /
• 2002

The basic assumption of analytical Dynamic Traffic Assignment models is that traffic demand and network conditions are known as a priori and unchanging during the whole planning horizon. This assumption may not be realistic in the practical traffic situation because traffic demand and network conditions nay vary from time to time. The rolling horizon implementation recognizes a fact : The Prediction of origin-destination(OD) matrices and network conditions is usually more accurate in a short period of time, while further into the whole horizon there exists a substantial uncertainty. In the rolling horizon implementation, therefore, rather than assuming time-dependent OD matrices and network conditions are known at the beginning of the horizon, it is assumed that the deterministic information of OD and traffic conditions for a short period are possessed, whereas information beyond this short period will not be available until the time rolls forward. This paper introduces rolling horizon implementation to enable a multi-class analytical DTA model to respond operationally to dynamic variations of both traffic demand and network conditions. In the paper, implementation procedure is discussed in detail, and practical solutions for some raised issues of 1) unfinished trips and 2) rerouting strategy of these trips, are proposed. Computational examples and results are presented and analyzed.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.1
• /
• pp.179-187
• /
• 2014

The underlay protocol is a cognitive radio method in which secondary or cognitive users use the same frequency without affecting the quality of service (QoS) for the primary users. In addition, because of the broadcast characteristics of the wireless environment, some nodes, which are called eavesdropper nodes, want to illegally receive information that is intended for other communication links. Hence, Physical Layer Security is applied considering the achievable secrecy rate (ASR) to prevent this from happening. In this paper, a performance analysis of the amplify-and-forward scheme under an interference constraint and Physical Layer Security is investigated in the cooperative communication mode. In this model, the relays use an amplify-and- forward method to help transmit signals from a source to a destination. The best relay is chosen using an opportunistic relay selection method, which is based on the end-to-end ASR. The system performance is evaluated in terms of the outage probability of the ASR. The lower and upper bounds of this probability, based on the global statistical channel state information (CSI), are derived in closed form. Our simulation results show that the system performance improves when the distances from the relays to the eavesdropper are larger than the distances from the relays to the destination, and the cognitive network is far enough from the primary user.

• 전자공학회논문지 IE
• /
• v.43 no.3
• /
• pp.41-48
• /
• 2006

In this paper, we propose a new active queue management (AQM) scheme by utilizing the predictability of the Internet traffic. The proposed scheme predicts future traffic input rate by using the auto-regressive (AR) time series model and determines the future congestion level by comparing the predicted input rate with the service rate. If the congestion is expected, the packet drop probability is dynamically adjusted to avoid the anticipated congestion level. Unlike the previous AQM schemes which use the queue length variation as the congestion measure, the proposed scheme uses the variation of the traffic input rate as the congestion measure. By predicting the network congestion level, the proposed scheme can adapt more rapidly to the changing network condition and stabilize the average queue length and its variation even if the traffic input level varies widely. Through ns-2 simulation study in varying network environments, we compare the performance among RED, Adaptive RED (ARED), REM, Predicted AQM (PAQM) and the proposed scheme in terms of average queue length and packet drop rate, and show that the proposed scheme is more adaptive to the varying network conditions and has shorter response time.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.9
• /
• pp.54-62
• /
• 2015

Although NAND flash-based SSD (Solid-State Drive) provides superior performance in comparison to HDD (Hard Disk Drive), it has a major drawback in write endurance. As a result, the lifetime of SSD is determined by the workload and thus it becomes a big challenge in current technology trend of such as the shifting from SLC (Single Level Cell) to MLC (Multi Level cell) and even TLC (Triple Level Cell). Most previous studies have dealt with wear-leveling or improving SSD lifetime regarding hardware architecture. In this paper, we propose the optimal configuration of host I/O stack focusing on file system, I/O scheduler, and link power management using JEDEC enterprise workloads in terms of WAF (Write Amplification Factor) which represents the efficiency perspective of SSD life time especially for host write processing into flash memory. Experimental analysis shows that the optimum configuration of I/O stack for the perspective of SSD lifetime is MinPower-Dead-XFS which prolongs the lifetime of SSD approximately 2.6 times in comparison with MaxPower-Cfq-Ext4, the best performance combination. Though the performance was reduced by 13%, this contributions demonstrates a considerable aspect of SSD lifetime in relation to I/O stack optimization.