Ensemble of Probabilistic Learning Networks for IoT Edge Intrusion Detection

Tony Jan  and A.S.M Sajeev 

Melbourne Institute of Technology, Australia 

ABSTRACT

 This paper proposes an intelligent and compact machine learning model for IoT intrusion detection using an ensemble of semi-parametric models with Ada boost. The proposed model provides an adequate realtime intrusion detection at an affordable computational complexity suitable for the IoT edge networks. The proposed model is evaluated against other comparable models using the benchmark data on IoT-IDS and shows comparable performance with reduced computations as required. 

KEYWORDS

adaboosted ensemble learning, IoT edge security, machine learning for IoT.

Full Text: 

A Proactive Flow Admission and Re-Routing Scheme for Load Balancing and Mitigation of Congestion Propagation in SDN Data Plane

SmineshC. N.1 , Grace Mary Kanaga E.2 , and Ranjitha K.3 

 1&3 Dept. of Computer Science and Engineering, Govt. Engineering College, Thrissur, India 2 Dept. of Computer Science and Engineering, Karunya Institute of Technology and Sciences, Coimbatore, India 

ABSTRACT

 The centralized architecture in software-defined network (SDN) provides a global view of the underlying network, paving the way for enormous research in the area of SDN traffic engineering (SDN TE). This research focuses on the load balancing aspects of SDN TE, given that the existing reactive methods for data-plane load balancing eventually result in packet loss and proactive schemes for data plane load balancing do not address congestion propagation. In the proposed work, the SDN controller periodically monitors flow level statistics and utilization on each link in the network and over-utilized links that cause network congestion and packet loss are identified as bottleneck links. For load balancing the identified largest flow and further traffic through these bottleneck links are rerouted through the lightly-loaded alternate path. The proposed scheme models a Bayesian Network using the observed port utilization and residual bandwidth to decide whether the newly computed alternate path can handle the new flow load before flow admission which in turn reduces congestion propagation. The simulation results show that when the network traffic increases the proposed method efficiently re-routes the flows and balance the network load which substantially improves the network efficiency and the quality of service (QoS) parameters. 

KEYWORDS

Bayesian Network, QoS, SDN, Traffic Engineering, Congestion Propagation.

Full Text: 

Improvement of Multiple Routing Based on Fuzzy Clustering and PSO Algorithm In WSNs to Reduce Energy Consumption

Gholamreza Farahani 

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

ABSTRACT

One of the most important issues discussed in Wireless Sensor Networks (WSNs) is how to transfer information from nodes within the network to the base station and select the best possible route for transmission of this information, taking into account energy consumption for the network lifetime with maximum reliability and security. Hence, it would be useful to provide a suitable method that would have the features mentioned. This paper uses an Ad-hoc On-demand Multipath Distance Vector (AOMDV) as a routing protocol. This protocol has high energy consumption due to its multipath. However, it is a big challenge if it can reduce AOMDV energy consumption. Therefore, clustering operations for nodes are of high priority to determine the head of clusters which LEACH protocol and fuzzy logic and Particle Swarm Optimization (PSO) algorithm are used for this purpose. Simulation results represent 5% improvement in energy consumption in a WSN compared to AOMDV method. 

KEYWORDS

Energy Aware Routing Protocol, Fuzzy Logic, Ad-hoc Multipath, LEACH, Particle Swarm Optimization Algorithm.

Full Text:

Availability Aspects Through Optimization Techniques Based Outlier Detection Mechanism in Wireless and Mobile Networks

Neeraj Chugh, Adarsh Kumar and Alok Aggarwal 

School of Computer Science, University of Petroleum & Energy Studies, Dehradun, India 

ABSTRACT

Radio Frequency IDentification (RFID) and Wireless Sensor Networks (WSN) are the two most prominent wireless technologies for implementing a complete smart environment for the Internet of Things (IoT). Both RFID and WSN are resource constraint devices, which forces us to go for lightweight cryptography for security purposes. Security in terms of confidentiality, integrity, authentication, authorization, and availability. Key management is one of the major constraints for resource constraint mobile sensor devices. This work is an extension of the work done by Kumar et al. using efficient error prediction and limit of agreement for anomaly score. This work ensures cryptographic property, availability, in RFID-WSN integrated network through outlier detection mechanism for 50 to 5000 nodes network. Through detection ratios and anomaly scores system is tested against outliers. The proposed outlier detection mechanism identifies the inliers and outliers through anomaly score for protection against Denial-of-Service (DoS) attack. Intruders can be detected in few milliseconds without giving any conflict to the access rights. In terms of throughput, a minimum improvement of 6.2% and a maximum of 219.9% is observed for the proposed protocol as compared to Kumar et al. Protocol and in terms of percentage of Packet Delivery Ratio (PDR), a minimum improvement of 8.9% and a maximum of 19.5% is observed for the proposed protocol as compared to Kumar et al. protocol.

 KEYWORDS

 WSN, MANET, RFID, ANOMALY, SECURITY

Full Text: 

A Novel Adaptive Caching Mechanism for Video on Demand System Over Wireless Mobile Network

Saleh Ali Alomari 

Faculty of Sciences and Information Technology, Jadara University, Irbid, Jordan 

ABSTRACT

 Video on Demand (VOD) system over the wireless mobile network is a system that provides video services to mobile clients. The main problem with these systems is the high service delay where the mobile clients have to wait to view their favorite movie. The importance of this paper is based on finding a solution on how to reduce the delay time in the VOD system. This paper introduces a novel caching mechanism named Proxy Server Cache mechanism to tackle the issue of service delay. This delay happens when the broadcasting phase that is related to the first segment is missed by a client from the current broadcasting channels. In this mechanism, the video’s first segment is stored on a server of a stationary proxy type. The delayed clients will directly acquire the first segment from the proxy server instead of waiting for the following broadcasting channel pertaining to the first segment. The proposed scheme ensuresobtaining the first segment from mobile clients when they arrive. Additionally, the performance of the proposed scheme is validated by applying the VOD system, which can involve the balancing mechanism to retain particular requests through to the local proxy server to provide a fair dissemination for these requests. The obtained result confirms that the proposed scheme reduces the time delay of the system in comparison with the best existing schemes. The results of the average time delay in the Proxy-Cache scheme is 179.2505 milliseconds when 10 clients arrive each minute (Client/minute), the average time delay is 140 milliseconds when the video lengths are 30, 60 and 90. Meanwhile, the failure probability for obtaining the first segment of the video remains zero when the number of arrived requests is set to2, 4, 6, 8 and 10. 

KEYWORDS

 VOD, Proxy-Cache, All-Cache, PoR-Cache, Random-Cache, DSC-Cache, SB, LF’s, LPS.

Full Text: 

Scalable and Energy Efficient Task Offloading Schemes for Vehicular Cloud Computing

Mohammad Pasha1 and Khaleel Ur Rahman Khan2

 1Department of Information Technology, MJCET, Hyderabad, India 2Department of Computer Science Engineering, ACE, Hyderabad, India 

ABSTRACT

 Smart vehicles of today on road are equipped with advanced computational units, multiple communication technologies, intelligent sensing platforms, and human-computer interaction devices which utilize Vehicular Edge Networks to support services offered by the remote cloud. This being named as Opportunistic Vehicular Edge Computing recently, has the possibility to supplement the services provided by the Edge gadgets. Many Vehicular Edge Computing architectures have been proposed as of late which support task offloading. One among the premier difficulties in these networks is efficiently utilizing the resources available at the vehicular nodes. The present work uses APEATOVC, a conveyed and versatile protocol for economical, efficient and effective task offloading in these networks which address the adaptability of vehicular clouds. The results obtained by extensive simulations are presented to assess and contrast its performance with existing protocols. 

KEYWORDS

Vehicular Cloud Computing, Mobile Edge Computing, Vehicular Ad-Hoc Networks, Computation Offloading.

