• International Journal of Computer Science & Network Security
• /
• v.21 no.12
• /
• pp.1-8
• /
• 2021

In Mobile Ad-Hoc Network (MANET) Application, routing protocol is essential to ensure successful data transmission to all nodes. Ad-hoc On-demand Distance Vector (AODV) Protocol is a reactive routing protocol that is mostly used in MANET applications. However, the protocol causes Route Request (RREQ) message flooding issue due to the broadcasting method at the route request stage to find a path to a particular destination, where the RREQ will be rebroadcast if no Request Response (RREP) message is received. A scalable neighbor-based routing (SNBR) protocol was then proposed to overcome the issue. In the SNBR protocol, the RREQ message is only rebroadcast if the number of neighbor nodes less than a certain fix number, known as drop factor. However, since a network always have a dynamic characteristic with a dynamic number of neighbor nodes, the fix drop factor in SNBR protocol could not provide an optimal flooding problem solution in a low dense network environment, where the RREQ message is continuously rebroadcast RREQ message until reach the fix drop factor. To overcome this problem, a new broadcasting method as Dynamic SNBR (DSNBR) is proposed, where the drop factor is determined based on current number of neighbor nodes. This method rebroadcast the extra RREQ messages based on the determined dynamic drop factor. The performance of the proposed DSNBR is evaluated using NS2 and compared with the performance of the existing protocol; AODV and SNBR. Simulation results show that the new routing protocol reduces the routing request overhead, energy consumption, MAC Collision and enhances end-to-end delay, network coverage ratio as a result of reducing the extra route request messages.

• The Journal of Korean Society for School & Community Health Education
• /
• v.20 no.2
• /
• pp.81-91
• /
• 2019

Objectives: It helps dental clinic to work 1:1 consulting and select the properties of the Kakao Talk message. The study was designed to determine the influence of users cognitive and emotional responses by message attribute that affect intention of use of dental clinic. Methods: This study targeted 297 peple Kakao Talk users aged 20-50 s, in Seoul, Gyeonggi-do and Incheon from, February 6 to April 7, 2017. We analyzed the data with frequency analysis, t-test, one-way ANOVA, and multiple regression analysis by using SPSS ver 24.0(SPSS Inc, Chicago, USA). The significance level for significance was set at 0.05. Results: Among the user's responses about the event type Kakao talk message, the ease(${\beta}=0.121$, p<0.01), usefulness(${\beta}=0.148$, p<0.001), affinity(${\beta}=0.471$, p<0.001), satisfaction(${\beta}=0.249$, p<0.001). affected intention of use of dental clinic. Among the user's responses about the dental information type, the ease(${\beta}=0.150$, p<0.05), expertise(${\beta}=0.151$, p<0.05), satisfaction(${\beta}=0.237$, p<0.001) affected intention of use of dental clinic(p<0.05). Among the user's responses about the general public relations type, the expertise(${\beta}=0.254$), affinity(${\beta}=0.193$), satisfaction(${\beta}=0.474$) affected intention of use of dental clinic(p<0.001). Conclusion: It is necessary to elicit a positive intention of use of dental clinic through a highly emotional response from the users to improve the image of the dental clinic and to attract patients.

• The KIPS Transactions:PartA
• /
• v.13A no.5 s.102
• /
• pp.455-464
• /
• 2006

In multi-regional mobile agent computing environments, spatial replication-based approach may be used as a representative mobile agent fault-tolerance technique because it allows agent execution to make progress without blocking even in case of agent failures. However, to apply this approach to real mobile agent-based computing systems, it is essential to minimize the overhead of locating and managing mobile agents replicated on each stage. This paper presents a new mobile agent location management protocol SRLM to solve this problem. The proposed protocol allows only the primary among all the replicated workers of each stage to register with its regional server and then, significantly reduces its location updating and message delivery overheads compared with the previous protocols. Also, the protocol addresses the location management problem incurred by electing the new primary among the remaining workers at a stage in case of the primary worker's failure.

• Journal of Internet Computing and Services
• /
• v.5 no.1
• /
• pp.51-57
• /
• 2004

Mobile Internet allows users to request critical information and receive swift responses at any places, but mobile users could suffer from unreliable and ill-timed services due to the characteristics of wireless media, One way that reduces possibility of the unsatisfactory services is data replication. Data Replica1ion, however, inevitably induces the overhead of maintaining replica consistency which requires more expensive synchronization mechanism. We propose a new replicated data management scheme in distributed mobile environment, In order to alleviate negative impact of synchronization message overhead in fault-prone mobile Internet environment, we devise a new replication control scheme called proxy quorum consensus (PQC), PQC minimizes the message overhead by coordinating quorum access activities by means of proxy mediated voting (PMV) which exploits reliable proxy hosts instead of unreliable mobile hosts in voting process, We also propose a simulation model to show the performance of PQC. Based on the results of the performance evaluation, we conclude that PQC scheme outperforms the traditional schemes.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.7
• /
• pp.123-132
• /
• 2009

