Minimum Hop Routing Wireless Sensor Networks Based on Ensuring of Data Link Reliability

The traditional wireless sensor networks based on minimum hop routing (MHR) protocol have the disadvantage of short stable period of minimum hop gradient field (MHGF), this would lead to the data sinking unreliable easily. In this paper, in order to improve the reliability of data sinking, a minimum hop routing wireless sensor network based on link reliability guaranteed (MHR-LR) is proposed. In the MHGF setting up process in MHR-LR networks, by limiting the level width of MHGF to ensure that any node has enough downstream source-side neighbors, namely the upstream destination-side neighbors. The stable period of MHGF is extended, and the reliability of data aggregation is improved, meanwhile the communication overhead is not increased by taking low cost information as the basis for MHGF level space controlling. The results of theoretical analysis and simulation prove the effectiveness of the method.

I. INTRODUCTION

Wireless sensor networks (WSN) have the characteristics of dynamic topology and strictly constrained node resources, especially the energy resource. Because of the dynamic topology, it is required that the data acquisition and data transmission in WSN must have sufficient redundancy to ensure the reliability. Redundant acquisition often depends on the densely distribution of nodes, and redundant transmission often rely on multi-path to transport the same data packet at the same time. However, strictly constrained energy resource makes it necessary that the total number of data packets forwarded in the data transmission process should be as small as possible in order to save energy and prolong the network lifetime. Data sinking is a main form in wireless sensor networks' data transporting in typical MHR wireless sensor networks, data aggregation is implemented along the MHGF composed of different gradient levels, and the level space is decided by nodes' effective communication radius (Re). The nodes within the same gradient level have the same value of minimum hop count (MHC) to the sink node, which referred to as the node's hop count value (HC). The dividing line between the neighboring levels forms the gradient level boundary. According to the direction of data gathering, the nodes in MHGF can be classified into on-bound node, outbound node and in-bound node. For some a MHGF level, the boundary near to the sink is called inner boundary, and the boundary far from the sink is called outer boundary. An on-bound node is a node located just on the outer boundary; an in-bound node is a node located near to the inner boundary; and an out-bound node is a node located near to the outer boundary. The relation between MHGF boundary and node in some a level of MHGF, for example, the 3^rd level, is displayed in Figure 1. Figure 1. MHGF level, boundary and node