Routing for Sink Nodes with Obstacles in Cluster-Based WSN

Routing for Sink Nodes with Obstacles in Cluster-Based WSN

1 Laxmikant Reddi 2 Najam-Al-Saher

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

Navodaya Institute of Technology, Navodaya Institute of Technology, Raichur- 584101 Raichur- 584101

Abstract: In wireless sensor networks (WSNs), the assistance of exploiting the sink mobility to extend network lifetime have been well identified. This paper delivers an energy-efficient routing system stationed on the cluster-based approach considering obstacles for the mobile sink in WSNs. Based on cluster method, the node is elected as a cluster head which collects data from their respective cluster members and forwards the data to the mobile sink. In this paper, the mobile sink initiates the data-gather route periodically from the beginning site, then directly gets data from these cluster heads in a single-hop range, and lastly backs to the initial site. However, having obstacles in WSNs the complexity of the scheduling problem increases the traditional algorithms are difficult to resolve.

1. INTRODUCTION

   Wireless sensor networks (WSNs) have a extensive set of collections. These include sensing data collected from various environments from the sensor devices. Respective sensors forward its data to sink (Base Station), and later sends to the end user. For the Better Data Gathering and scalability in large sensor networks, Clustering is considered to be effective approach. In Wireless Sensor Networks, Clustering is an adequate way of lending scalability and data aggregation. Due to the Presence of many Obstacles in the dense network, WSNs have less Performance. Here we employed RCER algorithm, Based on Geographic locations sensor nodes are clustered. Algorithm identifies an obstacles using message communication between neighboring sensors and it sends data with the help of RCER rule.

   Wireless Technologies re-frames the world of Communications. By first, with Radio transceiver in wireless telegraphy. There by term wireless is evolved in order to describe Wireless broadband (Internet) and Cellular networks. Even though, channel having finite spectrum along with other constraints, affords mobile communications only. Large number of sensor nodes is deployed using Wireless Ad-hoc Networking. Mobile ad-hoc networks (MANET) subsist with wireless devices along with mobile hosts. Due to its broadcasting nature of wireless communication and Omni directional antennae, all hosts receives mobile host

   transmission within its transmission range. If hosts are not within range, in between mobile nodes can forward their message, thus connectivity builds effectively in adhoc networks for all mobile hosts in deployed area.

2. BACKGROUND

   In the paper titled Energy consumption monitoring for sensor nodes in snap the authors communicates that as vitality is one of most urgent viewpoints for ordering calculations' execution, it's vital to get an apparatus to compute the rest of the vitality utilization. There wasn't any fantastic answer for check vitality utilization of each individual sensor hub in remote sensor organize. In this paper, the creators prescribes another continuous vitality observing game plan as a practical nuts and bolts for WSN test bed (sensor arrange right hand stage, SNAP). The creators describes an observing outline which has taking after points of interest: ongoing exact vitality estimation, the ability to adapt to vast scale WSN, checked hubs with free reactions, exceedingly versatile to different sorts of sensor hubs and backings facilitate examination on hubs as for vitality productivity.

   In the paper titled Wireless Sensor Network Platform for Intrinsic Optical Fiber pH Sensors the authors investigates the capability of making a half breed WSN through the development of a nonexclusive remote sensor arrange stage, which gifts for the able coordination of a no. of novel optical fiber (wired) sensors. The intention is to support the capability of a sensor display. A fundamental design comprises of a LED light source, a photodiode, a channel, and an enhancing circuit. In this way, singular bit can proof and process the signs set up from the optical fiber sensors and send those information caught remotely to a base station. To affirm both the mixture discernment and the adequacy of a non specific stage, the model is confirmed utilizing a characteristic pH optical fiber sensor. At the point when the sensor is directed to a scope of arrangements, the information created from the framework are procured at the base station. The viable outcomes accomplished affirm the execution of the plan, and its capacity to give constant optical fiber sensor information observing, handling, and transmission.

3. ALGORITHMS

   1. LEACH Algorithm

      Figure 1: LEACH Algorithm

      LEACH is renowned algorithm for Wireless Sensor Networks since it includes groups and cluster heads for data transmission.Cluster heads are elected randomly. In this major concern in Data transmission power consumption, thus it is required to have powerefficient protocols. In order to curtail the total power consumption within the network.LEACH handles cluster heads in rounds for long distance transmission. Thus we require more efficient algorithm other than LEACH which has less power consumption and better efficiency in energy.

      Disadvantages of LEACH:

      1. The selection of cluster head in LEACH, which elects the head randomly based on lowest battery level because of huge probability that a node has and packets are seized from data transmission.

      2. In LEACH Cluster head maintains local topology i.e., which nodes belongs to which cluster because of this to and fro communication are possible within the nodes from source to base station and vice versa. This results in exponential increase of end to end delay and also curtails energy consumption.

      3. Algorithm doesnt useful in the presence of obstacles during data packet transmission, because of which data packets can move to and fro and get blocked within the network.

   2. GRID Algorithm

   Figure 2: GRID Algorithm

   In the current scenario, the Obstacle aware approach prefers the cluster head based on the nodes residual energy. Initially cluster head elected based on near on the cluster center. Then from next, cluster head is elected based on nodes residual energy.Which has highest energy when compare to other nodes in the network. With this current scenario, 2 routing algorithms were used. First one is based on cluster head routing algorithm and next is based on grid. Cluster head routing approach finds the capable path which involves normal nodes along with cluster heads. Grid routing approach is based on knowledge of obstacle awareness i.e several paths are found with not involving obstacles in the path.