Full Text: 

  

Improvement of False Report Detection Performance Based on Invalid Data Detection Using Neural Network in WSN

Sanghyeok Lim and Taeho Cho 

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

ABSTRACT

WSN consists of a number of nodes and base stations and is used for event monitoring in various fields such as war situations, forest fires, and home networks. WSN sensor nodes are placed in fields that are difficult for users to manage. It is therefore vulnerable to attackers, and attackers can use false nodes or MAC injection attacks through the hijacked nodes to reduce the lifetime of the network or trigger false alarms. In order to prevent such attacks, several security protocols have been proposed, and all of them have been subjected to MAC-dependent validation, making it impossible to defend against false report attacks in extreme attack circumstances. As attacks have recently become more diverse and more intelligent, WSNs require intelligent methods of security. Based on the report information gathered from the base station, the proposed method provides a technique to prevent attacks that may occur where all MAC information is damaged by carrying out verification of a false report attack through the machine learning based prediction model and the evaluation function. 

KEYWORDS

Network Protocols, Wireless Sensor Network, simulation, machine learning, neural network

Full Text: 

Performance of OLSR MANET Adopting Cross-Layer Approach Under CBR and VBR Traffics Environment

Teerapat Sanguankotchakorn1 , Sanika K.Wijayasekara2 and Sugino Nobuhiko3 

1Telecommunications Field of Study, School of Engineering and Technology, Asian Institute of technology, Pathumthani, Thailand 2 Faculty of Engineering, Chulalongkorn University, Bangkok, Thailand 3 Interdisciplinary Graduate School of Science and Engineering, Tokyo Institute of Technology, Japan 

ABSTRACT

 The routing protocols play an important role in Mobile Ad-Hoc Network (MANET) because of the dynamically change of its topology. Optimized Link State Routing (OLSR), unawareness of Quality of Service (QoS) and power-consumed protocol, is an example of a widely-used routing protocol in MANET. The Multi-Point Relays (MPR) selection algorithm is very crucial in OLSR. Therefore, firstly, we propose a heuristic method to select the best path based on two parameters; Bit Error Rate (BER) derived from the physical layer and Weighted Connectivity Index (CI) adopted from the network layer. This can be done via the cross-layer design scheme. This is anticipated to enhance the performance of OLSR, provide QoS guarantee and improve the power consumption. The performances of the proposed scheme are investigated by simulation of two types of traffics: CBR and VBR (MPEG-4), evaluated by metrics namely Throughput, Packet Delivery Ratio (PDR), Average End-to-End Delay, Control Overhead and Average Total Power Consumption.We compare our results with the typical OLSR and OLSR using only Weighted CI. It is obvious that our proposed scheme provides superior performances to the typical OLSR and OLSR using only Weighted CI, especially, at high traffic load. 

KEYWORDS

Mobile Ad-hoc Network (MANET), OLSR, Bit Error Rate (BER), Weighted Connectivity Index, Quality of Service (QoS)

For More Details : 

Modelling and Qos-Achieving Solution in Full-Duplex Cellular Systems

Ali Y. Al-Zahrani 

Department of Electrical and Computer Engineering University of Jeddah Jeddah 21589, Saudi Arabia 

ABSTRACT 

The global bandwidth scarcity and the ever-growing demand for fast wireless services have motivated the quest for new techniques that enhance the spectral efficiency (SE) of wireless systems. Most conventional SE increasing methods (e.g., adaptive modulation and coding) have already been exhausted. Single-channel full-duplex (SCFD) communication is a new attractive approach in which each node may simultaneously receive and transmit over the same frequency channel, and thus, it has the potential to double the current SE figures. In this paper, we derive a model for the signal-to-interference-plus-noise ratio (SINR) in a SCFD-based cellular system with imperfect self-interference cancellation. Furthermore, given a set of uplink and downlink quality of service requirements, we answer the following two fundamental questions. First, is this set achievable in the SCFD-based cellular system? Second, if the given set is achievable, what is the optimal achieving policy? To that end, we provide a unified model for the SCFD-based cellular system, and give insights in the matrix of interference channel gains. Simulation results suggest that depending on the locations of the users, a combination of full-duplex and half-duplex modes over the whole network is more favourable policy. 

KEYWORDS

Full-duplex, cellular network, self-interference, inter-cell interference, resource allocations and interference cancellation

For More Details: 

Energy Splitting for SWIPT in QoS-Constraint MTC Network: A Non-Cooperative Game Theoretic Approach

Kang Kang, Zhenni Pan, Jiang Liu, Shigeru Shimamoto

Graduate School of Fundamental Science and Engineering, Waseda University, Japan

ABSTRACT

This paper studies the emerging wireless energy harvesting algorithm dedicated for machine type communication (MTC) in a typical cellular network where one transmitter (e.g. the base station, a hybrid access point) with constant power supply communicates with a set of users (e.g. wearable devices, sensors). In the downlink direction, the information transmission and power transfer are conducted simultaneously by the base station. Since MTC only transmits several bits control signal in the downlink direction, the received signal power can be split into two parts at the receiver side. One is used for information decoding and the other part is used for energy harvesting. Since we assume that the users are without power supply or battery, the uplink transmission power is totally from the energy harvesting. Then, the users are able to transmit their measured or collected data to the base station in the uplink direction. Game theory is used in this paper to exploit the optimal ratio for energy harvesting of each user since power splitting scheme is adopted. The results show that this proposed algorithm is capable of modifying dynamically to achieve the prescribed target downlink decoding signal-to-noise plus interference ratio (SINR) which ensures the high reliability of MTC while maximizing the uplink throughput. 

KEYWORDS

 Energy harvesting, decoding SINR, uplink throughput maximization

For More Details:

A Future Mobile Packet Core Network Based on Ip-In-Ip Protocol

Mohammad Al Shinwan1 and Kim Chul-Soo2

1 Faculty of Computer Science and Informatics, department of Mobile Computing, Amman Arab University, Amman, Jordan. 2Department of Computer Engineering, Inje University, Gimhae, Republic of Korea. 

ABSTRACT 

The current Evolved Packet Core (EPC) 4th generation (4G) mobile network architecture features complicated control plane protocols and requires expensive equipment. Data delivery in the mobile packet core is performed based on a centralized mobility anchor between eNode B (eNB) elements and the network gateways. The mobility anchor is performed based on General Packet Radio Service tunnelling protocol (GTP), which has numerous drawbacks, including high tunnelling overhead and suboptimal routing between mobile devices on the same network. To address these challenges, here we describe new mobile core architecture for future mobile networks. The proposed scheme is based on IP encapsulated within IP (IP-in-IP) for mobility management and data delivery. In this scheme, the core network functions via layer 3 switching (L3S), and data delivery is implemented based on IP-in-IP routing, thus eliminating the GTP tunnelling protocol. For handover between eNB elements located near to one another, we propose the creation of a tunnel that maintains data delivery to mobile devices until the new eNB element updates the route with the gateway, which prevents data packet loss during handover. For this, we propose Generic Routing Encapsulation (GRE) tunnelling protocol. We describe the results of numerical analyses and simulation results showing that the proposed network core architecture provides superior performance compared with the current 4G architecture in terms of handover delay, tunnelling overhead and total transmission delay. 

KEYWORDS 

5G network, mobile core network, IP-in-IP, GRE 

For More Details:

Packet Size Optimization for Energy Efficiency in Multipath Fading for Wireless Body Area Network

Nattkorn Promwongsa and Teerapat Sanguakotchakorn

Asian Institut of Technology, Thailand

