• Title/Summary/Keyword: in-network join

Search Result 156, Processing Time 0.026 seconds

An Energy-Aware Multi-tree Video Multicast Scheme in Wireless Ad Hoc Networks (무선 애드 혹 네트워크에서 잔여 에너지를 고려한 다중 트리 비디오 멀티캐스트 기법)

  • Park, Jae-Young;Kang, Kyung-Ran;Cho, Young-Jong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.12B
    • /
    • pp.1336-1348
    • /
    • 2009
  • In this paper, we propose an energy-aware multi-tree video multicast scheme for wireless ad hoc networks. Some network nodes may have energy enough to receive and forward the whole video content whereas some may not. Even though the video quality may vary depending on the remaining energy, our scheme enables the low-energy nodes to join the video multicast session. The video stream is split into a set of multiple and independent descriptions by MDC (Multiple description coding) scheme. Each description corresponds to a substream and number of substreams determine the video quality. The member nodes determine how many substreams it would receive depending on the remaining energy and expected amount of packets per substream. So does the intermediate tree nodes. That builds a tree per substream and multiple trees per session. The data source disseminates each substream through corresponding tree. The video quality of the member nodes varies according to number of participating trees. We evaluate the performance of our scheme by simulation. Our scheme showed better peak signal to noise ratio and extended the lifetime of the network nodes compared with MAODV, which builds a single tree, and MT-MAODV, which builds multiple trees but does not consider the available energy.

A Design and Implementation of the Realtime Video Lecture System for Multimedia Education (멀티미디어 교육을 위한 실시간 영상강의 시스템의 설계와 구현)

  • 방혜자
    • Journal of Korea Multimedia Society
    • /
    • v.5 no.6
    • /
    • pp.625-637
    • /
    • 2002
  • The Internet had been taken properties which were both a slow speed and low-bandwidth of the first time. It was impossible to transmit large multimedia data because of a Internet properties. After tens of Year Passed, many people began to transmit multimedia data in the Internet which had fast-speed and high-bandwidth. Some people want to team classes to be taught in school through the Internet. And, educators wish to use multimedia data in the educational field. Due to previous reasons, many parts in the educational field had tried to join real-time objects to multimedia objects. But, real-time data didn’t appear easily due to many faults like network errors and system bugs if we want to control data in order to teach and learn classes. Then, this paper separates real-time and unreal-time data and controls these data that aye made a time scheduler to have time information in the extended SMIL-file for deceasing these faults.

  • PDF

A Efficient Key Generation and Renewal for Broadcast Encryption (브로드캐스트 암호화에서의 효율적인 키 생성과 갱신 방법)

  • Lee, Deok-Gyu;Lee, Im-Yeong
    • The KIPS Transactions:PartC
    • /
    • v.11C no.2
    • /
    • pp.149-156
    • /
    • 2004
  • Broadcast encryption schemes are applied to transmit digital informations of multimedia, software, Pay-TV etc. in public network. Important thing is that only user who is permitted before only must be able to get digital information in broadcast encryption schemes. If broadcast message transfers, users who authority is get digital information to use private key given in the advance by oneself. Thus, user acquires message or session key to use key that broadcaster transmits, broadcaster need process that generation and distribution key in these process. Also, user secession new when join efficient key renewal need. In this paper, introduce about efficient key generation and distribution, key renewal method. Take advantage of two technique of proposal system. One is method that server creates key forecasting user without user's agreement, and another is method that server and user agree each other and create key Advantage of two proposal system because uses a secret key broadcast message decryption do can and renewal is available effectively using one information whatever key renewal later.

