Relay Node Selection in Wireless Sensor Networks using Opportunistic Routing Algorithm

Relay Node Selection in Wireless Sensor Networks using Opportunistic Routing Algorithm

Sachin Kumar Rais Fatima Sadaf

Asst.Prof., Dept. of ECE, PG Student,

Navodaya Institute of Technology, Navodaya Institute of Technology,

Raichur – 584101 Raichur – 584101

Abstract: As we are aware the there is limited rechargeable power in the sensor nodes we must design the routing protocol in such a way that we can obtain optimum energy saving. Henceforth we are focusing here on the minimization of the energy utilization in the wireless sensor networks and also increasing the network lifetime. Here we follow the principle of opportunistic routing wherein we consider that the multihop relay decision is made based on the comparison of energy of the sensor nodes and also the distance to the sink. Specifically, an Energy Saving via Opportunistic Routing (ENS_OR) algorithm is designed to provide minimum power cost during transmission and also providing protection to those nodes having low residual energy, therefore improving the network performance.

1. INTRODUCTION

   There is wide range of application of wireless sensor network in the field of medical care, robotic exploration and surveillance of agriculture. Development in the field ofelectronics and wireless communication has enabled us to develop wireless sensor nodeshaving low power, low cost and multifunctional characteristics in a integrated manner. InWSN senor nodes are distributed in harsh land areas and in most of the cases it is alaborious task to recharge the energy of the nodes via replacement of batteries. The main job of sensor nodes is to collect the data and transmit it to the desired receiver. Much of the energy is consumed during transmission of the data than during collection of data. In order to get better energy efficiency throughout data transmission the majority of the routing protocols lean to find the minimum energy path between the source and sink to achieve optimal consumption of energy. In WSN the design of efficient energy routing protocol is a tedious task, since it not only includes the discovery of minimum energy path from the source to destination but also must take into account how the distribution ofenergy is balance in the whole sensor network. Moreover, network partition and unpredictable wireless links may cause the loss of data packets and cause multiple retransmissions in a preselected good transmission path. Retransmission of packets overthe preselected good path certainly causes a significant increase in energy cost of thenetwork. So for efficient WSN appropriate proportion must be there between reducing network time and reducing energy consumption. For1-D queue network an energy efficient algorithm is designed in this project. Forselecting relay nodes based on the opportunistic routing theory, for saving the energy,improving the network lifetime and to obtain optimal transmission path from source tosinkenergy

   saving via opportunistic routing (ENS_OR) algorithm is used.

2. BACKGROUND

   In the paper titled An energy-balanced routing method based on forward-aware factor for wireless sensor networks, the authors propose that wireless sensor networks have become an important field of research especially in industrial applications over the past few decades. Designing of a routing protocol has become essential for effective data transmission, as a result of the way that there is constrained vitality and correspondence capacity of sensor hubs. The idea of vitality adjusted steering strategy in view of forwardmindful component (FAF-EBRM) is proposed in this paper. In FAF-EBRM, the familiarity with connection weight and forward vitality thickness is the criteria behind choosing the following jump. In the examinations, FAF-EBRM is entrusted and LEACH and EEUC, comes about demonstrate that FAF- EBRM has great execution attributes contrasted with LEACH and EEUC, adjusting the vitality utilization, drags out the capacity lifetime andgives high caliber of administration to the remote system.

   In the paper titled Opportunistic routing for wireless ad hoc and sensor networks: resent and future directions, the authors propose that Opportunistic improves the performance of wireless sensor networks and wireless ad hoc networks therefore, it is gaining much attention in the field of research. In opportunistic routing method, the intermediatenodes collaborate in a consistent and localized manner for forwarding the data packet. Theadvantage of the broadcast nature of the wireless network is utilized by the opportunistic algorithm in order to increase the network throughput and transmission reliability.

3. ALGORITHMS

   1. MTE Algorithm

      Figure1: MTE Algorithm

      Minimum Transmission Energy (MTE) algorithm first determines the set of neighbors, from each neighbor to destination a single route is determined which gives the path based on random selection process so that the route is undeterministic. Then a route which consumes minimum transmission energy is chosen as the best route.

      Disadvantages of MTE:

      • MTE Algorithm finds randomized routes. During the forward node pick there are chances that the same node is picked multiple times.

      • The End to End Delay is very high.

      • Energy consumption is very high.

   2. ENS_OR Algorithm

   Figure2: ENS_OR Algorithm

   The algorithm places the EEN nodes at regular intervals (distances) towards the sink. The source node will find neighbors. If the sink is found in the neighbors range then the process is stopped and the packet is transmitted to the sink. Otherwise it picks the forward neighbor which is closer to relay node and has maximum residual energy. The procedure is repeated until a relay node is reached or destination is reached.

   Advantages of ENS_OR:

   at regular intervals in the network so that any node can transmit to relay node and then the data can reach the sink.

   • The transmission range is also adjusted dynamically based on the residual energy for the nodes in the network.