ABSTRACT

 Recently, Wireless Body Area Network (WBAN) has drawn vast interest to many researchers due to its potential in healthcare and medical fields. In this paper, we propose the energy efficiency model of Time Diversity communication in Rician and Rayleigh fading channels emphasizing the optimal packet size. The optimal packet size to maximize energy efficiency is investigated for on-body and in-body channels. Four modulation techniques are considered including the recently proposed 16-ary Quadrature Amplitude Position Modulation (QAPM). In addition, the closed-form expression of the energy efficiency model in multipath fading is derived. Here, three evaluation metrics including the energy efficiency, the normalized throughput and the average end-to-end delay are adopted and compared to the existing 1-hop and Cooperative communications as well as our previously proposed 2-hop communication. The results show that our proposed Time Diversity communication scheme outperforms the existing ones in deep fading channel except for the average end-to-end delay. 

KEYWORDS

Packet Size Optimization, Energy Efficiency, 2-hop, Time Diversity, Multipath Fading, Wireless Body Area Network

For More Details:

Multi-Constraints Adaptive Link Quality Index Based Mobile-RPL Routing Protocol for Low Power Lossy Networks

Sneha K1 . and B G Prasad2

1Department of Computer Science & Engineering, BNM Institute of Technology, Bengaluru, Karnataka, India 2Department of Computer Science & Engineering, BMS College of Engineering, Bengaluru, Karnataka, India

ABSTRACT

The importance of IPv6 Routing Protocol for Low power and Lossy Networks (LLNs), also called RPL, has motivated in the development of a robust and quality of service (QoS) oriented Multi-Constraints Adaptive Link Quality Index (MALQI) based routing protocol. Unlike classical RPL protocols, MALQI enables mobile-RPL while ensuring fault-resilient, reliable and QoS communication over LLNs. MALQI protocol exploits key novelties such as signal strength based mobile node positioning, average received signal strength indicator (ARSSI) and ETX based objective function for fault tolerant best forwarding path selection. The functional architecture of MALQI enables it to be used as the parallel to the link layer RPL that even in the case of link failure can assist efficient data delivery over LLNs. Once detecting link outage, MALQI can execute node discover and best forwarding path selection to assist QoS delivery. Contiki-Cooja based simulation reveals that MALQI based mobile-RPL outperforms other state-of-art routing protocols. 

KEYWORDS

 Mobile-RPL; Adaptive Link Quality; Low Power Lossy Network; Routing Protocol; MALQI.

For More Details:

Enhancing and Measuring the Performance in Software Defined Networking

1Md. Alam Hossain, 1Mohammad Nowsin Amin Sheikh,2,*Shawon S. M. Rahman, 1 Sujan Biswas, and 1Md. Ariful Islam Arman 

1Dept. of Computer Science & Engineering, Jessore University of Science and Technology, Jessore, Bangladesh 2Associate Professor, Dept. of Computer Science & Engineering, University of HawaiiHilo, 200 W. Kawili Street, Hilo, HI 96720, USA 

ABSTRACT 

Software Defined Networking (SDN) is a challenging chapter in today’s networking era. It is a network design approach that engages the framework to be controlled or 'altered' adroitly and halfway using programming applications. SDN is a serious advancement that assures to provide a better strategy than displaying the Quality of Service (QoS) approach in the present correspondence frameworks. SDN etymologically changes the lead and convenience of system instruments using the single high state program. It separates the system control and sending functions, empowering the network control to end up specifically. It provides more functionality and more flexibility than the traditional networks. A network administrator can easily shape the traffic without touching any individual switches and services which are needed in a network. The main technology for implementing SDN is a separation of data plane and control plane, network virtualization through programmability. The total amount of time in which user can respond is called response time. Throughput is known as how fast a network can send data. In this paper, we have design a network through which we have measured the Response Time and Throughput comparing with the Real-time Online Interactive Applications (ROIA), Multiple Packet Scheduler, and NOX. 

KEYWORDS

Software Defined Networking, SDN, Quality of Service, QoS, Real-time Online Interactive Application, ROIA, Network Operating System, NOX, CES, MPLSTE, Switch Capacity, Number of Queues Impact, QoE Evaluation, Bandwidth Isolation.

For More Details:

A New Approach to Stochastic Scheduling in Data Center Networks

Tingqiu Tim Yuan, Tao Huang, Cong Xu and Jian Li 

Huawei Technologies, China 

ABSTRACT 

The Quality of Service (QoS) of scheduling between latency-sensitive small data flows (a.k.a. mice) and throughput-oriented large ones (a.k.a. elephants) has become ever challenging with the proliferation of cloud-based applications. In light of this mounting problem, this work proposes a novel flow control scheme, HOLMES (HOListic Mice-Elephants Stochastic), which offers a holistic view of global congestion awareness as well as a stochastic scheduler of mixed mice-elephants data flows in Data Center Networks (DCNs). Firstly, we theoretically prove the necessity for partitioning DCN paths into sub-networks using a stochastic model. Secondly, the HOLMES architecture is proposed, which adaptively partitions the available DCN paths into low-latency and high-throughput sub-networks via a global congestion-aware scheduling mechanism. Based on the stochastic power-of-two-choices policy, the HOLMES scheduling mechanism acquires only a subset of the global congestion information, while achieves close to optimal load balance on each end-to-end DCN path. We also formally prove the stability of HOLMES flow scheduling algorithm. Thirdly, extensive simulation validates the effectiveness and dependability of HOLMES with select DCN topologies. The proposal has been in test in an industrial production environment. An extensive survey of related work is also presented.

KEYWORDS

 Data center network, flow scheduling, network partition, stochastic scheduling model

For More Details: 

An Efficient Bandwidth Optimization and Minimizing Energy Consumption Utilizing Efficient Reliability and Interval Discrepant Routing (ERIDR) Algorithm

Sivashanmugam.N1 and Jothi Venkateshwaran.C2 

1Research Scholar, PG & Research Department of Computer Science, Presidency College, Madras University, Chennai-60005, Tamilnadu, India 

2 Professor & Head, Dept. of Computer Science and Engineering, St. Peter's Institute of Higher Education and Research, Chennai, Tamilnadu, India 

ABSTRACT

The bandwidth utilization plays a vital role in a Wireless Sensor Network (WSN) that transmits data packets from source peer to perspective destination peer without any packet loss and time delay. In a conventional system, two main features cannot be satisfied concurrently such as low delay and high data reliability and then the peer was transferred fewer data packets and it optimized with regular bandwidth rate. Moreover, the convention of bandwidth in network routers influences the quality of service (QoS). To overcome the above issues, an Efficient Reliability and Interval Discrepant Routing (ERIDR) algorithm is proposed to optimize bandwidth utilization on the router network with the help of bandwidth optimizer. The bandwidth optimizer allocates required bandwidth for data transmission to each peer simultaneously to ensure the bandwidth efficiency. The proposed design is to optimize bandwidth utilization of every peer and increase data processing via higher bandwidth rate that reduces time delay and minimizes energy consumption. The proposed method establishes a high bandwidth rate router to transmit data concurrently from source peer to destination peer (peer-to-peer) without any packet loss by initializing host IP address for every peer. Based on Experimental evaluations, proposed methodology reduces 3.32 AD (Average Delay), 0.05 ET (Execution Time), 5.44 EC (Energy Consumption) and 0.28 BU (Bandwidth Utilization) compared than existing methodologies. 

KEYWORDS

 Bandwidth Optimization, Energy Consumption (EC), Efficient Reliability and Interval Discrepant Routing (ERIDR) Algorithm, quality of service (QoS), Average Delay (AD), Execution Time (ET), and Bandwidth Utilization (BU).

For More Details:

A Security Analysis of IoT Encryption : Side Channel Cube Attack on SIMECK32/64

Alya Geogiana Buja1,2, Shekh Faisal Abdul-Latip1 and Rabiah Ahmad1 1 

 INSFORNET, Center for Advanced Computing Technology, Universiti Teknikal Malaysia Melaka, Hang Tuah Jaya, Durian Tunggal, 76100 Melaka, Malaysia 

