Energy Efficient Dynamic Routing Mechanism (EEDRM) with Obstacles in WSN
- PDF / 2,504,075 Bytes
- 16 Pages / 439.37 x 666.142 pts Page_size
- 16 Downloads / 315 Views
Energy Efficient Dynamic Routing Mechanism (EEDRM) with Obstacles in WSN Sharmila Selvaraj1 · Saranya Vasanthamani1
© Springer Science+Business Media, LLC, part of Springer Nature 2020
Abstract In Wireless Sensor Networks, the in-built energy and processing capacity of sensors should be reliably used to ensure effective use of resources. The major pitfalls in WSN include network lifetime management, energy management and Obstacle avoidance. The paramount aim of proposed EEDRM protocol is to deliver better network efficiency thus uses the concept called clustering of sensor nodes. Cluster Heads are chosen based on energy, distance between cluster head (CH) and sink. Mobility enables high resource usage, hence in proposed work Cluster Heads are made mobile and routes in computed path. Obstacles in sensing environment is an important thing to be considered. EEDRM is designed in a way that it resists obstacles using travelling salesman problem, Hamiltonian Circuit algorithms and with the help of binary grid pattern in sensing environment. Data latency is reduced as CH is available all the time for receiving data from CM inside Cluster and all CH are independent to each other so data collected by CH will be transferred dynamically to the sink. Based on Obstacle avoidance model and node states an FSM is constructed using hidden Markov model. The increased network lifetime and throughput of EEDRM is analysed and compared with M-GEAR protocol. Analysis comes out with the result that EEDRM is 1.82 times better than M-GEAR and 3.92 times better than LEACH ME in terms of throughput and in terms of network lifetime EEDRM outperforms M-GEAR by 1.2 times and LEACH ME by 1.54 times. Keywords Sensor node · Energy efficiency · Network lifetime · Obstacle · Sink · Clustering · Algorithm
* Sharmila Selvaraj [email protected] Saranya Vasanthamani [email protected] 1
Department of Information Technology, Sri Krishna College of Engineering and Technology, Coimbatore, Tamil Nadu, India
13
Vol.:(0123456789)
S. Selvaraj, S. Vasanthamani
1 Introduction The network which is formed with the organisation of tiny sensors which have in-built processing power for measuring environmental behaviour connected over a wireless medium is mentioned as Wireless Sensor Networks (WSNs). The way in which environmental characteristics are measured has been changed over years. In past, different sensors with processing capability are placed near the Region of Interest (RoI) and connected to the central base station through wired medium. But now a days a concept called WSN are used to process sensed data from huge range of sensors in accurate manner without the need of any physical medium. Routing is the process of selecting data transmission path in a network across huge number of systems, due to the technological development there exists numerous amounts of routing algorithms [1–5]. Clustering takes important part in data transmission. Clustering algorithms differs in the way of selection of Cluster Head (CH) [6–9]. The reaso
Data Loading...
