Search results for: Radial basis function networks
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 4769

Search results for: Radial basis function networks

4199 Sparsity-Based Unsupervised Unmixing of Hyperspectral Imaging Data Using Basis Pursuit

Authors: Ahmed Elrewainy

Abstract:

Mixing in the hyperspectral imaging occurs due to the low spatial resolutions of the used cameras. The existing pure materials “endmembers” in the scene share the spectra pixels with different amounts called “abundances”. Unmixing of the data cube is an important task to know the present endmembers in the cube for the analysis of these images. Unsupervised unmixing is done with no information about the given data cube. Sparsity is one of the recent approaches used in the source recovery or unmixing techniques. The l1-norm optimization problem “basis pursuit” could be used as a sparsity-based approach to solve this unmixing problem where the endmembers is assumed to be sparse in an appropriate domain known as dictionary. This optimization problem is solved using proximal method “iterative thresholding”. The l1-norm basis pursuit optimization problem as a sparsity-based unmixing technique was used to unmix real and synthetic hyperspectral data cubes.

Keywords: Basis pursuit, blind source separation, hyperspectral imaging, spectral unmixing, wavelets.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 809
4198 A Competitive Replica Placement Methodology for Ad Hoc Networks

Authors: Samee Ullah Khan, C. Ardil

Abstract:

In this paper, a mathematical model for data object replication in ad hoc networks is formulated. The derived model is general, flexible and adaptable to cater for various applications in ad hoc networks. We propose a game theoretical technique in which players (mobile hosts) continuously compete in a non-cooperative environment to improve data accessibility by replicating data objects. The technique incorporates the access frequency from mobile hosts to each data object, the status of the network connectivity, and communication costs. The proposed technique is extensively evaluated against four well-known ad hoc network replica allocation methods. The experimental results reveal that the proposed approach outperforms the four techniques in both the execution time and solution quality

Keywords: Data replication, auctions, static allocation.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1376
4197 A Quality Optimization Approach: An Application on Next Generation Networks

Authors: Gülfem I. Alptekin, S. Emre Alptekin

Abstract:

The next generation wireless systems, especially the cognitive radio networks aim at utilizing network resources more efficiently. They share a wide range of available spectrum in an opportunistic manner. In this paper, we propose a quality management model for short-term sub-lease of unutilized spectrum bands to different service providers. We built our model on competitive secondary market architecture. To establish the necessary conditions for convergent behavior, we utilize techniques from game theory. Our proposed model is based on potential game approach that is suitable for systems with dynamic decision making. The Nash equilibrium point tells the spectrum holders the ideal price values where profit is maximized at the highest level of customer satisfaction. Our numerical results show that the price decisions of the network providers depend on the price and QoS of their own bands as well as the prices and QoS levels of their opponents- bands.

Keywords: cognitive radio networks, game theory, nextgeneration wireless networks, spectrum management.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1481
4196 An Agent-based Model for Analyzing Interaction of Two Stable Social Networks

Authors: Masatora Daito, Hisashi Kojima

Abstract:

In this research, the authors analyze network stability using agent-based simulation. Firstly, the authors focus on analyzing large networks (eight agents) by connecting different two stable small social networks (A small stable network is consisted on four agents.). Secondly, the authors analyze the network (eight agents) shape which is added one agent to a stable network (seven agents). Thirdly, the authors analyze interpersonal comparison of utility. The “star-network "was not found on the result of interaction among stable two small networks. On the other hand, “decentralized network" was formed from several combination. In case of added one agent to a stable network (seven agents), if the value of “c"(maintenance cost of per a link) was larger, the number of patterns of stable network was also larger. In this case, the authors identified the characteristics of a large stable network. The authors discovered the cases of decreasing personal utility under condition increasing total utility.

Keywords: Social Network, Symmetric Situation, Network Stability, Agent-Based Modeling.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1503
4195 Social Networks and Absorptive Capacity

Authors: Rachelle Bosua, Nina Evans

Abstract:

