• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.10
• /
• pp.2338-2356
• /
• 2013

In cognitive radio networks, acquiring the position information of the primary user is critical to the communication of the secondary user. Localization of primary users can help improve the efficiency with which the spectrum is reused, because the information can be used to avoid harmful interference to the network while simultaneity is exploited to improve the spectrum utilization. Despite its inherent inaccuracy, received signal strength based on range has been used as the standard tool for distance measurements in the location detection process. Most previous works have employed the path-loss propagation model with a fixed value of the path loss exponent. However, in actual environments, the path loss exponent for each channel is different. Moreover, due to the complexity of the radio channel, when the number of channel increases, a larger number of RSS measurements are needed, and this results in additional energy consumption. In this paper, to overcome this problem, we propose using the Bayesian compressive sensing method with a calibrated path loss exponent to improve the performance of the PU localization method.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.691-694
• /
• 2003

This paper describes how to use Profibus networks to support real-time industrial communications, that is, how to ensure the transmission of real-time messages within a maximum bound time. Profibus is based on a simplified timed token protocol, which is a well-proved solution for the real-time communication systems. However, Profibus differs from the timed token protocol, thus the usual timed token protocol has to be modified in order to be applied in Profibus. In fact, the real-time solutions for networks based on the timed token protocol rely on the possibility of allocating specific bandwidth for the real-time traffic. This means that a minimum amount of time to transmit the real-time messages is always guaranteed whenever each token is arrived. In other words, with the Profibus protocol, at least, one real-time message should be transmitted per every token visit in the worst case. It is required to control medium access properly to satisfy the message deadlines. In this paper, we have presented how to obtain the optimal network parameter for the Profibus protocol. The selected network parameter is valid regardless of the behavior of asynchronous messages.

• IEIE Transactions on Smart Processing and Computing
• /
• v.2 no.2
• /
• pp.77-85
• /
• 2013

this study examined hybrid Time of Arrival/Angle of Arrival (TOA/AOA) localization technique in a cellular network. Based on the linearized equations from the TOA and AOA measurements, the weighted least square (WLS) method is proposed to obtain the location estimation of a mobile station (MS) by analyzing the statistical properties of the error vector in Line of Sight (LOS) and Non-line of Sight (NLOS) environments, respectively. Moreover, the precise expression of the Cramer-Rao lower bound (CRLB) for hybrid TOA/AOA measurements in different LOS/NLOS conditions was derived when the LOS error is a Gaussian variable and the NLOS error is an exponential variable. The idea of cooperative localization is proposed based on the additional information from short-range communication among the MSs in fourth generation (4G) cellular networks. Therefore, the proposed hybrid TOA/AOA WLS method can be improved further with the cooperative scheme. The simulation results show that the hybrid TOA/AOA method has better performance than the TOA only method, particularly when the AOA measurements are accurate. Moreover, the performance of the hybrid TOA/AOA method can be improved further by the cooperative scheme.

• The Journal of the Acoustical Society of Korea
• /
• v.39 no.6
• /
• pp.505-514
• /
• 2020

Since a large amount of training data is typically needed to train Deep Neural Networks (DNNs), a parallel training approach is required to train the DNNs. The Stochastic Gradient Descent (SGD) algorithm is one of the most widely used methods to train the DNNs. However, since the SGD is an inherently sequential process, it requires some sort of approximation schemes to parallelize the SGD algorithm. In this paper, we review various efforts on parallelizing the SGD algorithm, and analyze the computational overhead, communication overhead, and the effects of the approximations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.4680-4697
• /
• 2017

In future, since the user experience plays a more and more important role in the development of today's communication systems, quality of experience (QoE) becomes a widely used metric, which reflects the subjective experience of end users for wireless service. In addition, the energy efficiency is an increasingly important problem with the explosive growth in the amount of wireless terminals and nodes. Hence, a QoE-aware energy efficiency maximization based joint user access selection and power allocation approach is proposed to solve the problem. We transform the joint allocation process to an optimization of energy efficiency by establishing an energy efficiency model, and then the optimization problem is solved by chaotic clone immune algorithm (CCIA). Numerical simulation results indicate that the proposed algorithm can efficiently and reliably improve the QoE and ensure high energy efficiency of networks.

