• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.3
• /
• pp.815-834
• /
• 2012

Recently, along with the innovative development of wireless communication techniques and mobile devices, mobile P2P services in mobile wireless networks have gained a lot of attention. In this paper, we propose a resource discovery scheme with data dissemination over mobile P2P networks. In the proposed scheme, each peer manages a local information table, a resource index table, and a routing table in a local database to enhance the accuracy and cost of resource discovery. The local information table stores the status of a mobile peer, and the resource index table stores the resource information of the neighbor peers via the ranking function. The routing table is used to communicate with the neighbor peers. We use a timestamp message to determine whether or not the resource index table will be changed before the resource information is exchanged. Our ranking function considers the interest and mobility of the mobile peer and prioritizes the resource information transmitted from the neighbor peers. It is shown via various experiments that the proposed scheme outperforms the existing scheme.

• Journal of Communications and Networks
• /
• v.17 no.2
• /
• pp.133-144
• /
• 2015

In this paper, we introduce a system and a set of algorithms for disseminating popular content to a large group of wireless clients spread over a wide area. This area is partitioned into multiple cells and there is a base station in each cell which is able to broadcast to the clients within its radio coverage. Dissemination of information in the proposed system is hybrid in nature: Each base station broadcasts a fraction of information in the form of random linear combinations of data blocks. Then the clients cooperate by exchanging packets to obtain their desired messages while they are moving arbitrarily over the area. In this paper, fundamental trade-offs between the average information delivery completion time at the clients and different parameters of the system such as bandwidth usage by the base stations, average energy consumption by the clients and the popularity of the spread information are studied. Moreover different heuristic algorithms are proposed to control and maintain a balance over these trade-offs. Also, the more complicated case of multiple sessions where each client is interested in an arbitrary subset of sessions is considered and two variants of the basic dissemination algorithm are proposed. The performance of all the proposed algorithms is evaluated via extensive numerical experiments.

• Journal of Internet Computing and Services
• /
• v.10 no.2
• /
• pp.153-160
• /
• 2009

One of the major challenges of designing a dissemination protocol for Wireless Sensor Networks(WSNs) is energy efficiency. Recently, this issue has received much attention from the research community, and SPMS, which outperforms the well-known protocol SPIN, specially is a representative protocol. In addition, one of many characters of SPMS is the use of the shortest path to minimize the energy consumption. However, since it repeatedly uses the same path as the shortest path, the maximizing of the network lifetime is impossible, though it reduces the energy consumption. In this paper, we propose a dissemination protocol using probability-based clustering which guarantees energy-efficient data transmission and maximizes network lifetime. The proposed protocol solves the network lifetime problem by a novel probability function, which is related to the residual energy and the transmission radius between nodes. The simulation results show that it guarantees energy-efficient transmission and moreover increases the network lifetime by approximately 78% than that of SPMS.

• Journal of Agricultural Extension & Community Development
• /
• v.23 no.2
• /
• pp.181-193
• /
• 2016

The linkages between agricultural research and extension are important to enhance farmers' competence. The objectives of the study were to explore the linkage between research and extension for the family farm. Data including quantitative and qualitative were obtained from the key actors about the public management regarding linkage which were the method, the topic of the agricultural technology dissemination, and the agricultural research topics. Results show that the main structural problems of the agricultural technology dissemination were technical support services, credit services, and farm planning and infrastructure deficit. Furthermore, as for the topics or content of agricultural technology dissemination, organic agriculture, soil management and conservation, agricultural credit, organizational strengthening, marketing, participatory research, dissemination of technology, equipment, infrastructure and agricultural mechanization were preferred.

• BMB Reports
• /
• v.52 no.8
• /
• pp.490-495
• /
• 2019

Using tunneling nanotubes (TNTs), various pathological molecules and viruses disseminate to adjacent cells intercellularly. Here, we show that the intracellular invasion of Mycoplasma hyorhinis induces the formation of actin- and tubulin-based TNTs in various mammalian cell lines. M. hyorhinis was found in TNTs generated by M. hyorhinis infection in NIH3T3 cells. Because mycoplasma-free recipient cells received mycoplasmas from M. hyorhinis-infected donor cells in a mixed co-culture system and not a spatially separated co-culture system, direct cell-to-cell contact via TNTs was necessary for the intracellular dissemination of M. hyorhinis. The activity of Rac1, which is a small GTP binding protein, was increased by the intracellular invasion of M. hyorhinis, and its pharmacological and genetic inhibition prevented M. hyorhinis infection-induced TNT generation in NIH3T3 cells. The pharmacological and genetic inhibition of Rac1 also reduced the cell-to-cell dissemination of M. hyorhinis. Based on these data, we conclude that intracellular invasion of M. hyorhinis induces the formation of TNTs, which are used for the cell-to-cell dissemination of M. hyorhinis.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.460-462
• /
• 1999