Applicability of Geo-spatial Processing Open Sources to Geographic Object-based Image Analysis (GEOBIA)

  • Lee, Ki-Won;Kang, Sang-Goo
    • Korean Journal of Remote Sensing
    • /
    • v.27 no.3
    • /
    • pp.379-388
    • /
    • 2011
  • At present, GEOBIA (Geographic Object-based Image Analysis), heir of OBIA (Object-based Image Analysis), is regarded as an important methodology by object-oriented paradigm for remote sensing, dealing with geo-objects related to image segmentation and classification in the different view point of pixel-based processing. This also helps to directly link to GIS applications. Thus, GEOBIA software is on the booming. The main theme of this study is to look into the applicability of geo-spatial processing open source to GEOBIA. However, there is no few fully featured open source for GEOBIA which needs complicated schemes and algorithms, till It was carried out to implement a preliminary system for GEOBIA running an integrated and user-oriented environment. This work was performed by using various open sources such as OTB or PostgreSQL/PostGIS. Some points are different from the widely-used proprietary GEOBIA software. In this system, geo-objects are not file-based ones, but tightly linked with GIS layers in spatial database management system. The mean shift algorithm with parameters associated with spatial similarities or homogeneities is used for image segmentation. For classification process in this work, tree-based model of hierarchical network composing parent and child nodes is implemented by attribute join in the semi-automatic mode, unlike traditional image-based classification. Of course, this integrated GEOBIA system is on the progressing stage, and further works are necessary. It is expected that this approach helps to develop and to extend new applications such as urban mapping or change detection linked to GIS data sets using GEOBIA.

Determination of Reserved Channel Capacity for Popular Videos in Video-on-Demand Systems (주문형 비디오 시스템에서 인기 비디오를 위한 예약 채널 용량의 결정)

  • 하숙정;배인한
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.5_6
    • /
    • pp.223-231
    • /
    • 2003
  • Video-on-Demand (VOD) service needs high resource consumption because of high bandwidth and long playback duration which are characteristics of multimedia. Various techniques such as Patching and Channel-Reserving Patching have been proposed to reduce the demand on the network-I/O bandwidth. Patching allows new clients to join an existing multicast for realization of true VOD, and Channel-Reserving Patching reserves the part of total channel capacity of video server in order to serve the requests for popular videos on which requests of users concentrate. To improve the performance of Channel-Reserving Patching, we propose the method that determines the reserved channel capacity of video server for the popular videos in this paper. The performance of our method is evaluated in terms of average servile latency, defection ratio and fairness through simulation, and is compared with those of Patching and another Channel-Reserving Patching.

A Design and Implementation of Virtual Grid for Reducing Frequency of Continuous Query on LBSNS (LBSNS에서 연속 질의 빈도 감소를 위한 가상그리드 기법의 설계 및 구현)

  • Lee, Eun-Sik;Cho, Dae-Soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.4
    • /
    • pp.752-758
    • /
    • 2012
  • SNS(Social Networking Services) is oneline service that enable users to construct human network through their relation on web, such as following relation, friend relation, and etc. Recently, owing to the advent of digital devices (smart phone, tablet PC) which embedded GPS some applications which provide services with spatial relevance and social relevance have been released. Such an online service is called LBSNS. It is required to use spatial filtering so as to build the LBSNS system that enable users to subscribe information of interesting area. For spatial filtering, user and tweet attaches location information which divide into static property presenting fixed area and dynamic property presenting user's area changed along the moving user. In the case of using a location information including dynamic property, Continuous query occurred from the moving user causes the problem in server. In this paper, we propose spatial filtering algorithm using Virtual Grid for reducing frequency of query, and conclude that frequency of query on using Virtual Grid is 93% decreased than frequency of query on not using Virtual Grid.

Mtigating the IGMP Flooding Attacks for the IPTV Access Network (IPTV 접속망에서의 IGMP 플러딩 공격 효과 감소 기법)

  • Kim, Sung-Jin;Kim, Yu-Na;Kim, Jong
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.12
    • /
    • pp.998-1002
    • /
    • 2009
  • In IPTV multicast architecture, the IGMP(Internet Group Management Protocol) is used for access networks. This protocol supports the functionality of join or leave for a specific multicast channel group. But, malicious attackers can disturb legitimate users being served appropriately. By using spoofed IGMP messages, attackers can hi-jack the premium channel, wasting bandwidth and exhausting the IGMP router's resources. To prevent the message spoofing, we can introduce the packet-level authentication methods. But, it causes the additional processing overhead to an IGMP processing router, so that the router is more susceptible to the flooding attacks. In this paper, we propose the two-level authentication scheme in order to mitigate the IGMP flooding attack.

