• Title/Summary/Keyword: mobile cluster

Search Result 310, Processing Time 0.027 seconds

An Optimal Resource Distribution Scheme for P2P Streaming Service over Centralized DU Environment in LTE (LTE에서 집중화된 DU 환경에서 P2P 스트리밍 서비스를 위한 최적의 자원 배분 방안)

  • Kim, Yangjung;Chong, Ilyoung
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.3 no.3
    • /
    • pp.81-86
    • /
    • 2014
  • According to the development of streaming services with P2P and mobile network technologies, researches to enhance the service quality in mobile environment have been proposed. However, streaming services considering high-speed mobile environment and characteristics of heterogenous terminals have been hindered from being provided with the required quality from user because of bandwidth congestion between selfish peers of existing P2P system. It is also prone to long delay and loss in accordance with the repeated traffic amounts because there are no optimized solution for traffic localization. The structure to enhance peer contribution for service differentiation and peer selection with clustering scheme with location information of terminal can satisfy both users and service providers with service quality and efficiency. In this paper, we propose an incentive mechanism and resource distribution scheme with user contribution and traffic cost information based on user location, which make mobile users increase the satisfaction of service quality in LTE environments.

An Efficient Implementation of Mobile Raspberry Pi Hadoop Clusters for Robust and Augmented Computing Performance

  • Srinivasan, Kathiravan;Chang, Chuan-Yu;Huang, Chao-Hsi;Chang, Min-Hao;Sharma, Anant;Ankur, Avinash
    • Journal of Information Processing Systems
    • /
    • v.14 no.4
    • /
    • pp.989-1009
    • /
    • 2018
  • Rapid advances in science and technology with exponential development of smart mobile devices, workstations, supercomputers, smart gadgets and network servers has been witnessed over the past few years. The sudden increase in the Internet population and manifold growth in internet speeds has occasioned the generation of an enormous amount of data, now termed 'big data'. Given this scenario, storage of data on local servers or a personal computer is an issue, which can be resolved by utilizing cloud computing. At present, there are several cloud computing service providers available to resolve the big data issues. This paper establishes a framework that builds Hadoop clusters on the new single-board computer (SBC) Mobile Raspberry Pi. Moreover, these clusters offer facilities for storage as well as computing. Besides the fact that the regular data centers require large amounts of energy for operation, they also need cooling equipment and occupy prime real estate. However, this energy consumption scenario and the physical space constraints can be solved by employing a Mobile Raspberry Pi with Hadoop clusters that provides a cost-effective, low-power, high-speed solution along with micro-data center support for big data. Hadoop provides the required modules for the distributed processing of big data by deploying map-reduce programming approaches. In this work, the performance of SBC clusters and a single computer were compared. It can be observed from the experimental data that the SBC clusters exemplify superior performance to a single computer, by around 20%. Furthermore, the cluster processing speed for large volumes of data can be enhanced by escalating the number of SBC nodes. Data storage is accomplished by using a Hadoop Distributed File System (HDFS), which offers more flexibility and greater scalability than a single computer system.

An Efficient Dynamic Group Key Agreement for Low-Power Mobile Devices (저전력 모바일 장치에 적합한 효율적인 동적 그룹 키 동의)

  • Cho Seokhyang;Nam Junghyun;Kim Seungjoo;Won Dongho;Lee Hyejoo;Choi Jinsoo
    • The KIPS Transactions:PartC
    • /
    • v.12C no.2 s.98
    • /
    • pp.157-168
    • /
    • 2005
  • Group key agreement protocols are designed to provide a group of parties securely communicating over a public network with a session key. The mobile computing architecture is asymmetric in the sense of computational capabilities of participants. That is, the protocol participants consist of the stationary server(application servers) with sufficient computational Power and a cluster of mobile devices(clients) with limited computational resources. It is desirable to minimize the amount of computation performed by each group member in a group involving low-power mobile devices such as smart cards or personal digital assistants(PDAs). Furthermore we are required to update the group key with low computational costs when the members need to be excluded from the group or multiple new members need to be brought into an existing group. In this paper, we propose a dynamic group key protocol which offers computational efficiency to the clients with low-power mobile devices. We compare the total communicative and computational costs of our protocol with others and prove its suity against a passive adversary in the random oracle model.

