Probabilistic based Optimal Node Localization in Wireless Sensor Networks

 #WSN #node #sensor #rootnode #network

Probabilistic based Optimal Node Localization in Wireless Sensor Networks

Authors

Souparnika Jadhav and Dr. Nagesh K. N

Department of Electronics & Communication Engineering,

Nagarjuna College of Engineering & Technology Bangaluru, India

Keywords

Wireless Sensor Networks (WSN), Sensor Nodes (SNs), Node localization, Anchor Nodes (ANs), RootMean-Square Error (RMSE).

https://aircconline.com/ijcnc/V14N3/14322cnc06.pdf

Optimization of Packet Length for Two Way Relaying with Energy Harvesting

Ghassan Alnwaimi , Hatem Boujemaa , Kamran Arshad

 King Abdulaziz University, Kingdom of Saudi Arabia , University of Carthage, Sup’Com, COSIM Laboratory, Tunisia , College of Engineering, Ajman University 

 Abstract

 In this article, we suggest optimizing packet length for two way relaying with energy harvesting. In the first transmission phase, two source nodes N1 and N2 are transmitting data to each others through a selected relay R. In the second phase, the selected relay will amplify the sum of the signals received signals from N1 and N2. The selected relay amplifies the received signals using the harvested energy from Radio Frequency (RF) signals transmitted by nodes N1 and N2. Finally, N1 will remove, from the relay’s signal, its own signal to be able to decode the symbol of N2. Similarly, N2 will remove, from the relay’s signal, its own signal to be able to decode the symbol of N1. We derive the outage probability, packet error probability and throughput at N1 and N2. We also optimize packet length to maximize the throughput at N1 or N2. 

Index Terms 

Cooperative systems, Optimal packet length, Rayleigh fading channels

Full Text:

A Min-Max Scheduling Load Balanced Approach to Enhance Energy Efficiency and Performance of Mobile ADHOC Networks

K.Venkatachalapathy1 and D.Sundaranarayana2 

1 Research Scholar, Department of Computer Science and Engineering, Annamalai University, Chidambaram, India 2 Professors, Department of Computer and Information Science, Annamalai University, Chidambaram, India 

ABSTRACT

 Energy efficiency and traffic management in Mobile Ad hoc Networks (MANETs) is a complex process due to the self-organizing nature of the nodes. Quality of service (QoS) of the network is achieved by addressing the issues concerned with load handling and energy conservation. This manuscript proposes a min-max scheduling (M2S) algorithm for energy efficiency and load balancing (LB) in MANETs. The algorithm operates in two phases: neighbor selection and load balancing. In state selection, the transmission of the node is altered based on its energy and packet delivery factor. In the load balancing phase, the selected nodes are induced by queuing and scheduling the process to improve the rate of load dissemination. The different processes are intended to improve the packet delivery factor (PDF) by selecting appropriate node transmission states. The transmission states of the nodes are classified through periodic remaining energy update; the queuing and scheduling process is dynamically adjusted with energy consideration. A weight-based normalized function eases neighbor selection by determining the most precise neighbor that satisfies transmission and energy constraints. The results of the proposed M2SLB (Min-Max Scheduling Load Balancing) proves the consistency of the proposed algorithm by improving the network throughput, packet delivery ratio and minimizing delay and packet loss by retaining higher remaining energy. 

KEYWORDS

 Energy Efficiency, Load Balancing, MANET, Packet Delivery Factor, Queuing and Scheduling.

Full Text : 

QoS Categories Activeness-Aware Adaptive EDCA Algorithm for Dense IoT Networks

Mohammed A. Salem1 , Ibrahim F. Tarrad2 , Mohamed I. Youssef 2 and Sherine M. Abd El-Kader3 

1Department of Electrical Engineering, Higher Technological Institute, 10th of Ramadan City, Egypt 2Department of Electrical Engineering, Al-Azhar University, Cairo, Egypt 3Department of Computer Engineering, Electronics Research Institute, Giza, Egypt 

ABSTRACT

 IEEE 802.11 networks have a great role to play in supporting and deploying of the Internet of Things (IoT). The realization of IoT depends on the ability of the network to handle a massive number of stations and transmissions and to support Quality of Service (QoS). IEEE 802.11 networks enable the QoS by applying the Enhanced Distributed Channel Access (EDCA) with static parameters regardless of existing network capacity or which Access Category (AC) of QoS is already active. Our objective in this paper is to improve the efficiency of the uplink access in 802.11 networks; therefore we proposed an algorithm called QoS Categories Activeness-Aware Adaptive EDCA Algorithm (QCAAAE) which adapts Contention Window (CW) size, and Arbitration Inter-Frame Space Number (AIFSN) values depending on the number of associated Stations (STAs) and considering the presence of each AC. For different traffic scenarios, the simulation results confirm the outperformance of the proposed algorithm in terms of throughput (increased on average 23%) and retransmission attempts rate (decreased on average 47%) considering acceptable delay for sensitive delay services. 

KEYWORDS

 IoT, IEEE 802.11, EDCA, CW, AIFSN, MAC, QoS

