• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.344-357
• /
• 2015

With the increase in a number of access technologies and data rates, a continuous connection among different networks is demand of the future wireless networks. In the last decade, user connectivity among different access networks remained a challenging job. Therefore, in this article, we proposed a user-centric and user-perspective based network selection mechanism for fast handover management in heterogeneous wireless networks. The proposed scheme selects the most appropriate network among available networks on the basis of resources i.e. cost, data rate, and link quality. Initially, we load the Media Independent Information Service (MIIS) with the information of cost and data rate provided by different network operators. Similarly, Mobile Node (MN) is also loaded with the user preferred cost and data rate for different applications. The MN obtains the information of cost and data rate from MIIS server upon a predefined threshold, and make a decision for handover according to its current cost and data rate. Furthermore, we employ an optimal threshold mechanism for initiation of the handover execution phase to minimize false handover indications. The proposed scheme is based on a survey for network selection and its implementation in C programming language to validate its performance and accuracy. The simulation result shows that the proposed scheme performs superior then the schemes present in the current literature.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.9 no.6
• /
• pp.151-158
• /
• 2010

In line with the requirement of appropriate protocol support for such mission-critical wireless sensor network (WSN) applications as patient monitoring, we investigate the framework for designing medium access control (MAC) schemes. The data traffic in medical systems comes with inherent traffic heterogeneity as well as strict requirement of reliability according to the varied extents of devise-wise criticality in separate cases. This implies that the quality-of-Service (QoS) issues are very distinctly delicate requiring specialized consideration. Besides, there are features in such systems that can be exploited during the design of a MAC scheme. In a monitoring or routine surveillance application, there are degrees of regularity or predictability in traffic as coordinated from a node of central control. The coordinator thus takes on the role of marshaling the resources in a neighborhood of nodes deployed mostly for upstream traffic; in a collision-free scheme, it schedules the time slots for each superframe based on the QoS specifications. In this preliminary study, we identify the key artifacts of such a MAC scheme. We also present basic performance issues like the impact of superframe length on delay incurred, energy efficiency achieved in the network operation as obtained in a typical simulation setup based on this framework.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.5B
• /
• pp.365-377
• /
• 2006

We define the incomplete medium sharing system as a multi-channel shared medium communication system where any types of constraints are imposed to the set of channels that may be allocated to any transmitter-receiver node pair. A set of distributed MAC schemes are proposed, all of which are based on the CSMA/CA scheme employed in IEEE 802. 11 WLAN standards. Distributed MAC schemes are proposed in three different forms, which can be differentiated by the number and the location of back-off timers; that is, (1) one timer for all queues destined for different receiver nodes, (2) multiple timers at individual transmission queues, (3) multiple timers for individual channels. Through an extensive set of computer simulations, the performances of the proposed MAC schemes show that the MAC scheme with timers at individual transmission queues outperform the others in terms of throughput and delay for most cases considered. The complexity of the proposed schemes is also compared, and the first scheme obviously turned out to be the simplest, and the complexity of the second and third schemes depends on the number of receiver nodes and the number of channels, respectively.

• The KIPS Transactions:PartC
• /
• v.9C no.4
• /
• pp.551-562
• /
• 2002

We usually applied PPP CHAP when the visited ISP subscriber accesses to authentication server in own home ISP network and IP Assignment for remote Internet service. But PPP CHAP doesn't support in case of visited ISP subscriber in GPRS network accesses to authentication sorrel in own home ISP network for wireless Internet service. We suggest solution for this problem with PPP CHAP improvement. For this we propose the modified PPP CHAP message format, PCO Message format at MT, and interworking message and format between GGSN and RADIUS in home ISP network for wireless internet service of mobile ISP subscriber at GPRS network in this paper. We also show authentication results when visited mobile ISP subscriber via PPP CHAP at GPRS network accesses the RADIUS server in home ISP network.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.8
• /
• pp.2245-2252
• /
• 1999

Since DSM provides a user a simple shared memory abstraction, the user does not have to be concerned with data movement between hosts. Each node in DSM systems has processor, memory, and connection to a network. Memory is divided into pages, and a page can have multiple copies in different nodes. To maintain data consistency between nodes, two conventional protocols are used : write-update protocol and invalidate protocol. The performance of these protocols depends on the system parameters and the memory access patterns. for adapting to memory access patterns, competitive update protocol updates those copies of a page that are expected to be used in the near future, while selectively invalidating other copies. We present weighted competitive update protocols that consider different communication bandwidth for each connection a of two nodes. Test result by simulation show that the weighted competitive update protocol improves performance.

