Mobile elements have shown the advantages in wireless sensor networks not only in data collection and transmission but also in the field of region coverage. The mobile sensor nodes (MSNs) whose mobility is controlled, visits the predetermined locations and collects the environmental information as per the procedure called MSNs traversal algorithms. The major performance bottleneck in MSNs is the energy source which is impractical to replace after the deployment. In random deployment, single or a group of MSNs may fall at the same location or at different locations, whose starting positions of traversal and traversal paths may differ from the preplanned. This work formulates the problem of scheduling the MSNs in distributed manner so that the entire region is covered without coverage holes with minimum energy depletion. Finally, some computationally practical algorithms for multiple MSNs with fault and non-fault tolerant support are presented and their performances compared.

Mobile sensor nodes scheduling for bounded region coverage

Mobile multihop communication network is an important branch of modern mobile communication system, and is an important technical support for ubiquitous communication. The random movement of the nodes makes the networking be more flexible, but the frequently changing topology will decrease the link duration between nodes significantly, which will increase the packets loss probability and affect the network communication performance. Aiming at the problem of declining link duration caused by nomadic characteristics in mobile multihop communication network, four link duration models for possible moving states are established based on different features in real networking process in this paper, which will provide reliable criterion for the optimal routing selection. Model analysis and simulation results show that the reliable route established by the proposed model will effectively extend the link duration, and can enhance the global stability of the mobile multihop information transmission, so as to provide new option to transmission reliability improvement for the mobile communication network.

Research on link duration for mobile multihop communication networks

Safe and reliable Wireless Sensor Network (Wireless Sensor Networks, WSN) is an important branch of modern communication systems, and plays an important role in the life and production, especially in some critical fields. However, a large number of network attacks will threaten the data security, which will seriously affect network reliability and will greatly reduce the use value of wireless sensor networks. For network security issues, security model for Low-energy Consumption Tree Routing (LCTR) protocols has been proposed in this paper to provide reliable guarantee to achieve authentication and data integration using Message Authentication Code (MAC) or Digital Signature (DS) techniques. Research will devote to assess the implementation results and energy consumption of the common message authentication code and digital signature technology in tree routing protocol, so as to provide new option to security improvement for the wireless communication network.

Research on Low-energy Consumption Tree Routing security for Wireless Sensor Networks

In this work a rectangular Region of interest (ROI) is covered with Mobile Sensor Nodes (MSNs) using coverage based pattern of movement. ROI is divided into equilateral triangles and squares in tesselation fashion to provide complete coverage without coverage holes. MSNs are moved along the vertices of polygons to have optimized movement cost. All MSNs should travel an approximately equal distance, otherwise the MSN which travels longer distance depletes more energy compared to the MSN which travels shorter distance. We show that, the ROI partition in tessellation fashion is application specific and plays a great role in uniform energy depletion of the MSNs during the traversal. An improper partition may lead to an unbalanced movement cost and non-uniform residual energy.

Mobile sensor node traversal schemes using coverage based pattern movement with uniform energy depletion

Mobile sensor nodes (MSNs) are equipped with locomotive can move around after having been deployed. They are equipped with limited energy. A large portion of energy is drained during the traversal. In order to extend the life time of a MSN, the traveling distance must be minimized. Region of interest (ROI) is covered with multiple MSNs using coverage based pattern movement. When a group of MSNs are deployed to cover a given ROI, all the deployed MSNs should travel an approximately equal distance. Otherwise, the MSN which travels longer distance depletes more energy compared to the MSN which travels a shorter distance. In this work we show that, ROI partition plays great role in hole free coverage and makes the MSNs have optimized movement cost with fault tolerant support.

/pdf/fault-tolerant-mobile-sensor-node-traversal-schemes-based-on-2u8vs9o4ii.pdf

Fault Tolerant Mobile Sensor Node Traversal Schemes Based on Hexagonal Coverage

Mobile sensor nodes are featured with node mobility along with standard sensor functions. They can move around after being deployed. In many situations placement of static sensor nodes might not be possible and human intervention is not feasible. Mobile sensor nodes are very useful in such hazardous and disastrous situations. When a group of mobile sensor nodes are deployed to cover an area for search operations, coordination among the deployed nodes is very important. A mobile sensor node (MSN) depletes more energy during the traversal. Whenever there arises a failure, in one of the deployed mobile sensor nodes, the remaining fault-free mobile sensor nodes should travel to cover the remaining uncovered area. In this work we propose a Mobile Traversal Algorithm (MTA), for mobile sensor nodes to cover a rectangular region of interest (ROI). It makes MSNs to travel shorter distances to extend effective operational duration of the network and also to provide fault tolerance mechanism.

R. J. D’Souza

Papers

Optimal 1-coverage by homogeneous mobile sensor nodes using hexagonal scheme

Mobile sensor node traversal schemes using coverage based pattern movement with uniform energy depletion

Fault Tolerant Mobile Sensor Node Traversal Schemes Based on Hexagonal Coverage