Full Text :

The Performance of Convolutional Coding Based Cooperative Communication: Relay Position and Power Allocation Analysis

Cebrail ÇIFLIKLI1 , Waeal AL-OBAIDI2 and Musaab AL-OBAIDI2

 1Electronic Tech. Program/ Electronics and Automation, Erciyes University, Kayseri, Turkey 2Faculty of Electrical and Electronic Engineering, Erciyes University, Kayseri, Turkey

 ABSTRACT 

Wireless communication faces adversities due to noise, fading, and path loss. Multiple-Input MultipleOutput (MIMO) systems are used to overcome individual fading effect by employing transmit diversity. Duo to user single-antenna, Cooperation between at least two users is able to provide spatial diversity. This paper presents the evaluation of the performances of the Amplify and Forward (AF) cooperative system for different relay positions using several network topologies over Rayleigh and Rician fading channel. Furthermore, we present the performances of AF cooperative system with various power allocation. The results show that cooperative communication with convolutional coding shows an outperformance compared to the non-convolutional, which is a promising solution for high data-rate networks such as (WSN), Ad hoc, (IoT), and even mobile networks. When topologies are compared, the simulation shows that, linear topology offers the best BER performance, in contrast when the relay acts as source and the source take the relay place, the analysis result shows that, equilateral triangle topology has the best BER performance and stability, and the system performance with inter-user Rician fading channel is better than the performance of the system with inter-user Rayleigh fading channel. 

KEYWORDS

 MIMO, AF cooperative, convolutional coding, path loss, power allocation, fading.

Full Text : 

Fast Packets Delivery Techniques for Urgent Packets in Emergency Applications of Internet of Things

Fawaz Alassery 

Department of Computer Engineering, Taif University, Taif, Saudi Arabia 

ABSTRACT

 Internet of Things (IoT) has been receiving a lot of interest around the world in academia, industry and telecommunication organizations. In IoT, many constrained devices can communicate with each other which generate a huge number of transferred packets. These packets have different priorities based on the applications which are supported by IoT technology. Emergency applications such as calling an ambulance in a car accident scenario need fast and reliable packets delivery in order to receive an immediate response from a service provider. When a client sends his request with specific requirements, fast and reliable return contents (packets) should be fulfilled, otherwise, the network resources may be wasted and undesirable circumstances may be counted. Content-Centric Networking (CCN) has become a promising network paradigm that satisfies the requirements of fast packets delivery for emergency applications of IoT. In this paper, we propose fast packets delivery techniques based on CCN for IoT environment, these techniques are suitable for urgent packets in emergency applications that need fast delivery. The simulation results show how the proposed techniques can achieve high throughput, a large number of request messages, fast response time and a low number of lost packets in comparison with the normal CCN. 

KEYWORDS 

Internet of Things, Content-Centric Networking, emergency applications, data delivery, real-time packets.

Full Text : 

Context-Aware Energy Conserving Routing Algorithm for Internet of Things

D. Kothandaraman1 , C. Chellappan2 , P. Sivasankar3 and Syed Nawaz Pasha1

1Department of Computer Science and Engineering, S R Engineering College, Warangal, TS, India 2Department of Computer Science and Engineering, CEG, Anna University, Chennai, TN, India 3Departmentof Electronics Engineering, NITTTR, Chennai, TN, India 

ABSTRACT

Internet of Things (IoT) is the fast- growing technology, mostly used in smart mobile devices such as notebooks, tablets, personal digital assistants (PDA), smartphones, etc. Due to its dynamic nature and the limited battery power of the IoT enabled smart mobile nodes, the communication links between intermediate relay nodes may fail frequently, thus affecting the routing performance of the network and also the availability of the nodes. Existing algorithm does not concentrate about communication links and battery power/energy, but these node links are a very important factor for improving the quality of routing in IoT. In this paper, Context-aware Energy Conserving Algorithm for routing (CECA) was proposed which employs QoS routing metrics like Inter-Meeting Time and residual energy and has been applied to IoT enabled smart mobile devices using different technologies with different microcontroller which resulted in an increased network lifetime, throughput and reduced control overhead and the end to end delay. Simulation results show that, with respect to the speed of the mobile nodes from 2 to 10m/s, CECA increases the network lifetime, thereby increasing the average residual energy by 11.1% and increasing throughput there by reduces the average end to end delay by 14.1% over the Energy-Efficient Probabilistic Routing (EEPR) algorithm. With respect to the number of nodes increases from 10 to 100 nodes, CECA algorithms increase the average residual energy by16.1 % reduces the average end to end delay by 15.9% and control overhead by 23.7% over the existing EEPR. 

KEYWORDS 

Energy conserving, Smart mobile devices, Routing, Residual energy, Inter-meeting time.

Full Text : 

Implementation of A Context-Aware Routing Mechanism in an Inexpensive Standalone Communication System for Disaster Scenarios

Regin Cabacas and In-Ho Ra 

School of Computer, Information and Communication Engineering, Kunsan National University, Gunsan, South Korea 