4. RESULTS

   Figure3: Best route discovered using ENS_OR

   Figure 4: Residual Energy

   Figure 5: Throughput

   Figure 6: Number of Hops

   Figure 3 shows the best route discovered using ENS_OR algorithm.

   Figure 4, 5 and 6 shows the comparison of MTE and ENS_OR algorithm in terms of residual energy,throughput and number of hops.

5. CONCLUSION

   In our day to day life wireless sensor networks are being widely used for controlling and monitoring due to its favourable features, such as low cost, low power, easy implementation, and maintenance. However, most of sensor nodes have limited non rechargeable battery power. Therefore designing a routing protocol in WSN, energy savings optimization becomes the top priority. For 1-D queue network reduction of energy consumption and improvement of network lifetime is focussed. For this matter, we employ opportunistic routing theory in order to optimize the network energy efficiency, by considering the distance of all the sensor nodes to the sink and also the residual energy of all nodes. This will increase the network

   lifetime. In this project energy efficient opportunistic routing strategy with minimum network cost and proctection of nodes from low residual energy is achieved. Simulation results show that the above described method ENS_OR gives significant improvement in preserving the energy of the network as compared with other existing routing algorithms.

6. REFERENCES

1. D. Bruckner, C. Picus, R. Veik,W. Herzner, and G. Zucker, Hierarchical semantic processing architecture for smart sensors in surveillance networks, IEEE Trans. Ind. Informat., vol. 8, no. 2, pp. 291301, May 2012.

2. D. Hoang, P. Yadav, R. Kumar, and S. Panda, Real-time implementation of a harmony search algorithm-based clustering protocol for energy efficient wireless sensor networks, IEEE Trans. Ind. Informat., vol. 10,no. 1, pp. 774783, Feb. 2014.

3. D. Zhang, G. Li, K. Zheng, X. Ming, and Z.-H. Pan, An energy- balanced routing method based on forward-aware factor for wireless sensor networks,IEEE Trans. Ind. Informat., vol. 10, no. 1, pp. 766773, Feb.2014.

4. F. Ren, J. Zhang, T. He, C. Lin, and S. K. Ren, EBRP: Energybalanced routing protocol for data gathering in wireless sensor networks,IEEE Trans. Parallel Distrib. Syst., vol. 22, no. 12, pp. 21082125,Dec. 2011.

5. A. Behnad and S. Nader-Esfahani, On the statistics of MFR routing in one-dimensional ad hoc networks, IEEE Trans. Veh. Technol., vol. 60,no. 7, pp. 32763289, Sep. 2011.

6. P. Santi and D. M. Blough, The critical transmitting range for connectivity in sparse wireless ad hoc networks, IEEE Trans. Mobile Comput.,vol. 2, no. 1, pp. 2539, Jan./Mar. 2003.

7. V. Ramaiyan, A. Kumar, and E. Altman, Optimal hop distance and power control for a single cell, dense, ad hoc wireless network, IEEETrans. Mobile Comput., vol. 11, no. 11, pp. 16011612, Nov. 2012.

8. S. Dulman, M. Rossi, P. Havinga, and M. Zorzi, On the hop count statistics for randomly deployed wireless sensor networks, Int. J. SensorNetw., vol. 1, no. 1, pp. 89102, 2006.

9. Y. Keshtkarjahromi, R. Ansari, and A. Khokhar, Energy efficient decentralized detection based on bit-optimal multi-hop transmission in onedimensional wireless sensor networks, in Proc. Int. Fed. Inf. Process.Wireless Days (WD), 2013, pp. 18.

10. H. Liu, B. Zhang, H. T. Mouftah, X. Shen, and J. Ma, Opportunistic routing for wireless ad hoc and sensor networks: Present and future directions, IEEE Commun. Mag., vol. 47, no. 12, pp. 103109, Dec.2009.

11. S. Biswas and R. Morris, Exor: Opportunistic multi-hop routing for wireless networks, in Assoc. Comput. Mach. SIGCOMM Comput.Commun. Rev., 2005, vol. 35, no. 4, pp. 133144.

12. M. Zorzi and R. R. Rao, Geographic random forwarding (geraf) for ad hoc and sensor networks: Multihop performance, IEEE

    Trans. Mobile Comput., vol. 2, no. 4, pp. 337348, Oct./Dec. 2003.

13. L. Cheng, J. Niu, J. Cao, S. Das, and Y. Gu, Qos aware geographic opportunistic routing in wireless sensor networks, IEEE Trans. Parallel Distrib. Syst., vol. 25, no. 7, pp. 18641875, Jul. 2014.