휴대형 컴퓨터와 무선통신기술의 급속한 발달은 사용자에게 언제, 어디서나 필요한 컴퓨팅을 수행할 수 있는 이동 컴퓨팅이라는 새로운 패러다임을 발생케 하였다. 이동 컴퓨팅 환경은 대역폭(bandwidth)과 저 수준의 전송품질을 가지고 있기 때문에 서버가 어떠한 방법으로 데이터 dissemination을 이용하는 새로운 시스템 구조들이 제안되었다. 본 논문에서는 데이터 dissemination의 한 기법인 브로트캐스트 기법에서의 데이터 일관성 유지 문제와 이동 클라이언트의 효율적 전력 사용 문제를 동시에 고려한 브로트캐스트 기법을 제안하였다.

• The Journal of Information Systems
• /
• v.8 no.1
• /
• pp.109-129
• /
• 1999

This study deals with the problem of information dissemination in a communication network, which is defined to be the process whereby a set of messages, generated by an originator, is transmitted to all the members within the network. Since this type of message generally includes control data to manage the network or global information that all members should know, it is to be required to transmit it to all the members as soon as possible. In this study, it is assumed that a member can either transmit or receive a message and an informed member can transmit it to only one of its neighbors at time. This type of transmission is called 'local broadcasting' Several schemes of call sequencing are designed for a general-type network with nonuniform edge transmission times, and then computer simulations are performed. Some heuristics for information dissemination are proposed and tested. For this, optimal call sequence in a tree-type network, sequencing theory and graph theory are applied. The result shows that call sequencing based on the shortest path tree is the most desirable.

• Land and Housing Review
• /
• v.8 no.3
• /
• pp.103-111
• /
• 2017

This study is aimed to identify the LHI policies in the research process that reflect the diversity of job positions and workplace using a statistical method such as IPA. To collect the sample data questionnaire survey was carried out in 400 staffs in LH including researchers to investigate dissemination of research results and improve factor regard with research. The dissemination of research results is positioned as a important key factor for the determination of research institute policy. From this reason, satisfaction survey was performed for defining the procedure of research system and the dissemination of research findings. The answers give stimulate participation for investigational activity and share some perceptions with research vision a dominant position. Futhermore, select the research theme which is a important association with pending issues at the planning phase is to reinforce the availability of research findings. Lastly, promote research findings intensively is cause availability of research results to increase also.

• Journal of KIISE:Information Networking
• /
• v.36 no.3
• /
• pp.222-230
• /
• 2009

A sensor network is an important element of the ubiquitous and it consists of sensor fields that contain sensor nodes and sink nodes that collect data from sensor nodes. Since each sensor node has limited resources, one of the important issues covered in the past sensor network studies has been maximizing the usage of limited energy to extend network lifetime. However, most studies have only considered fixed sink nodes, which created various problems for cases with multiple mobile sink nodes. Accordingly, while maintaining routes to mobile sink nodes, this study aims to deploy the hybrid communication mode that combines single and multi-hop modes for intra-cluster and inter-cluster transmission to resolve the problem of failed data transmission to mobile sink nodes caused by disconnected routes. Furthermore, a 2-level hierarchical routing protocol was used to reduce the number of sensor nodes participating in data transmission, and cross-shape trajectory forwarding was employed in packet transmission to provide an efficient data dissemination method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.3
• /
• pp.543-548
• /
• 2017

In the conventional algorithm, the D2D message dissemination algorithm based on the Epidemic routing protocol frequently causes a problem of duplication of the received messages due to the overlaps of D2D transmission coverages. It is because all D2D devices that receive the messages perform relaying the message replicas to other D2D devices within their transmission range. Therefore, we herein propose the farthest-k relay selection algorithm to mitigate this message duplication problem. In the farthest-k relay selection algorithm, less than k devices within the D2D transmission range perform message relay. Furthermore, we perform comparative performance analysis between the conventional D2D data dissemination algorithm and our farthest-k relay selection algorithm. By using intensive MATLAB simulations we prove the performance excellency of our farthest-k relay algorithm compared with the conventional algorithm with respect to coverage probability, the total number of initially and duplicately received messages, and transmission efficiency.