2 Universiti Teknologi MARA, Shah Alam, 40450 Selangor, Malaysia 

ABSTRACT

 Simeck, a lightweight block cipher has been proposed to be one of the encryption that can be employed in the Internet of Things (IoT) applications. Therefore, this paper presents the security of the Simeck32/64 block cipher against side-channel cube attack. We exhibit our attack against Simeck32/64 using the Hamming weight leakage assumption to extract linearly independent equations in key bits. We have been able to find 32 linearly independent equations in 32 key variables by only considering the second bit from the LSB of the Hamming weight leakage of the internal state on the fourth round of the cipher. This enables our attack to improve previous attacks on Simeck32/64 within side-channel attack model with better time and data complexity of 235 and 211.29 respectively. 

KEYWORDS

 Block Cipher, IoT, Lightweight Encryption, Security Analysis, Simeck 

For More Details:

Energy Efficient Routing Algorithm for Void Avoidance in UWSN Using Residual Energy and Depth Variance

Gulista Khan and R.K. Dwivedi 

Department of Computer Engineering, Teerthanker Mahaveer University, Moradabad, UP, India 

ABSTRACT

Underwater Wireless Sensor Networks (UWSN) is attracting the interest of most of the researcher because of the good opportunity to discover and catch the oceanic activities. As we know radio waves could not work efficiently in Underwater so Underwater Acoustic Sensor Networks (UASN) emerged as a most prevalent network to an outstanding range. UASN have some constraints in its deployment as well as acoustic wave communication. This limitation involves large propagation delay, transmission cost, very less bandwidth, high signal attenuation, and restricted accessibility of the nodes and non-availability of the recharging of nodes leads to the development of some energy saving algorithms to prolong the lifetime of the nodes. Routing technique must be rich enough to overcome all these constraints and give an energyefficient path by avoiding void regions and increase the network lifetime. Depth based algorithms proposed in the last decades use depth factor to estimate the path from sender to the sink. By having the holding time calculation they minimize the replication of information. Here, this per have proposed Energy Efficient Void Avoidance Routing Scheme for UWSN (E2RV) using Residual Energy and Depth Variance it used two hop node information to escape the void shacks in the network area along with this it is using regularized remaining energy and normalized depth of the nodes to estimate the path from data generating node to sink node. In this way E2RV not only removing the void holes but also maintains the energy depletion of the network nodes and upsurge the network lifetime. Simulation results show the improvement of E2RV over previously defined algorithms in terms of packet delivery ratio, duplications, less energy depletion and increased lifetime. 

KEYWORDS

 Acoustic, underwater wireless device networks, void region, residual energy, and normalized depth. 

For More Details:

A Hybrid Modulation Method for Dimming in Visible Light Communication

Wataru Uemura and Takahiro Kitazawa 

Department of Electronics and Informatics, Ryukoku University, Shiga, Japan

ABSTRACT

 In visible light communication in which information is superimposed on light, its communication range is visible. On the other hand, when the modulation that brightness is changed according to information is used, it is not good for the human eye because human feels flicker for the changed brightness. Therefore, the pulse width modulation which is used in the infrared remote controller, is not suitable for the visible light communication. And the pulse position modulation that sends information at the position of a pulse is often used. In pulse position modulation, for example, when one symbol uses four slots, quad information can be sent by turning on only one slot among the four slots and turning off the other three slots. In this method, the brightness becomes ¼ and feels not flicker but darker than when it is always on. On the other hand, when inverted pulse position modulation in which these slots of ON and OFF are reversed is used, since one slot is OFF, and three slots are ON, the brightness becomes 3/4, which does not become too dark. In this paper, we propose a hybrid modulation that can vary the brightness other than 1/4(25%) or 3/4(75%) by combining these pulse position modulation and inverted pulse position modulation. We have two experiments; one is measuring its communication performance and the other is the evaluation for visual flicker by the human eye and. From the view of the communication performance, each brightness is the same performance. So, the changing brightness does not affect to the performance. For the dimming, we interviewed 10 people how to feel the flicker in visible light communication. As the result, they do not feel the flickers. So, our proposed hybrid modulation method can be adapted for the dimming lighting equipment. 

KEYWORDS

 Visible Light Communication, lighting control, dimming, wireless communication 

For More Details:

New Interconnection Topology for Network on Chip

Laxminath Tripathy and Chitta Ranjan Tripathy 

Veer Surendra Sai University of Technology, Burla, India 

 ABSTRACT 

The architecture of networks on chip (NOC) highly affects the overall performance of the system on chip (SOC). A new topology for chip interconnection called Torus connected Rings is proposed. Due to the presence of multiple disjoint paths between any source and destination pair, this topology exhibits high fault tolerance capability. The proposed routing method can tolerate faults adaptively. TCR is simple in design and highly scalable. The detailed design and topological parameters are compared with alternate topologies. 

KEYWORDS

 Torus, Ring, MCR, Static routing algorithm, Dynamic fault-tolerant routing.

For More Details:

Routing Protocols Performance in Mobile Ad-Hoc Networks Using Millimeter Wave

Mustafa S. Aljumaily 

Department of Electrical Engineering and Computer Science The University of Tennessee, Knoxville, TN, USA 

ABSTRACT

 Self-Organized networks (SONs) have been studied for many years, and have attracted many researchers due to their substantial applications. Although the performance of such networks in the lower band networks (sub-6 GHz band frequencies) has been well studied, there are only sparse studies on SON in higher frequency bands, such as the millimeter wave (mmWave) band ranges between 28GHz and 300GHz. mmWave frequencies have attracted many researchers in the past few years because of its unique features and are now considered as an important part of the next generation of wireless communications namely (5G).In this paper, we study the performance of some well-known routing protocols in the case of mmWave Mobile Ad hoc Networks (MANET) using the ns-3 mmwave module that was developed recently. SONs are within the goals for the next release of the 3GPP New Radio (NR) standardization process (Release-16) for the 5G, which makes the study of the behavior of such frequency bands for these networks an important activity towards achieving such goal. Mathematical and simulation results show a great improvement in the routing protocols delivery rates and power consumption when using mmWave compared to the sub6GHz band frequencies. 

KEYWORDS 

Millimeter wave, Routing, mobile ad-hoc networks (MANET), Self-Organized Networks (SON), 5G, performance evaluation.

For More Details:

Performances of Ad Hoc Networks Under Deterministic and Probabilistic Channel Conditions : Cases for Single Path and Multipath Routing Protocols

Mohammed Tarique and Rumana Islam 

Department of Electrical Engineering, Ajman University-Fujairah Campus P.O. Box 2202, Fujairah, United Arab Emirates 

ABSTRACT

 Deterministic channel models have been widely used in simulation and modeling of ad hoc network for a long time. But, deterministic channel models are too simple to represent a real-world ad hoc network scenario. Recently, random channel models have drawn considerable attention of the researchers in this field. The results presented in the literature show that random channel models have a grave impact on the performance of an ad hoc network. A comprehensive investigation on this issue is yet to be available in the literature. In this investigation, we consider both deterministic and random channel models to investigate their effects on ad hoc networks. We consider two different types of routing protocols namely single path and multipath routing protocols. We choose Destination Sequence Distance Vector (DSDV), Dynamic Source Routing Protocol (DSR), and Ad-hoc On-Demand Distance Vector (AODV) as the single path routing protocols. On the other hand, we choose Ad-hoc On-Demand Multiple Path Distance Vector (AOMDV) as the multipath routing protocol. The results show that some single path routing protocol can outperform multipath routing protocol under both deterministic and random channel conditions. These results surprisingly contradict the popular claim that multipath routing protocol always outperforms single path routing protocol. A guideline for choosing an appropriate routing protocol for adhoc network has also been provided in this work. 

