Accepted Papers

  • Research and Implementation of Load Balancing Algorithm for Mass Mobile Application Detection Task
    Yanhui Guoang1,2, Yingjie He1,2,Xiaoming Liu3, 1Beijing University of Posts and Telecommunications, 2NEL of Security Technology for Mobile Internet, 3National Computer Network Emergency Response Technical Team/Coordination Center of China, China
    With the development of the Fifth Generation Communication Technology, the smart phone has become an essential thing to people, and the number of mobile applications is growing at an unprecedented speed. In this paper, a load balancing algorithm for mobile application security detection on the basis of the traditional load balancing algorithm is proposed. Considering the characteristics of mobile application detection task, the application control flow complexity(ACFC) will be introduced as the load value calculation parameters. After experimental verification,the task efficiency can be greatly improved by the proposed algorithm.
  • Enhanced Protocol for Wireless Content-Centric Network
    Chan-Min Park, Rana Asif Rehman, Tran Dinh Hieu and Byung-Seo, KimHongik University, Sejong, Republic of Korea
    Recently, Content-Centric Networking (CCN) was introduced and is expected as a new concept of future internet architecture. Even though CCN is initially studied for wired networks, recently, it is also studied for wireless environment. In this paper, we discuss improvement method for efficient content flooding over wireless CCNs. The proposed scheme of this paper use MAC Address of nodes when Interest and Data Packet are forwarded in order to limit the area of flooding of packets. The proposed protocol not only reduces the spread of Data packets, but also offers priority of forwarding to nodes of shortest path. As a consequence, it reduce content download time which is proved by extensive simulations.
  • Implementation and Performance analysis of Probabilistic Cognitive Relay using USRP2
    Amith Khandakar, and Amr Mohamed, Qatar University, Qatar
    Cognitive Relaying is the concept where secondary users (SUs) help primary users (PUs) by relaying its traffic. This paper aims to propose the possibility of studying and comparing the performance of cognitive relaying using an experimental framework developed with USRP2. We practically analyse the effect of probabilistic relaying and scheduling on optimizing the delay and throughput of both SU and PU. A protocol is developed with cooperative policies and implemented, where the SU serves either its own data or the PU relayed data with certain service probabilities. An additional admission control is introduced to allow the PU data to be relayed by the SU, whereby a primary user’s packet is admitted to the relay queue of secondary user with certain admission probability. The proposed randomized policy introduces a fundamental trade-off between the delays of the primary user and secondary user. Consequently, it opens room for trading the primary user delay for enhanced secondary user delay and vice versa. The effect of varying the scheduling and admission probabilities is thoroughly investigated using the test setup. Finally the practical results are verified with the simulation and theoretical results, and a conclusion is drawn from the results of the combined effects of probability of relaying and scheduling on the performance of the PU and SU in a cognitive relay environment.