International Journal of Computer Networks and Applications

80 - 91

Authors: Hamida Lubuva, Qiming Huang, Godfrey Charles Msonde

In recent years, Android has been the main mobile operating system. The proliferation of apps powered not only by Android magnetized app developers, but also by malware developers with criminal intent to design and distribute malicious apps that can influence the ordinary activity of Android phones and tablets, steal private information and credentials, or even worse, lock the phone and ask for ransom. This study was carried out with a view of bring out clearly the review of previous researches carried regarding static analysis and pinpoint out what to be done in future. A systematic literature review which involves studying 56 research papers published in regard to static analysis. This review elaborate permissions misuse, reverse engineering and concept of static analysis in general. The outcomes of the review revealed that static analysis is widely used since it is not performed at run-time hence malicious applications cannot access to the device during analysis unlike dynamic analysis. During the review no single work done to the satisfaction curbing the existing and future evolving malwares. This study will help academicians to gain insight concerning static analysis without extensively perusing several articles to understand static malware analysis based on deep learning.

65 - 72

Authors: Getamesay Haile, Dereje Yohannes, Kebebew Ababu

In this paper we proposed a novel emergency message forwarding scheme for VANET (Vehicular Ad-hoc Network) which can capable of tackling broadcast storm problem by reducing unwanted network traffic. Safety application of VANET by its nature is time critical and it needs low delay and needs to be disseminated on time. So applying broadcasting technique is the best option in safety application for VANET. But applying simple broadcasting causes broadcast storm problem due to high number of unwanted network traffic. Unwanted network traffic happens when the number of nodes to rebroadcast the emergency message is increased. The numbers of forwarder node to re-transmit the emergency message have high effect on the network. So, one of the solution to reduce unwanted traffic is applying selective forwarding scheme to broadcast emergency message and minimize the number of forwarder node which rebroadcast the emergency message. The aim of this paper is to design lane Id based selective emergency message forwarding scheme (LSEMF) which can minimize the number of forwarder node without affecting the notified vehicles with high data delivery ratio and low overhead. The proposed forwarding scheme is a multi-hop selective forwarding scheme in which vehicles found in the same lane with the source of emergency message and found behind the accident can have high priority to be selected as a forwarder node. To select forwarder node we combine distance, lane id and travel direction of vehicle. To simulate this work, we use SUMO simulator for generating mobility and OMNeT++ for network simulator by using Veins framework. Finally we compare our result with counter based scheme and distance based scheme. From the simulation result the proposed scheme has better performances than the existing schemes in terms of data delivery ratio, overhead and forwarder node ratio.

47 - 54

Authors: Vikas Gupta, Brahmjit Singh

Estimation of position of unknown nodes is of immense importance for proper deployment and tracking of sensors. The centroid based localization algorithm (CLA) is widely used for the localization of the sensors but its original and modified versions suffer from large positioning error. Here the localization algorithm is evaluated in terms of localization error utilizing artificial bee colony based (ABC) algorithm. Comparison of outcome is presented through other widely used techniques including swarm based particle swarm optimization (PSO) and evolutionary algorithms based differential evolution (DE) on basic centroid localization algorithm. The results obtained through simulation demonstrate that localization error is minimal in ABC and DE based CLA as compared to basic and PSO based schemes but the computation time is the largest in DE based localization algorithm as compared to others. In comparison to the basic CLA the average localization error is reduced by 95% and computation time is increased by seven fold in ABC based CLA. It may be established that having considered localization error of prime importance, ABC algorithm based CLA is the most suitable strategy for localization amongst all the three algorithms.

31 - 38

Authors: Gagan Deep Dhand, Rohit Kumar, Rishabh, Devashish Ghildiyal, Rachna Jain

The tremendous development in wireless technologies and multimedia applications persuaded upsurge in spectrum utilization in the past. One of the adequate clarifications to overwhelm this limitation is by using Cognitive Radios (CR). These networks are likely to boost spectrum consumption professionally by permitting Secondary Users (SUs) to take advantage of the use of the approved spectrum of primary users (PUs). CR is a kind of a sensible radio that can sense the extraneous surroundings, analyze the past and build perspicacious conclusions to switch its transmission factors in step with the current state of the atmosphere. An Ad-hoc Network engaging Cognitive Radios (CR) can often be termed as Cognitive Radio Adhoc Network (CRAHN). Routing in CRAHN is not an easy mission due to spectrum availability, power, link stability, etc. Among all the parameters, the one among the best parameter for route selection is throughput. Since several applications need a high value of throughput like Audio & Video Broadcasting, Interactive audio & Video Streaming, etc. and some require the low value of throughput like E-mail, Telnet, etc. This paper design a routing strategy based on finding an optimal throughput path using fuzzy logic. To show the efficiency of a designed scheme it is compared with the shortest path routing mechanism. Our result shows that the proposed method is efficient than Shortest Spectrum.

13 - 24

Authors: Kadry Sayed Mohamed, Sayed Abd El Hady Nouh, Abdelhady M. Naguib

Mobile ad hoc networks (MANETs) consist of a group of two or more nodes, which are connected in dispersed manner for enabling wireless communications. All nodes being moveable and are dynamically connected in a random way. MANETs can be used in many applications such as: military battles, WSN, in areas where it is difficult to build wired network. Due to dynamic topology of MANET, restricted battery power, and limited capacity of wireless channels, it becomes design of routing mechanism is one of the main challenges in MANET. In general, MANETs’ routing protocols can be classified into two classes: proactive routing (e.g. DSDV) and reactive routing (e.g. AODV and DSR). Many studies showed that reactive routing protocols are outperform proactive protocols. Therefore, the presented article concerned with performance enhancement of DSR which is one of the most famous reactive routing protocols. The standard DSR is multi hop in its nature, where route selection between any two communicating nodes is only based on minimum hop count as a metric, regardless another metrics such as energy of nodes, traffic load on nodes and power transmission of packets which may have negative effects on performance of the standard DSR. This paper presents new version of standard DSR, called (APEE-DSR), through modification of both route discovery phase and route maintenance phase, in such a way that minimize energy consumption of nodes and realization of balanced traffic load of nodes, in addition to adaptation of transmission power of exchanged data packets among communicating nodes, resulting in prolong life time of nodes, thence increase life time of the routes and relative stability of network. In the proposed scheme route selection is based on two combined metrics: nodes’ energy and nodes’ traffic load. Moreover, transmission power of packets among nodes through the selected route will be adaptive. Performance evaluation and comparison between proposed scheme (APEE-DSR) and original DSR has been implemented utilizing network imitator (NS2). Results of simulation proved that performance of the proposed protocol outperform original DSR in terms of: packet delivery ratio, end to end delay, normalized overhead and energy consumption of nodes.