KEYWORDS

 Network Protocols, Single Path, Multipath, DSR, AODV, DSDV, AOMDV, Random Channel, Deterministic Channels, Network Performances

For More Details: 

Robot Human Interface for Housekeeper Robot with Wireless Capabilities

Suhad Faisal Behadili 

Computer Science Department, Science Collage, University Of Baghdad, Iraq

 ABSTRACT 

This paper presents the design and implementation of a Human Interface for a housekeeper robot. It bases on the idea of making the robot understand the human needs without making the human go through the details of robots work, for example, the way that the robot implements the work or the method that the robot uses to plan the path in order to reach the work area. The interface commands based on idioms of the natural human language and designed in a manner that the user gives the robot several commands with their execution date/time. As a result, the robot has a list of tasks to be doneon certain dates/times. However, the robot performs the tasks assigned to it without any human intervention and then gives feedback to the human about each task progress in a dedicated list. As well as, the user decides to get the feedback either through the interface, through the wireless communication, or both of them. Hence, the user’s presence not necessary during the robot tasks execution.

 KEYWORDS

 Housekeeper, robot, wireless, human, mobile, tasks. 

More Details: 

Proposed Load Balancing Algorithm to Reduce Response Time and Processing Time on Cloud Computing

Nguyen Xuan Phi1 , Cao Trung Tin2 , Luu Nguyen Ky Thu3 and Tran Cong Hung4 

1,2,3,4 Posts and Telecommunications Institute of Technology, Ho Chi Minh, Vietnam.

 ABSTRACT

Cloud computing is a new technology that brings new challenges to all organizations around the world. Improving response time for user requests on cloud computing is a critical issue to combat bottlenecks. As for cloud computing, bandwidth to from cloud service providers is a bottleneck. With the rapid development of the scale and number of applications, this access is often threatened by overload. Therefore, this paper our proposed Throttled Modified Algorithm(TMA) for improving the response time of VMs on cloud computing to improve performance for end-user. We have simulated the proposed algorithm with the CloudAnalyts simulation tool and this algorithm has improved response times and processing time of the cloud data center.

 KEYWORDS

Load balancing; response time; cloud computing; processing time. 

More Details:

Improved Handover Algorithm to Avoid Duplication AAA Authentication in Proxy MIPV6

Hewei Yu1 and Meiling Zhou2 

1 School of Computer Science & Engineering, South China University of Technology, Guang Zhou, P.R.China

 2GF Fund Management Co., Ltd., Guang Zhou, P.R.China 

ABSTRACT

 This paper proposes an improved handover algorithm which does not need authenticating again if Mobile Node moves within the same Proxy MIPv6 domain. When MN enters PMIPv6 domain at the first time, it needs to make an AAA authentication. But when MN moves between MAGs in the same domain, it can perform handover procedure without the second times of AAA authentication, and speed the handover process. We built a structure of PMIPv6 including AAA server on NS-2 and set up a real test-bed, and proposed an improved handover algorithm for PMIPv6 based on AAA authentication. The simulation and testing results show that the new scheme can effectively reduce the handover latency and ratio of packet loss, and improve network performance. 

KEYWORDS

 PMIPv6; AAA; handover; fast handover 

More Details:

An Effective Privacy-Preserving Data Coding in Peer-To-Peer Network

Ngoc Hong Tran1 , Cao Vien Phung 2 , Binh Quoc Nguyen 1 , and Leila Bahri 3 

Vietnamese-German University 1 , Vietnam, Technische Universität Carolo-Wilhelmina zu Braunschweig2 , Germany, and KTH 1 , Sweden 

Abstract 

Coding Opportunistically (COPE) is a simple but very effective data coding mechanism in the wireless network. However, COPE leaves risks for attackers easily getting the private information saved in the packets, when they move through the network to their destination nodes. Hence, a lightweight cryptographic approach, namely SCOPE, was proposed to consolidate COPE against the honest-but-curious and malicious attacks. Honest-but-curious attack serves adversaries who accurately obey the protocol but try to learn as much private information as possible for their curiosity. Additionally, this kind of attack is not destructive consequently. However, it may leave the backdoor for the more dangerous attacks carrying catastrophes to the system. Malicious attack tries to learn not only the private information but also modifies the packet on harmful purposes. To cope with this issue, in this work, a lightweight cryptographic approach improves COPE, namely SCOPE, that is defensive to the both attacks. The private information in the COPE packet are encrypted by Elliptic Curve Cryptography (ECC), and an additional information is inserted into SCOPE packets served for the authentication process using the lightweight hash Elliptic Curve Digital Signature Algorithm (ECDSA). We then prove our new protocol is still guaranteed to be a secure method of data coding, and to be light to effectively operate in the peer-to-peer wireless network. 

Keywords

 Network Coding, Peer-to-Peer, Homomorphic Encryption, Elliptic Curve Cryptography (ECC), Elliptic Curve Digital Signature Algorithm (ECDSA), Honest-But-Curious Attack, Malicious Attac

More Details:

Efficient PAPR Reduction Approach for Selective Mapping in a STBC MIMO-OFDM System

VijayaLakshmi M1 and K Rama Linga Reddy2 

1ETM Dept, GNITS, Hyderabad, India 

2 HOD, ETM Dept, GNITS, Hyderabad, India

  ABSTRACT 

The demand for wireless communication increases every day. MIMO system increases the channel capacity without increasing the bandwidth. OFDM eliminates inter-symbol interference very effectively. By combining both these technologies ,the resultant data rates are increased and also robustness to multi path fading effects. But the main drawback of MIMO-OFDM system is its high PAPR. Selective mapping(SLM) is one of the popular distortion less technique for reducing high PAPR but the computational complexity for searching optimum phase factors is high. Many evolutionary algorithms like particle swarm optimisation, artificial bee colony optimization algorithm, cuckoo search algorithm are proposed for searching optimum phase factors. In this paper two new optimization algorithms social spider optimization(SSO), adaptive artificial bee colony algorithm are proposed for SLM and Simulation results shows that compared to adaptive artifctial bee colony algorithm, social spider optimization algorithm(SSO) gives best phase factors for lower PAPR with fewer number of iterations and also reduces the computational complexity of SLM technique very efficiently. 

KEYWORDS

 Multiple input multiple output(MIMO),orthogonal frequency division multiplexing(OFDM),peak to average power ratio(PAPR). Space time block codes(STBC).

More Details:

Chained Displays : Configuration of Multiple Co-Located Public Displays

Amir E. Sarabadani Tafreshi, Milan Bombsch and Gerhard Troster 

¨ ETH Zurich, CH-8092 Z ¨ urich, Switzerland ¨

 ABSTRACT 

Networks of pervasive display systems involving public and semi-public displays have allowed experiences to be created that span across multiple displays to achieve a stronger effect on the viewers. However, little research has been done so far on the configuration of content for multiple displays, especially when encountered in sequence in what is commonly referred to as chained displays. As a first step towards determining appropriate configuration strategies for chained displays, we have identified and investigated different approaches for configuring content. We report on a user study on the effect of the different configuration models in terms of usability and user engagement. 

KEYWORDS 

Configuration model; Multiple displays; Pervasive display; Content; usability; user engagement.

More Details: 

Deployment of Intrusion Prevention System on Multi-Core Processor Based Security Hardware

Swetha K V1 and Ravi Dara2 

1Department of Computer Science & Engineering, CMR Institute of Technology, Bangalore, India 2Nevis Networks(I) Pvt.Ltd., Pune, India 