Designing mobile personal assistant agent based on users' experience and their position information (위치정보 및 사용자 경험을 반영하는 모바일 PA에이전트의 설계)

  • Kang, Shin-Bong;Noh, Sang-Uk
    • Journal of Internet Computing and Services
    • /
    • v.12 no.1
    • /
    • pp.99-110
    • /
    • 2011
  • Mobile environments rapidly changing and digital convergence widely employed, mobile devices including smart phones have been playing a critical role that changes users' lifestyle in the areas of entertainments, businesses and information services. The various services using mobile devices are developing to meet the personal needs of users in the mobile environments. Especially, an LBS (Location-Based Service) is combined with other services and contents such as augmented reality, mobile SNS (Social Network Service), games, and searching, which can provide convenient and useful services to mobile users. In this paper, we design and implement the prototype of mobile personal assistant (PA) agents. Our personal assistant agent helps users do some tasks by hiding the complexity of difficult tasks, performing tasks on behalf of the users, and reflecting the preferences of users. To identify user's preferences and provide personalized services, clustering and classification algorithms of data mining are applied. The clusters of the log data using clustering algorithms are made by measuring the dissimilarity between two objects based on usage patterns. The classification algorithms produce user profiles within each cluster, which make it possible for PA agents to provide users with personalized services and contents. In the experiment, we measured the classification accuracy of user model clustered using clustering algorithms. It turned out that the classification accuracy using our method was increased by 17.42%, compared with that using other clustering algorithms.

Energy Efficiency Routing Algorithm for Vessel Ubiquitous Sensor Network Environments (선박 USN에서 에너지 효율성을 위한 라우팅 알고리즘)

  • Choi, Myeong-Soo;Pyo, Se-Jun;Lee, Jin-Seok;Yoon, Seok-Ho;Lee, Seong-Ro
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.5B
    • /
    • pp.557-565
    • /
    • 2011
  • In this paper, we assume that sensor nodes organize the multi-hop networks, are fixed, and operate as full function devices(FFD). The wireless sensor network(WSN) only consists of mobile nodes without the assistance from the fixed infrastructure, which increases the flexibility of the network. However, it is difficult to perform routing in the WSN, since sensor nodes freely join in and drop out of the network, and some sensor nodes have very low power. We propose the algorithm combining routing schemes based on the bitmap and cluster methods in this paper. Through computer simulations, we show the validity of the proposed algorithm.

Implementation of QoS Provisioning Model in VANET (VANET에서 QoS Provisioning모델의 구현)

  • Huh, Jee-Wan;Song, Wang-Cheol
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2009.05a
    • /
    • pp.884-888
    • /
    • 2009
  • Vehicular Adhoc Networks (VANET), a Vehicle-to-Infrastucture or Vehicle-to-Vehicle communication technology, is an area that makes more specific use of Mobile Adhoc Networks(MANET). VANET's Quality of Service(QoS) focuses on preventing possible emergencies like car crash from happening by immediately transmitting information to the cars around, while MANET's QoS is being studied for the quality of multimedia data such as Video on Demand(VoD), Video streaming, Voice over IP(VoIP), etc. In this paper, I structure the actual network configuration using Link State Routing(LSR), implement QoS Provisioning Model using Common Open Policy Service(COPS), and suggest more effective k-hop Cluster and inter-domain policy negotiation which fit better to the characteristics of VANET.

  • PDF