ABSTRACT 

Natural disasters often destroy and disrupt communication infrastructures that hinder the utilization of disaster applications and services needed by emergency responders. During these circumstances an implementation of a standalone communication system (SCS) that serves as an alternative communication platform for vital disaster management activities is essential. In this study, we present a design and implementation of an SCS realized using an inexpensive microcontroller platform. Specifically, the study employed Raspberry Pi (RPi) devices as rapidly deployable relay nodes designed with a context-aware routing mechanism. The routing mechanism decides the most efficient route to send messages or disseminate information in the network by utilizing a context-aware factor (CF) calculated using several context information such as delivery probability and link quality. Moreover, with the use of this context information, the proposed scheme aims to reduce communication delay and overhead in the network commonly caused by resource contention of users. The performance of the proposed SCS, was evaluated in a small-area case-scenario deployment using a messaging application and web-based monitoring service. Additionally, a simulation-based performance analysis of the proposed context-aware routing mechanism applied to an urban area map was also conducted. Furthermore, in the simulation, the proposed scheme was compared to the most commonly used Flooding and AODV schemes for SCS. Results show a high delivery probability, faster delivery time (low latency) and reduced message overhead when using the proposed approach compared with the other routing schemes. 

KEYWORDS 

Standalone communication systems, disaster communication systems, context-aware routing

Full Text : 

A Markovian Model for Internet of Things Application

Osama Salameh, Mohammed Awad and Fadi AbuAlrub

 Department of Computer Systems Engineering, Arab American University, Palestine

ABSTRACT 

Internet of Things (IoT) allows communication among human-to-things, things-to-human, and things-to things that are incorporated into an information networks allowing automatic information interchange and the processing of data at real time. In this paper, we conduct a performance analysis of a real application defined through four traffic classes with the priorities present in smart cities using Continuous Time Markov Chains(CTMC). Based on a finite capacity queuing system, we propose a new cost-effective analytical model with a push-out management scheme in favor of the highest priority (emergency) traffic. Based on the analytical model, several performance measures for different traffic classes have been studied extensively including blocking probability; push out probability, delay, channel utilization as well as overall system performance. 

KEYWORDS

 Performance analysis, Markov chain, IoT

Full Details:

Fuzzy Gene Optimized Reweight Boosting Classification for Energy Efficient Data Gathering in WSN

J.Srimathi1 and V.Valli Mayil2 

1Ph.d, Research Scholar, Bharathiar University, India 2Head & Associate Professor, Dept. of Computer Science &Applications, Periyar Maniammai University, Thanjavur, India 

ABSTRACT 

The energy is a major resource to obtain efficient data gathering and increasing network lifetime (NL). The various techniques are introduced for data aggregation, but energy optimized sensor node (SN) selection was not carried out to further enhance NL. In order to improve the energy efficient data gathering in WSN, a Fuzzy Gene Energy Optimized Reweight Boosting Classification (FGEORBC) Technique is introduced with lesser time consumption. In FGEORBC technique, the Residual Energy (RE) of SN in the WSN is computed. After calculating SN residual energy, fuzzy logic is applied to determine higher energy nodes and lower energy nodes using threshold value. For finding the optimal higher energy SNs, then Ranked Gaussian gene optimization technique is applied. If the node satisfies the fitness criterion, then the node is selected as an optimal higher energy SN. Otherwise, the rank selection, ring crossover, and Gaussian mutation process are carried out until the condition gets satisfied. After that, the sink node collects the data packets (DP) from the optimal higher energy SNs. In the sink node, Reweight Boosting Classification is carried out to classify the sensed DP and it sends to the base station (BS) for further processing. Simulation of FGEORBC technique is carried out using different parameters such as energy consumption (EC), NL, data gathering time and classification accuracy (CA) with respect to a number of SN and a number of DP. The results observed that FGEORBC technique improves the data gathering and NL with minimum time as well as EC than the state-of-the-art methods. 

KEYWORDS

WSN, data gathering, residual energy, fuzzy logic, Ranked Gaussian gene optimization, data classification, Reweight Boosting Classification

Full Details : 

An Enhancement of Cluster-Based False Data Filtering Scheme Through Dynamic Security Selection in Wireless Sensor Networks

Jungsub Ahn and Taeho Cho 

Department of Electrical and Computer Engineering, Sungkyunkwan University, Suwon, Republic of Korea 

ABSTRACT

Today, wireless sensor networks (WSNs) are applied to various industries such as building automation, medical, security, intelligent agriculture, and disaster monitoring. A WSN consists of hundreds to thousands of tiny sensor nodes that perform monitoring tasks. A small sensor node has a limited amount of internal memory and energy resources. Sensor nodes are used to detect a variety of data in specific environmental areas. As a result, WSN should be energy efficient. Sensor nodes are vulnerable to false report injection attacks because they are deployed in an open environment. A false report injection attack consumes the limited energy of a node more quickly and confuses the user. CFFS has been proposed to prevent such an attack using a method of en-route filtering false reports by dividing nodes into clusters. However, the CFFS scheme is vulnerable for repeated false report injection attacks. In this paper, we propose an approach to prolong the WSN lifetime by adjusting the dynamic security threshold value and using a fuzzy logic-based key redistribution selection of cluster head nodes. The proposed method increases the detection rate for repeated false report injection attacks by adding the additional key distribution phase in the existing method. The experimental results show that the energy efficiency of the proposed method was increased by 40.278%. 

