CONTROLLING DELAY AT THE ROUTER BUFFER USING MODIFIED RANDOM EARLY DETECTION

Ahmad Adel Abu-Shareha

 Information Technology and Computing Department, Arab Open University (AOU),
Riyadh, Saudi Arabia

Abstract 

Active Queue Management (AQM) methods are used to manage the buffer of the network routers and avoid the problems caused by network congestion, especially packet loss. Among various AQM methods that have been proposed in the literature, Random Early Detection (RED)method has proved to stabilize the network performance under various traffic loads. However, as the primary concern of RED is to avoid loss when the router buffer overflowed, RED harms the delay at the router and increases the latency. Given that reducing delay is critical to some applications, such as online conferencing and broadcasting, RED needs to be adjusted to ease the delay problem. In this paper, RED is improved by monitoring the delay at the router buffer and implementing packet dropping to handle the issue of network delay and enhance the network performance. Accordingly, the modified method calculates and used a delay parameter with the RED to reduce the delay while maintaining the desirable RED’s characteristics. The experimental results showed that the proposed Delay-Controller Random Early Detection (DcRED) improved network performance under various traffic loads. Compared to RED, DcRED results in less delay, while maintaining the loss and dropping rates.

Keywords 

Delay, Congestion, Random Early Detection, Active Queue Management

                       

                                                  Full Text

Developing QoS by Priority Routing for Real Time Data in Internet of Things (IoT) Urban Scenarios

Radwan S. Abujassar

Information Technology and Computing (ITC) Arab Open University, Kuwait Branch

Abstract 

In networks, many application protocols such as CoAP, REST, XMPP ,AMQP have been proposed for IoT communication which includes p2p or S2S. In MANET Network convergence does the way for improvements in Internet of Things (IoT) communication with high potential for a wide range of applications. Each protocol focuses on some aspects of communication in the IoT. Hence, these application protocols have indicated of how IoT has integrated to enhanced and developed of a new service that require to guarantees the wide range offered by the quality of services. In this paper, we will introduce a smart pathway that can be bridge the gap between IoT services with its real data traffic. Therefore, we enhanced the MANET routing protocol for computing two or more paths to pass the more that one high priority real traffic data via these paths to improve the gloomy picture of this protocol in the context of IoT. In particular, the good services with high timely delivery of urgent data such as real time data environmental monitoring. After surveying the published and available protocol interoperability given for urban sensing. In this research, we have proposed a novel solution to integrate MANET overlays, and collaboratively formed over MANET, to boost urban data in IoT. Overlays are used to dynamic differentiate and fasten the delivery of high priority real application time data over low-latency MANET paths by integrating with the original specifications. Our experimental results showed the effectiveness on the network such as the overhead and network congestion. In addition, the initial results of the light-weight improved the routing protocol over the baseline protocols in terms of the delay of reciveing the packets between nodes which lead to increase the throughput by reducing loss packets.

Keywords 

Quality of Service (QoS), Adhoc on demand Distance Vector Alternative (ODVA), Open Link State Routing (OLSR),Internet Of Thing(IOT)

                       

                                                  Full Text

A NOVEL HYBRID OPPORTUNISTIC SCALABLE ENERGY EFFICIENT ROUTING DESIGN FOR LOW POWER, LOSSY WIRELESS SENSOR NETWORKS

Jayavignesh Thyagarajan and Suganthi K

School of Electronics Engineering, Vellore Institute of Technology, Chennai Campus, India

Abstract 

