8th International Conference on Computer Science, Engineering and Applications

February 17~18, 2018, Melbourne, Australia

Accepted Papers


  • A Proposed Architecture for a Heterogeneous Unmanned Aerial Vehicles System
    Ahmed Barnawi, Abdullah Almalaise and Asif I. Khan, Faculty of Computing and IT, King Abdulaziz University, Jeddah 21589, Saudi Arabia
    ABSTRACT
    With the latest advancement in wireless communications and digital electronics, the design and development of low-cost, low-power, multifunctional autonomous vehicles have become possible. This paper describes a software architecture of a system that aims to develop an experimental test-bed for Heterogeneous Unmanned Aerial Vehicles (UAVs). The software architecture proposed in the paper has hardware abstraction that hides low-level complexity from the application developer who uses API to interact with the UAVs. The test bed framework is based on modular architecture that can be easily extensible and support design principles like scalability and reusability. The main novelty of this architectural design is the user interface which from one side is meant to connect the operator to the system and from the other is meant to connect the system to the robotic agents via in-the-house developed API's. UAVs mission and functionalities are controlled by well-developed graphical user interface (GUI) which integrates all information of the mission in the single GUI.
  • On the Duality Feature of P-class Problems and NP Complete Problems
    Wenhong Tian, University of Electronic Science and Technology of China, Chengdu, China
    ABSTRACT
    In term of computational complexity, P-class (abbreviated as P) problems are polynomial-time solvable by deterministic Turing machine while NP complete (abbreviated as NPC) problems are polynomial-time solvable by nondeterministic Turing machine. P and NPC problems are regularly treated in different classes. Determining whether or not it is possible to solve NPC problems quickly, is one of the principal unsolved problems in computer science today. In this paper, a new perspective is provided: both problems and NPC problems have the duality feature in terms of computational complexity of a symptotic efficiency of algorithms.
  • An Integer Programming Model for Embedding Social Values into Software Requirement Selection
    Davoud Mougouei and David M W Powers, Flinders University, Adelaide, Australia
    ABSTRACT
    Software requirement selection is traditionally guided by economic worth of software products. The existing requirement section models thus aim to optimize the economic value of a software product ignoring its social values and their long-term impacts on the society. Social values of a software product however, are important and need to be considered in requirement selection. Moreover, social and economic values of requirements may change in the presence or absence of other requirements due to the relationships and conflicts among those requirements. These dependencies are imprecise and hard to specify in software projects. This paper presents an integer programming model for embedding social and economic values and dependencies among them into software requirement selection. We further, account for imprecision of values and dependencies among them using the algebraic structure of fuzzy graphs.
  • Partial Selection of Software Requirements : A fuzzy Method
    Davoud Mougouei and David M W Powers, Flinders University, Adelaide, Australia
    ABSTRACT
    Resource constraints in software projects rarely allow for all of the requirements to be implemented. Hence, prioritization and selection of requirements is inevitable. This often results in value loss by accidentally ignoring requirements with positive influence on the values of the selected requirements. To mitigate this, we have presented a fuzzy method that allows for partial selection (satisfaction) of requirements rather than ignoring them or postponing them to the future. The proposed method helps reduce the value loss by reducing the chances that requirements with positive influences on the values of other requirements are ignored. The method is scalable to software projects with large number of requirements and allows for prioritization and selection of requirements with respect to different goals.
  • Performance Evaluation of Mobile IP on Mobile Ad hoc Networks using NS2
    Kingsley K. Ofosu, Jamal-Deen Abdulai and Ferdinand A. Katsriku, Department of Computer Science, University of Ghana, Legon-Accra, Ghana
    ABSTRACT
    Mobile computing devices equipped with transceivers form Mobile Ad Hoc Networks (MANET) when two or more of these devices find themselves within transmission range. MANETs are stand-alone (no existing infrastructure needed), autonomous networks that utilise multi-hop communication to reach nodes out of transmitter range. Unlike infrastructure networks e.g. the Internet with fixed topology, MANETs are dynamic. Despite the heterogeneous nature of these two networks, integrating MANETs with the Internet extends the network coverage and adds to the application domain of MANETs. One of the many ways of combining MANETs with the Internet involves using Mobile Internet Protocol (Mobile IP) and a MANET protocol to route packets between the Internet and the MANET via Gateway agents. In this paper, we evaluate the performance of Mobile IP on MANET in Network Simulator 2 (NS2). We have implemented Mobile IP on Ad hoc On-demand Distance Vector (AODV), Ad hoc On-demand Multiple Distance Vector (AOMDV) and Destination-Sequenced Distance Vector (DSDV) routing protocols and compared performances based on Throughput, End-to-End Delay (E2ED), Packet Delivery Ratio (PDR) and Normalized Packet Ratio (NPR). The simulation results suggest that on-demand routing within the MANET better serves Mobile IP on MANETs.
  • Load Balancing Management using Fuzzy Logic to Improve the Report Transfer Success Rate
    ABSTRACT
    A wireless sensor network (WSN) consists of multiple sensor nodes and base stations (BS) that collect information over widely deployed sensor nodes. Sensor nodes have limited energy source and low computing power. Due to those features, there is a disadvantage that user's individual node management is difficult and they are easily captured by attackers. Therefore, efficient energy allocation of nodes is important and network security protocol is needed. The Probabilistic Voting Filtering System (PVFS) is a system that prevents false vote injection attack and false report attack injected from attackers. The reason for the existence of this protocol is for energy management of nodes through defence against those attacks and in order to efficiently manage the network based on PVFS, load balancing of nodes should be performed. In the proposed scheme, fuzzy logic is applied to each cluster head node (CH) to perform load balancing by determine whether to perform a role as a verification node and an event forwarding node. The experiment shows that the event detection rate and the report delivery success rate are improved in proposed scheme compare with original PVFS.
  • Analysis of an Optimized Trajectory in Mobile Ad Hoc Networks
    Apurva Sharma, Galgotias University, India and Piyush Anand, Noida International University, India
    ABSTRACT
    Mobile ad hoc network (MANET) is an auto-coordinated, framework less, auto-collecting and auto-controlling arrangement of mobile hubs associated by remote connections. The hubs move subjectively and may join or leave the network at their own. In the present work an endeavor has been made to give an examination on the portability models utilized as a part of an Ad Hoc network utilizing diverse steering conventions. Five distinctive versatility models, for example, Random waypoint, Random walk, Pursue, Pursue Smart and Group Mobility Model are actualized. The execution of three directing convention DSR, OLSR and GRP is thought about by utilizing diverse portability models. Reproductions have been done utilizing OPNET Simulator 14.0 and execution investigation has been done in view of the outcomes acquired by utilizing two diverse execution measurements, for example, Retransmission Attempts and Throughput utilizing network of 40 mobile hubs for every situation. Recreation comes about have shown that Hybrid conventions (GRP) beats every one of the conventions in all the versatility models as far as throughput.
  • Improving Fairness of Channel Assignment Algorithm based on Weighted Links Ranking Scheme for Wireless Mesh Network
    Fuad A. Ghaleb, Maznah Kamat, Mazleena Salleh, Mohd. Foad Rohani, Shukor Abd Razak, Universiti Teknologi Malaysia, Malaysia
    ABSTRACT
    Wireless Mesh Networks (WMNs) are promising means to provide inexpensive deployment, flexible and fast broadband access. Recent WMNs use multiple-radio and multiple channels to provide high performance. However, interference between channels is considered the key challenge for WMN performance. In WMN, the data flows are directed from/to the gateways. Thus, the quality of the critical links close to the gateways should be properly considered during channel assignments. Otherwise, network fragmentation and bottleneck problem may occur affecting the performance of the network due to the congestions, and unfair channel distribution. Unfortunately, existing channel assignments lack consideration this issue by focusing only on the link close to the gateways and neglecting other critical links. In this paper, a fair channel assignment algorithm is proposed based on weighted link ranking scheme in order to minimize the interference and thus improve the capacity of the network. The links are fairly ranked based on multiple criteria obtained from traffic and network topology such as distance from the gateways, interference index, and, traffic load. The results from numerical simulation have demonstrated that the proposed channel assignment algorithm has good performance in terms of reducing the interference and improving the network capacity. Accordingly, the proposed algorithm achieves the fairness of channel distribution to improve network performance.
  • Improving Fairness of Channel Assignment Algorithm based on Weighted Links Ranking Scheme for Wireless Mesh Network
    Fuad A. Ghaleb, Maznah Kamat, Mazleena Salleh, Mohd. Foad Rohani, Shukor Abd Razak, Universiti Teknologi Malaysia, Malaysia
    ABSTRACT
    Wireless Mesh Networks (WMNs) are promising means to provide inexpensive deployment, flexible and fast broadband access. Recent WMNs use multiple-radio and multiple channels to provide high performance. However, interference between channels is considered the key challenge for WMN performance. In WMN, the data flows are directed from/to the gateways. Thus, the quality of the critical links close to the gateways should be properly considered during channel assignments. Otherwise, network fragmentation and bottleneck problem may occur affecting the performance of the network due to the congestions, and unfair channel distribution. Unfortunately, existing channel assignments lack consideration this issue by focusing only on the link close to the gateways and neglecting other critical links. In this paper, a fair channel assignment algorithm is proposed based on weighted link ranking scheme in order to minimize the interference and thus improve the capacity of the network. The links are fairly ranked based on multiple criteria obtained from traffic and network topology such as distance from the gateways, interference index, and, traffic load. The results from numerical simulation have demonstrated that the proposed channel assignment algorithm has good performance in terms of reducing the interference and improving the network capacity. Accordingly, the proposed algorithm achieves the fairness of channel distribution to improve network performance.