KEYWORDS

False Report Injection Attack, Cluster-based False Data Filtering, Network Lifetime Extension, FuzzyLogic System. 

Full Details:

RB-IEMRP: Relay Based Improved Throughput Energy-Efficient Multi-Hop Routing Protocol for INTRA Body Sensor Network (INTRA-WBSN)

Tarique Rashid1 , Sunil Kumar2 , Akshay Verma2 , Prateek Raj Gautam2 and Arvind Kumar2 . 

1Electrical and Electronics Engineering Department Katihar Engineering College, Katihar,India 2Electronics and Communication Engineering Department Motilal Nehru National Institute of Technology Allahabad, India

ABSTRACT

 In this paper, we have proposed a Relay based Improved Throughput and Energy-efficient Multi-hop Routing Protocol (Rb-IEMRP) for the Intra Wireless Body Sensor Network (Intra-WBSN). Moreover, mathematical analysis has been presented, to calculate the minimum number of relay nodes require to be deployed corresponding to the bio-sensor nodes in Intra-WBSN. Normal sensing data from bio-sensor nodes forwarded to BNC through relay nodes while emergency data is directly transmitted to BNC. Relays nodes are placed in the patients' cloth. It can be easily replaced or recharged that facilitates effective health monitoring. The proposed routing protocol has achieved better network stability, network lifetime, energy efficiency and throughput as compared to Stable Increased Throughput Multi-Hop Protocol for Link Efficiency in Wireless Body Area Networks (SIMPLE) and Reliable Energy Efficient Critical Data Routing in Wireless Body Area Networks (REEC) routing protocols. It has been validated through simulation results. 

KEYWORDS

Intra wireless body sensor network (Intra-WBSN), Body node coordinator (BNC), Relay, Wireless body sensor network (WBSN), Energy efficiency. 

Full Details:

Allocation of Virtual Firewall Functions in NFV-Based Networks with Minimum Network Cost

Shin-ichi Kuribayashi 

Department of Computer and Information Science, Seikei University, Japan

ABSTRACT

 NFV-based network implements a variety of network functions with software on general-purpose servers and this allows the network operator to select any capacity and location of network functions without any physical constraints. It is essential for economical NFV-based network design to determine the place where each network function should be located in the network and what its capacity should be. The authors proposed an algorithm of virtual routing function allocation in the NFV-based network for minimizing the network cost and provided effective allocation guidelines for virtual routing functions. This paper proposes the deployment algorithm of virtual firewall function in addition to virtual routing function for minimizing the network cost. Our evaluation results have revealed the following: (1) Installing a packet filtering function, which is a part of the firewall function, in the sending-side area additionally can reduce wasteful transit bandwidth and routing processing and thereby reduce the network cost. (2) The greater the number of packets filtered by packet filtering function in the sending-side area, the more the reduction of network cost is increased. (3) The greater the bandwidth cost relative to the routing function cost, the greater the effect of statistical multiplexing on reducing the network cost. (4) The proposed algorithm would be approaching about 95% of the deployment with the optimal solution. 

KEYWORDS

NFV, resource allocation, the virtual routing function, minimum total network cost

Full Details:

Energy Consumption Reduction in Wireless Sensor Network Based on Clustering

Gholamreza Farahani 

Department of Electrical Engineering and Information Technology, Iranian Research Organization for Science and Technology (IROST), Tehran, Iran

ABSTRACT 

One of the important issues in the routing protocol design in Wireless Sensor Networks (WSNs) is minimizing energy consumption and maximizing network lift time. Nowadays networks and information systems are one of the main parts of modern life that without them, people cannot live. On the hand, the impairment of these networks leads to great and incalculable costs. In this paper, a new method based on clustering has presented that problem of energy consumption is solved. The proposed algorithm is that energy-based clustering can create clusters of the same energy level and distribute energy efficiency across the WNS nodes. This proposed clustering protocol classify network nodes based on energy and neighbourhood criteria and attempts to better balance energy in clusters and ultimately increase network lifetime and maintain network coverage. Results are shown that the proposed algorithm is on average 40% better than LEACH algorithm and 14% better than IBLEACH algorithm. 

KEYWORDS 

Wireless Sensor Network, Clustering, LEACH Algorithm, IBLEACH Algorithm.

Full Details:

Design of Secure and Reliable MU-MIMO Transceiver System for Vehicular Networks

C. Manikandan, P. Neelamegam, S.Rakesh Kumar, G. Venkat Babu, and Sai Siva Satwik Kommi

School of Electrical and Electronics Engineering, SASTRA Deemed University, Thanjavur, Tamil Nadu, India

ABSTRACT 

