MCBT: Multi-Hop Cluster Based Stable Backbone Trees for Data Collection and Dissemination in WSNs

We propose a stable backbone tree construction algorithm using multi-hop clusters for wireless sensor networks (WSNs). The hierarchical cluster structure has advantages in data fusion and aggregation. Energy consumption can be decreased by managing nodes with cluster heads. Backbone nodes, which are responsible for performing and managing multi-hop communication, can reduce the communication overhead such as control traffic and minimize the number of active nodes. Previous backbone construction algorithms, such as Hierarchical Cluster-based Data Dissemination (HCDD) and Multicluster, Mobile, Multimedia radio network (MMM), consume energy quickly. They are designed without regard to appropriate factors such as residual energy and degree (the number of connections or edges to other nodes) of a node for WSNs. Thus, the network is quickly disconnected or has to reconstruct a backbone. We propose a distributed algorithm to create a stable backbone by selecting the nodes with higher energy or degree as the cluster heads. This increases the overall network lifetime. Moreover, the proposed method balances energy consumption by distributing the traffic load among nodes around the cluster head. In the simulation, the proposed scheme outperforms previous clustering schemes in terms of the average and the standard deviation of residual energy or degree of backbone nodes, the average residual energy of backbone nodes after disseminating the sensed data, and the network lifetime

Optimized path registration with prefix delegation in nested mobile networks

Abstract. As the need for a solution to support mobile network is consistently increasing, NEtwork MObility (NEMO) Basic Support protocol is proposed by using a bi-directional tunnel between a Mobile Router (MR) and its Home Agent (HA). However, the multiple levels of MR-HA tunnels in nested mobile networks lead to significant suboptimal routing, called pinball routing. In this paper we propose a Route Optimization (RO) scheme based on improved Prefix Delegation in order to pass ingress filtering. In an effort to provide the RO based on the improved procedure, it performs an address translation mechanism and a registration procedure to inform other nodes of an optimal path. The proposed scheme supports nested mobile networks without requiring additional tunneling, thus reducing packet overhead and latency with regard to the NEMO basic solution. We evaluate the proposed scheme with previous schemes by analytical models. According to the results, our newly proposed scheme shows 20 % and 50 % of performance improvements for the worst case and the best case, respectively.