Robot Human Interface for Housekeeper Robot with Wireless Capabilities

Suhad Faisal Behadili 

Computer Science Department, Science Collage, University Of Baghdad, Iraq

 ABSTRACT 

This paper presents the design and implementation of a Human Interface for a housekeeper robot. It bases on the idea of making the robot understand the human needs without making the human go through the details of robots work, for example, the way that the robot implements the work or the method that the robot uses to plan the path in order to reach the work area. The interface commands based on idioms of the natural human language and designed in a manner that the user gives the robot several commands with their execution date/time. As a result, the robot has a list of tasks to be doneon certain dates/times. However, the robot performs the tasks assigned to it without any human intervention and then gives feedback to the human about each task progress in a dedicated list. As well as, the user decides to get the feedback either through the interface, through the wireless communication, or both of them. Hence, the user’s presence not necessary during the robot tasks execution.

 KEYWORDS

 Housekeeper, robot, wireless, human, mobile, tasks. 

More Details: 

Proposed Load Balancing Algorithm to Reduce Response Time and Processing Time on Cloud Computing

Nguyen Xuan Phi1 , Cao Trung Tin2 , Luu Nguyen Ky Thu3 and Tran Cong Hung4 

1,2,3,4 Posts and Telecommunications Institute of Technology, Ho Chi Minh, Vietnam.

 ABSTRACT

Cloud computing is a new technology that brings new challenges to all organizations around the world. Improving response time for user requests on cloud computing is a critical issue to combat bottlenecks. As for cloud computing, bandwidth to from cloud service providers is a bottleneck. With the rapid development of the scale and number of applications, this access is often threatened by overload. Therefore, this paper our proposed Throttled Modified Algorithm(TMA) for improving the response time of VMs on cloud computing to improve performance for end-user. We have simulated the proposed algorithm with the CloudAnalyts simulation tool and this algorithm has improved response times and processing time of the cloud data center.

 KEYWORDS

Load balancing; response time; cloud computing; processing time. 

More Details:

Improved Handover Algorithm to Avoid Duplication AAA Authentication in Proxy MIPV6

Hewei Yu1 and Meiling Zhou2 

1 School of Computer Science & Engineering, South China University of Technology, Guang Zhou, P.R.China

 2GF Fund Management Co., Ltd., Guang Zhou, P.R.China 

ABSTRACT

 This paper proposes an improved handover algorithm which does not need authenticating again if Mobile Node moves within the same Proxy MIPv6 domain. When MN enters PMIPv6 domain at the first time, it needs to make an AAA authentication. But when MN moves between MAGs in the same domain, it can perform handover procedure without the second times of AAA authentication, and speed the handover process. We built a structure of PMIPv6 including AAA server on NS-2 and set up a real test-bed, and proposed an improved handover algorithm for PMIPv6 based on AAA authentication. The simulation and testing results show that the new scheme can effectively reduce the handover latency and ratio of packet loss, and improve network performance. 

KEYWORDS

 PMIPv6; AAA; handover; fast handover 

More Details:

An Effective Privacy-Preserving Data Coding in Peer-To-Peer Network

Ngoc Hong Tran1 , Cao Vien Phung 2 , Binh Quoc Nguyen 1 , and Leila Bahri 3 

Vietnamese-German University 1 , Vietnam, Technische Universität Carolo-Wilhelmina zu Braunschweig2 , Germany, and KTH 1 , Sweden 

Abstract 

Coding Opportunistically (COPE) is a simple but very effective data coding mechanism in the wireless network. However, COPE leaves risks for attackers easily getting the private information saved in the packets, when they move through the network to their destination nodes. Hence, a lightweight cryptographic approach, namely SCOPE, was proposed to consolidate COPE against the honest-but-curious and malicious attacks. Honest-but-curious attack serves adversaries who accurately obey the protocol but try to learn as much private information as possible for their curiosity. Additionally, this kind of attack is not destructive consequently. However, it may leave the backdoor for the more dangerous attacks carrying catastrophes to the system. Malicious attack tries to learn not only the private information but also modifies the packet on harmful purposes. To cope with this issue, in this work, a lightweight cryptographic approach improves COPE, namely SCOPE, that is defensive to the both attacks. The private information in the COPE packet are encrypted by Elliptic Curve Cryptography (ECC), and an additional information is inserted into SCOPE packets served for the authentication process using the lightweight hash Elliptic Curve Digital Signature Algorithm (ECDSA). We then prove our new protocol is still guaranteed to be a secure method of data coding, and to be light to effectively operate in the peer-to-peer wireless network. 

