Hierarchical Routing Architecture Research Articles

Energy Efficient Routing Technique for Wireless Sensor Networks Using Ant-Colony Optimization

Wireless sensor networks (WSN) consists of numerous number of nodes fitted with energy reserves to collect large amount of data from the environment on which it is deployed. Energy conservation has huge importance in wsn since it is virtually impossible to recharge the nodes in their remote deployment. Forwarding the collected data from nodes to the base station requires considerable amount of energy. Hence efficient routing protocols should be used in forwarding the data to the base station in order to minimize the energy consumption thereby increasing the life-time of the network. In this proposed routing protocol, we consider a hierarchical routing architecture in which nodes in the outer-level forwards data to the inner-level nodes. Here we optimized the routing path using ant-colonies where data moves along minimal congested path. Further, when ant-colony optimization is used, certain cluster-head nodes may get overloaded with data forwarding resulting in early death due to lack of energy. To overcome this anomaly, we estimated the amount of data a neighboring Cluster-head can forward based on their residual energy. We compared the energy consumption results of this proposed Routing using Ant Colony Optimization (RACO) with other existing clustering protocols and found that this system conserves more energy thereby increasing lifetime of the network.

Performance Evaluation and Optimization of Hierarchical Routing in SDN Control Plane

In Software defined networking (SDN), distributed control plane is becoming a promising solution to tackle with scalability and performance. We propose a tree-like hierarchical routing architecture which employs the divide-and-conquer strategy to enhance routing performance on the distributed control plane. To evaluate and optimize the performance of the hierarchical architecture, we apply queuing theory to modeling routing request arrival and processing, and derive an explicit expression of the routing response time. Then we formulate the resource allocation problem in the hierarchical architecture as an optimization problem whose objective is to minimize the response time subject to queue stability and resource constraints. Using the Karush- Kuhn-Tucker (KKT) condition we obtain the optimal resource allocation policy. Based on that, we theoretically prove that the response time under the hierarchical routing architecture is strictly less than that under the Peer to peer (P2P) architecture. Finally, we perform numerical analyses to confirm the conclusions.

Hierarchical Address Event Routing for Reconfigurable Large-Scale Neuromorphic Systems.

We present a hierarchical address-event routing (HiAER) architecture for scalable communication of neural and synaptic spike events between neuromorphic processors, implemented with five Xilinx Spartan-6 field-programmable gate arrays and four custom analog neuromophic integrated circuits serving 262k neurons and 262M synapses. The architecture extends the single-bus address-event representation protocol to a hierarchy of multiple nested buses, routing events across increasing scales of spatial distance. The HiAER protocol provides individually programmable axonal delay in addition to strength for each synapse, lending itself toward biologically plausible neural network architectures, and scales across a range of hierarchies suitable for multichip and multiboard systems in reconfigurable large-scale neuromorphic systems. We show approximately linear scaling of net global synaptic event throughput with number of routing nodes in the network, at 3.6×107 synaptic events per second per 16k-neuron node in the hierarchy.

Routing with off-network control: a novel paradigm for scalable design in very large sensor networks

This paper presents a novel architectural solution to address the problem of scalable routing in very large sensor networks. The control complexities of the existing sensor routing protocols, both flat and with traditional hierarchy, do not scale very well for large networks with potentially hundreds of thousands of embedded sensor devices. This paper develops a novel routing solution Off-Network Control Processing (ONCP) that achieves control scalability in large sensor networks by shifting certain amount of routing functions "off-network". This routing approach, consisting of "coarse grain" global routing, and distributed "fine grain" local routing is proposed for achieving scalability by avoiding network-wide control message dissemination. We present the ONCP architectural concepts and analytically characterize its performance in relation to both flat and traditional hierarchical sensor routing architectures. We also present ns2-based experimental results which indicate that for very large networks, the packet drop, latency and energy performance of ONCP can be significantly better than those for flat sensor routing protocols such as Directed Diffusion and cluster-based traditional hierarchical protocols such as CBRP.

Hierarchical Cluster Routing in Mobile Multihop Networks

Mobile multihop networks are collections of entirely mobile nodes that have no fixed infrastructure or central controlling mechanism for routing or location management. In this paper, routing protocols based on a hierarchical clustering architecture are proposed. The basic idea is to partition the network into clusters and define routing mechanisms within and between clusters using a hierarchical architecture. The main advantage of this architecture is efficient routing and reduced communication and computational overhead. Simulation experiments indicated that the proposed hierarchical cluster-based routing architecture performs well in relatively low mobile networking environment. 1 Lecturer, Department of Computer Sciences, Faculty of Science, University of Swaziland, P/B 4, Kwaluseni, Swaziland