International Journal of Communication Networks and Information Security (IJCNIS)
Not a member yet
1021 research outputs found
Sort by
Cross-Layer Routing Based on Semantic Web Services Discovery with Energy Evaluation and Optimization in MANET
Get PDFThe web services discovery process in mobile adhoc networks is considered as a very difficult challenge due to the continuous change in the topology of the network and also the lack of a fixed central directory for publishing web services. Several approaches have been proposed which are based on either keywords or identifiers representing the service to be searched or by using a specific scenario of discovery. All of those proposed solutions try to respect the constraints of ad hoc networks such as energy, bandwidth, throughput ... etc. In this paper we present our new proposed model for measuring the cost of the overall energy consumption in ad hoc networks depending on the web services discovery protocols. We also present a new optimized web services discovery protocol in MANET based on cross_layer routing techniques with the dissemination in the routing process at the same time the semantic web services information and a Discovery_Diameter parameter that we have proposed to limit the area of discovery in the network. Finally, we present simulation results of our defined approach showing a significant optimization of the energy consumption level and the average throughput
PFPS: Priority-First Packet Scheduler for IEEE 802.15.4 Heterogeneous Wireless Sensor Networks
Get PDFThis paper presents priority-first packet scheduling approach for heterogeneous traffic flows in low data rate heterogeneous wireless sensor networks (HWSNs). A delay sensitive or emergency event occurrence demands the data delivery on the priority basis over regular monitoring sensing applications. In addition, handling sudden multi-event data and achieving their reliability requirements distinctly becomes the challenge and necessity in the critical situations. To address this problem, this paper presents distributed approach of managing data transmission for simultaneous traffic flows over multi-hop topology, which reduces the load of a sink node; and helps to make a life of the network prolong. For this reason, heterogeneous traffic flows algorithm (CHTF) algorithm classifies the each incoming packets either from source nodes or downstream hop node based on the packet priority and stores them into the respective queues. The PFPS-EDF and PFPS-FCFS algorithms present scheduling for each data packets using priority weight. Furthermore, reporting rate is timely updated based on the queue level considering their fairness index and processing rate. The reported work in this paper is validated in ns2 (ns2.32 allinone) simulator by putting the network into each distinct cases for validation of presented work and real time TestBed. The protocol evaluation presents that the distributed queue-based PFPS scheduling mechanism works efficiently using CSMA/CA MAC protocol of the IEEE 802.15.4 sensor networks
Optimized Clustering Protocol for Balancing Energy in Wireless Sensor Networks
Get PDFWhile wireless sensor networks (WSNs) are increasingly equipped to handle more complex functions and in-network processing may require these battery powered sensors to judiciously use their constrained energy to prolong the effective network lifetime. Cluster-based Hierarchical Routing Protocol using compressive sensing (CS) theory (CBHRP-CS) divides the network into several clusters, each managed by a set of CHs called a header. Each member of the header compresses the collected data using CS. This paper proposes an optimized clustering protocol using CS (OCP-CS) to improve the performance of WSNs by exploiting compressibility. In OCP-CS, each cluster is managed by a cluster head (CH). CHs are selected based on node concentration and sensor residual energy, and performs data aggregation using CS to reduce the energy consumed in the process of data sampling and transmission. Simulations show that our proposed protocol is effective in prolonging the network lifetime and supporting scalable data aggregation than existing protocols
A New Approach for DDoS attacks to discriminate the attack level and provide security for DDoS nodes in MANET
Get PDFMobile Ad Hoc Networks (MANETs) enable versatile hosts to frame a correspondence arrange without a prefixed framework. In military applications portable specially appointed system assumes essential part since it is particularly planned network for on request necessity and in circumstances where set up of physical network isn't conceivable. Despite the fact that it gives high adaptability, it likewise conveys more difficulties for MANETs to battle against malicious assaults. In any case, the property of mobility and excess additionally motivates new plans to outline safeguard procedure. In this paper, we propose a procedure to relieve DDoS assaults in MANETs. Expect that a malicious attacker ordinarily targets particular victims. The attacker will surrender if the assault neglected to accomplish the coveted objectives after a specific length of assaulting time. In our assurance system, we exploit high excess and select a protection node. Once a DDoS attack has been identified, the suspicious movement will be diverted to the protection node. The victim will work typically, and it is sensible to expect that the attacker will stop the trivial endeavors. Through escalated recreation test utilizing NS-2, we have confirmed the viability of our approach and assessed the cost and overhead of the framework
Capacity Enhancement of Multiuser Wireless Communication System through Adaptive Non-Linear Pre coding
Get PDFMultiuser multiple-input multiple-output (MIMO) nonlinear pre coding techniques face the issue of poor computational scalability of the size of the network. But by this nonlinear pre coding technique the interference is pre-cancelled automatically and also provides better capacity. So in order to reduce the computational burden in this paper, a definitive issue of MU-MIMO scalability is tackled through a non-linear adaptive optimum vector perturbation technique. Unlike the conventional (Vector Perturbation) VP methods, here a novel anterograde tracing is utilized which is usually recognized in the nervous system thus reducing complexity. The tracing of distance can be done through an iterative-optimization procedure. By this novel non-linear technique the capacity is improved to a greater extend which is explained practically. By means of this, the computational complexity is managed to be in the cubic order of the size of MUMIMO, and this mainly derives from the inverse of the channel matrix. The proposed signal processing system has been implemented in the working platform of MATLAB/SIMULINK. The simulation results of proposed communication system and comparison with existing systems shows the significance of the proposed work
Statistical-Based Heuristic for Scheduling of Independent Tasks in Cloud Computing
No full textCloud computing is an emerging and innovative technology that is used for solving large-scale complex problems. It considers as an extension to distributed and parallel computing. Additionally, it enables sharing, organizing and aggregation of computational machines to satisfy the user demands. One of the main goals of the task scheduling is to minimize the makespan (i.e. the overall processing time) and maximize the machine utilization. This paper addresses the problem of how to schedule many independent tasks when using different machines. It introduces two batch mode heuristics algorithms for scheduling independent task in the computational cloud environment, high mean absolute deviation first heuristic and QoS Guided Sufferage-HMADF heuristic. Besides, the paper presented other existing batch mode heuristics such as, Min-Min, Max-Min and Sufferage. The four heuristic modes are simulated and the experimental results are discussed using two performance measures, makespan and machine resource utilization
Assisted Navigation Algorithm for Wireless Sensor Actuator and Robot Networks
Get PDFWireless Sensor, Actuator and Robot Networks (WSARNs) are made of mobile and static sensor nodes that interact in order to collaboratively perform specific tasks, such as supporting assisted navigation for mobile robotic nodes that carry out requested operations in hostile environments, where the human presence is impracticable. In this regard, it is worth noting that assisted navigation algorithms have a highly dynamic nature, and are implemented by sensor nodes that are characterized by limited transmission power and lean autonomy in terms of computing and memory capacity. This paper presents an improved version of the assisted navigation algorithm based on the concept of “credit field”. The main aim of the proposed algorithm is to reduce and balance the energy consumption among the static sensor nodes when running the algorithm to manage the presence of obstacles and adversary areas, thus extending the lifetime of WSARNs. The algorithm has been tested on a hybrid sensor network that employs Mica2 Motes as static sensor nodes and Lego Mindstorms robots integrated with a Stargate board developed by Crossbow as mobile nodes
Redundancy Elimination with Coverage Preserving algorithm in Wireless Sensor Network
Get PDFIn Wireless Sensor Network, the sensor nodes are deployed using random or deterministic deployment methods. Many applications prefer random deployment for deploying the sensor nodes. Random deployment is the main cause of redundancy. Detection and elimination of redundant sensor nodes while preserving coverage is very important issue after the sensor nodes are deployed randomly in the region of interest. The redundancy elimination with coverage preserving algorithm is proposed in this paper and the results are presented. The proposed algorithm determines redundant sensor nodes and also the sensor nodes which provide the least coverage of region of interest. If two sensor nodes cover same area or if the Euclidian distance between two nodes is less than 25% of sensing range of a sensor node, the sensor which is not located at optimal position will be deactivated, so that, it reduces the number of optimal nodes required to cover complete region of interest. This in turn increases the lifetime of the network. The simulation results illustrate that the proposed algorithm preserves 100% coverage or region of interest by removing redundant nodes and also the nodes which provide the least coverage of region of interest. It also reduces the number of optimal nodes required to provide 100% coverage of region of interest
State of the Art Intrusion Detection System for Cloud Computing
Get PDFThe term Cloud computing is not new anymore in computing technology. This form of computing technology previously considered only as marketing term, but today Cloud computing not only provides innovative improvements in resource utilisation but it also creates a new opportunities in data protection mechanisms where the advancement of intrusion detection technologies are blooming rapidly. From the perspective of security, Cloud computing also introduces concerns about data protection and intrusion detection mechanism. This paper surveys, explores and informs researchers about the latest developed Cloud Intrusion Detection Systems by providing a comprehensive taxonomy and investigating possible solutions to detect intrusions in cloud computing systems. As a result, we provide a comprehensive review of Cloud Intrusion Detection System research, while highlighting the specific properties of Cloud Intrusion Detection System. We also present taxonomy on the key issues in Cloud Intrusion Detection System area and discuss the different approaches taken to solve the issues. We conclude the paper with a critical analysis of challenges that have not fully solved
Evaluation Method for SDN Network Effectiveness in Next Generation Cellular Networks
Get PDF5G mobile technology will become the new revolution in the mobile communication market. The new networks will focus on significantly improving the quality of service. The basis for their construction will form SDN networks. Therefore, the work analyzed the advantages and disadvantages of two SDN implementing methods. It was developed mathematical method to assess their complex effectiveness, which consider QoS requirements of implementing service through special weights for scalability, performance and packet delay. There were simulations of Overlay networks by using softswitches to verify the adequacy of the proposed method. The results showed that the use of SDN networks more efficiently by using IP networks for large volumes of traffic and with a large number of network equipment. Also, there were compared the approaches to build SDN management level architecture. Based on the studies and modeling we suggested to use distributed controller architecture because of its higher level of reliability