ABSTRACT

 After tightening up network perimeter for dealing with external threats, organizations have woken up to the threats from inside Local Area Networks (LAN) over the past several years. It is thus important to design and implement LAN security strategies in order to secure assets on LAN by filtering traffic and thereby protecting them from malicious access and insider attacks. Banking Financial Services and Insurance (BFSI) industry is one such segment that faces increased risks and security challenges. The typical architecture of this segment includes several thousands of users connecting from various branches over Wide Area Network (WAN) links crossing national and international boundaries with varying network speed to access data center resources. The objective of this work is to deploy LAN security solution to protect the data center located at headquarters from the end user machines. A LAN security solution should ideally provide Network Access Control (NAC) along with cleaning (securing) the traffic going through it. Traffic cleaning itself includes various features like firewall, intrusion detection/prevention, traffic anomaly detection, validation of asset ownership etc. LANenforcer (LE) is a device deployed in front of the data center such that the traffic from end-user machines necessarily passes through it so that it can enforce security. The goal of this system is to enhance the security features of a LANenforcer security system with Intrusion Prevention System (IPS) to enable it to detect and prevent malicious network activities. IPS is plugged into the packet path based on the configuration in such a way that the entire traffic passes through the IPS on LE. 

KEYWORDS

 LAN security, LANenforcer, IPS, Security hardware, Multi-core processor 

More Details:

DPI-Based Congestion Control Method for Servers and Network Lines

Shin-ichi Kuribayashi 

Department of Computer and Information Science, Seikei University, Japan

ABSTRACT

 The use of Deep Packet Inspection (DPI) equipment in a network could simplify the conventional workload for system management and accelerate the control action. The authors proposed a congestion control method that uses DPI equipment installed in a network to estimate overload conditions of servers or network lines and, upon detecting an overload condition, resolves congestion by moving some virtual machines to other servers or rerouting some communication flows to other routes. However, since the previous paper was focused on confirming the effectiveness of using DPI technology, it assumed some restrictive control conditions. This paper proposes to enhance the existing DPI-based congestion control, in order to dynamically select an optimal solution for cases where there are multiple candidates available for: virtual machines to be moved, physical servers to which virtual machines are to be moved, communication flows to be diverted, and routes to which communication flows are to be diverted. This paper also considers server congestion for cases where computing power congestion and bandwidth congestion occur simultaneously in a server, and line congestion for cases where the maximum allowable network delay of each communication flow is taken into consideration. Finally, the feasibility of the proposed methods is demonstrated by an evaluation system with real DPI equipment. 

KEYWORDS 

Deep packet inspection, congestion control, network, server

More Details: 

Special Issue on: "Cyber Physical Systems"

http://airccse.org/journal/sicfp18.html

Guest Editors:

V.Vijayakumar,
VIT University,
India

V. Neelanarayanan,
VIT University,
India

P. Nithyanandam,
VIT University,
India

Siguang Chen,
Nanjing University of Posts and Telecommunications,
China

Theme and Scope

Cyber-Physical Systems (CPS) are integrations of computation, networking, and physical
processes. The vision of CPS faces some core challenges of multidisciplinary research, as their
relevant technologies appear in diverse areas of science and engineering.

This special issue is intended to cover contributions in both the design and analysis in the field of
Cyber Physical Systems. The special issue will additionally select high quality papers from the
International Conference on Recent Trends in Advance Computing - Cyber Physical Systems
(ICRTAC-CPS), to be held in VIT Chennai, India, September 2018.

Topics of interest

Authors are solicited to contribute to this Special Issue by submitting articles that illustrate
research results, projects, surveying works and industrial experiences that describe significant
advances in the following areas, but are not limited to:

• Design, synthesis and verification of CPS
• Sustainability and environmental issues in CPS
• Social CPS computing
• Industrial CPS and smart manufacturing
• Applications of CPS in various domains such as smart energy systems, robotics and
automation, automotive and transportation systems, smart healthcare, surveillance
systems, etc
• Adaptive attack mitigation for CPS
• Authentication and access control for CPS
• Availability, recovery and auditing for CPS
• Data security and privacy for CPS
• Embedded systems security and privacy
• EV charging system security
• Urban transportation system security
• Vulnerability analysis for CPS
• Wireless sensor network security and privacy
• Big data modeling and analytics for CPS
• Cross-layer modeling and optimization for CPS
• Design automation for CPS
• Embedded system design for CPS
• Intrusion detection for CPS
• Key management in CPS
• Legacy CPS system protection
• Lightweight crypto and security
• Security and privacy in industrial control systems
• Smart grid security
• Threat modeling for CPS
• CPS fault detection and recovery
• CPS security and privacy

Notes for Prospective Authors

Submissions must be original and should not have been published previously or be under
consideration for publication while being evaluated for this Issue. Manuscripts should be written
in English and strictly follow the guideline of the Journal IJCNC. The manuscripts should be
submitted to one of the guest editors by July 15, 2018 through email cpss@airccse.org

Important Dates

• Submission Deadline : July 15, 2018
• Notification : October 15, 2018
• Final manuscript due : October 30, 2018

For more details please visit: http://airccse.org/journal/ijcnc.html

Constructing a Fuzzy Network Intrusion Classifier Based on Differential Evolution and Harmonic Search

I. A. Hodashinsky, M. A. Mech 

Department of Complex Information Security Tomsk State University of Control Systems and Radioelectronics (TUSUR), Tomsk, Russia 

ABSTRACT

 This paper presents a method for constructing intrusion detection systems based on efficient fuzzy rulebased classifiers. The design process of a fuzzy rule-based classifier from a given input-output data set can be presented as a feature selection and parameter optimization problem. For parameter optimization of fuzzy classifiers, the differential evolution is used, while the binary harmonic search algorithm is used for selection of relevant features. The performance of the designed classifiers is evaluated using the KDD Cup 1999 intrusion detection dataset. The optimal classifier is selected based on the Akaike information criterion. The optimal intrusion detection system has a 1.21% type I error and a 0.39% type II error. A comparative study with other methods was accomplished. The results obtained showed the adequacy of the proposed method. 

KEYWORDS

 Intrusion detection; fuzzy classifier; differential evolution; feature selection; binary harmonic search; Akaike information criterion

More Details: 

Lightweight Cryptography for Distributed PKI Based MANETS

N Chaitanya Kumar, Abdul Basit, Priyadarshi Singh, and V. Ch. Venkaiah 

School of Computer and Information Sciences, University of Hyderabad, Hyderabad-500046, India 

Abstract.

Because of lack of infrastructure and Central Authority(CA), secure communication is a challenging job in MANETs. A lightweight security solution is needed in MANET to balance its nodes resource tightness and mobility feature. The role of CA should be decentralized in MANET because the network is managed by the nodes themselves without any fixed infrastructure and centralized authority. In this paper, we created a distributed PUblic Key Infrastructure (PKI) using Shamir secret sharing mechanism which allows the nodes of the MANET to have a share of its private key. The traditional PKI protocols require centralized authority and heavy computing power to manage public and private keys, thus making them not suitable for MANETs. To establish a secure communication for the MANET nodes, we proposed a lightweight crypto protocol which requires limited resources, making it suitable for MANETs. 

Keywords: 

Secret sharing, Lightweight Cryptography, Public key cryptography, MANETS

More Details:

A System for Visualization of Big Attributed Hierarchical Graphs

Victor N. Kasyanov, Timur A. Zolotuhin

 Institute of Informatics Systems, Novosibirsk State University Novosibirsk, Russia  

ABSTRACT 

Information visualization is a process of transformation of large and complex abstract forms of information into the visual forms, strengthening cognitive abilities of users and allowing them to take the most optimal decisions. A graph is an abstract structure that is widely used to model complex information for its visualization. In the paper, we consider a system aimed at supporting of visualization of big amounts of complex information on the base of attributed hierarchical graphs. 

KEYWORDS

 Attributed Hierarchical Graphs; Big Graphs; Information Visualization; Visualization Systems  

More Details:

Performance Evaluation of Blowfish Algorithm on Supercomputer IMAN1