MU-MIMO (Multi-User MIMO) has been a promising technique for vehicular networks to achieve faster communication. Conventional MU-MIMO transceiver is designed with One-dimensional (1-D) improper modulation schemes such as Binary Phase Shift Keying (BPSK) and Multilevel Amplitude Shift Keying (MASK) failed to yield standard ABER (average bit error rate). To achieve high reliability, a novel MUMIMO uplink transceiver system is designed under PAPC (Per-Antenna Power Constraint) by assuming perfect and imperfect channel state information (CSI). MIMO communication channels are perceptible. Hence, security of the proposed system is improved by novel pseudorandom key generation technique using randomized synthetic colour image. Analytical design for proposed systems is carried and simulated for various p-norm constraints. Simulation results show higher reliability and security than the existing system. It also satisfies the linearity constraint of a power amplifier, which makes the system more suitable for practical applications.

KEYWORDS

MU-MIMO, Uplink, PAPC, 1-D improper modulation, Perfect & imperfect CSI, Colour Image, Pseudorandom key generation.

Full Details:  

VIVoNet: Visually-Represented, Intent-Based, Voice-Assisted Networking

Amar Chaudhari, Amrita Asthana, Atharva Kaluskar, Dewang Gedia, Lakshay Karani, Levi Perigo, Rahil Gandotra and Sapna Gangwar

 Interdisciplinary Telecom Program, University of Colorado Boulder, USA 

ABSTRACT

 Networks have become considerably large, complex and dynamic. The configuration, operation, monitoring, and troubleshooting of networks is a cumbersome and time-consuming task for the network administrators as they must deal with the physical layer, underlying protocols, addressing systems, control rules, and many other low-level details. This research paper proposes an Intent-based networking system (IBNS) coupled with voice-assistance that can abstract the underlying network infrastructure and allow administrators to alter its behavior by expressing intents via voice commands. The system also displays the real-time network topology along with the highlighted intents on an interactive web application that can be used for network diagnostics. Compared to traditional networks, the concepts of software-defined networking (SDN) make it easier to integrate a voice assistant that allows configuring the network based on intents. 

KEYWORDS 

Network Management, SDN, Voice-Assistance, Intent-Based Networking & Realtime Visualization

Full Details:

Optimization of Packet Length for MIMO systems

Ghassan Alnwaimi¹, Hatem Boujemaa², Kamran Arshad³

¹King Abdulaziz University, Kingdom of Saudi Arabia

²Sup’Com, COSIM Laboratory, Tunisia

³Ajman University, United Arab Emirates

ABSTRACT

In this article, a method to enhance the throughput for Multiple Input Multiple Output (MIMO) systems by optimizing packet length is proposed. Two adaptation algorithms are proposed. In the first algorithm, we use the Average Signal to Noise Ratio (ASNR) to choose the optimal packet length and Modulation and Coding Scheme (MCS) in order to maximize the throughput. In the second algorithm, packet length and MCS are adapted with respect to the Instantaneous received SNR (ISNR). This article concludes that the variable packet length gives up to 1.8 dB gain with respect to the Fixed Packet Length (FPL).

KEYWORDS

MIMO systems, Optimal packet length, Rayleigh fading channels.

For More Details: http://aircconline.com/ijcnc/V11N1/11119cnc08.pdf

Volume Link:  http://airccse.org/journal/ijc2019.html

  

REFERENCES

1]      Pallaviram Sure; Narendra Babu C; Chandra Mohan Bhuma, “Large random matrix-based channel estimation for massive MIMO-OFDM uplink”, IET Communications, Year: 2018, Volume: 12, Issue: 9 Pages: 1035 - 1041.

[2]     Chung Duc Ho; Hien Quoc Ngo; Michail Matthaiou; Long D. Nguyen, “Power Allocation for Multi-Way Massive MIMO Relaying”, IEEE Transactions on Communications, Year: 2018,( Early Access ), Pages: 1 - 1.

[3]     Guili Zhou; Youming Li; Yu-Cheng He; Xiaoli Wang; Mingchen Yu, “Artificial fish swarm based power allocation algorithm for MIMO-OFDM relay underwater acoustic communication”, IET Communications, Volume: 12, Issue: 9 Pages: 1079 - 1085, 2018.

[4]     Narayan Prasad; Xiao Feng Qi, “Downlink multi-user MIMO scheduling with performance guarantees”, 2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), Pages: 1 - 8, 2018.

[5]     Jawad Mirza; Gan Zheng; Kai-Kit Wong; Sangarapillai Lambotharan; Lajos Hanzo, “On the Performance of Multiuser MIMO Systems Relying on Full-Duplex CSI Acquisition”, IEEE Transactions on Communications, Year: 2018.

[6]     Parag Aggarwal; Vivek Ashok Bohara, “Analytical Characterization of Dual-Band MultiUser MIMO-OFDM System with Nonlinear Transmitter Constraints”, IEEE Transactions

on Communications, Year: 2018.