The resource-based view of the firm regards knowledge as one of the most important organizational assets and a key strategic resource that contributes unique value to organizations. The acquisition, absorption and internalization of external knowledge are central to an organization-s innovative capabilities. This ability to evaluate, acquire and integrate new knowledge from its environment is referred to as a firm-s absorptive capacity (AC). This research in progress paper explores the link between interorganizational Social Networks (SNs) and a firm-s Absorptive Capacity (AC). Based on an in-depth literature survey of both concepts, four propositions are proposed that explain the link between AC and SNs. These propositions suggest that SNs are key to a firm-s AC. A qualitative research method is proposed to test the set of propositions in the next stage of this research.

Keywords: Knowledge, Innovation, Absorptive Capacity, Social Networks

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1719
4194 Energy Efficient Clustering Algorithm with Global and Local Re-clustering for Wireless Sensor Networks

Authors: Ashanie Guanathillake, Kithsiri Samarasinghe

Abstract:

Wireless Sensor Networks consist of inexpensive, low power sensor nodes deployed to monitor the environment and collect data. Gathering information in an energy efficient manner is a critical aspect to prolong the network lifetime. Clustering  algorithms have an advantage of enhancing the network lifetime. Current clustering algorithms usually focus on global re-clustering and local re-clustering separately. This paper, proposed a combination of those two reclustering methods to reduce the energy consumption of the network. Furthermore, the proposed algorithm can apply to homogeneous as well as heterogeneous wireless sensor networks. In addition, the cluster head rotation happens, only when its energy drops below a dynamic threshold value computed by the algorithm. The simulation result shows that the proposed algorithm prolong the network lifetime compared to existing algorithms.

Keywords: Energy efficient, Global re-clustering, Local re-clustering, Wireless sensor networks.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2339
4193 Correspondence between Function and Interaction in Protein Interaction Network of Saccaromyces cerevisiae

Authors: Nurcan Tuncbag, Turkan Haliloglu, Ozlem Keskin

Abstract:

Understanding the cell's large-scale organization is an interesting task in computational biology. Thus, protein-protein interactions can reveal important organization and function of the cell. Here, we investigated the correspondence between protein interactions and function for the yeast. We obtained the correlations among the set of proteins. Then these correlations are clustered using both the hierarchical and biclustering methods. The detailed analyses of proteins in each cluster were carried out by making use of their functional annotations. As a result, we found that some functional classes appear together in almost all biclusters. On the other hand, in hierarchical clustering, the dominancy of one functional class is observed. In the light of the clustering data, we have verified some interactions which were not identified as core interactions in DIP and also, we have characterized some functionally unknown proteins according to the interaction data and functional correlation. In brief, from interaction data to function, some correlated results are noticed about the relationship between interaction and function which might give clues about the organization of the proteins, also to predict new interactions and to characterize functions of unknown proteins.

Keywords: Pair-wise protein interactions, DIP database, functional correlations, biclustering.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1559
4192 Energy Deposited by Secondary Electrons Generated by Swift Proton Beams through Polymethylmethacrylate

Authors: Maurizio Dapor, Isabel Abril, Pablo de Vera, Rafael Garcia-Molina

Abstract:

The ionization yield of ion tracks in polymers and bio-molecular systems reaches a maximum, known as the Bragg peak, close to the end of the ion trajectories. Along the path of the ions through the materials, many electrons are generated, which produce a cascade of further ionizations and, consequently, a shower of secondary electrons. Among these, very low energy secondary electrons can produce damage in the biomolecules by dissociative electron attachment. This work deals with the calculation of the energy distribution of electrons produced by protons in a sample of polymethylmethacrylate (PMMA), a material that is used as a phantom for living tissues in hadron therapy. PMMA is also of relevance for microelectronics in CMOS technologies and as a photoresist mask in electron beam lithography. We present a Monte Carlo code that, starting from a realistic description of the energy distribution of the electrons ejected by protons moving through PMMA, simulates the entire cascade of generated secondary electrons. By following in detail the motion of all these electrons, we find the radial distribution of the energy that they deposit in PMMA for several initial proton energies characteristic of the Bragg peak.

Keywords: Monte Carlo method, secondary electrons, energetic ions, ion-beam cancer therapy, ionization cross section, polymethylmethacrylate, proton beams, secondary electrons, radial energy distribution.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1531
4191 Elastic-Plastic Analysis for Finite Deformation of a Rotating Disk Having Variable Thickness with Inclusion