Keywords

 Network Coding, Peer-to-Peer, Homomorphic Encryption, Elliptic Curve Cryptography (ECC), Elliptic Curve Digital Signature Algorithm (ECDSA), Honest-But-Curious Attack, Malicious Attac

More Details:

Efficient PAPR Reduction Approach for Selective Mapping in a STBC MIMO-OFDM System

VijayaLakshmi M1 and K Rama Linga Reddy2 

1ETM Dept, GNITS, Hyderabad, India 

2 HOD, ETM Dept, GNITS, Hyderabad, India

  ABSTRACT 

The demand for wireless communication increases every day. MIMO system increases the channel capacity without increasing the bandwidth. OFDM eliminates inter-symbol interference very effectively. By combining both these technologies ,the resultant data rates are increased and also robustness to multi path fading effects. But the main drawback of MIMO-OFDM system is its high PAPR. Selective mapping(SLM) is one of the popular distortion less technique for reducing high PAPR but the computational complexity for searching optimum phase factors is high. Many evolutionary algorithms like particle swarm optimisation, artificial bee colony optimization algorithm, cuckoo search algorithm are proposed for searching optimum phase factors. In this paper two new optimization algorithms social spider optimization(SSO), adaptive artificial bee colony algorithm are proposed for SLM and Simulation results shows that compared to adaptive artifctial bee colony algorithm, social spider optimization algorithm(SSO) gives best phase factors for lower PAPR with fewer number of iterations and also reduces the computational complexity of SLM technique very efficiently. 

KEYWORDS

 Multiple input multiple output(MIMO),orthogonal frequency division multiplexing(OFDM),peak to average power ratio(PAPR). Space time block codes(STBC).

More Details:

Chained Displays : Configuration of Multiple Co-Located Public Displays

Amir E. Sarabadani Tafreshi, Milan Bombsch and Gerhard Troster 

¨ ETH Zurich, CH-8092 Z ¨ urich, Switzerland ¨

 ABSTRACT 

Networks of pervasive display systems involving public and semi-public displays have allowed experiences to be created that span across multiple displays to achieve a stronger effect on the viewers. However, little research has been done so far on the configuration of content for multiple displays, especially when encountered in sequence in what is commonly referred to as chained displays. As a first step towards determining appropriate configuration strategies for chained displays, we have identified and investigated different approaches for configuring content. We report on a user study on the effect of the different configuration models in terms of usability and user engagement. 

KEYWORDS 

Configuration model; Multiple displays; Pervasive display; Content; usability; user engagement.

More Details: 

Deployment of Intrusion Prevention System on Multi-Core Processor Based Security Hardware

Swetha K V1 and Ravi Dara2 

1Department of Computer Science & Engineering, CMR Institute of Technology, Bangalore, India 2Nevis Networks(I) Pvt.Ltd., Pune, India 

ABSTRACT

 After tightening up network perimeter for dealing with external threats, organizations have woken up to the threats from inside Local Area Networks (LAN) over the past several years. It is thus important to design and implement LAN security strategies in order to secure assets on LAN by filtering traffic and thereby protecting them from malicious access and insider attacks. Banking Financial Services and Insurance (BFSI) industry is one such segment that faces increased risks and security challenges. The typical architecture of this segment includes several thousands of users connecting from various branches over Wide Area Network (WAN) links crossing national and international boundaries with varying network speed to access data center resources. The objective of this work is to deploy LAN security solution to protect the data center located at headquarters from the end user machines. A LAN security solution should ideally provide Network Access Control (NAC) along with cleaning (securing) the traffic going through it. Traffic cleaning itself includes various features like firewall, intrusion detection/prevention, traffic anomaly detection, validation of asset ownership etc. LANenforcer (LE) is a device deployed in front of the data center such that the traffic from end-user machines necessarily passes through it so that it can enforce security. The goal of this system is to enhance the security features of a LANenforcer security system with Intrusion Prevention System (IPS) to enable it to detect and prevent malicious network activities. IPS is plugged into the packet path based on the configuration in such a way that the entire traffic passes through the IPS on LE. 