A Study on Secure Routing Protocol using Multi-level Architecture in Mobile Ad Hoc Network (Multi-level 구조를 이용한 보안 라우팅 프로토콜에 관한 연구)

  • Yang, Hwan Seok
    • Convergence Security Journal
    • /
    • v.14 no.7
    • /
    • pp.17-22
    • /
    • 2014
  • Wireless Ad hoc Network is threatened from many types of attacks because of its open structure, dynamic topology and the absence of infrastructure. Attacks by malicious nodes inside the network destroy communication path and discard packet. The damage is quite large and detecting attacks are difficult. In this paper, we proposed attack detection technique using secure authentication infrastructure for efficient detection and prevention of internal attack nodes. Cluster structure is used in the proposed method so that each nodes act as a certificate authority and the public key is issued in cluster head through trust evaluation of nodes. Symmetric Key is shared for integrity of data between the nodes and the structure which adds authentication message to the RREQ packet is used. ns-2 simulator is used to evaluate performance of proposed method and excellent performance can be performed through the experiment.

Intrusion Detection System based on Cluster (클러스터를 기반으로 한 침입탐지시스템)

  • Yang, Hwan-Seok
    • Journal of Digital Contents Society
    • /
    • v.10 no.3
    • /
    • pp.479-484
    • /
    • 2009
  • Security system of wireless network take on importance as use of wireless network increases. Detection and opposition about that is difficult even if attack happens because MANET is composed of only moving node. And it is difficult that existing security system is applied as it is because of migratory nodes. Therefore, system is protected from malicious attack of intruder in this environment and it has to correspond to attack immediately. In this paper, we propose intrusion detection system using cluster head in order to detect malicious attack and use resources efficiently. we used method that gathering of rules is defined and it judges whether it corresponds or not to detect intrusion more exactly. In order to evaluate performance of proposed method, we used blackhole, message negligence, jamming attack.

  • PDF

Efficient and Secure Routing Protocol forWireless Sensor Networks through SNR Based Dynamic Clustering Mechanisms

  • Ganesh, Subramanian;Amutha, Ramachandran
    • Journal of Communications and Networks
    • /
    • v.15 no.4
    • /
    • pp.422-429
    • /
    • 2013
  • Advances in wireless sensor network (WSN) technology have enabled small and low-cost sensors with the capability of sensing various types of physical and environmental conditions, data processing, and wireless communication. In the WSN, the sensor nodes have a limited transmission range and their processing and storage capabilities as well as their energy resources are limited. A triple umpiring system has already been proved for its better performance in WSNs. The clustering technique is effective in prolonging the lifetime of the WSN. In this study, we have modified the ad-hoc on demand distance vector routing by incorporating signal-to-noise ratio (SNR) based dynamic clustering. The proposed scheme, which is an efficient and secure routing protocol for wireless sensor networks through SNR-based dynamic clustering (ESRPSDC) mechanisms, can partition the nodes into clusters and select the cluster head (CH) among the nodes based on the energy, and non CH nodes join with a specific CH based on the SNR values. Error recovery has been implemented during the inter-cluster routing in order to avoid end-to-end error recovery. Security has been achieved by isolating the malicious nodes using sink-based routing pattern analysis. Extensive investigation studies using a global mobile simulator have shown that this hybrid ESRP significantly improves the energy efficiency and packet reception rate as compared with the SNR unaware routing algorithms such as the low energy aware adaptive clustering hierarchy and power efficient gathering in sensor information systems.

A Study on Detection Improvement Technique of Black Hole Node in Ad Hoc Network (Ad Hoc Network에서 블랙 홀 노드 탐지 향상 기법에 관한 연구)

  • Yang, HwanSeok;Yoo, SeungJae
    • Convergence Security Journal
    • /
    • v.13 no.6
    • /
    • pp.11-16
    • /
    • 2013
  • Mobile node must move optionally and perform the router and the host functions at the same time. These characteristics of nodes have become a potential threatening element of a variety of attacks. In particular, a black hole which malicious node causes packet loss among them is one of the most important issues. In this paper, we propose distributed detection technique using monitoring tables in all node and cooperative detection technique based cluster for an efficient detection of black hole attack. The proposed technique performs by dividing into local detection and cooperative detection process which is composed of process of step 4 in order to improve the accuracy of the attack detection. Cluster head uses a black hole list to cooperative detection. The performance of the proposed technique was evaluated using ns-2 simulator and its excellent performance could be confirmed in the experiment result.