The perforrnance and portability of mobile applications can be greatly increased by adopting proxy modiles which exists between the conventional system and the device. When mobile devices collaborate with the conventional computers, there are problems to address: a battery life problem, limited input and output methods, and intermittent wireless connection. Those issues are magnified in the multimedia collaboration environment since it works in a real-time condition and the size of the message in the system is big in many cases. Additionally, because multimedia collaboration system softwares are too heavy and complex for mobile devices, it is veη hard to integrate them with conventional systems. In this paper, we describe our design and its implementation of a novel approach to map events (i.e. messages) using a proxy for mobile applications. We adopt a proxy to provide a content adaptation (i.e. transcoding) where the message contents are customized. Also, we design a mobile version publish/subscribe system to provide communication service for mobile device in loosely coupled and flexible manner. We present our empirical results which show that our design can be efficiently implemented and integrated with a conventional multimedia collaboration system.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.7
• /
• pp.76-91
• /
• 1996

In this paper, we proposed the new medium access control protocol for the virtual token bus netowrk. The network is applied to inter-processor communication network of large capacity digital switching system and digital mobile system with distributed control architecture. in the virtual token bus netowrk, the existing medium access control protocols hav ea switchove rtime overhead when traffic load is light or asymmetric according ot arbitration address of node that has message to send. The proposed protocol optimized average message delay using cyclic bus access chain to exclude switchover time of node that do not have message to send. Therefore it enhanced bus tuilization and average message delay that degrades the performance of real time communication netowrks. It showed that the proposed protocol is more enhacned than virtual token medium access control protocol and virtual token medium access control protocol iwth reservation through performance analysis.

• Asia pacific journal of information systems
• /
• v.25 no.2
• /
• pp.239-264
• /
• 2015

This study aims to investigate the effect of message content and source user identity on information diffusion in Twitter networks. For the empirical study, we collected 11,346 tweets pertaining to the three major mobile telecom carriers in Korea for three months, from September to December 2011. These tweets generated 59,111 retweets (RTs) and were retweeted at least once. Our analysis indicates that information diffusion in Twitter in terms of RT volume is affected primarily by the type of message content, such as the inclusion of corporate social responsibility activities. However, the effect of message content on information diffusion is heterogeneous to the identity of the information source. We argue that user identity affects recipients' perception of the credibility of focal information. Our study offers insights into the information diffusion mechanism in online social networks and provides managerial implications on the strategic utilization of online social networks for marketing communications with customers.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.9
• /
• pp.57-63
• /
• 2016

The purpose of the study is to investigate the preference by emoticon types according to the gender of sender, emotion types of message and intimacy with the recipient. Results show that women mostly prefer to use dynamic and imaged emoticon than men. However, the preference of using text messages increases when both men and women express uncomfortable emotion. Especially, when users send family messages, they tend to prefer for text message. And when users send close friends messages, the preference for dynamic and imaged emoticon is high. When users send distant friends messages, the similar tendency is shown regardless of emotion. These results can provide the information to use emoticon in the filed of education and take advantage in digital education and mobile education.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5B
• /
• pp.257-269
• /
• 2007

This paper proposes a novel method to perform a quantitative analysis of message complexity and applies this method in comparing the message complexity among the mobile ad hoc network (MANET) address autoconfiguration protocols (AAPs). To obtain the upper bound of the message complexity of the protocols, the O-notation of a MANET group of N nodes has been applied. The message complexity of the single node joining case in Strong DAD, Weak DAD with proactive routing protocols (WDP), Weak DAD with on-demand routing protocols (WDO), and MANETconf has been derived as n(mO(N)+O(t)), n(O(N)+O(t)), n(O(N)+2O(t)), and nO((t+1)N)+O(N)+O(2) respectively. In order to verify the bounds, analytical simulations that quantify the message complexity of the address autoconfiguration process based on the different coflict probabilities are conducted.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.5
• /
• pp.73-79
• /
• 2011

With increasing use of smartphone, users require a new message service to prevent security attack and provide integrated messages. Since smartphone uses data services such as 3G cell network and WiFi, it can provide reliable message transfer through various security policies. In addition, it can transfer various data collected using built-in camera and GPS. This paper proposes a smart message service platform which can provide security services such as authentication, confidentiality and integrity as well as transfer the integrated message including location, picture and text. To verity the functionality of the platform, this paper implements an iPhone app and message transfer server, and then shows the implementation results.