Opportunistic Routing (OR) scheme increases the transmission reliability despite the lossy wireless radio links by exploiting the broadcast nature of the wireless medium. However, OR schemes in low power Wireless Sensor Network (WSN) leads to energy drain in constrained sensor nodes due to constant overhearing, periodic beaconing for Neighbourhood Management (NM) and increase in packet header length to append priority wise sorted Forwarding Candidates Set (FCS) prior to data transmission. The timer-based coordination mechanism incurs the least overhead to coordinate among the FCS that has successfully received the data packet for relaying the data in a multi-hop manner. This timer-based mechanism suffers from duplicate transmissions if the FCS is either not carefully selected or coordinated. The focus of this work is to propose a hybrid opportunistic energy efficient routing design for large scale, low power and lossy WSN. This design avoids periodic 'hello' beacons for NM, limits constant overhearing and increase in packet header length. There are two modes of operation i) opportunistic ii) unicast mode. The sender node adopts opportunistic forwarding for its initial data packet transmission and instead of pre-computing the FCS, it is dynamically computed in a completely distributed manner. The eligible nodes to be part of FCS will be neighbour nodes at lower corona level than the sender with respect to the sink and remaining energy above the minimum threshold. The nodes part of FCS based on crosslayered multi-metrics and fuzzy decision logic determines its priority level to compute Dynamic Holding Delay (DHD) for effective timer coordination. The differentiated back off implementation along with DHD enables the higher priority candidate that had received data packet to forward the packet first and facilitates others to cancel its timer upon overhearing. The sender node switches to unicast mode of forwarding for successive transmissions by choosing the forwarding node with maximum trust value as it denotes the stability of the temporally varying link with respect to the forwarder. The sender node will revert to opportunistic mode to increase transmission reliability in case of link-level transmission error or no trustworthy forwarders. Simulation results in NS2 show significant increase in Packet Delivery Ratio (PDR),decrease in both average energy consumption per node and Normalized Energy Consumption (NEC) per packet in comparison with existing protocols.

Keywords 

Routing, Opportunistic, Energy Efficiency, fuzzy logic, scalability, communication protocol design

                       

                                                  Full Text

MAINTAINING CLOUD PERFORMANCE UNDER DDOS ATTACKS

Moataz H. Khalil^{1, 2} , Mohamed Azab² , Ashraf Elsayed³ , Walaa Sheta^{1, 2} , Mahmoud Gabr³ and Adel S. Elmaghraby^{1, 2}

¹CECS Department, University of Louisville, Kentucky, USA

²The City of Scientific Research and Technology Applications, Egypt

 ³Department of Mathematics & Computer Science, Faculty of Science, Alexandria University, Alexandria, Egypt

Abstract 

The popularity of cloud computing has been growing where the cloud became an attractive alternative rather than classic information processing system. The distributed denial of service (DDoS) attack is one of the famous attacks to cloud computing. This paper proposes a Multiple Layer Defense (MLD) scheme to detect and mitigate DDoS attacks which due to resource depletion. The MLD consists of two layers. The first layer has an alarm system send alarms to cloud management when DDoS attacks start. The second layer includes an anomaly detection system detects VM is infected by DDoS attacks. Also,MLD tested with a different DDoS attack ratio to show scheme stability. MLD evaluated by The energy consumption and the overall SLA violations. The results show the great effect of the MLD to reduce the energy consumption and the overall SLA violation for all datasets. Also, the MLD shows acceptable stability and reactivity with different DDoS attack ratio. 

Keywords 

Cloud Computing, Energy consumption, Service Level Agreement, DDoS attack, anomaly detection, Availability.

                       

                                                  Full Text

CONTAINERIZED SERVICES ORCHESTRATION FOR EDGE COMPUTING IN SOFTWARE-DEFINED WIDE AREA NETWORKS

Felipe Rodriguez Yaguache and Kimmo Ahola

5G Networks & Beyond, Technical Research Centre of Finland (VTT), Espoo, Finland

Abstract 

As SD-WAN disrupts legacy WAN technologies and becomes the preferred WAN technology adopted by corporations, and Kubernetes becomes the de-facto container orchestration tool, the opportunities for deploying edge-computing containerized applications running over SD-WAN are vast. 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 article, an in-house service discovery solution that works alongside Kubernetes’ master node for allowing improved traffic handling and better user experience when running micro-services 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.

Keywords 

SD-WAN, Edge computing, Virtualization, Kubernetes, Containers, Services

                       

                                                  Full Text

