Optimization of WSN using Biological Inspired Self-Organized Secure Autonomous Routing Protocol

Since last three decade, Wireless Sensor Network is one of the biggest innovative technologies; it provides facility of heavy data traffic and management telecommunication by sensing, computation and communication into a small device. Main threat for this type of data transfer is data security in terms of maintains data integrity, high consumption of energy, end-to-end delay and high cost of nodes i.e. sensor. Handling all h issue at same time is the difficult task. SRTLD and BIOSARP are two routing protocol which helps in improving performance of the WSN. This paper is a detail description of secure architecture which is based on SRTLD and BIOSARP protocol. The main objective of this architecture is to provide high security by taking into account low energy consumption, low end-to-end delay and low node level cost. This mechanism uses concept of ACO (Ant Colony Optimization) which helps in achieving objective of the architectur

A greedy ant colony forwarding algorithm for Named Data Networking

The Named Data Networking (NDN) is a newly proposed Internet architecture based on Content-Centric Networking, which transforms data, instead of hosts, into a first-class entity. However, one of the major challenges is supporting intelligent forwarding of Interests over multiple paths while allowing an unbounded name space. To address this challenge, this paper proposes a Greedy Ant Colony Forwarding (GACF) algorithm which uses the ISP-based aggregation to reduce the content naming space. There are two kinds of ants in GACF. One is Hello Ant which is used to discover the all possible paths and optimize them; the other is Normal Ant which is used to get data and reinforce the optimization of the paths simultaneously. The GACF algorithm is a Quality of Service aware forwarding algorithm. It adaptively reduces the impacts incited by the dynamic complex network

Meta Heuristic for WDM Optical Networks Without Wavelength Conversion

This paper presents the results of the algorithm Snake-Two, evolving from algorithm Snake-One, which showed important results in the blocking probability of transport networks under dynamic traffic, but poor results in the network utilization indicator. The strategy applied is called Saturated Link and it moves traffic to congestion zones, creating concentrated network utilization, thus improving blocking probability. This is achieved by monitoring congested links using the full saturation capacity of each link. This way, the ones least used are downloaded, which enables keeping the congestion zoned and saturated, significantly lowering the blocking probability with low network utilization cost for dynamic traffic scenarios

Congressos amb més articles Campus del Baix Llobregat (CBL) - 2011

Es presenta la llista de congressos en les que més han participat els autors del CBL ordenat per centres. Si el centre no apareix vol dir que els congressos en el que han participat els seus autors no están buidats a l’SCOPUS.Preprin

Dynamic Anycast Routing and Wavelength Assignment in WDM Networks Using Ant Colony Optimization (ACO)

Abstract—Ant colony optimization (ACO) is a probabilistic technique used for solving complex computational problems, such as finding optimal routes in networks. It has been proved to perform better than simulated annealing and genetic algorithm approaches for solving dynamic problems. ACO algorithms can quickly adapt to real-time changes in the system. In this paper, we propose an ACO-based algorithm to solve the dynamic anycast routing and wavelength assignment (RWA) problem in wavelength-routed optical networks. Using extensive simulations, we show that ACO-based anycast RWA significantly reduces blocking probability compared to the fixed shortest-path first (SPF) and other load-balancing and dynamic algorithms. Keywords: WDM, RWA, anycast, and ACO. I

Dynamic anycast routing and wavelength assignment in WDM networks using ant colony optimization (ACO)

Ant colony optimization (ACO) is a probabilistic technique used for solving complex computational problems, such as finding optimal routes in networks. It has been proved to perform better than simulated annealing and genetic algorithm approaches for solving dynamic problems. ACO algorithms can quickly adapt to real-time changes in the system. In this paper, we propose an ACO-based algorithm to solve the dynamic anycast routing and wavelength assignment (RWA) problem in wavelength-routed optical networks. Using extensive simulations, we show that ACO-based anycast RWA significantly reduces blocking probability compared to the fixed shortest-path first (SPF) and other load-balancing and dynamic algorithms.Peer Reviewe

QoS - Aware content oriented flow routing in optical computer network

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.In this thesis, one of the most important issues in the field of networks communication is tackled and addressed. This issue is represented by QoS, where the increasing demand on highquality applications together with the fast increase in the rates of Internet users have led to massive traffic being transmitted on the Internet. This thesis proposes new ideas to manage the flow of this huge traffic in a manner that contributes in improving the communication QoS. This can be achieved by replacing the conventional application-insensitive routing schemes by others which take into account the type of applications when making the routing decision. As a first contribution, the effect on the potential development in the quality of experience on the loading of Basra optical network has been investigated. Furthermore, the traffic due to each application was dealt with in different ways according to their delay and loss sensitivities. Load rate distributions over the various links due to the different applications were deployed to investigate the places of possible congestions in the network and the dominant applications that cause such congestions. In addition, OpenFlow and Optica Burst Switching (OBS) techniques were used to provide a wider range of network controllability and management. A centralised routing protocol that takes into account the available bandwidth, delay, and security as three important QoS parameters, when forwarding traffics of different types, was proposed and implemented using OMNeT++ networks simulator. As a novel idea, security has been incorporated in our QoS requirements by incorporating Oyster Optics Technology (OOT) to secure some of the optical links aiming to supply the network with some secure paths for those applications that have high privacy requirements. A particular type of traffic is to be routed according to the importance of these three QoS parameters for such a traffic type. The link utilisation, end to end delays and securities due to the different applications were recorded to prove the feasibility of our proposed system. In order to decrease the amount of traffic overhead, the same QoS constraints were implemented on a distributed Ant colony based routing. The traditional Ant routing protocol was improved by adopting the idea of Red-Green-Blue (RGB) pheromones routing to incorporate these QoS constraints. Improvements of 11% load balancing, and 9% security for private data was achieved compared to the conventional Ant routing techniques. In addition, this Ant based routing was utilised to propose an improved solution for the routing and wavelength assignment problem in the WDM optical computer networks