Authors: Sanjeev Sharma, Manoj Sahni

Abstract:

Transition theory has been used to derive the elasticplastic and transitional stresses. Results obtained have been discussed numerically and depicted graphically. It is observed that the rotating disk made of incompressible material with inclusion require higher angular speed to yield at the internal surface as compared to disk made of compressible material. It is seen that the radial and circumferential stresses are maximum at the internal surface with and without edge load (for flat disk). With the increase in thickness parameter (k = 2, 4), the circumferential stress is maximum at the external surface while the radial stress is maximum at the internal surface. From the figures drawn the disk with exponentially varying thickness (k = 2), high angular speed is required for initial yielding at internal surface as compared to flat disk and exponentially varying thickness for k = 4 onwards. It is concluded that the disk made of isotropic compressible material is on the safer side of the design as compared to disk made of isotropic incompressible material as it requires higher percentage increase in an angular speed to become fully plastic from its initial yielding.

Keywords: Finite deformation, Incompressibility, Transitionalstresses, Elastic-plastic.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1650
4190 Distributed Denial of Service Attacks in Mobile Adhoc Networks

Authors: Gurjinder Kaur, Yogesh Chaba, V. K. Jain

Abstract:

The aim of this paper is to explore the security issues that significantly affect the performance of Mobile Adhoc Networks (MANET)and limit the services provided to their intended users. The MANETs are more vulnerable to Distributed Denial of Service attacks (DDoS) because of their properties like shared medium, dynamic topologies etc. A DDoS attack is a coordinated attempt made by malicious users to flood the victim network with the large amount of data such that the resources of the victim network are exhausted resulting in the deterioration of the network performance. This paper highlights the effects of different types of DDoS attacks in MANETs and categorizes them according to their behavior.

Keywords: Distributed Denial, Mobile Adhoc Networks

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2410
4189 Discussing Embedded versus Central Machine Learning in Wireless Sensor Networks

Authors: Anne-Lena Kampen, Øivind Kure

Abstract:

Machine learning (ML) can be implemented in Wireless Sensor Networks (WSNs) as a central solution or distributed solution where the ML is embedded in the nodes. Embedding improves privacy and may reduce prediction delay. In addition, the number of transmissions is reduced. However, quality factors such as prediction accuracy, fault detection efficiency and coordinated control of the overall system suffer. Here, we discuss and highlight the trade-offs that should be considered when choosing between embedding and centralized ML, especially for multihop networks. In addition, we present estimations that demonstrate the energy trade-offs between embedded and centralized ML. Although the total network energy consumption is lower with central prediction, it makes the network more prone for partitioning due to the high forwarding load on the one-hop nodes. Moreover, the continuous improvements in the number of operations per joule for embedded devices will move the energy balance toward embedded prediction.

Keywords: Central ML, embedded machine learning, energy consumption, local ML, Wireless Sensor Networks, WSN.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 777
4188 The Existence of Field Corn Networks on the Thailand-Burma Border under the Patron-Client Contract Farming System

Authors: Kettawa Boonprakarn, Jedsarid Sangkaphan, Bejapornd Deekhuntod, Nuntharat Suriyo

Abstract:

This study aimed to investigate the existence of field corn networks on the Thailand-Burma border under the patron-client contract farming system. The data of this qualitative study were collected through in-depth interviews with nine key informants.

The results of the study revealed that the existence of the field corn networks was associated with the relationship where farmers had to share their crops with protectors in the areas under the influence of the KNU (Karen National Union) and the DKBA (Democratic Karen Buddhist Army) or Burmese soldiers. A Mae Liang, the person who starts a network has a connection with a Thaokae, Luk Rai Hua Chai or the head of a group of farmers, and farmers. They are under the patron-client system with trust and loyalty that enable the head of the group and the farmers in the Burma border side to remain under the same Mae Liang even though the business has been passed down to later generations.

Keywords: Existence, field-corn networks, patron-client system, contract farming.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1714
4187 An Improved Learning Algorithm based on the Conjugate Gradient Method for Back Propagation Neural Networks