A NOVEL SECURITY PROTOCOL FOR WIRELESS SENSOR NETWORKS BASED ON ELLIPTIC CURVE SIGNCRYPTION

Anuj Kumar Singh¹ and B.D.K.Patro²

¹Dr. A.P.J. Abdul Kalam Technical University, Lucknow, (U.P), India

²Rajkiya Engineering College, Kannauj, (U.P.), India

Abstract 

With the growing usage of wireless sensors in a variety of applications including Internet of Things, the security aspects of wireless sensor networks have been on priority for the researchers. Due to the constraints of resources in wireless sensor networks, it has been always a challenge to design efficient security protocols for wireless sensor networks. An novel elliptic curve signcryption based security protocol for wireless sensor networks has been presented in this paper, which provides anonymity, confidentiality, mutual authentication, forward security, secure key establishment, and key privacy at the same time providing resistance from replay attack, impersonation attack, insider attack, offline dictionary attack, and stolen-verifier attack. Results have revealed that the proposed elliptic curve signcryption based protocol consumes the least time in comparison to other protocols while providing the highest level of security.

Keywords 

Wireless Sensor Network, Security,Protocol, Signcryption, Elliptic Curve
                       

                                                  Full Text

A LOW-ENERGY DATA AGGREGATION PROTOCOL USING AN EMERGENCY EFFICIENT HYBRID MEDIUM ACCESS CONTROL PROTOCOL IN HIERARCHAL WIRELESS SENSOR NETWORKS

Rana Adel¹ and Tamer Barakat²

¹Faculty of engineering, communications and electronics department Fayoum, Egypt

²Faculty of engineering, electrical department, Fayoum University Postal number, 63514, Fayoum, Egypt

Abstract 

Recent wireless sensor network focused on developing communication networks with minimal power and cost. To achieve this, several techniques have been developed to monitor a completely wireless sensor network. Generally, in the WSN network, communication is established between the source nodes and the destination node with an abundant number of hops, an activity which consumes much energy. The node existing between source and destination nodes consumes energy for transmission of data and maximize network lifetime. To overcome this issue, a new Emergency Efficient Hybrid Medium Access Control (EEHMAC) protocol is presented to reduce consumption of energy among a specific group of WSNs which will increase the network lifetime. The proposed model makes a residual battery is utilized for effective transmission of data with minimal power consumption. Compared with other models, the experimental results strongly showed that our model is not only able to reduce network lifetime but also to increase the overall network performance.

Keywords 

Wireless sensor networks, data aggregation, EEHMAC protocol and clustering in WSN                              

                                                  Full Text

ENERGY EFFICIENT COMPUTING FOR SMART PHONES IN CLOUD ASSISTED ENVIRONMENT

Nancy Arya¹ Sunita Choudhary¹ and S.Taruna²

¹ Department of Computer Science, Banasthali Vidyapith, Rajasthan, India

² Department of Computer Science, JK Lakshmipat University, Rajasthan, India

Abstract 

In recent years, the employment of smart mobile phones has increased enormously and are concerned as an area of human life. Smartphones are capable to support immense range of complicated and intensive applications results shortened power capability and fewer performance. Mobile cloud computing is the newly rising paradigm integrates the features of cloud computing and mobile computing to beat the constraints of mobile devices. Mobile cloud computing employs computational offloading that migrates the computations from mobile devices to remote servers. In this paper, a novel model is proposed for dynamic task offloading to attain the energy optimization and better performance for mobile applications in the cloud environment. The paper proposed an optimum offloading algorithm by introducing new criteria such as benchmarking for offloading decision making. It also supports the concept of partitioning to divide the computing problem into various sub-problems. These sub-problems can be executed parallelly on mobile device and cloud. Performance evaluation results proved that the proposed model can reduce around 20% to 53% energy for low complexity problems and up to 98% for high complexity problems.

Keywords 

Mobile Cloud Computing, Mobile Computing, Computational Offloading, Dynamic Task Offloading, Energy Optimization.                                 

                                                  Full Text