[7]     Muhammad Hanif; Hong-Chuan Yang; Gary Boudreau; Edward Sich; Hossein Seyedmehdi, “Antenna subset selection for massive MIMO systems: A trace-based sequential approach for sum rate maximization”, Journal of Communications and Networks, Volume: 20, Issue: 2 Pages: 144 - 155, 2018.

[8]     Harun Siljak; Irene Macaluso; Nicola Marchetti, “Distributing Complexity: A New Approach to Antenna Selection for Distributed Massive MIMO”, IEEE Wireless Communications Letters, 2018.

[9]     Walid Al-Hussaibi; Falah H. Ali, “A Closed-Form Approximation of Correlated Multiuser MIMO Ergodic Capacity with Antenna Selection and Imperfect Channel Estimation”, IEEE Transactions on Vehicular Technology, Year: 2018, ( Early Access ).

[10]   Nir Shlezinger; Roee Shaked; Ron Dabora, “On the Capacity of MIMO Broadband Power Line Communications Channels”, IEEE Transactions on Communications, Year: 2018, ( Early Access ), Pages: 1 - 1.

[11]   Chun-Tao Lin; Ronald Y. Chang; Fan-Shuo Tseng, “Source and Relay Precoding for FullDuplex MIMO Relaying with a SWIPT-Enabled Destination”, IEEE Communications Letters, Year: 2018, ( Early Access ), Pages: 1 - 1.

[12]   Cheol Jeong; MinChul Ju; Sung Ho Chae, “MIMO Decode-and-Forward Relay Systems With an Energy-Constrained Antenna-Switching Relay”, IEEE Communications Letters,

Year: 2017, Volume: 21, Issue: 8, Pages: 1851 - 1854.

[13]   Ishtiaq Ahmad; Khoa D. Nguyen; Andre Pollok; Nick Letzepis, “ Multi-hopping loss in MIMO decode-and-forward cooperative relaying”, 2016 IEEE 27th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC), Year: 2016 Pages: 1 - 6

[14]   Zhengzheng Xiang; Meixia Tao; Jianhua Mo; Xiaodong Wang, “Degrees of Freedom for MIMO Two-Way X Relay Channel”, IEEE Transactions on Signal Processing, Year: 2013, Volume: 61, Issue: 7, Pages: 1711 - 1720.

[15]   Santosh Timilsina; Gayan Amarasuriya Aruma Baduge; Rafael F. Schaefer, “Secure Communication in Spectrum-Sharing Massive MIMO Systems with Active Eavesdropping”,

IEEE Transactions on Cognitive Communications and Networking, Year: 2018, ( Early Access ) Pages: 1 - 1.

[16]   Mohammad Vahid Jamali; Pooya Nabavi; Jawad A. Salehi, “MIMO Underwater Visible Light Communications: Comprehensive Channel Study, Performance Analysis, and

Multiple-Symbol Detection”, IEEE Transactions on Vehicular Technology, Year: 2018, ( Early Access )

[17]   Y. Xi, A. Burr, J. B. Wei, D. Grace, “ A general upper bound to evaluate packet error rate over quasi-static fading channels”, IEEE Trans. Wireless Communications, vol. 10, nO 5, pp 1373-1377, May 2011.

[18]   J. G. Proakis, Digital Communications, Third edition, Mc Graw Hill, 1995.

[19]   S. Y. Liu, X. Wu, Y. Xi, J. Wei, “On the throughput and OPL of an uncoded ARQ system over slow Rayleigh fading channels”, IEEE Communication Letters, Vol. 16, no 8, pp. 1173-1175, August 2012.

Techniques for Offloading lte Evolved Packet Core Traffic Using Open flow: A Comparative Survey & Design Reference

Kam Nasim¹ and Trevor James Hall²

¹Department of Electrical and Computer Engineering, University of Ottawa, Canada

²Professor and Canada Research Chair in Photonic Network Technology, University of Ottawa, Canada

ABSTRACT

Cellular users of today have an insatiable appetite for bandwidth and data. Data-intensive applications, such as video on demand, online gaming and video conferencing, have gained prominence. This, coupled with recent innovations in the mobile network such as LTE/4G, poses a unique challenge to network operators in how to extract the most value from their deployments while reducing their Total Cost of Operations (TCO). To this end, a number of enhancements have been proposed to the “conventional” LTE mobile network. Most of these recognize the monolithic and non-elastic nature of the mobile backend and propose complimenting core functionality with concepts borrowed from Software Defined Networking (SDN). In this paper, we will attempt to explore some existing options within the LTE standard to address traffic challenges. We then survey some SDN-enabled alternatives and comment on their merits and drawbacks.

KEYWORDS

SDN, LTE, EPC, open flow, mobile networks, deep packet inspection, network applications.

For More Details: http://aircconline.com/ijcnc/V11N1/11119cnc07.pdf

Volume Link:  http://airccse.org/journal/ijc2019.html

REFERENCES

[1]     Opendaylight platform. https://www.opendaylight.org/. Accessed: 2016-01-30.

[2]     Global Games Market Grows to $86.1bn in 2016. http://www.newzoo.com/pressreleases/global-games-market-grows-to-86-1bn-in-2016, October 2013.

