A study on IP-based hierarchical routing strategy in network simulation

The intrinsic routing policy of NS2—a network simulation tool— based on flat or hierarchical address has the disadvantage such as small topology scale,high resource consumption,low efficiency and so on.This paper proposes an IP based hierarchical routing strategy in network simulation to extend the topology scale and improve performance in simulating.Firstly,a stratification mechanism to identify IP address of nodes is described.Then,an algorithm of packet transmitting method(PTM) is presented for packet forwarding in the same subnet.Finally,algorithms of region partition(RP),routing computation based on region division(RCBRD) and routing distribution(RD) is proposed to implement regional segmentation,route calculation and route distribution for forwarding packets in different subnets respectively.The experiment results show that under the same condition,compared with plane address,the topology scale of the network simulation is extended two times and the consumption of time and memory during simulation is reduced by approximately 73%and 45.8% respectively.Compared with hierarchical address,the topology scale of the network simulation is expanded by more than 50%,and the consumption of time and memory is reduced by about 59.2% and 25% respectively.In addition,along with the growth of the node size,the proportion of reducing total simulation time and memory consumption would gradually increase.

Incremental Linear Discriminant Analysis Dimensionality Reduction and 3D Dynamic Hierarchical Clustering WSNs

Optimizing the sensor energy is one of the most important concern in Three-Dimensional(3D)Wireless Sensor Networks(WSNs).An improved dynamic hierarchical clustering has been used in previous works that computes optimum clusters count and thus,the total consumption of energy is optimal.However,the computational complexity will be increased due to data dimension,and this leads to increase in delay in network data transmission and reception.For solving the above-mentioned issues,an efficient dimensionality reduction model based on Incremental Linear Discriminant Analysis(ILDA)is proposed for 3D hierarchical clustering WSNs.The major objective of the proposed work is to design an efficient dimensionality reduction and energy efficient clustering algorithm in 3D hierarchical clustering WSNs.This ILDA approach consists of four major steps such as data dimension reduction,distance similarity index introduction,double cluster head technique and node dormancy approach.This protocol differs from normal hierarchical routing protocols in formulating the Cluster Head(CH)selection technique.According to node’s position and residual energy,optimal cluster-head function is generated,and every CH is elected by this formulation.For a 3D spherical structure,under the same network condition,the performance of the proposed ILDA with Improved Dynamic Hierarchical Clustering(IDHC)is compared with Distributed Energy-Efficient Clustering(DEEC),Hybrid Energy Efficient Distributed(HEED)and Stable Election Protocol(SEP)techniques.It is observed that the proposed ILDA based IDHC approach provides better results with respect to Throughput,network residual energy,network lifetime and first node death round.

Fuzzy Based Adaptive Clustering to Improve the Lifetime of Wireless Sensor Network

The objective of the recently proposed fuzzy based hierarchical routing protocol F-SCH is to improve the lifetime of a Wireless Sensor Network. Though the performance of F-SCH is better than LEACH, the randomness in CH selection inhibits it from attaining enhanced lifetime. CBCH ensures maximum network lifetime when CH is close to the centroid of the cluster. However, for a widely distributed network, CBCH results in small sized clusters increasing the inter cluster communication cost. Hence, with an objective to enhance the network lifetime, a fuzzy based two-level hierarchical routing protocol is proposed. The novelty of the proposal lies in identification of appropriate parameters used in Cluster Head and Super Cluster Head selection. Experiments for different network scenarios are performed through both simulation and hardware to validate the proposal. The performance of the network is evaluated in terms of Node Death. The proposal is compared with F-SCH and the results reveal the efficacy of the proposal in enhancing the lifetime of network.

Orthogonal Stacked Spectral Coding Labels for Fast Packets Routing over Optical MPLS Network

Multi-protocol label switching（MPLS） has the advantage of high efficiency in the second layer, which improves the performance of data packets routing. In this paper, a new structure to implement optical MPLS is proposed. We construct a code family for spectral-amplitude coding（SAC） labels in the optical MPLS networks. SAC labels are suitable for optical packet switching because they can be constructed and recognized quickly at each router. We use the label stacking to provide hierarchical routing to avoid swapping labels at each forwarding node and reduce system complexity. However, the phase-induced intensity noise（PIIN） appears due to the incoherent property of the light source when the stacked labels set makes the correlation decoding with the local node label,which degrades system performance.

Steadfast Energy Proficient Sensor Node Activation System in Wireless Networks Lifetime Enhancement

The wireless sensor network (WSN) is one of the budding exploring areas and fast rising fields in wireless communications. The sensor nodes in the network are generally small-size, low-cost, low-power and multi-function capabilities. Wireless sensor networks (WSNs) are used for various applications;since numerous sensor nodes are usually deployed on remote and inaccessible places, the employment and preservation should be easy and scalable. Sensor nodes in the field being run out of energy quickly has been an issue and many energy efficient routing protocols have been proposed to solve this problem and preserve the long life of the network. This paper work proposes a hierarchical based node activation routing technique which shows energy efficiency. This technique selects cluster head with highest residual energy in each communication round of transmission to the base station from the cluster heads. Hierarchical based node activation routing technique with different levels of hierarchy simulation results prolongs the lifetime of the network compared to other clustering schemes and communication rounds of simulation increase significantly.

QoS multicast routing protocol in hierarchical wireless MANET

A wireless MANET is a self-configurable network in which mobile, battery-powered devices dynamically create and change the network topology without relying on any intrastructure or administrative support. It offers unique benefits for certain environments, but there are still several open issues to be resolved before realizing these benefits, including QoS routing, multicasting, and mobility management. Specifically, an efficient QoS multicast routing protocol is needed, This paper presents a hierarchical QoS multicast routing protocol （QMRP） for mobile ad hoc networks. It can provide QoS-sensitive routes in a scalable and flexible way, in the network environment with mobility. In the proposed QMRP scheme, each local node only needs to maintain local multicast routing information and/or summary information of other clusters （or domains） but does not require any global ad hoc network states to be maintained. The QMRP also allows any ad hoc group member to join/leave the multicast group dynamically and supports multiple QoS constraints. This paper presents formal description and main procedures for realizing routing decision process of the QMRP and the proof of correctness and complexity analysis of the protocol. The performance measures of QMRP are evaluated using simulation. The simulation results verify the efficiency and availability of QMRP.

Load balance in hierarchical routing network

In this article,the problem of load balance in hierarchical routing network is studied.Since conventional shortest path first（SPF） algorithm over aggregated topology in hierarchical routing network may result in worse routing performance,a traffic sharing path selection algorithm and a variable weight scheme are put forward for hierarchical routing network,which can equilibrate the utilities of link resources and reduce the blocking probability of connections with the improvement on survivability.Simulations are conducted to evaluate proposed variable weight and traffics balance（VWTB） algorithm,which combines traffic sharing and variable weight.From the simulation results,it can be found that the proposed VWTB algorithm can balance the traffics and equilibrate the utilities of link resources significantly.