Energy Efficient Clustering and Routing in Mobile Wireless Sensor Network

A critical need in Mobile Wireless Sensor Network (MWSN) is to achieve energy efficiency during routing as the sensor nodes have scarce energy resource. The nodes' mobility in MWSN poses a challenge to design an energy efficient routing protocol. Clustering helps to achieve energy efficiency by reducing the organization complexity overhead of the network which is proportional to the number of nodes in the network. This paper proposes a novel hybrid multipath routing algorithm with an efficient clustering technique. A node is selected as cluster head if it has high surplus energy, better transmission range and least mobility. The Energy Aware (EA) selection mechanism and the Maximal Nodal Surplus Energy estimation technique incorporated in this algorithm improves the energy performance during routing. Simulation results can show that the proposed clustering and routing algorithm can scale well in dynamic and energy deficient mobile sensor network.Comment: 9 pages, 4 figure

Improving Network Lifetime with Connectivity and Coverage in WSN

Coverage of interest points and network connectivity are two main challenging and practically important issues of Wireless Sensor Networks (WSNs). Although many studies have exploited the mobility of sensors to improve the quality of coverage and connectivity, little attention has been paid to the minimization of sensors� movement, which often consumes the majority of the limited energy of sensors and thus shortens the network lifetime significantly. To fill in this gap, this paper addresses the challenges of the Mobile Sensor Deployment (MSD) problem and investigates how to deploy mobile sensors with minimum movement to form a WSN that provides both target coverage and network connectivity. To this end, the MSD problem is decomposed into two sub-problems: the Target Coverage (TCOV) problem and the Network Connectivity (NCON) problem. We then solve TCOV and NCON one by one and combine their solutions to address the MSD problem. The proposed method uses the concept of Network Partition to improve network lifetime and coverage

Maximization of Network Lifetime with Coverage and Connectivity Improvement Using Network Partition

Coverage of interest points and network connectivity are two main challenging and practically important issues of Wireless Sensor Networks (WSNs). Although many studies have exploited the mobility of sensors to improve the quality of coverage and connectivity, little attention has been paid to the minimization of sensors’ movement, which often consumes the majority of the limited energy of sensors and thus shortens the network lifetime significantly. To fill in this gap, this paper addresses the challenges of the Mobile Sensor Deployment (MSD) problem and investigates how to deploy mobile sensors with minimum movement to form a WSN that provides both target coverage and network connectivity. To this end, the MSD problem is decomposed into two sub-problems: the Target Coverage (TCOV) problem and the Network Connectivity (NCON) problem. We then solve TCOV and NCON one by one and combine their solutions to address the MSD problem. The proposed method uses the concept of Network Partition to improve network lifetime and coverage. The combination of the solutions to TCOV and NCON, as demonstrated by extensive simulation experiments, offers a promising solution to the original MSD problem that balances the load of different sensors and prolongs the network lifetime consequently

An information diffusion model in social networks with carrier compartment and delay

With the wide applications of the communication networks, the topic of information networks security is getting more and more attention from governments and individuals. This paper is devoted to investigating a malware propagation model with carrier compartment and delay to describe the process of malware propagation in mobile wireless sensor networks. Based on matrix theory for characteristic values, the local stability criterion of equilibrium points is established. Applying the linear approximation method of nonlinear systems, we study the existence of Hopf bifurcation at the equilibrium points. At the same time, we identify some sensitive parameters in the process of malware propagation. Finally, numerical simulations are performed to illustrate the theoretical results

On Prolonging Network Lifetime through Load-Similar Node Deployment in Wireless Sensor Networks

This paper is focused on the study of the energy hole problem in the Progressive Multi-hop Rotational Clustered (PMRC)-structure, a highly scalable wireless sensor network (WSN) architecture. Based on an analysis on the traffic load distribution in PMRC-based WSNs, we propose a novel load-similar node distribution strategy combined with the Minimum Overlapping Layers (MOL) scheme to address the energy hole problem in PMRC-based WSNs. In this strategy, sensor nodes are deployed in the network area according to the load distribution. That is, more nodes shall be deployed in the range where the average load is higher, and then the loads among different areas in the sensor network tend to be balanced. Simulation results demonstrate that the load-similar node distribution strategy prolongs network lifetime and reduces the average packet latency in comparison with existing nonuniform node distribution and uniform node distribution strategies. Note that, besides the PMRC structure, the analysis model and the proposed load-similar node distribution strategy are also applicable to other multi-hop WSN structures

Minimizing Movement for Target Coverage and Network Connectivity in Mobile Sensor Networks

PublishedJournal Article© 2014 IEEE. Coverage of interest points and network connectivity are two main challenging and practically important issues of Wireless Sensor Networks (WSNs). Although many studies have exploited the mobility of sensors to improve the quality of coverage andconnectivity, little attention has been paid to the minimization of sensors' movement, which often consumes the majority of the limited energy of sensors and thus shortens the network lifetime significantly. To fill in this gap, this paper addresses the challenges of the Mobile Sensor Deployment (MSD) problem and investigates how to deploy mobile sensors with minimum movement to form a WSN that provides both target coverage and network connectivity. To this end, the MSD problem is decomposed into two sub-problems: the Target COVerage (TCOV) problem and the Network CONnectivity (NCON) problem. We then solve TCOV and NCON one by one and combine their solutions to address the MSD problem. The NP-hardness of TCOV is proved. For a special case of TCOV where targets disperse from each other farther than double of the coverage radius, an exact algorithm based on the Hungarian method is proposed to find the optimal solution. For general cases of TCOV, two heuristic algorithms, i.e., the Basic algorithm based on clique partition and the TV-Greedy algorithm based on Voronoi partition of the deployment region, are proposed to reduce the total movement distance ofsensors. For NCON, an efficient solution based on the Steiner minimum tree with constrained edge length is proposed. Thecombination of the solutions to TCOV and NCON, as demonstrated by extensive simulation experiments, offers a promising solutionto the original MSD problem that balances the load of different sensors and prolongs the network lifetime consequently.This work is supported in part by the National Science Foundation of China (Grant Nos. 61232001, 61103203, 61173169, and 61173051), the Major Science & Technology Research Program for Strategic Emerging Industry of Hunan (Grant No. 2012GK4054), and the Scientific Research Fund of Hunan Provincial Education Department (Grant No. 14C0030)

Relay Node Placement and Trajectory Computation of Mobile Data Collectors in Wireless Sensor Networks

Recent research has shown that introducing mobile data collectors (MDC) can significantly improve the performance of wireless sensor networks. There are important design problems in this area, such as determining the number and positions of relay nodes, determining their buffer capacities to ensure there is no data loss, and calculating a suitable trajectory for MDC(s). In this thesis, we first propose an integrated integer linear program (ILP) formulation that calculates the optimal number and positions of the relay nodes with the requisite buffer capacities. We then present two algorithms for calculating the trajectory of the MDC, based on the locations and the load of each individual relay node, in a way that minimizes the energy dissipation of the relay nodes. Our simulation results demonstrate that our approach is feasible for networks with hundreds of sensor nodes and leads to significant improvements compared to conventional data communication strategies