[3]     Mojdeh Amani, Toktam Mahmoodi, Mallikarjun Tatipamula, and Hamid Aghvami. Sdn based data offloading for sdn based data offloading for 5g mobile networks g mobile networks. ZTECOMMUNICATIONS, page 34, 2014.

[4]     Arijit Banerjee, Xu Chen, Jeffrey Erman, Vijay Gopalakrishnan, Seungjoon Lee, and Jacobus Van Der Merwe. Moca: a lightweight mobile cloud offloading architecture. In Proceedings of the eighth ACM international workshop on Mobility in the evolving internet architecture, pages 11–16. ACM, 2013.

[5]     ArsanyBasta, Wolfgang Kellerer, Marco Hoffmann, Karel Hoffmann, and E-D Schmidt. A virtual sdn-enabled lteepc architecture: a case study for s-/p-gateways functions. In Future Networks and Services (SDN4FNS), 2013 IEEE SDN for, pages 1–7. IEEE, 2013.

[6]     Siwar Ben Hadj Said, Malla Reddy Sama, KarineGuillouard, Lucian Suciu, Gael Simon, Xavier Lagrange, and Jean-Marie Bonnin. New control plane in 3gpp lte/epc architecture for on-demand connectivity service. In Cloud Networking (CloudNet), 2013 IEEE 2nd International Conference on, pages 205–209. IEEE, 2013.

[7]     Gustavo Carneiro. Ns-3: Network simulator 3. In UTM Lab Meeting April, volume 20, 2010.

[8]     KJS Chadha, CF Hunnicutt, SR Peck, and J Tebes. Advanced mobile phone service: Mobile telephone switching office. Bell System Technical Journal, 58(1):71–95, 1979.

[9]     Margaret Chiosi, Don Clarke, P Willis, A Reid, J Feger, M Bugenhagen, W Khan, M Fargano, C Cui, H Deng, et al. Network functions virtualisation introductory white paper. In SDN and OpenFlow World Congress, 2012.

[10]   Junguk Cho, Binh Nguyen, Arijit Banerjee, Robert Ricci, Jacobus Van der Merwe, and Kirk Webb. Smore: software-defined networking mobile offloading architecture. In Proceedings of the 4th workshop on All things cellular: operations, applications, & challenges, pages 21–26. ACM, 2014.

[11]   Cisco Visual Networking Index Cisco. Global mobile data traffic forecast update, 2013–2018. white paper, 2014.

[12]   Cisco Visual Networking Index Cisco. Global mobile data traffic forecast update, 2016–2021. white paper, 2017.

[13]   OpenFlow Switch Consortium et al. Openflow switch specification version 1.1. 0 implemented (wire protocol 0x02), february 2011.

[14]   SouheirEido and Annie Gravey. How much lte traffic can be offloaded? In Advances in Communication Networking, pages 48–58. Springer, 2014.

[15]   Raj Jain, Dah-Ming Chiu, and William Hawe. A quantitative measure of fairness and discrimination for resource allocation in shared computer systems. 1998.

[16]   Amit Kumar, Jyotsna Sengupta, and Yun-fei Liu. 3gpp lte: The future of mobile broadband. Wireless Personal Communications, 62(3):671–686, 2012.

[17]   Alcatel Lucent. The lte network architecturea comprehensive tutorial. Strategic Whitepaper, 2009.

[18]   Kanthi Nagaraj and Sachin Katti. Procel: Smart traffic handling for a scalable software epc. In Proceedings of the third workshop on Hot topics in software defined networking, pages 43–48. ACM, 2014.

[19]   Kam Nasim. AETOS: An Architecture for Offloading Core Software Defined Networking Concepts. Master’s thesis, University of Ottawa, 2016.

[20]   CISCO Global Visual Networking and Cloud Index.Forecast and methodology, 2011-2016.

[21]   George F. Riley and Thomas R. Henderson. Modeling and Tools for Network Simulation, chapter The ns-3 Network Simulator, pages 15–34. Springer Berlin Heidelberg, Berlin, Heidelberg, 2010.

[22]   CB Sankaran. Data offloading techniques in 3gpp rel-10 networks: A tutorial. Communications Magazine, IEEE, 50(6):46–53, 2012.

Machine Learning Algorithm of Detection of DOS Attacks on An Automotive Telematic Unit

Eric Perraud

Renault Software Labs, Toulouse, France

Abstract

Today vehicles are connected to private networks which are owned by the car manufacturer. But in coming years, vehicles become more and more connected to the public Internet for infotainment applications but also to safety applications. Like any Internet terminal, some hackers can attack the wireless connectivity unit of the vehicle with Distribution Denial of Services (DDOS) attacks, so that the wireless connectivity unit of the vehicle is not available and the service is lost. Therefore, it is critical to developing a mechanism to detect such an attack and eliminate it, to maintain the availability of the wireless connectivity unit. This paper proposes an algorithm which proceeds in 2 steps: it uses an unsupervised machine learning algorithm to detect DDOS attacks in the incoming Internet data. When it detects an attack, it uses the results of the machine learning algorithm to split the legitimate flow and the rogue flows. The rogue flow is filtered so that the availability of the wireless connectivity unit of the vehicle is restored. This proposed algorithm needs very few CPU computing power and is compatible with low-cost CPUs which are used in an automotive wireless connectivity unit.