Authors: N. M. Nawi, M. R. Ransing, R. S. Ransing

Abstract:

The conjugate gradient optimization algorithm usually used for nonlinear least squares is presented and is combined with the modified back propagation algorithm yielding a new fast training multilayer perceptron (MLP) algorithm (CGFR/AG). The approaches presented in the paper consist of three steps: (1) Modification on standard back propagation algorithm by introducing gain variation term of the activation function, (2) Calculating the gradient descent on error with respect to the weights and gains values and (3) the determination of the new search direction by exploiting the information calculated by gradient descent in step (2) as well as the previous search direction. The proposed method improved the training efficiency of back propagation algorithm by adaptively modifying the initial search direction. Performance of the proposed method is demonstrated by comparing to the conjugate gradient algorithm from neural network toolbox for the chosen benchmark. The results show that the number of iterations required by the proposed method to converge is less than 20% of what is required by the standard conjugate gradient and neural network toolbox algorithm.

Keywords: Back-propagation, activation function, conjugategradient, search direction, gain variation.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2804
4186 Estimation of Production Function in Fishery on the Coasts of Caspian Sea

Authors: Komeil Jahanifar, Zahra Abedi, Yaghob Zeraatkish

Abstract:

This research was conducted for the first time at the southeastern coasts of the Caspian Sea in order to evaluate the performance of osteichthyes cooperatives through production (catch) function. Using one of the indirect valuation methods in this research, contributory factors in catch were identified and were inserted into the function as independent variables. In order to carry out this research, the performance of 25 Osteichthyes catching cooperatives in the utilization year of 2009 which were involved in fishing in Miankale wildlife refuge region. The contributory factors in catch were divided into groups of economic, ecological and biological factors. In the mentioned function, catch rate of the cooperative were inserted into as the dependant variable and fourteen partial variables in terms of nine general variables as independent variables. Finally, after function estimation, seven variables were rendered significant at 99 percent reliably level. The results of the function estimation indicated that human resource (fisherman quantity) had the greatest positive effect on catch rate with an influence coefficient of 1.7 while weather conditions had the greatest negative effect on the catch rate of cooperatives with an influence coefficient of -2.07. Moreover, factors like member's share, experience and fisherman training and fishing effort played the main roles in the catch rate of cooperative with influence coefficients of 0.81, 0.5 and 0.21, respectively.

Keywords: Production Function, Coefficient, Variable, Osteichthyes, Caspian Sea

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2009
4185 Categorical Missing Data Imputation Using Fuzzy Neural Networks with Numerical and Categorical Inputs

Authors: Pilar Rey-del-Castillo, Jesús Cardeñosa

Abstract:

There are many situations where input feature vectors are incomplete and methods to tackle the problem have been studied for a long time. A commonly used procedure is to replace each missing value with an imputation. This paper presents a method to perform categorical missing data imputation from numerical and categorical variables. The imputations are based on Simpson-s fuzzy min-max neural networks where the input variables for learning and classification are just numerical. The proposed method extends the input to categorical variables by introducing new fuzzy sets, a new operation and a new architecture. The procedure is tested and compared with others using opinion poll data.

Keywords: Classifier, imputation techniques, fuzzy systems, fuzzy min-max neural networks.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1736
4184 Emerging Technology for 6G Networks

Authors: Yaseein S. Hussein, Victor P. Gil Jiménez, Abdulmajeed Al-Jumaily

Abstract:

Due to the rapid advancement of technology, there is an increasing demand for wireless connections that are both fast and reliable, with minimal latency. New wireless communication standards are developed every decade, and 2030 is expected to see the introduction of 6G. The primary objectives of 6G network and terminal designs are focused on sustainability and environmental friendliness. The International Telecommunication Union-Recommendation division (ITU-R) has established the minimum requirements for 6G, with peak and user data rates of 1 Tbps and 10-100 Gbps, respectively. In this context, Light Fidelity (Li-Fi) technology is the most promising candidate to meet these requirements. This article will explore the various advantages, features, and potential applications of Li-Fi technology, and compare it with 5G networking, to showcase its potential impact among other emerging technologies that aim to enable 6G networks.

