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