4. RESULTS

   Figure 3: Route from source to destination nodes in GRID

   Figure 4: Performance Hops

   Figure 5: Performance Routing Overhead

   Figure 3 shows route from source to destination node in GRID algorithm.

   Figure 4, 5 and 6 shows the comparison of LEACH and GRID algorithm in terms of number of hops, routing overhead and throughput.

   Figure 6: Performance Throughput

5. CONCLUSION

   The network is divided globally into Hierarchical Network and Non Hierarchical Network. LEACH algorithm belongs to a category of hierarchical network. LEACH discovers the route between sources nodes to destination node with base station being involved in the communication with back and forth propagation for the case of inter cluster communication. EACH algorithm is future simulated to measure the parameters which includes Average Transmission Delay, No. of Hops, Consumption of Energy, No. of Alive Nodes, No. of Dead Nodes, Lifetime Ratio and Routing Overhead. In the Obstacle Aware Approach elects the cluster head stationed on the residual energy of the node. Initially cluster head is selected based on the closeness on the center of the cluster.

6. REFERENCES

1. J. C. Cuevas-Martinez, J. Canada-Bago, J. A. Fernandez- Prieto, and M. A. Gadeo-Martos, “Knowledge-based duty cycle estimation in wireless sensor networks: Application for sound pressure monitoring,'' Appl. Soft Comput., vol. 13, no. 2, pp. 967_980, 2013.

2. H.-L. Fu, H.-C. Chen, and P. Lin, “Aps: Distributed air pollution sensing system on wireless sensor and robot networks,'' Comput. Commun.,vol. 35, no. 9, pp. 1141_1150, 2012.

3. Z. Shen et al., “Energy consumption monitoring for sensor nodes in snap,'' Int. J. Sensor Netw., vol. 13, no. 2, pp. 112_120, 2013.

4. B. Zhou, S. Yang, T. H. Nguyen, T. Sun, and K. T. V. Grattan, “Wireless sensor network platform for intrinsic optical _ber pH sensors,'' IEEE Sensors J., vol. 14, no. 4, pp. 1313_1320, Apr. 2014.

5. M. Dong, X. Liu, Z. Qian, A. Liu, and T. Wang, “QoE- ensured price competition model for emerging mobile networks,'' IEEE Wireless Commun., vol. 22, no. 4, pp. 50_57, Aug. 2015.

6. G. Han et al., “Cross-layer optimized routing in wireless sensor networks with duty-cycle and energy harvesting,'' Wireless Commun. Mobile Comput., vol. 15, no. 16, pp. 1957_1981, 2015.

7. M. Zhao, Y. Yang, and C. Wang, “Mobile data gathering with load balanced clustering and dual data uploading in wireless sensor networks,'' IEEE Trans. Mobile Comput., vol. 14, no. 4, pp. 770_785, Apr. 2015.

8. L. Ji, Y. Yang, and W. Wang, “Mobility assisted data gathering with solar irradiance awareness in heterogeneous energy replenishable wireless sensor networks,'' Comput. Commun., vol. 69, pp. 88_97,Sep. 2015.

9. M. Dong et al., “Mobile agent-based energy-aware and user- centric data collection in wireless sensor networks,'' Comput. Netw., vol. 74, pp. 58_70, Dec. 2014.

10. S. Guo, C. Wang, and Y. Yang, “Joint mobile data gathering and energy provisioning in wireless rechargeable sensor networks,'' IEEE Trans. Mobile Comput., vol. 13, no. 12, pp. 2836_2852, Dec. 2014.

11. W. B. Heinzelman, A. P. Chandrakasan, and H. Balakrishnan, “An application-speci_c protocol architecture for wireless microsensor networks,'' IEEE Trans. Wireless Commun., vol. 1, no. 4, pp. 660_670, Oct. 2002.

12. G. Smaragdakis, I. Matta, and A. Bestavros, “SEP: A stable election protocol for clustered heterogeneous wireless sensor networks,'' in Proc. SANPA, 2004, pp. 1_11.

13. A. W. Khan, A. H. Abdullah, M. A. Razzaque, and J. I. Bangash, “VGDRA: A virtual grid-based dynamic routes adjustment scheme for mobile sink-based wireless sensor networks,'' IEEE Sensors J., vol. 15,no. 1, pp. 526_534, Jan. 2015.

14. O. Cayirpunar, E. Kadioglu-Urtis, and B. Tavli, “Optimal base station mobility patterns for wireless sensor network lifetime maximization,'' IEEE Sensors J., vol. 15, no. 11, pp. 6592_6603, Nov. 2015.

15. F. Tashtarian, M. H. Y. Moghaddam, K. Sohraby, and S. Effati, “On maximizing the lifetime of wireless sensor networks in event-driven applications with mobile sinks,'' IEEE Trans. Veh. Technol., vol. 64, no. 7pp. 3177_3189, Jul. 2015.