KEYWORDS

 LAN security, LANenforcer, IPS, Security hardware, Multi-core processor 

More Details:

DPI-Based Congestion Control Method for Servers and Network Lines

Shin-ichi Kuribayashi 

Department of Computer and Information Science, Seikei University, Japan

ABSTRACT

 The use of Deep Packet Inspection (DPI) equipment in a network could simplify the conventional workload for system management and accelerate the control action. The authors proposed a congestion control method that uses DPI equipment installed in a network to estimate overload conditions of servers or network lines and, upon detecting an overload condition, resolves congestion by moving some virtual machines to other servers or rerouting some communication flows to other routes. However, since the previous paper was focused on confirming the effectiveness of using DPI technology, it assumed some restrictive control conditions. This paper proposes to enhance the existing DPI-based congestion control, in order to dynamically select an optimal solution for cases where there are multiple candidates available for: virtual machines to be moved, physical servers to which virtual machines are to be moved, communication flows to be diverted, and routes to which communication flows are to be diverted. This paper also considers server congestion for cases where computing power congestion and bandwidth congestion occur simultaneously in a server, and line congestion for cases where the maximum allowable network delay of each communication flow is taken into consideration. Finally, the feasibility of the proposed methods is demonstrated by an evaluation system with real DPI equipment. 

KEYWORDS 

Deep packet inspection, congestion control, network, server

More Details: 

Special Issue on: "Cyber Physical Systems"

http://airccse.org/journal/sicfp18.html

Guest Editors:

V.Vijayakumar,
VIT University,
India

V. Neelanarayanan,
VIT University,
India

P. Nithyanandam,
VIT University,
India

Siguang Chen,
Nanjing University of Posts and Telecommunications,
China

Theme and Scope

Cyber-Physical Systems (CPS) are integrations of computation, networking, and physical
processes. The vision of CPS faces some core challenges of multidisciplinary research, as their
relevant technologies appear in diverse areas of science and engineering.

This special issue is intended to cover contributions in both the design and analysis in the field of
Cyber Physical Systems. The special issue will additionally select high quality papers from the
International Conference on Recent Trends in Advance Computing - Cyber Physical Systems
(ICRTAC-CPS), to be held in VIT Chennai, India, September 2018.

Topics of interest

Authors are solicited to contribute to this Special Issue by submitting articles that illustrate
research results, projects, surveying works and industrial experiences that describe significant
advances in the following areas, but are not limited to:

• Design, synthesis and verification of CPS
• Sustainability and environmental issues in CPS
• Social CPS computing
• Industrial CPS and smart manufacturing
• Applications of CPS in various domains such as smart energy systems, robotics and
automation, automotive and transportation systems, smart healthcare, surveillance
systems, etc
• Adaptive attack mitigation for CPS
• Authentication and access control for CPS
• Availability, recovery and auditing for CPS
• Data security and privacy for CPS
• Embedded systems security and privacy
• EV charging system security
• Urban transportation system security
• Vulnerability analysis for CPS
• Wireless sensor network security and privacy
• Big data modeling and analytics for CPS
• Cross-layer modeling and optimization for CPS
• Design automation for CPS
• Embedded system design for CPS
• Intrusion detection for CPS
• Key management in CPS
• Legacy CPS system protection
• Lightweight crypto and security
• Security and privacy in industrial control systems
• Smart grid security
• Threat modeling for CPS
• CPS fault detection and recovery
• CPS security and privacy

Notes for Prospective Authors

Submissions must be original and should not have been published previously or be under
consideration for publication while being evaluated for this Issue. Manuscripts should be written
in English and strictly follow the guideline of the Journal IJCNC. The manuscripts should be
submitted to one of the guest editors by July 15, 2018 through email cpss@airccse.org

Important Dates

• Submission Deadline : July 15, 2018
• Notification : October 15, 2018
• Final manuscript due : October 30, 2018

For more details please visit: http://airccse.org/journal/ijcnc.html