Keywords

Clustering algorithm, vehicle, DDOS, unsupervised learning

For More Details: http://aircconline.com/ijcnc/V11N1/11119cnc02.pdf

Volume Link: http://airccse.org/journal/ijc2019.html

REFERENCES

[1]     Andrew Ng – Coursera Online – Machine Learning

[2]     D. Ippoliti and X. Zhou. Online adaptive anomaly detection for augmented network flows. In IEEE 22nd Int. Symp. on Modelling, Analysis Simulation of Comput. and Telecommun. Syst., pages 433–442, Sept. 2014.

[3]     A. Lakhina, M. Crovella, and C. Diot. Diagnosing network-wide traffic anomalies. In Conf. on Applications, Technologies, Architectures, and Protocols for Comput. Commun., pages 219–230, New York, NY, USA, 2004. ACM.

[4]     Juliette Dromard, Gilles Roudiere, Philippe Owezarski. Online and scalable unsupervised network anomaly detection method – IEEE Transactions on Networks and Service Management ,pages 34-47, 2017.

[5]     N. Chen, A. Chen, and L. Zhou. An incremental grid density-based clustering algorithm. Journal of Software, 13(1), Aug. 2002.

[6]     P. Casas, J. Mazel, and P. Owezarski. NETWORKING 2011: 10th Int. IFIP TC 6 Networking Conf., chapter UNADA: Unsupervised Network Anomaly Detection Using Sub-space Outliers Ranking, pages 40–51. Springer Berlin Heidelberg, 2011.

[7]     Y. Bengio, O. Delalleau, and N. Le Roux. The curse of highly variable functions for local kernel machines. In Proc. of the 18th Int. Conf. on Neural Information Processing Systems, pages 107–114, Cambridge, MA, USA, 2005. MIT Press.

[8]     Chiadighikaobi Ikenna Rene and Johari Abdullah. Malicious Code Intrusion Detection using Machine Learning And Indicators of Compromise. International Journal of Computer Science and Information Security (IJCSIS), Vol. 15, No. 9, September 2017

[9]     A. Patcha and J. Park. An overview of anomaly detection techniques: Existing solutions and latest technological trends. Comput. Netw., 51(12), Aug 2007.

[10]   Vishwas S. Ciza, T. and Balakrishnan N. Usefulness of darpa dataset for intrusion detection system evaluation, 2014

[11]   P. F. Evangelista, M. J. Embrechts, and B. K. Szymanski. Taming the Curse of Dimensionality in Kernels and Novelty Detection, pages 425– 438. Springer Berlin Heidelberg, Berlin, Heidelberg, 2006

[12]   M-LShyu,S-CChen,K.Sarinnapakorn,andL.Chang. A novel anomaly detection scheme based on principal component classifier. IEEE Foundations and New Directions of Data Mining Workshop, pages 171– 179, 2003.

[13]   J. Dromard, V. Baudin, P. Owezarski, A. Mozo-Velasco, B. Ordozgoiti, and S. Gomez-Canaval.D4.3: Experimental evaluation of algorithms for online network characterizations. Technical report, FP7 European ONTIC project: Online Network Traffic Characterization, January 2017.

[14]   J. Mazel. Unsupervised network anomaly detection. PhD thesis, INSA Toulouse, France, Dec. 2011

[15]   Vijaya P. Vipin, D., Sattvik S., Sreevathsan S., and Gireesh K. T. Network intrusion detection system based on machine learning algorithms. International Journal of Computer Science and Information Technology (IJCSIT), 2(6):138–151, 2010.

[16]   Deshmukh S. Patil, R. and Rajeswari K. Analysis of simple k-means with multiple dimensions using weka. International Journal of Advanced Research in Computer Science and Software Engineering, 110:14–17, 2015.

[17]   K. Leung and C. Leckie. Unsupervised anomaly detection in network intrusion detection using clusters. In Twenty-Eighth Australasian Comput. Science Conf. (ACSC2005), pages 333–342, 2005.

[18]   P. Casas, J. Mazel, and P. Owezarski. Unsupervised network intrusion detection systems: Detecting the unknown without knowledge. Comput. Comm., 35(7):772 – 783, 2012.

[19]   11. L. Parsons et al., “Subspace Clustering for High Dimensional Data: a Review”, in ACM SIGKDD Expl. Newsletter, vol. 6 (1), pp. 90-105, 2004 ACM SIGKDD Expl. Newsletter, vol. 6 (1), pp. 90-105, 2004

AUTHORS 

Eric Perraud works at Renault Software labs in the Strategy Office. He had previously been working at Intel and Motorola as modem chief architect. He has a Telecommunication master from Sup Telecom Bretagne and a opto-electronics PhD from Sup-Aero