Mahmoud Rajallah Asassfeh1 , Mohammad Qatawneh1 and Feras Mohamed ALAzzeh2

 1Department of Computer Science-King Abdullah II School for information technology, University of Jordan, Amman-Jordan, 2Department of computer information systems, Alzaytoonah University of Jordan, Amman-Jordan.

 ABSTRACT 

Cryptographic applications are becoming increasingly more important in today’s world of data exchange, big volumes of data need to be transferred safely from one location to another at high speed. In this paper, the parallel implementation of blowfish cryptography algorithm is evaluated and compared in terms of running time, speed up and parallel efficiency. The parallel implementation of blowfish is implemented using message passing interface (MPI) library, and the results have been conducted using IMAN1 Supercomputer. The experimental results show that the runtime of blowfish algorithm is decreased as the number of processors is increased. Moreover, when the number of processors is 2, 4, and 8, parallel efficiency achieves up to 99%, 98%, and 66%, respectively. 

KEYWORDS 

Blowfish; Encryption; MPI; Supercomputer

More Details : 

Task Allocation and Path Planning for Network of Autonomous Underwater Vehicles

Bychkov Igor, Kenzin Maksim and Maksimkin Nikolay 

Matrosov Institute for System Dynamics and Control Theory, Siberian Branch of the Russian Academy of Science, Irkutsk, Russia

ABSTRACT 

Cooperative multi-objective missions for connected heterogeneous groups of autonomous underwater vehicles are highly complex operations and it is an important and challenging problem to effectively route these vehicles in the dynamic environment under given communication constraints. We propose a solution for the task allocation and path planning problems based on the evolutionary algorithms that allows one to obtain feasible group routes ensuring well-timed accomplishment of all objectives.

KEYWORDS

 autonomous underwater vehicle; mission planning; heterogeneous group routing; evolutionary algorithm

More Details :  

Improvements in Routing Algorithms to Enhance Lifetime of Wireless Sensor Networks

D. Naga Ravikiran1 and C.G. Dethe2 

1Research Scholar, ECE Department, Priyadarshini Institute of Engineering and Technology (PIET), Nagpur, Maharashtra. 

2Director, UGC-Human Resource Development Centre, RTM Nagpur University, Nagpur, India.

ABSTRACT: 

Wireless sensor network (WSN) brings a new paradigm of real-time embedded systems with limited computation, communication, memory, and energy resources that are being used fora huge range of applications. Clustering in WSNs is an effective way to minimize the energy consumption of sensor nodes. In this paper improvements in various parameters are compared for three different routing algorithms. First, it is started with Low Energy Adaptive Cluster Hierarchy (LEACH)which is a famed clustering mechanism that elects a CH based on the probability model. Then, work describes a Fuzzy logic system initiated CH selection algorithm for LEACH. Then Artificial Bee Colony (ABC)which is an optimisation protocol owes its inspiration to the exploration behaviour of honey bees. In this study ABC optimization algorithm is proposed for fuzzy rule selection. Then, the results of the three routing algorithms are compared with respect to various parameters.

 KEYWORDS 

Wireless Sensor Network (WSN), LEACH, Clustering, Artificial Bee Colony (ABC), Fuzzy logic system.

More Details : 

The Development and Study of the Methods and Algorithms for the Classification of Data Flows of Cloud Applications in the Network of the Virtual Data Center

Irina Bolodurina1 and Denis Parfenov2 

1Department of Applied Mathematics Orenburg State University Orenburg, Russia 

2 Faculty of Distance Learning Technologies Orenburg State University Orenburg, Russia  

ABSTRACT 

This paper represents the results of the research, which have allowed us to develop a hybrid approach to the processing, classification, and control of traffic routes. The approach enables to identify traffic flows in the virtual data center in real-time systems. Our solution is based on the methods of data mining and machine learning, which enable to classify traffic more accurately according to more criteria and parameters. As a practical result, the paper represents the algorithmic solution of the classification of the traffic flows of cloud applications and services embodied in a module for the controller of the software-defined network. This solution enables to increase the efficiency of handling user requests to cloud applications and reduce the response time, which has a positive effect on the quality of service in the network of the virtual data center. 

KEYWORDS 

Cloud applications; software-defined network; traffic flows; virtual data center; data mining; machine learning  

More Details: 

Path Splitting for Virtual Network Embedding in Elastic Optical Networks

Path Splitting for Virtual Network Embedding in Elastic Optical Networks

Badr Oulad Nassar and Takuji Tachibana Graduate School of Engineering, University of Fukui, Fukui City, Japan 

ABSTRACT

 In elastic optical networks, a wavelength is divided into frequency slots (FS) and optical signals are switched at multiple FS intervals. On the other hand, network virtualization manages network resources by efficiently mapping virtual nodes and links to physical ones (virtual network embedding). In this paper, we propose a dynamic virtual network embedding algorithm to decrease the rejection rate of virtual optical network requests. We define four schemes for node mapping. For link mapping, the primary path, which is the shortest path between the mapped nodes, is computed. If there are no available FSs, path splitting is performed and FSs are assigned at links in primary and alternatives paths. By simulation, we evaluate the effectiveness of path splitting for NSFNET and ARPA2. Numerical results show that path splitting is effective in decreasing the rejection rate. Finally, LLNL scheme, which considers both node and link resources, has the smallest rejection rate. 

KEYWORDS

Path Splitting, Virtual Optical Network, Virtual Network Embedding, Elastic Optical Network

More Details : 

On the Transmission of Asynchronous Data Streams Over Packet Switched Networks with Random Multiple Access

Yuriy Anatolievich Kropotov and Aleksander Anatolievich Kolpakov 

Department of Electronics and Computer Science Vladimir State University named after Alexander and Nicholay Stoletovs VlGU Murom, Russia 

ABSTRACT

 The task of synchronizing discrete information on received data packets in packet-switched networks and random multiple access to the transmission medium is actual. In such channels, an asynchronous method of information transmission is provided. Therefore, in telecommunication systems, there is a problem of developing new methods for exchanging information and forming an effective structure for organizing clock synchronization for incoming data packets. 

KEYWORDS

Synchronization process; packet communications; asynchronous data stream; discrete information; channels with a random multiple access

Full Text : 

Imperative Programs Behavior Simulation in Terms of Compositional Petri Nets

Leontyev Denis Vasilevich, Kharitonov Dmitry Ivanovich and Tarasov Georgiy Vitalievich

 Institute of Automation and Control Processes FEB RAS Vladivostok, Russia 

ABSTRACT

 The article considers a generation mechanism of compositional models simulating imperative programs behavior in terms of Petri nets. The mechanism of program models generation consists of two main stages. At the first stage, the structure of the program is prepared using such program elements like: libraries, functions and links between functions. At the second stage, the content of function bodies is generated on the base of template constructions. In the article some semantic constructions template examples of imperative programming language with their descriptions are given, and a generation example of a program model in terms of Petri nets is demonstrated.

KEYWORDS

Program modeling; control flow; Petri nets; composition operations

Full Text : 

Extended Linear Multi-Commodity Multicost Network and Maximal Flow Limited Cost Problems

Tran Quoc Chien1 and Ho Van Hung2 

1The University of Education, University of Danang, Danang, Vietnam

 2Quangnam University, Tamky, Vietnam 

ABSTRACT

The Graph is a powerful mathematical tool applied in many fields as transportation, communication, informatics, economy, … In an ordinary graph, the weights of edges and vertexes are considered independently where the length of a path is the sum of weights of the edges and the vertexes on this path. However, in many practical problems, weights at a vertex are not the same for all paths passing this vertex but depend on coming and leaving edges. The presented paper develops a model of the extended linear multi-commodity multi-cost network that can be more exactly and effectively applied to model many practical problems. Then, maximal limit cost flow problems are modeled as implicit linear programming problems. On the base of dual theory in linear programming, an effective approximate algorithm is developed. 