Keywords: 6G Networks, artificial intelligence, AI, Li-Fi technology, terahertz communication, visible light communication.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 112
4183 Education Function of Botanical Gardens

Authors: Ruhugül Özge Ocak, Banu Öztürk Kurtaslan

Abstract:

Botanical gardens are very significant organizations which protect the environment against the increasing environmental problems, provide environmental education for people, offer recreation possibilities, etc. This article describes botanical gardens and their functions. The most important function of botanical garden is to provide environmental education for people and improve environmental awareness. Considering this function, some botanical gardens were examined and opinions were suggested about the subject.

Keywords: Botanical garden, environment, environmental education, recreation.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1633
4182 An Analysis of Global Stability of a Class of Neutral-Type Neural Systems with Time Delays

Authors: Ozlem Faydasicok, Sabri Arik

Abstract:

This paper derives some new sufficient conditions for the stability of a class of neutral-type neural networks with discrete time delays by employing a suitable Lyapunov functional. The obtained conditions can be easily verified as they can be expressed in terms of the network parameters only. It is shown that the results presented in this paper for neutral-type delayed neural networks establish a new set of stability criteria, and therefore can be considered as the alternative results to the previously published literature results. A numerical example is also given to demonstrate the applicability of our proposed stability criterion.

Keywords: Stability Analysis, Neutral-Type Neural Networks, Time Delay Systems, Lyapunov Functionals.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1612
4181 Client Server System for e-Services Access Using Mobile Communications Networks

Authors: Eugen Pop, Mihai Barbos, Razvan Lupu

Abstract:

The client server systems using mobile communications networks for data transmission became very attractive for many economic agents, in the purpose of promoting and offering electronic services to their clients. E-services are suitable for business developing and financial benefits increasing. The products or services can be efficiently delivered to a large number of clients, using mobile Internet access technologies. The clients can have access to e-services, anywhere and anytime, with the support of 3G, GPRS, WLAN, etc., channels bandwidth, data services and protocols. Based on the mobile communications networks evolution and development, a convergence of technological and financial interests of mobile operators, software developers, mobile terminals producers and e-content providers is established. These will lead to a high level of integration of IT&C resources and will facilitate the value added services delivery through the mobile communications networks. In this paper it is presented a client server system, for e-services access, with Smartphones and PDA-s mobile software applications, installed on Symbian and Windows Mobile operating systems.

Keywords: Client server system, e-services access, mobile communications, PDA, Smartphone.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2634
4180 Multi-Objective Analysis of Cost and Social Benefits in Rural Road Networks

Authors: J. K. Shrestha, A. Benta, R. B. Lopes, N. Lopes

Abstract:

This paper presents a multi-objective model for addressing two main objectives in designing rural roads networks: minimization of user operation costs and maximization of population covered. As limited budgets often exist, a reasonable trade-off must be obtained in order to account for both cost and social benefits in this type of networks. For a real-world rural road network, the model is solved, where all non-dominated solutions were obtained. Afterwards, an analysis is made on the (possibly) most interesting solutions (the ones providing better trade-offs). This analysis, coupled with the knowledge of the real world scenario (typically provided by decision makers) provides a suitable method for the evaluation of road networks in rural areas of developing countries.

Keywords: Multi-objective, user operation cost, population covered, rural road network.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1802
4179 Synchronization for Impulsive Fuzzy Cohen-Grossberg Neural Networks with Time Delays under Noise Perturbation

Authors: Changzhao Li, Juan Zhang

Abstract:

In this paper, we investigate a class of fuzzy Cohen- Grossberg neural networks with time delays and impulsive effects. By virtue of stochastic analysis, Halanay inequality for stochastic differential equations, we find sufficient conditions for the global exponential square-mean synchronization of the FCGNNs under noise perturbation. In particular, the traditional assumption on the differentiability of the time-varying delays is no longer needed. Finally, a numerical example is given to show the effectiveness of the results in this paper.

Keywords: Fuzzy Cohen-Grossberg neural networks (FCGNNs), complete synchronization, time delays, impulsive, noise perturbation.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1312
4178 Complex-Valued Neural Network in Signal Processing: A Study on the Effectiveness of Complex Valued Generalized Mean Neuron Model

