• Journal of Korea Society of Digital Industry and Information Management
• /
• v.4 no.3
• /
• pp.9-18
• /
• 2008

Mobile devices do not need the fixed network infrastructure in ad-hoc network, these devices communicate each other through the distributed control. Accordingly, mobile devices can discover several services using dynamic searching method and provide safely public ownership of these services. Ad-hoc network needs the distributed control and topology of dynamic network because the limited power for processing and network communication. This paper is devoted to provide the secure protocol that provides efficient services discovery using SDP(Service Discovery Protocol) and considers the security requirements. Proposed protocol provides the distributed control based on PKI without central server, the discovery of trusted service, secure telecommunication, the identification among mobile devices, and service access control by user authority.

• Journal of the Korean Society for Precision Engineering
• /
• v.11 no.4
• /
• pp.126-137
• /
• 1994

Performance management of computer networks is intended to improve a given network performance in order for more efficient information exchange between subsystems of an integrated large-scale system. Importance of perfomance management is growing as many functions of the large- scale system depend on the quality of communication services provided by the network. The role of performance management is to manipulate the adjustable protocol parameters on line so that the network can adapt itself to a dynamic environment. This can be divided into two subtasks : performance evaluation to find how changes in protocol parameters affect the network performance and decision making to determine the magnitude and direction of parameter adjustment. This paper is the first part of the two papers focusing on conceptual design, development, and evaluation of performance management for token bus networks. This paper specifically deals with the task of performance evaluation which utilizes the principle of perturbation analysis of discrete event dynamic systems. The developed algorithm can estimate the network performance under a perturbed protocol parameter setting from observations of the network operations under a nominal parameter setting.

• Spatial Information Research
• /
• v.14 no.2 s.37
• /
• pp.245-260
• /
• 2006

A practical use of the location information and user requirement are increased in a mobile environment which supports the portability. And Various service which GIS is related with a Spatial DB have been processed. Generally, logical relation of a traffic network which organizes the Road DB uses a basic node-link structure. In this way, Designed structure can not be flexible at various model apply and are not efficient with a database retrieval in a maintenance management side. In this research, We supplement with the problem of a existing network model and the limitation of the building through the design of a network model which uses dynamic segmentation. And we tried to implement efficient hierarchy model at the retrieval of the network and presentation. Designed model supports a stage presentation of various level and a hierarchy entity relation and We are expected to supplement a network spatial modelling function which the GIS has.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.415-417
• /
• 2005

Core operations (e.9. TDMA scheduler, synchronized sleep period, data aggregation) of many proposed protocols for different layer of sensor network necessitate clock synchronization. Our Paper mingles the scheme of dynamic clustering and diffusion based asynchronous averaging algorithm for clock synchronization in sensor network. Our proposed algorithm takes the advantage of dynamic clustering and then applies asynchronous averaging algorithm for synchronization to reduce number of rounds and operations required for converging time which in turn save energy significantly than energy required in diffusion based asynchronous averaging algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.120-122
• /
• 2015

In this paper, we proposed an algorithm of the unnecessary copied message inhibition using dynamic density what is called DDIM(Dynamic Density-based Inhibited Message diffusion) in DTNs(Delay Tolerant Networks). Existing DTN routing algorithms as Epidemic and Spray and Wait have some problems that occur large overhead in dense network due to the thoughtless message diffusion. Our proposed method, the DDIM, determines adjusted number of copied message through dynamic node density that is calculated using node's radio coverage and neighbor nodes in period time to solve message diffusion problem. It decrease overhead without losing message delivery ratio and increased latency through reducing message diffusion. In this paper, we compare delivery ratio, average latency and overhead of proposed algorithm, DDIM, and existing DTN routing algorithm and prove enhanced performance through simulation results.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.10
• /
• pp.165-173
• /
• 2011

In Mobile Ad-hoc Network(MANET), mobile nodes are operated by limited batteries. Therefore, it is very important to consume the battery power efficiently to prevent termination of the network. In this paper, we propose Energy-aware Dynamic Source Routing(EDSR) which is based on the Dynamic Source Routing(DSR) to increase the packet transmission and lifetime of the network. If the battery power of a node reaches threshold level, then the node gives up the function of relaying to save battery power except as a source and a destination node. While the conventional DSR doesn't consider the battery consumptions of the nodes, EDSR blocks the nodes from relaying whose battery powers are below the threshold level. Simulation results show the proposed EDSR is more efficient in packet transmission and network lifetime through the balanced battery consumption of the mobile nodes.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.7
• /
• pp.139-148
• /
• 2008

The sensor network is applied from the field which is various. The sensor network nodes are exchanged with mobile environment and they construct they select cluster and cluster headers. In this paper, we propose the Dynamic Prediction Clustering Algorithm use to Skyline queries attributes in direction, angel and hop. This algorithm constructs cluster in base mobile sensor node after select cluster header. Propose algorithm is based made cluster header for mobile sensor node. It "Adv" reduced the waste of energy which mobile sensor node is unnecessary. Respects clustering where is efficient according to hop count of sensor node made dynamic cluster. To extend a network life time of 2.4 times to decrease average energy consuming of sensor node. Also maintains dynamic cluster to optimize the within hop count cluster, the average energy specific consumption of node decreased 14%.

• The Korean Journal of Applied Statistics
• /
• v.34 no.1
• /
• pp.25-38
• /
• 2021

Recently the need for network surveillance to detect abnormal behavior within dynamic social networks has increased. We consider a dynamic version of the degree corrected stochastic block model (DCSBM) to simulate dynamic social networks and to monitor for a significant structural change in these networks. To apply a control charting procedure to network surveillance, in-control model parameters must be estimated from the Phase I data, that is from historical data. In network surveillance, however, there are many situations where sufficient relevant historical data are unavailable. In this paper we propose a self-starting Shewhart control charting procedure for detecting change in the dynamic networks. This procedure can be a very useful option when we have only a few initial samples for parameter estimation. Simulation results show that the proposed procedure has good in-control performance even when the number of initial samples is very small.

• IE interfaces
• /
• v.22 no.1
• /
• pp.63-72
• /
• 2009

This paper considers a transporter scheduling problem under dynamic block transportation environment in shipbuilding. In dynamic situations, there exist the addition, cancellation or change of block transportation requirements, sudden breakdowns and maintenance of transporters. The transportation of the blocks in the shipyard has some distinct characteristics. Some blocks are available to be picked up at a specific time during the planning horizon while some other blocks need to be delivered before a specific time. These requirements cause two penalty times: 1) delay times incurred when a block is picked up after a required start time, and 2) tardy times incurred when a block shipment is completed after the required delivery time. The blocks are located at different areas in the shipyard and transported by transporters. The objective of this paper is to propose a heuristic algorithm based on a network flow model which minimize the weighted sum of empty transporter travel times, delay times, and tardy times. Also, a rolling-horizon scheduling method is proposed for dynamic block transportation environment. The performance of the proposed heuristic algorithms are evaluated through a simulation experiment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.10C
• /
• pp.956-963
• /
• 2006

This research studies multi participant consistency and dynamic data shared through 3D scenes in virtual network environments. In a distributed virtual environment of client-server structure, consistency is maintained by the static information exchange; as jerks occur by packet delay when updating messages of dynamic data exchanges are broadcasted frequence, the network bottleneck is reduced by predicting the movement path by using the Dead-reckoning algorithm. In Dynamic data path prediction, the tests the location prediction error between Dead-reckoning convergence interval and error of prediction and actual condition one time above threshold it interpolates a previously location. The shared dynamic data of the 3D virtual environment is implementation using the VRML EAI.