• International Journal of Knowledge Content Development & Technology
• /
• v.7 no.4
• /
• pp.5-26
• /
• 2017

A cross-cultural comparison of social networking structure on McDonald's Facebook fan sites between Taiwan and the USA was conducted utilizing the individualism/collectivism dimension proposed by Hofstede. Four network indicators are used to describe the network structure of McDonald's Facebook fan sites: size, density, clique and centralization. Individuals who post on both Facebook sites for the year of 2012 were considered as network participants for the purpose of the study. Due to the huge amount of data, only one thread of postings was sampled from each month of the year of 2012. The final data consists of 1002 postings written by 896 individuals and 5962 postings written by 5532 individuals from Taiwan and the USA respectively. The results indicated that the USA McDonald's Facebook fan network has more fans, while Taiwan's McDonald's Facebook fan network is more densely connected. Cliques did form among the overall multiplex and within the individual uniplex networks in two countries, yet no significant differences were found between them. All the fan networks in both countries are relatively centralized, mostly on the site operators.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.6
• /
• pp.2861-2880
• /
• 2018

Mobile Ad hoc Networks (MANETs) have become a viable platform owing to their potential of providing communication without any pre-existing infrastructure and central administrating authority. Mutual support and co-operation among nodes are prerequisites for performing functions in such networks. The scarcity of resources makes it economical for nodes to conserve their resources and misbehave by avoiding participation in the network. Therefore, a mechanism is required to detect and handle such misbehaving nodes and promote co-operation in the network. Existing techniques for handling misbehaving nodes focus only on their current behaviour without considering the antecedent behaviour of nodes. In real world, a node may dynamically change its behaviour in accordance to its requirements. Hence, an efficient mechanism is required for providing security against such misbehaviour. This paper proposes an Adaptive Security Model which contemplates the present as well as anterior behaviour of nodes for providing security against dynamic node behaviour. The adaptivity of the model is nested in its ability to requite well-behaving nodes and penalize misbehaving ones in conformity with their overall behaviour. Simulation results indicate the efficiency of proposed scheme in securing the network from the menace of dynamic behaviour of nodes.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.38 no.11
• /
• pp.804-809
• /
• 2001

In this paper, a shared channel scheme and routing algorithms are proposed to reduce the number of wavelength channels for the optical WDM multihop networks using the every-other-row-connecting bilayered ShuffleNet scheme. In the shared channel scheme proposed, 2P nodes share the common wavelength channel reducing the number of required channels compare to other ones. By assigning an effective address each node, packets can be routed to the destination nodes through the intermediate nodes.

• Journal of Advanced Marine Engineering and Technology
• /
• v.35 no.8
• /
• pp.1092-1097
• /
• 2011

Data communications at sea are done by the traditional radio and satellite carriers. Because of the restrictions on the data rate and cost of the carriers, a novel data communication system at sea is needed. Nowadays the efforts to make use of the broadband land carriers at sea have been pursued. This paper proposes a routing scheme (NTCR) using the various carriers on land for a MANET model at sea. The NTCR scheme optimizes the route using a chosen carrier by taking considerations of normalized transmission characteristics (NTC) of applications and carriers. The NTCR scheme is compared with the MWR (max-win based routing) scheme.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.2
• /
• pp.1-6
• /
• 2009

Localization of nodes is a key technology for application of wireless sensor network. Having a GPS receiver on every sensor node is costly. In the past, several approaches, including range-based and range-free, have been proposed to calculate positions for randomly deployed sensor nodes. Most of them use some special nodes, called anchor nodes, which are assumed to know their own locations. Other sensors compute their locations based on the information provided by these anchor nodes. This paper uses a single mobile anchor node to move in the sensing field and broadcast its current position periodically. We provide a weighted centroid localization algorithm that uses coefficients, which are decided by the influence of mobile anchor node to unknown nodes, to prompt localization accuracy. We also suggest a criterion which is used to select mobile anchor node which involve in computing the position of nodes for improving localization accuracy. Weighted centroid localization algorithm is simple, and no communication is needed while locating. The localization accuracy of weighted centroid localization algorithm is better than maximum likelihood estimation which is used very often. It can be applied to many applications.