Authors: Anupama Pande, Ashok Kumar Thakur, Swapnoneel Roy

Abstract:

A complex valued neural network is a neural network which consists of complex valued input and/or weights and/or thresholds and/or activation functions. Complex-valued neural networks have been widening the scope of applications not only in electronics and informatics, but also in social systems. One of the most important applications of the complex valued neural network is in signal processing. In Neural networks, generalized mean neuron model (GMN) is often discussed and studied. The GMN includes a new aggregation function based on the concept of generalized mean of all the inputs to the neuron. This paper aims to present exhaustive results of using Generalized Mean Neuron model in a complex-valued neural network model that uses the back-propagation algorithm (called -Complex-BP-) for learning. Our experiments results demonstrate the effectiveness of a Generalized Mean Neuron Model in a complex plane for signal processing over a real valued neural network. We have studied and stated various observations like effect of learning rates, ranges of the initial weights randomly selected, error functions used and number of iterations for the convergence of error required on a Generalized Mean neural network model. Some inherent properties of this complex back propagation algorithm are also studied and discussed.

Keywords: Complex valued neural network, Generalized Meanneuron model, Signal processing.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1700
4177 Authentication Protocol for Wireless Sensor Networks

Authors: Sunil Gupta, Harsh Kumar Verma, AL Sangal

Abstract:

Wireless sensor networks can be used to measure and monitor many challenging problems and typically involve in monitoring, tracking and controlling areas such as battlefield monitoring, object tracking, habitat monitoring and home sentry systems. However, wireless sensor networks pose unique security challenges including forgery of sensor data, eavesdropping, denial of service attacks, and the physical compromise of sensor nodes. Node in a sensor networks may be vanished due to power exhaustion or malicious attacks. To expand the life span of the sensor network, a new node deployment is needed. In military scenarios, intruder may directly organize malicious nodes or manipulate existing nodes to set up malicious new nodes through many kinds of attacks. To avoid malicious nodes from joining the sensor network, a security is required in the design of sensor network protocols. In this paper, we proposed a security framework to provide a complete security solution against the known attacks in wireless sensor networks. Our framework accomplishes node authentication for new nodes with recognition of a malicious node. When deployed as a framework, a high degree of security is reachable compared with the conventional sensor network security solutions. A proposed framework can protect against most of the notorious attacks in sensor networks, and attain better computation and communication performance. This is different from conventional authentication methods based on the node identity. It includes identity of nodes and the node security time stamp into the authentication procedure. Hence security protocols not only see the identity of each node but also distinguish between new nodes and old nodes.

Keywords: Authentication, Key management, Wireless Sensornetwork, Elliptic curve cryptography (ECC).

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 3787
4176 Relation between Roots and Tangent Lines of Function in Fractional Dimensions: A Method for Optimization Problems

Authors: Ali Dorostkar

Abstract:

In this paper, a basic schematic of fractional dimensional optimization problem is presented. As will be shown, a method is performed based on a relation between roots and tangent lines of function in fractional dimensions for an arbitrary initial point. It is shown that for each polynomial function with order N at least N tangent lines must be existed in fractional dimensions of 0 < α < N+1 which pass exactly through the all roots of the proposed function. Geometrical analysis of tangent lines in fractional dimensions is also presented to clarify more intuitively the proposed method. Results show that with an appropriate selection of fractional dimensions, we can directly find the roots. Method is presented for giving a different direction of optimization problems by the use of fractional dimensions.

Keywords: Tangent line, fractional dimension, root, optimization problem.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 523
4175 Motion Planning of SCARA Robots for Trajectory Tracking

Authors: Giovanni Incerti

Abstract:

The paper presents a method for a simple and immediate motion planning of a SCARA robot, whose end-effector has to move along a given trajectory; the calculation procedure requires the user to define in analytical form or by points the trajectory to be followed and to assign the curvilinear abscissa as function of the time. On the basis of the geometrical characteristics of the robot, a specifically developed program determines the motion laws of the actuators that enable the robot to generate the required movement; this software can be used in all industrial applications for which a SCARA robot has to be frequently reprogrammed, in order to generate various types of trajectories with different motion times.

