## 2 Related Works  
The Flooding Protocol is a routing algorithm to distribute information of the nodes to every node in the neighborhood [13]. Each node is aware of the identities of its neighbors. Naive Flooding is a Flooding algorithm wherein each node first receives a packet, then transmits it to the neighbors. In Controlled Flooding, certain nodes are designed as transmitter nodes, which are strategically placed on the lattice. These nodes, upon receiving a packet, transmit it to the neighbors. Random Walk is a Flooding algorithm in which each node, upon first receiving a packet from a neighbor, transmits it to the neighbors, and designates one in three neighbors as the next transmitter. In Random Flooding, each node, upon receiving a packet, transmits it with probability p (0, 1). All subsequent receptions of the same packets are ignored by the node.  
A family of adaptive protocols is proposed by [PERSON] _et al_. [14; 15] and is called Sensor Protocols for Information via Negotiation (SPIN). It broadcasts the information of the nodes to every node in the network. In this protocol, every node is a potential base station within the network. This property causes the users to request from the nodes and fetch the needed information.  
[PERSON] _et al._ proposed a popular data aggregation sample for WSN, which is called directed diffusion [16]. Directed diffusion is presented according to the Data Centric (DC) paradigm. In DC, data coming from different sources are combined by eliminating redundancy and minimizing the number of transmissions. The events are measured by sensors in directed diffusion.  
Another routing protocol is energy aware routing [17], which aims at increasing the network lifetime. This protocol is similar to directed diffusion, but it differs in the sensing operation: it memorizes a set of paths instead of memorizing and performing one optimal path.  
Low Energy Adaptive Clustering Hierarchy (LEACH) [18] is a hierarchical clustering algorithm, meaning that it is a cluster based protocol, and has distributed cluster information. A few nodes are selected as cluster head (CH) nodes and compress data arriving from nodes that are in the respective cluster.  
The Threshold-Sensor Energy Efficient Sensor Network (TEEN) and Adaptive Periodic Threshold-Sensor Energy Efficient Sensor Network (APTEEN) are both proposed for time critical applications [19; 20]. In the TEEN protocol, network nodes sense the environmental data continuously, but transmission of the sensed data is done in discrete times. In fact, when there is a small change in the sensed value, the node switches on its transmitter for transmitting the sensed parameter. Thus, threshold value tries to reduce the number of data transmission by sending data in a defined range. On the other hand, APTEEN is a protocol that uses periodicity, meaning threshold values for the TEEN protocol change scarcely.  
There is a routing protocol that calculates the efficient energy of sub-network. This protocol is called the Minimum Energy Communication Network (MECN), which is used in sensor networks and utilizes low power GPS [21]. Some routing protocols are proposed for the sensor network, including energy-efficient multipath routing [22], Small Minimum Energy Communication Network (SMECN) [23], Self Organizing Protocol (SOP) [24], Sensor Aggregates Routing [25], Hierarchical Power-Aware Routing (HPAR) [26], Geographic Adaptive Fidelity (GAF) [27], Geographic and Energy Aware Routing (GEAR) [28], SPAN [29], the Greedy Other Adaptive Face Routing (GOAFR) [30], _etc._