IJETR032250
IJETR032250
IJETR032250
426 www.erpublication.org
A Maximum Sensing Range Bounded Energy Node Selection Approach to Optimise in WSN
distribution of nodes is not uniform, optimal In addition to the above resource constraints, WSNs pose
clustering becomes necessary to allow connectivity many other challenges, one of which is large scale of network
and enable energy efficient network operation. deployment. Heterogeneity of nodes is also an important issue
for WSNs. Another challenge is network longevity and
5. Network characteristics and unreliable robustness. Furthermore, adaptation to environmental
environment: A sensor network usually operates in changes is also essential for WSNs (Yu, Niyogi, Mehrotra &
a dynamic and unreliable environment. The Venkatasubramanian, 2003). One other important challenge
topology of a network, which is defined by the is programming the WSNs.
sensors and the communication links between the
sensors, changes frequently due to sensor addition,
deletion, node failures, damages, or energy III. LITERATURE SURVEY:-
depletion. Also, the sensor nodes are linked by a J. Jobin (2005) has defined a effective data transmission
wireless medium, which is noisy, error prone, and scheme to handle communication in sensor network. Author
time varying. Therefore, routing paths should defined a work to provide effective communication while
consider network topology dynamics due to limited analyzing the communication WSN width and the energy
energy and sensor mobility as well as increasing the specification. Atul Bari has defend an effective route
size of the network to maintain specific application communication so that the network life will be improved.
requirements in terms of coverage and connectivity Author defined the communication network to handle three
[4]. communication over the network. Author has defined the
effective balanced data gathering to perform data
6. Data Aggregation: Since sensor nodes may generate transmission under range, connectivity, fault effectiveness
significant redundant data, similar packets from and power aware communication. Vinay Joseph (2009) has
multiple nodes can be aggregated so that the number defined an effective power effective scheduling and routing
of transmissions is reduced. Data aggregation under multipath scheduling and energy effective routing.
technique has been used to achieve energy efficiency Author has defined multicast communication routing in
and data transfer optimization in a number of routing sensor network. Author improved the broadcasting over the
protocols[6]. network with performance improvement.
7. Diverse sensing application requirements: Sensor Author has defined suboptimal algorithm under the
networks have a wide range of diverse applications. performance study. Zhe Zang (2011) has defined effective
No network protocol can meet the requirements of route generation in sensor network. Author improved the
all applications. routing under there liability and low cost communication in
8. Scalability: Routing protocols should be able to scale sensor network. Author defined hop effective communication
with the network size. Also, sensors may not so that the reliable communication will be drawn. Author
necessarily have the same capabilities in terms of improve the hop effective routing policy so that the effective
energy, processing, sensing, and particularly route quality will be improved. Jinbao Li (2011) has defined
communication. Hence, communication links channel specific multi parameter specific routing in sensor
between sensors may not be symmetric, that is, a network. Author defined the power control effective routing
pair of sensors may not be able to have under optimal route generation and to handle the
communication in both directions. This should be opportunities to reduce the communication loss. Author
taken care of in the routing protocols [6]. defined the performance effective routing in sensor network.
427 www.erpublication.org
International Journal of Engineering and Technical Research (IJETR)
ISSN: 2321-0869, Volume-3, Issue-5, May 2015
parameters considered here are the distance, energy, delay
analysis on each node. In the simple form, a minimum
distance neighbor is considered as the effective next node.
But in this work, the maximum distance node within the
coverage range with maximum energy is considered as next
effective node. Set this node as the best neighbor and the
communication will be performed over that node. The process
is repeated till the destination node is not arrived.
REFERENCES:-
[1] Pandurang Kamat," Enhancing Source-Location Privacy in Sensor
Network Routing", Proceedings of the 25th IEEE International
Conference on Distributed Computing Systems (ICSCS05)
Figure 1: Existing Work Path Identification Approach[6] 1063-6927/05 2005 IEEE
[2] J. Jobin," A Lightweight Framework for Source-to-Sink Data Transfer
As shown in figure 1, the existing path identification can be in Wireless Sensor Networks", 0-7803-9277-9/052005 IEEE
done by performing the distance and energy based [3] Atul Bari," Maximizing the Lifetime of Two-Tiered Sensor
analysis[9]. The energy is having the higher priority so that if Networks".
next neighbor is energy effective, the communication will be [4] Yean-Fu Wen," Energy-Efficient Data Aggregation Routing and
Duty-Cycle Scheduling in Cluster-based Sensor Networks",
performed over it. Otherwise, the communication will be 1-4244-0667-6/07 2007 IEEE
performed under the distance and energy constraints [10]. [5] Yu Gu," Joint Scheduling and Routing for Lifetime Elongation in
Surveillance Sensor Networks", 2007 IEEE Asia-Pacific Services
Computing Conference 0-7695-3051-6/07 2007 IEEE
[6] Saeyoung Ahn," Slotted Beacon Scheduling Using Zig Bee Cskip
V. RESEARCH METHODOLOGY:- Mechanism", The Second International Conference on Sensor
In Ad-hoc network distance is the major factor respective to Technologies and Applications 978-0-7695-3330-8/08 2008 IEEE
[7] Yavuz Boga Turkogullari," An Efficient Heuristic for Placement,
which routing algorithms [7]. But In this presented work we
Scheduling and Routing in Wireless Sensor Networks",
have considered multiple parameters to identify the right 978-1-4244-2881-6/08 2008 IEEE
communication path. The parameters included in this work [8] Yawen Dai," MEBRS: Energy Balancing Route Scheduling in
are Centralized Wireless Sensor Networks", 1st Int'l Symposium on
Quality Electronic Design-Asia 978-1-4244-4952-1/09 2009 IEEE
(i) Distance
[9] Vinay Joseph," Joint Power Control, Scheduling and Routing for
(ii) Energy Multicast in Multihop Energy Harvesting Sensor Networks",
(iii) Maximum Coverage Range 9781-4244-3941-6/09@2009 IEEE
[10] D.Baghyalakshmi," LOW LATENCY AND ENERGY EFFICIENT
Based on these all vectors the reliable and efficient ROUTING PROTOCOLS FOR WIRELESS SENSOR
NETWORKS", ICWCSC 2010X 978-1-4244-5137-1/10 2010
communication path will be generated and that path will be IEEE
taken as the main routing path on which the communication [11] Jiann-Liang Chen," Adaptive Routing Protocol for Reliable Wireless
will be performed [11]. As the algorithm begin, the source and Sensor Networking", ICACT 2010 ISBN 978-89-5519-146-2
the destination nodes are specified explicitly between which [12] Amulya Ratna Swain," An Energy Aware Routing Protocol with
Sleep Scheduling for Wireless Sensor Networks", 2010 24th IEEE
the communication path will be generated. Now it will send International Conference on Advanced Information Networking and
the request to the source node and the wait is performed for Applications 1550-445X/10 2010 IEEE
the reply. As the reply is obtained it signify the right [13] Yuanyuan Zeng," Joint Power Control, Scheduling and Real-time
communication can be taken place. Now to perform the Routing in Wireless Sensor Networks", 978-1-4244-5848-6/10
2010 IEEE
effective communication between the source and the
destination the effective parameters are required to identify
for each neighbor node of current node.
Now to perform the effective communication we need to find
the next effective neighbor over which the communication
will be performed. In this work, the parametric analysis is
performed on each node to identify the best neighbor. The
428 www.erpublication.org