KEYWORDS

 Graph, Network, Multi-commodity Multi-cost Flow, Optimization, Linear-Programming. 

Full Text : 

Quad Tree Based Static Multi Hop Leach Energy Efficient Routing Protocol : A Novel Approach

1Abdulmalek Maresh Hasan Ali and 2Hanumanthappa .J. 

1Research Scholar, Department of CS&E, VTU, Belgaum, Karnataka, India. 

2DoS in CS, University of Mysuru, Manasagangotri, Mysuru, Karnataka, India.

 ABSTRACT 

This research work propounds a simple graph theory semblance Divide and Conquer Quad tree based Multi-hop Static Leach (DCQMS-Leach) energy efficient routing protocol for wireless sensor networks. The pivotal theme of this research work is to demonstrate how divide and conquer plays a pivotal role in a multi-hop static leach energy efficient routing protocol. This research work motivates, enforces, reckons the DCQMS-Leach energy efficient routing protocol in wireless sensor networks using Mat lab simulator. This research work also computes the performance concepts of DCQMS-Leach routing protocol using various performance metrics such as Packet Drop Rate (PDR), Throughput, and End to End Delay (EED) by comparing and contrasting alive nodes with number of nodes, number of each packets sent to the cluster heads with rounds, number of cluster heads with rounds, number of packets forwarded to the base station with rounds and finally dead nodes with number of rounds. In order to curtail energy consumption this research work proffers a routing methodology such as DCQMS-Leach in energy efficient wireless sensor routing protocol. The recommended DCQMS-Leach overcomes the in adequacies of all other different leach protocols suggested by the previous researchers. 

KEYWORDS

 Divide and Conquer (D&C), Divide and Conquer Quad tree based Multi hop Static Leach (DCQMSLeach), Energy Efficient Routing Protocol (EERP), Wireless Sensor Networks (WSNs), Energy Efficient WSNs (EEWSNs).  

Full Text : 

Response Surface Methodology for Performance Analysis and Modeling of MANET Routing Protocols

Mohamed Skander Daas1 and Salim Chikhi2 

1MISC Lab, Department of Fundamental Computer Science and its Applications, Abdelhamid Mehri Constantine

 2 University, Constantine, Algeria 2MISC Lab, University of Abdelhamid Mehri - Constantine 2, Constantine, Algeria 

ABSTRACT

 Numerous studies have analyzed the performances of routing protocols in mobile Ad-hoc networks (MANETs); most of these studies vary at most one or two parameters in experiments and do not study the interactions among these parameters. Furthermore, efficient mathematical modeling of the performances has not been investigated; such models can be useful for performance analysis, optimization, and prediction. This study aims to show the effectiveness of the response surface methodology (RSM) on the performance analysis of routing protocols in MANETs and establish a relationship between the influential parameters and these performances through mathematical modeling. Given that routing performances usually do not follow a linear pattern according to the parameters; mathematical models of factorial designs are not suitable for establishing a valid and reliable relationship between performances and parameters. Therefore, a Box–Behnken design, which is an RSM technique and provides quadratic mathematical models, is used in this study to establish a relationship. The obtained models are statistically analyzed; the models show that the studied performances accurately follow a quadratic evolution. These models provide invaluable information and can be useful in analyzing, optimizing, and predicting performances for mobile Ad-hoc routing protocols. 

KEYWORDS

 Response surface methodology, performance analysis, and modeling, routing protocols, mobile ad-hoc networks, design of experiments 

Full Text : 

VIRTUAL ROUTING FUNCTION DEPLOYMENT IN NFV-BASED NETWORKS UNDER NETWORK DELAY CONSTRAINTS

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. The authors proposed an algorithm of virtual routing function allocation in the NFVbased network for minimizing the total power consumption or the total network cost, and developed effective allocation guidelines for virtual routing functions. This paper evaluates the effect of the maximum tolerable network delay on the guidelines for the allocation of virtual routing functions, which minimizes the total network cost. The following points are clear from quantitative evaluations: (1) The shorter the maximum tolerable network delay, the greater the number of areas where the routing function must be allocated, resulting in an increase in the total network cost. (2) The greater the routing function cost relative to the circuit bandwidth cost, the greater the increase in the total network cost caused by the maximum tolerable network delay. This paper also provides the possible guideline how to decide the value of maximum tolerable network delay when the condition of allowable increase in network cost is given. 

KEYWORDS

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

Trust Factor and Fuzzy Firefly Integrated Particle Swarm Optimization Based Intrusion Detection and Prevention System for Secure Routing of MANET

Ramireddy Kondaiah1 and Bachala Sathyanarayana2 

1Research Scholar, Department of Computer Science, Rayalaseema University, Kurnool ,A.P,India.& Associate Professor, Dept of CSE, PBRVITS, Kavali, Andhra Pradesh , India. 

2 Professor in Computer Science &Technology ,Sri Krishnadevaraya University, Anantapur, A.P, India. 

ABSTRACT

Mobile Ad hoc Networks (MANET) is one of the rapidly emanating technologies, which has gained attention in a wide range of applications in the fields of military, private sectors, commercials and natural calamities. Securing MANET is a dominant responsibility, and hence, a trust factor and fuzzy based intrusion detection and prevention system is proposed for routing in this paper. Based on the trust values of the nodes, the fuzzy system identifies the intruder, such that the path generated in the MANET is secured. Moreover, an optimization algorithm, entitled Fuzzy integrated Particle Swarm Optimization (FuzzyFPSO), is proposed by the concatenation of the Firefly Algorithm (FA) and Particle Swarm Optimization (PSO) for the optimal path selection in order to provide secure routing. The simulation of the proposed methodology is NS2 simulator and analysis is carried out considering four cases, like without attack, flooding attacks, black hole attack and selective packet drop attack concerning throughput, delay and detection rate. The remarkable evaluation measures of the proposed Fuzzy-FPSO are the maximal throughput of 0.634, minimal delay of 0.044 , maximal detection rate of 0.697 and minimal routing overhead of 0.24550 And the evaluation measure for the case without any attacks are the maximal throughput of 0.762, minimal delay of 0.029 ,maximal detection rate of 0.805 and minimal routing overhead of 0.11511.

KEYWORDS

MANET, Routing, Trust, Fuzzy system, Firefly Algorithm, Particle Swarm Optimization.

Full Text :

Spectrum Sensing Strategy to Enhance the QoS in White-Fi Networks

Nabil Giweli, Seyed Shahrestani and Hon Cheung 

School of Computing, Engineering and Mathematics, Western Sydney University, Sydney, Australia  

ABSTRACT 

The rapidly growing number of wireless devices running applications that require high bandwidths, has resulted in increasing demands for the unlicensed frequency spectrum. Given the scarcity of allocated unlicensed frequencies, meeting such demands can become a serious concern. Cognitive Radio (CR) technology opens the door for the opportunistic use of the licensed spectrum to partially address the issues relevant to the limited availability of unlicensed frequencies. Combining CR and Wi-Fi to form the socalled White-Fi networks, has been proposed for achieving higher spectrum utilization. This article discusses the spectrum sensing in White-Fi networks and the impacts that it has on the QoS of typical applications. It also reports the analysis of such impacts through various simulation studies. Our results demonstrate the advantages of an adaptive sensing strategy that is capable of changing the related parameters based on QoS requirements. We also propose such a sensing strategy that can adapt to the IEEE 802.11e requirements. The goal of the proposed strategy is the enhancement of the overall QoS of the applications while maintaining efficient sensing of the spectrum. Simulation results of the scenarios that implement the proposed mechanisms demonstrate noticeable QoS improvements compared to cases where common sensing methods are utilized in IEEE802.11 networks. 

KEYWORDS

 Cognitive Radio, IEEE 802.11af, IEEE 802.11e, QoS, Spectrum Sensing, White-Fi. 

Full Text