ADDRESSING IMBALANCED CLASSES PROBLEM OF INTRUSION DETECTION SYSTEM USING WEIGHTED EXTREME LEARNING MACHINE

Mohammed Awad¹ and Alaeddin Alabdallah²

¹Faculty of E&IT, Dept. of Computer Systems Engineering,

Arab American University, Palestine

²Faculty of E&IT, Dept. of Computer Engineering,

An-Najah National University, Palestine

Abstract 

The main issues of the Intrusion Detection Systems (IDS) are in the sensitivity of these systems toward the errors, the inconsistent and inequitable ways in which the evaluation processes of these systems were often performed. Most of the previous efforts concerned with improving the overall accuracy of these models via increasing the detection rate and decreasing the false alarm which is an important issue. Machine Learning (ML) algorithms can classify all or most of the records of the minor classes to one of the main classes with negligible impact on performance. The riskiness of the threats caused by the small classes and the shortcoming of the previous efforts were used to address this issue, in addition to the need for improving the performance of the IDSs were the motivations for this work. In this paper, stratified sampling method and different cost-function schemes were consolidated with Extreme Learning Machine (ELM) method with Kernels, Activation Functions to build competitive ID solutions that improved the performance of these systems and reduced the occurrence of the accuracy paradox problem. The main experiments were performed using the UNB ISCX2012 dataset. The experimental results of the UNB ISCX2012 dataset showed that ELM models with polynomial function outperform other models in overall accuracy, recall, and F-score. Also, it competed with traditional model in Normal, DoS and SSH classes.

Keywords 

Machine Learning, Weighted Extreme Learning Machine, Intrusion detection system, Accuracy, UNB ISCX2012.

                                                                  

                                                  Full Text

HISTOGRAM OF NEIGHBORHOOD TRIPARTITE AUTHENTICATION WITH FINGERPRINT-BASED BIOMETRICS FOR IOT SERVICES

S. Kanchana

Department of Computer Science, PSG College of Arts & Science, Coimbatore, India

Abstract 

Internet of Things (IoT) and services is an interesting topic with a wide range of potential applications like smart home systems, health care, telemedicine, and intelligent transportation. Traditionally, key agreement schemes have been evaluated to access IoT services which are highly susceptible to security. Recently, Biometric-based authentication is also used to access IoT services and devices. They are involving a larger amount of memory with increased running time and found to be computationally infeasible. To provide robust authentication for IoT services, Histogram of Neighborhood Tripartite Authentication with Fingerprint Biometrics (HNTA-FB) for IoT services is proposed in this paper. This proposed HNTA-FB method uses binary patterns and a histogram of features to extract the region of interest. To reduce the memory requirements while providing access to IoT services, Histogram of Neighborhood Binary Pattern Pre-processing (HNBPP) model is proposed. The discriminative power of Neighbourhood Binary Pattern Registration (NBPR) is integrated with the normalized sparse representation based on the histogram. Additionally, this work presents a new Tripartite User Authentication model for fingerprint biometric template matching process. When compared with different state-of-the-art methods, the proposed method depicts significantly improved performance in terms of matching accuracy, computational overhead and execution speed and is highly effective in delivering smart home services.

Keywords 

 Binary Patterns, Fingerprint Biometrics, Histogram, Internet of Things, Neighborhood Tripartite Authentication.

                                                                  

                                                  Full Text

A COMPREHENSIVE STUDY OF DSCP MARKINGS’ IMPACT ON VOIP QOS IN HFC NETWORKS

Shaher Daoud  and Yanzhen Qu

School of Computer Science, Colorado Technical University, Colorado Springs, USA

Abstract 