Keywords: Motion planning, SCARA robot, trajectory tracking.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2366
4174 An Energy-Latency-Efficient MAC Protocol for Wireless Sensor Networks

Authors: Tahar Ezzedine, Mohamed Miladi, Ridha Bouallegue

Abstract:

Because nodes are usually battery-powered, the energy presents a very scarce resource in wireless sensor networks. For this reason, the design of medium access control had to take energy efficiency as one of its hottest concerns. Accordingly, in order to improve the energy performance of MAC schemes in wireless sensor networks, several ways can be followed. In fact, some researchers try to limit idle listening while others focus on mitigating overhearing (i.e. a node can hear a packet which is destined to another node) or reducing the number of the used control packets. We, in this paper, propose a new hybrid MAC protocol termed ELE-MAC (i.e. Energy Latency Efficient MAC). The ELE-MAC major design goals are energy and latency efficiencies. It adopts less control packets than SMAC in order to preserve energy. We carried out ns- 2 simulations to evaluate the performance of the proposed protocol. Thus, our simulation-s results prove the ELE-MAC energy efficiency. Additionally, our solution performs statistically the same or better latency characteristic compared to adaptive SMAC.

Keywords: Control packet, energy efficiency, medium access control, wireless sensor networks.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1666
4173 2n Almost Periodic Attractors for Cohen-Grossberg Neural Networks with Variable and Distribute Delays

Authors: Meng Hu, Lili Wang

Abstract:

In this paper, we investigate dynamics of 2n almost periodic attractors for Cohen-Grossberg neural networks (CGNNs) with variable and distribute time delays. By imposing some new assumptions on activation functions and system parameters, we split invariant basin of CGNNs into 2n compact convex subsets. Then the existence of 2n almost periodic solutions lying in compact convex subsets is attained due to employment of the theory of exponential dichotomy and Schauder-s fixed point theorem. Meanwhile, we derive some new criteria for the networks to converge toward these 2n almost periodic solutions and exponential attracting domains are also given correspondingly.

Keywords: CGNNs, almost periodic solution, invariant basins, attracting domains.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1345
4172 A Theory in Optimization of Ad-hoc Routing Algorithms

Authors: M. Kargar, F.Fartash, T. Saderi, M. Ebrahimi Dishabi

Abstract:

In this paper optimization of routing in ad-hoc networks is surveyed and a new method for reducing the complexity of routing algorithms is suggested. Using binary matrices for each node in the network and updating it once the routing is done, helps nodes to stop repeating the routing protocols in each data transfer. The algorithm suggested can reduce the complexity of routing to the least amount possible.

Keywords: Ad-hoc Networks, Algorithm, Protocol, RoutingTrain.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1642
4171 Energy Efficiency of Adaptive-Rate Medium Access Control Protocols for Sensor Networks

Authors: Rooholah Hasanizadeh, Saadan Zokaei

Abstract:

Energy efficient protocol design is the aim of current researches in the area of sensor networks where limited power resources impose energy conservation considerations. In this paper we care for Medium Access Control (MAC) protocols and after an extensive literature review, two adaptive schemes are discussed. Of them, adaptive-rate MACs which were introduced for throughput enhancement show the potency to save energy, even more than adaptive-power schemes. Then we propose an allocation algorithm for getting accurate and reliable results. Through a simulation study we validated our claim and showed the power saving of adaptive-rate protocols.

Keywords: Adaptive-rate, adaptive-power, MAC protocol, energy efficiency, sensor networks.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1918
4170 On the Efficiency of Five Step Approximation Method for the Solution of General Third Order Ordinary Differential Equations

Authors: N. M. Kamoh, M. C. Soomiyol

Abstract:

In this work, a five step continuous method for the solution of third order ordinary differential equations was developed in block form using collocation and interpolation techniques of the shifted Legendre polynomial basis function. The method was found to be zero-stable, consistent and convergent. The application of the method in solving third order initial value problem of ordinary differential equations revealed that the method compared favorably with existing methods.

Keywords: Shifted Legendre polynomials, third order block method, discrete method, convergent.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 616