• The KIPS Transactions:PartC
• /
• v.17C no.1
• /
• pp.109-118
• /
• 2010

Proxy mobile IPv6 (PMIPv6) protocol is a network-based mobility management protocol to support mobility for IPv6 nodes without host involvement. In PMIPv6, the Mobile Access Gateway (MAG) incurs a high signaling cost to update the location of a mobile node to the remote Local Mobility Anchor (LMA) if it moves frequently. This increases network overhead on the LMA, wastes network resources, and lengthens the delay time. Therefore, we propose a new mobility management scheme for minimizing signaling cost using the pointer forwarding. Our proposal can reduce signaling costs by registration with the neighbor MAG instead of the remote LMA using the pointer forwarding. The cost analysis using imbedded Markov chain presented in this paper shows that our proposal can achieve performance superior that of PMIPv6 scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.5
• /
• pp.486-496
• /
• 2013

Time synchronization in underwater environment is challenging due to high propagation delay and mobility of sensor nodes. Previous researches do not consider practical issues affecting on the accuracy of time synchronization such as high-channel access delay and relative position between sensor nodes. Also, those protocols using bidirectional message exchange shorten the network lifetime and decrease the network throughput because numerous transmission, reception and unnecessary overhearing can be occurred. Therefore, in our research, we suggest enhanced time synchronization based on features of underwater environment. It controls the instant of transmission by exploiting the feature of an oceanic movement and node deployment. Moreover, the protocol uses more accurate time information by removing channel access delay from the timestamp. The proposed scheme is also practical on the underwater sensor network requiring low-power consumption because the scheme conducts time-synchronization with smaller transmission and reception compared with previous works. Finally, simulation results show that the proposed protocol deceases time error by 2.5ms and 0.56ms compared with TSHL and MU-Sync respectively, reducing energy consumption by 68.4%.

• Journal of KIISE:Databases
• /
• v.31 no.2
• /
• pp.150-162
• /
• 2004

Moving objects have characteristics that they change continuously their positions over time. The movement of moving objects should be stored on trajectories for processing past queries. Moving objects databases need to provide spatio-temporal index for handling moving objects queries like combined queries. Combined queries consist of a range query selecting trajectories within a specific range and a trajectory query extracting to parts of the whole trajectory. Access methods showing good performance in range queries have a shortcoming that the cost of processing trajectory Queries is high. On the other hand, trajectory-based index schemes like the TB-tree are not suitable for range queries because of high overlaps between index nodes. This paper proposes new TR(Trajectory Riving)-tree which is revised for efficiently processing the combined queries. This index scheme has several features like the trajectory preservation, the increase of the capacity of leaf nodes, and the logical trajectory riving in order to reduce dead space and high overlap between bounding boxes of nodes. In our Performance study, the number of node access for combined queries in TR-tree is about 25% less than the STR-tree and the TB-tree.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.5
• /
• pp.1646-1652
• /
• 2010

The communication in wireless sensor network is divided into several layers, because of each of them do their role, the wireless communication is possible, the MAC (Medium Access Control) layer of the one of sensor network communications layer is used to the data errors, control flow, and manage resources. Using MAC Protocol, it ensures the communication between sensor node. In this paper, highlighted the energy efficiency of the S-MAC, T-MAC protocol it emphasized the efficiency of energy by lessening the woken time of all nods effectively, transmitting and receiving the control packet on only necessary nods through use of a method that RTS packet is added to SYNC packet and making other nods sleep. On sending SYNC+RTS packet and receiving the packet, nod noticed that it wasn't necessary to be awaked on this period, would be in Sleep mode, demonstrated mathematically that energy is more effective than existing protocol, and simulated with MATLAB.

• Journal of Internet Computing and Services
• /
• v.2 no.4
• /
• pp.41-53
• /
• 2001

Multi-distributed web cluster model built for high availability E-Business model exposes internal system nodes on its structural characteristics and has a potential that normal job performance is impossible due to the intentional prevention and attack by an illegal third party. Therefore, the security system which protects the structured system nodes and can correspond to the outflow of information from illegal users and unfair service requirements effectively is needed. Therefore the suggested distributed invasion detection system is the technology which detects the illegal requirement or resource access of system node distributed on open network through organic control between SC-Agents based on the shared memory of SC-Server. Distributed invasion detection system performs the examination of job requirement packet using Detection Agent primarily for detecting illegal invasion, observes the job process through monitoring agent when job is progressed and then judges the invasion through close cooperative works with other system nodes when there is access or demand of resource not permitted.