Various factors can have a significant degrading impact on the residential Voice over Internet Protocol (VoIP) phone services’ quality. Hybrid fibre- coaxial (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. This paper will analyze and assess VoIP traffic prioritization and its impact on VoIP’s quality of service (QoS) based on the concept of differentiated services code point (DSCP) markings. Call testing examines two types of calls. The first set of tests focus on calls that originate from a VoIP network and terminate on a signalling system 7 (SS7) network. The second experiment focuses on calls that originate from SS7 network and terminate on a VoIP network. The research results provide DSCP markings configurations that can improve phone conversations’ quality.

Keywords 

 QoS , VoIP,  DSCP Marking ,  jitter,  HFC Network, MOS.

                                                                  

                                                  Full Text

APPLYING GEO-ENCRYPTION AND ATTRIBUTE BASED ENCRYPTION TO IMPLEMENT SECURE ACCESS CONTROL IN THE CLOUD

Abu Salim¹, Sachin Tripathi² and Rajesh Kumar Tiwari³

 ¹Department of Computer Science, College of CS & IT, Jazan University, Jazan,
Kingdom of Saudi Arabia (KSA)

²Department of Computer Science Engineering, Indian Institute of Technology, 

Dhanbad, Jharkhand, India

³Department of Computer Science and Engineering, RVS College of Eng. & Tech.,Jamshedpur, Jharkhand, India 

Abstract 

Cloud computing is utility-based computing provides many benefits to its clients but security is one aspect which is delaying its adoptions. Security challenges include data security, network security and infrastructure security. Data security can be achieved using Cryptography. If we include location

information in the encryption and decryption process then we can bind access to data with the location so that data can be accessed only from the specified locations. In this paper, we propose a method based on the symmetric cryptography, location-based cryptography and ciphertext policy – Attribute-based encryption (CP-ABE) to implements secure access control to the outsourced data. The Symmetric key is used to encrypt that data whereas CP-ABE is used to encrypt the secret key and the location lock value before uploading on the server. User will download encrypted data and the symmetric secret key XORed with the Location Lock value, using his attributes based secret key he can obtain first XORed value of Symmetric secret key and location lock value. Using anti-spoof GPS Location lock value can be obtained which can be used to retrieve the symmetric secret key. We have adopted Massage Authentication Code (MAC) to ensure Integrity and Availability of the data. This protocol can be used in the Bank, government organization, military services or any other industry those are having their offices/work location at a fixed place, so data access can be bounded to that location.

Keywords 

Cloud Computing, Secure Access Control, Security issues, Cryptography, Geo Encryption, Attribute-Based Encryption, CP- ABE.

                                                                  

                                                  Full Text

LATTICE STRUCTURAL ANALYSIS ON SNIFFING TO DENIAL OF SERVICE ATTACKS

B.Prabadevi¹ , N.Jeyanthi¹ , Nur Izura Udzir² and Dhinaharan Nagamalai³

 ¹ School of Information Technology and Engineering, Vellore Institute of Technology, Vellore, India

²Department of Computer Science, Universiti Putra Malaysia, Malaysia

³Wireilla Net Solutions, Australia

Abstract 

Sniffing is one of the most prominent causes for most of the attacks in the digitized computing environment.Through various packet analyzers or sniffers available free of cost, the network packets can be captured and analyzed. The sensitive information of the victim like user credentials, passwords, a PIN which is of more considerable interest to the assailants’ can be stolen through sniffers. This is the primary reason for most of the variations of DDoS attacks in the network from a variety of its catalog of attacks. An effective and trusted framework for detecting and preventing these sniffing has greater significance in today’s computing. A counter hack method to avoid data theft is to encrypt sensitive information. This paper provides an analysis of the most prominent sniffing attacks. Moreover, this is one of the most important strides to guarantee system security. Also, a Lattice structure has been derived to prove that sniffing is the prominent activity for DoS or DDoS attacks. 

Keywords 

Sniffing, Sensitive Data, Intrusion Detection, DDoS, Lattice Structure;

                                                                  

                                                  Full Text

A FRACTAL BASED IMAGE CIPHER USING KNUTH SHUFFLE METHOD AND DYNAMIC DIFFUSION

Shafali Agarwal
  

Plano, Texas 75025, USA  

Abstract 

This paper proposes a fractal-based image encryption algorithm which follows permutation-substitution structure to maintain confusion and diffusion properties. The scheme consists of three phases: key generation process; pixel permutation using the Knuth shuffle method; and the dynamic diffusion of scrambled image. A burning ship fractal function is employed to generate a secret key sequence which is further scanned using the Hilbert transformation method to increase the randomness. The chaotic behavior of the fractal strengthens the key sensitivity towards its initial condition. In the permutation phase, the Knuth shuffle method is applied to a noisy plain image to change the index value of each pixel. To substitute the pixel values, a dynamic diffusion is suggested in which each scrambled pixel change its value by using the current key pixel and the previously ciphered image pixel. To enhance the security of the cryptosystem, the secret key is also modified at each encryption step by performing algebraic transformations. The visual and numerical analysis demonstrates that the proposed scheme is reliable to secure transmission of gray as well as color images.

Keywords 

Burning ship fractal, Knuth shuffle method, Image encryption, Hilbert transformation, dynamic diffusion

                                                                  

                                                  Full Text

AN OPTIMUM ENERGY CONSUMPTION HYBRID ALGORITHM FOR XLN STRATEGIC DESIGN IN WSN’S

Md. Khaja Mohiddin and V. B. S. Srilatha Indira Dutt

Research Scholar, Department of ECE, GITAM (Deemed to be University), Visakhapatnam, Andhra Pradesh, India
 Associate Professor, Department of ECE, GITAM (Deemed to be University), Visakhapatnam, Andhra Pradesh, India

Abstract 

In this paper, X-Layer protocol is originated which executes mobility error prediction (MEP) algorithm to calculate the remaining energy level of each node. This X-Layer protocol structure employs the mobility aware protocol that senses the mobility concerned to each node with the utilization of Ad-hoc On-Demand Distance Vector (AODV), which shares the information or data specific to the distance among individual nodes. With the help of this theory, the neighbour list will be updated only to those nodes which are mobile resulting in less energy consumption when compared to all (static/mobile) other nodes in the network. Apart from the MEP algorithm, clustering head (CH) election algorithm has also been specified to identify the relevant clusters whether they exists within the network region or not. Also clustering multi-hop routing (CMHR) algorithm was implemented in which the node can identify the cluster to which it belongs depending upon the distance from each cluster surrounding the node. Finally comprising the AODV routing protocol with the Two-Ray Ground method, we implement X-Layer protocol structure by considering MAC protocol in accordance to IEEE 802.15.4 to obtain the best results in energy consumption and also by reducing the energy wastage with respect to each node. The effective results had been illustrated through Network Simulator-II platform

Keywords 

IEEE 802.15.4, AODV Protocol, Two Ray Ground Propagation Model, Mobility Error Prediction (MEP)Algorithm, Clustering Multi-Hop Routing (CMHR) Algorithm, Energy Consumption, End-to-End Delay; Throughput 

                                                                  

                                                  Full Text

Fuzzy Informer Homed Routing Protocol for Wireless Sensor Network

Gholamreza Kakamanshadi, Savita Gupta and Sukhwinder Singh

Department of Computer Science & Engineering, Faculty of Engineering and Technology, Panjab University, Chandigarh, India

Abstract 

A wireless sensor network consists of several sensor nodes. Sensor nodes collaborate to collect meaningful environmental information and send them to the base station. During these processes, nodes are prone to failure, due to the energy depletion, hardware or software failure, etc. Therefore, fault tolerance and energy efficiency are two important objectives for reliable packet delivery. To address these objectives a novel method called fuzzy informer homed routing protocol is introduced. The proposed method tries to distribute the workload between every sensor node. A fuzzy logic approach is used to handle uncertainties in cluster head communication range estimation. The simulation results show that the proposed method can significantly reduce energy consumption as compared with IHR and DHR protocols. Furthermore, results revealed that it performs better than IHR and DHR protocols in terms of first node dead and half of the nodes alive, throughput and total remaining energy. It is concluded that the proposed protocol is a stable and energy efficient fault tolerance algorithm for wireless sensor networks. 

Keywords 

Wireless Sensor Network; Routing Protocols; Fault Tolerance; Energy Efficiency; Clustering Algorithms; Fuzzy Logic system                                                                   

                                                  Full Text

A MAC PROTOCOL WITH DYNAMIC ALLOCATION OF TIME SLOTS BASED ON TRAFFIC PRIORITY IN WIRELESS BODY AREA NETWORKS

Sabin Bhandari and Sangman Moh

Department of Computer Engineering, Chosun University, Gwangju, South Korea 

Abstract 

In a wireless body area network (WBAN), wireless biomedical sensors are placed around, on, or inside the human body. Given specific requirements, WBANs can significantly improve healthcare, diagnostic monitoring, and other medical services. However, the existing standards such as IEEE 802.11 and IEEE 802.15.4 have some limitations to meet all the requirements of WBANs. Many medium access control (MAC) protocols have been studied so far, most of which are derived from the IEEE 802.15.4 superframe structure with some improvements and adjustments. However, the MAC protocols do not provide the required quality of service (QoS) for various types of traffic in a WBAN. In this paper, a traffic-aware MAC (TA-MAC) protocol for WBANs is proposed, in which time slots are dynamically allocated on the basis of traffic priority, providing the required QoS. According to the performance evaluation results, the proposed TA-MAC is better than IEEE 802.15.4 MAC and the conventional priority-based MAC in terms of transmission time, system throughput, energy efficiency, and collision ratio. 

Keywords 

Wireless body area network; Medium access control, Energy efficiency; Quality of service; Traffic priority; IEEE 802.15.4                                                                         

                                                  Full Text

MULTI-OBJECTIVE OPTIMIZATION ASSISTED NETWORK CONDITION AWARE QOS-ROUTING PROTOCOL FOR MANETS: MNCQM

Shashi Raj K¹ and Siddesh G K²

¹Department of Electronics and Communication, Dayananda Sagar College of Engineering, Bengaluru, India

²Department of Electronics and Communication, JSS Academy of Technical Education, Bengaluru, India

Abstract 

The exponential rise in wireless communication systems and allied applications has revitalized academia-industries to achieve more efficient data transmission system to meet Quality-of-Service (QoS) demands. Amongst major wireless communication techniques, Mobile Ad-hoc Network (MANET) is found potential to provide decentralized and infrastructure less communication among multiple distributed nodes across network region. However, dynamic network conditions such as changing topology, congestion, packet drop, intrusion possibilities etc often make MANET’s routing a tedious task. On the other hand, mobile network feature broadens the horizon for intruders to penetrate the network and causes performance degradation. Unlike classical MANET protocols where major efforts have been made on single network parameter based routing decision, this research paper proposes a novel Elitist Genetic Algorithm (EGA) Multi-Objective Optimization assisted Network Condition Aware QoS-Routing Protocol for Mobile Ad-hoc Networks (MNCQM). Our proposed MNCQM protocol exhibits two phase implementation where at first it performs node-profiling under dynamic network topology for which three factors; irregular MAC information exchange, queuing overflow and topological variations have been considered. Towards this objective node features like Packet Forwarding Probability (PFP) at the MAC layer, Success Probability of Data Transmission (SPDT) of a neighboring node, and Probability of Successful Data Delivery (PSDD) have been obtained to estimate Node-Trustworthiness Index (NTI), which is further used to eliminate untrustworthy nodes. In the second phase of implementation, a novel Evolutionary Computing assisted non-disjoint best forwarding path selection model is developed that exploits node’s and allied link’s connectivity and availability features to identify the quasi-sub-optimal forwarding paths. EGA algorithm intends to reduce hop-counts, connectivity-loss and node or link unavailability to estimate best forwarding node. One key feature of the proposed model is dual-supplementary forwarding path selection that enables alternate path formation in case of link outage and thus avoids any iterative network discovery phase. 

Keywords 

MANET, QoS communication, Node-trustworthiness, Network awareness, Evolutionary computing based routing decision.

                                                                            Full Text

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: