Modeling and analysis of multi-hop routing in wireless sensor networks by using matlab

Due to the limited energy and the non-equivalence of wireless sensor network nodes, it is imperative to reduce and rationally use the energy consumption of the nodes to prolong the network lifetime. In this project, a random multi-hop routing approach for wireless sensor networks was modeled and simulated. In order to minimize energy consumption and improve the network lifetime, the simulated protocol depends on the selection of specific sensor nodes to be cluster header for the wireless sensor nodes which receive the packets from other normal sensor nodes randomly and then send it to a base station or Sink. This project classifies the network into two sizes, large size and small size and does compression between both networks when applying this protocol in order to assist the improvement of these networks. Simulation results showed improvement when the network size is changed from a large size to a small size. The lifetime is improved by about 76% that means the number of the round is increased from 80 -333, as well as the end to end delay, is improved around 30% from 180 ns – 280 ns to 100 ns – 170 ns. While for throughput, it is improved 85% from 5x106 bits to 2.5x107 bits. The packet loss also showed the improvement from 12000 to 2500 which means the improvement is about 20.83%. Lastly, the residual energy is improved by 73% approximately 3200 s (1200 s ~ 4400)

Performance Comparison of Heterogeneous EESAA in Two and Three Dimensional Wireless Sensor Networks

Wireless Sensor Network is the network of limited power, computational and storage sensing devices called sensors. These sensors sense and send out data to other sensors present in the network. A considerable amount of energy is dissipated in these tasks. Clustered techniques have been employed to optimize energy consumption in the energy constrained wireless sensor networks. The paper presents analysis of heterogeneous Energy Efficient Sleep Awake Aware (EESAA) Intelligent Sensor Network Routing Protocol in three dimensional spaces of a WSN in order to prolong the network lifetime. The reason behind 3D space, instead of 2D plane is its feasible and practical equivalence to the real world

Metric Dimension for Gabriel Unit Disk Graphs is NP-Complete

We show that finding a minimal number of landmark nodes for a unique virtual addressing by hop-distances in wireless ad-hoc sensor networks is NP-complete even if the networks are unit disk graphs that contain only Gabriel edges. This problem is equivalent to Metric Dimension for Gabriel unit disk graphs. The Gabriel edges of a unit disc graph induce a planar O(\sqrt{n}) distance and an optimal energy spanner. This is one of the most interesting restrictions of Metric Dimension in the context of wireless multi-hop networks.Comment: A brief announcement of this result has been published in the proceedings of ALGOSENSORS 201

Study on the Rough-set-based Clustering Algorithm for Sensor Networks

The traditional clustering algorithm is a very typical level routing algorithm in wireless sensor networks (WSN). On the basis of the classical LEACH (Low Energy Adaptive Clustering Hierarchy) algorithm, this paper proposes an energy efficient clustering algorithm in WSN. Through the introduction of rough set, the new algorithm mainly introduces how to confirm an optimized strategy to choose the cluster head effectively by the simplified decision table. That is to say, by discrete normalized data preprocessing of attribute value, getting discretization decision table. Finally, the results from simulated experiments show that the clustering algorithm based on rough set theory can optimize the clustering algorithm in network data. That is to say, the rough-set-based clustering algorithm can effectively choose the cluster head, balance the energy of the nodes in the cluster and prolong the lifetime of sensor networks