• Journal of the Korean Geographical Society
• /
• v.46 no.2
• /
• pp.197-211
• /
• 2011

Due to the complexity of spatial interaction and the necessity of spatial representation and modeling, aggregation of spatial interaction data is indispensible. Given this, the purpose of this paper is to evaluate the effects of modifiable areal unit problem (MAUP) on a spatial interaction model. Four aggregation schemes are utilized at eight different scales: 1) randomly select seeds of district and then allocate basic spatial units to them, 2) minimize the sum of population weighted distance within a district, 3) maximize the proportion of flow within a district, and 4) minimize the proportion of flow within a district. A simple Poisson regression model with origin and destination constraints is utilized. Analysis results demonstrate that spatial characteristics of residuals, parameter values, and goodness-of-fit of the model were influenced by aggregation scale and schemes. Overall, the model responded more sensitively to aggregation scale than aggregation schemes and the scale effect on the model was varied according to aggregation schemes.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.6B
• /
• pp.233-248
• /
• 2008

Advances in electronics and wireless communication technologies have enabled the development of large-scale wireless sensor networks (WSNs). There are numerous applications for wireless sensor networks, and security is vital for many of them. However, WSNs suffer from many constraints, including low computation capability, small memory, limited energy resources, susceptibility to physical capture, and the lack of infrastructure, all of which impose unique security challenges and make innovative approaches desirable. In this paper, we present a survey on security issues in wireless sensor networks. We address several network models for security protocols in WSNs, and explore the state of the art in research on the key distribution and management schemes, typical attacks and corresponding countermeasures, entity and message authentication protocols, security data aggregation, and privacy. In addition, we discuss some directions of future work.

• Asia pacific journal of information systems
• /
• v.16 no.1
• /
• pp.85-101
• /
• 2006

Actual type of aggregation performed by an ordered weighted averaging (OWA) operator heavily depends upon the weighting vector. A number of approaches have been suggested for obtaining the associated weights. In this paper, we present analytic forms of OWA operator weighting functions, each of which has such properties as rank-based weights and constant value of orness, irrespective of number of objectives aggregated. Specifically, we propose four analytic forms of OWA weighting functions that can be positioned at 0.25, 0.334, 0.667, and 0.75 on the orness scale. The merits for using these weights over other weighting schemes can be mentioned in a couple of ways. Firstiy, we can efficiently utilize the analytic forms of weighting functions without solving complicated mathematical programs once the degree of orness is specified a priori by decision maker. Secondly, combined with well-known OWA operator weights such as max, min, and average, any weighting vectors, having a desired value of orness and being independent of the number of objectives, can be generated. This can be accomplished by convex combinations of predetermined weighting functions having constant values of orness. Finally, in terms of a measure of dispersion, newly generated weighting vectors show just a few discrepancies with weights generated by maximum entropy OWA.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11A
• /
• pp.1147-1158
• /
• 2006

Clustering algorithm is an essential element to implement a hierarchical routing protocol, especially for a large-scale wireless sensor network. In this paper, we propose a new type of energy-efficient clustering algorithm, which maximizes the physical distance between cluster head and gateway by a neighbor node discovery mechanism. Furthermore, a slave/master patching scheme is introduced as a useful means of further improving the energy-efficiency. It has been shown that the number of cluster heads can be reduced by as many as 21% as compared with the existing clustering algorithms.