WIRELESS SENSOR NETWORKS SIMULATORS AND TESTBEDS
Souhila Silmi1,2, Zouina Doukha1,Rebiha Kemcha2,3 and Javier Ibañez-Guzmán1 1 USTHB University, Algeria 2 Higher Normal School Elbachir El-ibrahimi-Kouba, Algeria 3 University of Boumerdes, Algeria
Wireless sensor networks (WSNs) have emerged as one of the most promising technologies for the current era. Researchers have studied them for several years ago, but more work still needed to be made since open opportunities to integrate new technologies are added to this field. One challenging task is WSN deployment. Yet, this is done by real deployment with testbeds platforms or by simulation tools when real deployment could be costly and time-consuming. In this paper, we review the implementation and evaluation process in WSNs. We then describe relevant testbeds and simulation tools, and their features. Lastly, we conduct an experimentation study using these testbeds and simulations to highlight their pro and cons. As a use case, we implement a localization protocol. This work gives clarity to future-work for better implementation in order to improve reliability, accuracy and time consumed.
Wireless Sensor Network, Testbeds, Simulation Tools, Localization Protocol
For More Details :
http://aircconline.com/csit/papers/vol10/csit100912.pdf
OVERSAMPLING LOG MESSAGES USING A SEQUENCE GENERATIVE ADVERSARIAL NETWORK FOR ANOMALY DETECTION AND CLASSIFICATION
Amir Farzad and T. Aaron Gulliver University of Victoria
Dealing with imbalanced data is one of the main challenges in machine/deep learning algorithms for classification. This issue is more important with log message data as it is typically very imbalanced and negative logs are rare. In this paper, a model is proposed to generate text log messages using a SeqGAN network. Then features are extracted using an Autoencoder and anomaly detection is done using a GRU network. The proposed model is evaluated with two imbalanced log data sets, namely BGL and Openstack. Results are presented which show that oversampling and balancing data increases the accuracy of anomaly detection and classification.
Deep Learning, Oversampling, Log messages, Anomaly detection, Classification
For More Details :
http://aircconline.com/csit/papers/vol10/csit100515.pdf
PERFORMANCE ANALYSIS OF AODV, DSDV AND ZRP ROUTING PROTOCOLS FOR WIRELESS SENSOR NETWORKS USING NS2 TOOL
Faïza Tabbana, Department of Telecommunication Engineering, Military
This paper presents a literature review on WSN networks, in which the capacity of network nodes is limited with respect to energy supply, restricted computational capacity and communication bandwidth. WSN is a complex set of applications, link technologies, communication protocols, traffic flows and routing algorithms. Simulation is a predominant technique used to study and analyze the performance of a wireless senor network design. To prolong the lifetime of these sensor nodes, designing efficient routing protocols are critical. Basically, the Routing protocols for wireless sensor networks are responsible for maintaining the routes in the network which ensures reliable multi-hop communication. To address this issue, in this paper, various protocols like AODV (Ad-hoc on-demand distance vector routing), DSDV (Destination-Sequenced Distance-Vector Routing) and ZRP (Zone Routing Protocol) are discussed along with various comparative parameters like Throughput, Packet Loss Ratio, End to End Delay and Dropped Packets. The performance of these protocols varies depending on the simulation environment. It will be analyzed in two ways. Firstly, by varying nodes within a margin of 10 to 100 nodes. Another way is by keeping the number of nodes constant and varying the speed of nodes from 10 m/s to 90 m/s.
Wireless Sensor Network, AODV, DSDV, ZRP and Performance Metrics.
For More Details :
http://aircconline.com/csit/papers/vol10/csit100525.pdf
AN OVERVIEW OF AUTO-CONFIGURATION PROTOCOLS IN MOBILE AD HOC WIRELESS MULTI-HOP NETWORK
Adel R. Alharbi , University of Tabuk, Saudi Arabia
An ad hoc wireless IP multi-hop network is a collection of wireless IP protocol capable nodes that start in an unknown physical formation in the vicinity of a wireless IP portal to a wired IP network. While some wireless nodes might be in radio (wireless) range of the portal, other nodes might only be in radio range of one or more other nodes that in turn may in range of the portal and/or other wireless nodes. IP data-grams would travel from one node to another until the datagram is delivered to the portal or the destination node. All wireless nodes are assumed to be one or more hop away from the wireless IP portal. This paper reviews an auto-configure method of a mobile ad hoc network and to route IP traffic using existing mobile ad hoc network routing protocols. This method have the best characteristics in protocol overhead, robustness, convergence time, and scalability. The optimal mobile ad hoc network routing protocol can be chosen which best meets these characteristics for the given topology and operational profile. Finally, this method will efficiently use the address space allotted to the DHCP server.
Wireless LAN, communication systems routing, mobile communications, auto-configuration protocols, MANET.
For More Details :
http://aircconline.com/csit/papers/vol9/csit91804.pdf
IMPLEMENTATION OF VLAN VIA WIRELESS NETWORKS USING OPNET MODELER
Tareq Al-Khraishi and Muhannad Quwaider , Jordan University of Science and Technology, Jordan
A VLAN is a logical rather than physical connection that allows grouping hosts together in the same broadcast domain, so that packets are only delivered to ports that are combined to the same VLAN. By characteristic VLAN network, we can improve efficiency of wireless network and save bandwidth. Furthermore, implementing VLAN greatly improves wireless network security by decreasing the number of hosts that receive copies of frames broadcasted by switches, so hosts holding critical data are kept on a separate VLAN. This paper compares wireless network with wireless network having VLAN deployment. The proposed Network is evaluated in terms of average throughput and delay using file transfer in heavy traffic and web browsing applications. The simulation was carried out by employing OPNET 14.5 modeler simulation and the results show that the use of VLAN via wireless network had improved the performance by decreasing the traffic resulting in minimizing delay time. In addition, implementing VLAN reduces the network throughput because the traffic that is received and forwarded has a positive relationship with throughput. Furthermore, we investigated to improve the throughput in a wireless VLAN network by using adhoc routing protocols. Evaluation, comparison of broad adhoc routing protocols like AODV, DSR, OLSR, TORA and GPR are conducted in order to show the effect of the proposed VLAN on the performance results, like throughput and delay.
WLAN, OPNET, AODV, Throughput, VLAN, Routing Protocols, Access Point.
For More Details :
http://aircconline.com/csit/papers/vol9/csit91805.pdf
A SYSTEMATIC EVALUATION OF MANET ROUTING PROTOCOLS OVER UDP AND TCP IN MULTI-HOP WIRELESS NETWORK
Adebayo Seyi1 and Ogunseyi Taiwo2 1 China University of Mining and Technology, China 2 Communication University of China
There are genuine concerns for the right transport connection to be deployed on a particular routing protocol in order to have a reliable, fast and robust communication in spite of the size and the dynamics of the mobile ad-hoc network (MANET) topology. This paper comparatively studies the individual implementation of reactive and proactive protocols on both UDP and TCP transport connection using packet delivery ratio (PDR), throughput, end to end delay and delay variation (jitter) as quality of service (QoS) metrics. We studied the combination of both the transport connection and routing protocol that will deliver the best QoS in simple and complex network scenarios with source and destination nodes fixed and the intermediate nodes randomly moving throughout the simulation time. More so, the intrinsic characteristics of the routing protocols regarding the QoS metrics and transport connection are studied. Forty simulations were run for simple and complex multi-hop network models and the results were analyzed and presented.
MANET, Proactive, Reactive, QoS, UDP, TCP
For More Details :
http://aircconline.com/csit/papers/vol9/csit91717.pdf
A LOW COST METHANE ABSORPTION FUELING SYSTEM IN WIRELESS SENSOR NETWORKS USING SBC-MS
A.Rehash Rushmi Pavitra1 and Dr. E. Srie Vidhya Janani2 Anna University Regional Campus, India
The isolated accessible Methane (CH4) Absorption Fueling System (MAFS) is matured based on the mechanics of Wireless Sensor Network (WSN) comprised of gas sensing capable motes complementing a MAFS-WSN. Discrete routing protocols have been designed earlier for data collection in both compatible and divergent networks. This research presents a novel Scheduling based Clustering (SBC) with Mobile Sink (MS) strategy (SBC-MS) which supplements data collection in MAFS-WSN. The SBC-MS strategy attempts to exploit the vital parameters of energy and distance in selecting the appropriate cluster head that well suits MAFS-WSN in reliable gas detection. The MSs are exploited to reduce the energy expenditure in data communication. Extensive experimentations have been carried out with the proposed SBC-MS to ensure the QOS of MAFS-WSN in terms of schedulability and reliability. The simulation results prove that SBC-MS outperforms the earlier clustering technique M-LEACH in terms of network lifetime, energy consumption, end-to-end delay and data rate.
Methane Absorption Fueling system, Gas Sensing Capable Motes, Mobile Sinks, Scheduling and Clustering.
For More Details :
http://aircconline.com/csit/papers/vol9/csit91503.pdf
FINDING MAXIMAL LOCALIZABLE REGION IN WIRELESS SENSOR NETWORKS BY MERGING RIGID CLUSTERS
Saroja Kanchi , Kettering University, USA
Localization of Wireless Sensor Network (WSN) is the problem of finding the geo-locations of sensors in a sensor network deployed in various applications. Given the prolification of sensors in various applications, the localization and tracking of sensors have received considerable attention. Properties of rigidity and flexibility of the underlying graph of the WSN have been studied as a means of determining the localizability of the nodes in the WSN. In this paper, we present a new 3-merge technique for merging three rigid clusters of a network graph, into larger rigid cluster and we use this algorithm for finding maximal localizable regions within the WSN. We provide simulation results on random deployments of WSN to prove that this technique outperforms previously known algorithms for finding maximal localizable subregions. Moreover, simulation results show that the number of anchors needed to localize the entire WSN decreases due to finding large localizable regions.
Wireless Sensor Network, localization, rigidity, cluster, merging
For More Details :
http://aircconline.com/csit/papers/vol9/csit91326.pdf
MITIGATE CONTENT POISONING ATTACK IN NDN BY NAMESPACE AUTHORIZATION
Pengfei Yue and Bin Pang , Inner Mongolia University Hohhot, China
The Named Data Networking (NDN) immunes to most of the attacks which exist in today’s Internet. However, this newborn network architecture may still subject to Distributed Denial of Service (DDOS) attacks if less evaluation is paid. In this paper, we firstly give a survey of the state of art works on the mitigations of the Content Poisoning Attack (CPA) in NDN and discuss their limitations as well. After this, we give out our mitigation and the results from simulations show that with the implementation of our mitigation, the Interest Satisfaction Rate (ISR) of all Consumers maintains a highly acceptable rate even when network is under CPA.
The Named Data networking (NDN), Denial of service attack (Dos), Content Poisoning Attack (CPA)
For More Details :
http://aircconline.com/csit/papers/vol9/csit91109.pdf
TGRID LOCATION SERVICE IN AD-HOC NETWORKS
Baktash Motlagh Farrokhlegha , Technical& vocational University, IRAN
Geographic addresses are essential in position-based routing algorithms in mobile ad hoc networks, i.e. a node that intends to send a packet to some target node, has to know the target's current position. A distributed location service is required to provide each node's position to the other network nodes. Hierarchical Location Service (HGRID) has been known as a promising location service approach. In this paper we present a new approach called TGRID and describe the performance of a novel multi-level Tree-walk grid location management protocol for large scale ad hoc networks. The Tree-walk grid location service mechanism is evaluated by GLOMOSIM against well known location service protocol HGRID when increasing node density and node speed. It is observed that TGRID outperforms HGRID in terms of packet delivery fraction and storage cost and also maintains low control overhead in a uniformly randomly distributed network.
Location based routing, location service, location management, Mobile Ad Hoc Networks, HGRID, and TGRID
For More Details :
http://aircconline.com/csit/papers/vol9/csit91001.pdf
DATA ANALYSIS OF WIRELESS NETWORKS USING CLASSIFICATION TECHNIQUES
Daniel Rosa Canêdo1,2 and Alexandre Ricardo Soares Romariz1 1University of Brasília, Brazil 2Federal Institute of Goiás, Brazil
In the last decade, there has been a great technological advance in the infrastructure of mobile technologies. The increase in the use of wireless local area networks and the use of satellite services are also noticed. The high utilization rate of mobile devices for various purposes makes clear the need to track wireless networks to ensure the integrity and confidentiality of the information transmitted. Therefore, it is necessary to quickly and efficiently identify the normal and abnormal traffic of such networks, so that administrators can take action. This work aims to analyze classification techniques in relation to data from Wireless Networks, using some classes of anomalies pre-established according to some defined criteria of the MAC layer. For data analysis, WEKA Data mining software (Waikato Environment for Knowledge Analysis) is used. The classification algorithms present a success rate in the classification of viable data, being indicated in the use of intrusion detection systems for wireless networks.
Wireless Networks, Classification Techniques, Weka
For More Details :
http://aircconline.com/csit/papers/vol9/csit90905.pdf
OPTIMIZING DSCP MARKING TO ENSURE VOIP’S QOS OVER HFC NETWORK
Shaher Daoud and Yanzhen Qu Colorado Technical University, USA
Three major factors that can affect Voice over Internet Protocol (VoIP) phone services’ quality, these include packet delay, packet loss, and jitter. The focus of this study is specific to the VoIP phone services offered to customers by cable companies that utilize broadband hybrid fiber coaxial (HFC) networks. HFC networks typically carry three types of traffic that include voice, data, and video. Unlike data and video, some delays or packet loss can result in a noticeable degraded impact on a VoIP’s phone conversation. We will examine various differentiated services code point (DSCP) marking, then analyze and assess their impact on VoIP’s quality of service (QoS). This study mimics the production environment. It examines the relationship between specific DSCP marking’s configuration. This research avoids automated test calls and rather focuses on human made call testing. This study relies on users’ experience and the captured data to support this research’s findings.
QoS , VoIP, DSCP Marking , jitter, HFC Network, MOS.
For More Details :
http://aircconline.com/csit/papers/vol9/csit90928.pdf
ENABLING EDGE COMPUTING USING CONTAINER ORCHESTRATION AND SOFTWARE DEFINED WIDE AREA NETWORKS
Felipe Rodriguez Yaguache1 and Kimmo Ahola2 1,2 Technical Research Centre of Finland (VTT), Finland
With SD-WAN being increasingly adopted by corporations, and Kubernetes becoming the defacto container orchestration tool, the opportunities for deploying edge-computing applications running over SD-WAN are vast. Unfortunately, service orchestration in SD-WAN has not been provided with enough attention, resulting in the lack of research focused on service discovery in these scenarios. In this document, an in-house service discovery solution that works alongside Kubernetes’ master node for allowing an improved traffic handling and better user experience is developed. The service discovery solution was conceived following a design science research approach. Our research includes the implementation of a proof-of-concept SD-WAN topology alongside a Kubernetes cluster that allows us to deploy custom services and delimit the necessary characteristics of our in-house solution. Also, the implementation's performance is tested based on the required times for updating the discovery solution according to service updates. Finally, some conclusions and modifications are pointed out based on the results, while also discussing possible enhancements.
SD-WAN, Edge computing, Virtualization, Kubernetes, Services
For More Details :
http://aircconline.com/csit/papers/vol9/csit90930.pdf
INTRANET SECURITY USING A LAN PACKET SNIFFER TO MONITOR TRAFFIC
Ogbu N. Henry1 and Moses Adah Agana2 1Ebonyi State University, Abakaliki, Nigeria 2 University of Calabar, Nigeria
This paper was designed to provide Intranet traffic monitoring by sniffing the packets at the local Area Network (LAN) server end to provide security and control. It was implemented using five computer systems configured with static Internet Protocol (IP) addresses used in monitoring the IP traffic on the network by capturing and analyzing live packets from various sources and destinations in the network. The LAN was deployed on windows 8 with a D-link 16- port switch, category 6 Ethernet cable and other LAN devices. The IP traffics were captured and analyzed using Wireshark Version 2.0.3. Four network instructions were used in the analysis of the IP traffic and the results displayed the IP and Media Access Control (MAC) address sources and destinations of the frames, Ethernet, IP addresses, User Datagram Protocol (UDP) and Hypertext Transfer Protocol (HTTP). The outcome can aid network administrators to control Intranet access and provide security.
Packet, Sniffer, Protocol, Address, Network, Frame
For More Details :
http://aircconline.com/csit/papers/vol9/csit90806.pdf
VULNERABILITY ANALYSIS OF IP CAMERAS USING ARP POISONING
Thomas Doughty1, Nauman Israr2 and Usman Adeel3 1,2,3 Teesside University, Middlesbrough, UK
Internet Protocol (IP) cameras and Internet of Things (IoT) devices are known for theirvulnerabilities, and Man in the Middle attacks present a significant privacy and securityconcern. Because the attacks are easy to perform and highly effective, this allows attackers tosteal information and disrupt access to services. We evaluate the security of six IP cameras byperforming and outlining various attacks which can be used by criminals. A threat scenario isused to describe how a criminal may attack cameras before and during a burglary. Our findingsshow that IP cameras remain vulnerable to ARP Poisoning or Spoofing, and while somecameras use Digest Authentication to obfuscate passwords, some vendors and applicationsremain insecure. We suggest methods to prevent ARP Poisoning, and reiterate the need forgood password policy.
Security, Camera, Internet of Things, Passwords, Sniffing, Authentication
For More Details :
http://aircconline.com/csit/papers/vol9/csit90712.pdf
COPING WITH CLASS IMBALANCE IN CLASSIFICATION OF TRAFFIC CRASH SEVERITY BASED ON SENSOR AND ROAD DATA: A FEATURE SELECTION AND DATA AUGMENTATION APPROACH
Deepti Lamba1 Majed Alsadhan1 William Hsu1 Eric Fitzsimmons2 Gregory Newmark3 1Department of Computer Science 2Department of Civil Engineering 3 Regional & Community Planning Kansas State University, USA
This paper presents machine learning-based approaches to classification of historical traffic crashes in Kansas by severity, applied to a data set consisting of highway geometry, weather, and road sensor data. The goal of this work is to identify relevant features using a variety ofloss measures and algorithms for feature selection. This is shown to facilitate the discovery ofthe most relevant sensors for the task of learning to predict severe crashes (those involving bodily injury). The key technical challenges are to cope with class imbalance (as a 75%majority of crashes are non-severe) and a highly correlated and redundant set of features from multiple coalesced sources. The major novel contributions of this work are the development of a random oversampling strategy for data augmentation, combined with the systematic applicationof multiple feature selection measures over a range of supervised inductive learning models andalgorithms. Positive results from this approach, on a data set of 277 initial ground features and20,000 vehicle crashes collected over 9 years (2007 – 2015) by the Kansas Department of Transportation (KDOT), included models trained using 30 features (out of 277) that achievecross-validation precision and recall comparable to those obtained using the full set of features.These and other results point towards potential use of feature selection findings and theresultant models in planning future road construction.
Machine Learning, Class Imbalance, Predictive Analytics, Feature Selection, Data Augmentation, Traffic Engineering
For More Details :
http://aircconline.com/csit/papers/vol9/csit90611.pdf
ENERGY SPARING OF THE LEACH COMMUNICATION MECHANISM IN HETEROGENEOUS WSN
Zoltán Gál1and Usman Adeel2 1,2 University of Debrecen, Hungary
In current years, there have been a large progress in Wireless Sensor Networks (WSN) due totheir development in term of hardware and cost reduction. Plenty of routing protocols havebeen proposed and developed depending on the application and network architecture. One ofthe most efficient energy management of the wireless sensor networknodes is provided by theLEACH (Low Energy Adaptive Clustering Hierarchy) mechanism. This hierarchical protocoluses cluster head function of the nodes to aggregate and forward the messages from the clustermembers to the Sink node. Each node decides to become cluster head stochastically in eachepoch time intervals. Nodes have enough energy to reach directly through radio channel any ofthe nearest cluster nodes, as well as the sink node. Optimization algorithm is required toprovide efficient energy consumption on the WSN clusters level. A node being cluster head inthe actual epoch time can repeat this function just with a probability p in time. Classical nodesfind the nearest cluster head to minimize the transmission energy consumption and use timedivision multiple access method (TDMA)to send the radio frames in each epoch time. In thispaper we use own developed simulation method and software to analyze the remaining energyprocess in time of the whole WSN network and the number of forwarded frames in function ofthe probability p for a set of nodes having heterogeneous levels of the initial energy.
Internet of Things (IoT), Wireless Sensor Network(WSN), Low Energy Adaptive Clustering Hierarchy (LEACH) protocol, radio communication, energy sparing, stochastic process.
For More Details :
http://aircconline.com/csit/papers/vol9/csit90406.pdf
NETWORK SECURITY ARCHITECTURE AND APPLICATIONS BASED ON CONTEXT-AWARE SECURITY
Hoon Ko1, Chang Choi2, Pankoo Kim3 and Junho Choi4 1,2,3,4 Chosun University, Gwangju, South Korea
The number of services and smart devices which require context is increasing, and there is aclear need for new security policies which provide security that is convenient and flexible forthe user. In particular, there is an urgent need for new security policies regarding ITvulnerability layers for children, the elderly, and the disabled who experience many difficultiesusing current security technology. For a convenient and flexible security policy, it is necessaryto collect and analyze data such as user service use patterns, locations, etc., which can be usedto distinguish attack contexts and define a security service provision technology which issuitable to the user. This study has designed a user context-aware network security architecturewhich reflects the aforementioned requirements, collected user context-aware data, studied auser context analysis platform, and studied and analyzed context-aware security applications.
Context-aware Security, Network Security Policy, Malicious Code Detection
For More Details :
https://airccj.org/CSCP/vol9/csit90308.pdf
THE IMPLICIT PATH COST OPTIMIZATION IN DIJKSTRA ALGORITHM USING HASH MAP DATA STRUCTURE
Mabroukah Amarif and Ibtusam Alashoury Sebha University, Sebha, Libya
The shortest path between two points is one of the greatest challenges facing the researchersnowadays. There are many algorithms and mechanisms that are designed and still all according to the certain approach and adopted structural. The most famous and widely used algorithm isDijkstra algorithm, which is characterized by finding the shortest path between two pointsthrough graph data structure. It’s obvious to find the implicit path from the solution path; butthe searching time varies according to the type of data structure used to store the solution path.This paper improves the development of Dijkstra algorithm using linked hash map datastructure for storing the produced solution shortest path, and then investigates the subsequentimplicit paths within this data structure. The result show that the searching time through thegiven data structure is much better than restart the algorithm again to search for the same path.
Dijkstra algorithm, data structure, linked hash map, time complexity, implicit path, graph
For More Details :
https://airccj.org/CSCP/vol9/csit90204.pdf