GAGPC : An Algorithm to Optimize Multiple Continuous Queries on Data Streams (GAGPC : 데이타 스트림에 대한 다중 연속 질의의 최적화 알고리즘)

  • Suh Young-Kyoon;Son Jin-Hyun;Kim Myoung-Ho
    • Journal of KIISE:Databases
    • /
    • v.33 no.4
    • /
    • pp.409-422
    • /
    • 2006
  • In general, there can be many reusable intermediate results due to the overlapped windows and periodic execution intervals among Multiple Continuous Queries (MCQ) on data streams. In this regard, we propose an efficient greedy algorithm for a global query plan construction, called GAGPC. GAGPC first decides an execution cycle and finds the maximal Set(s) of Related execution Points (SRP). Next, GAGPC constructs a global execution plan to make MCQ share common join-fragments with the highest benefit in each SRP. The algorithm suggests that the best plan of the same continuous queries may be different according to not only the existence of common expressions, but the size of overlapped windows related to them. It also reflects to reuse not only the whole but partial intermediate results unlike previous work. Finally, we show experimental results for the validation of GAGPC.

Software Development Education through Developing a usable Multiplayer Online Game (다중 사용자 온라인 게임 개발을 통한 소프트웨어 개발 교육)

  • Yoon, Ilmi;Ng, Gary;Kwon, Oh Young
    • The Journal of Korean Institute for Practical Engineering Education
    • /
    • v.4 no.2
    • /
    • pp.38-45
    • /
    • 2012
  • Building a game has been used as effective and attractive way of teaching computer science. Building a usable Multi-player Game is requires important aspects of technology, teamwork and software engineering principles. The whole class was structured in to several teams and students needed to join one or two teams. Each team presented their progress, discussed future milestones and troubleshoots, updated documents for clearer communication and utilized SVN(Subversion) throughout the semester. Unlike usual class setting, all students worked collaboratively together like one company to achieve the goal. In one semester, students started from concept design and completed a working Multiplayer Online Game called "deBugger" (Fall 2009), and "World of Balance" (Fall 2011), while learning game design, 3D graphics, Game Engine, Server-client architecture, Game Protocol, network programming, database, Software Engineering principles, and large application development as a team project.

  • PDF

A Study of Gifted Students' Peer Relationship in an Elementary School's General and Gifted Classes (초등 영재학생의 영재학급과 일반학급에서의 교우관계 분석)

  • Kwon, Hyeok-Cheon;Ha, Min-Su;Chung, Duk-Ho;Lee, Jun-Ki
    • Journal of Gifted/Talented Education
    • /
    • v.22 no.3
    • /
    • pp.757-777
    • /
    • 2012
  • Peer relationships in young students' communities are one of the important factors influencing the cognitive and affective domains of learning. Moreover, students who join the special program for gifted students possess differential peer relationships from the students in general classes. This study aims to explore the differences of 5th grade five science-gifted students' peer relationships between students in special classes for gifted students and general classes. Five students in the special program for gifted students, managed by the Office of Education in a southern city, participated in this study. Social network analyses were utilized to explore participants' peer relationships; the students' homeroom teacher was interviewed to explore the contextual and in-depth characteristics of gifted students' peer relationships. The results illustrated four cases of peer relationships: (1) smart loner (2) my study mate (3) I'm the best in my class, and (4) a good friend anywhere. This study identified that the gifted students possessed diverse peer relationships in both the special program and general classroom. In addition, this study suggests that the program for gifted students needs to be specially designed based on the gifted students' peer relationship.