IJETR032250

Download as pdf or txt
Download as pdf or txt
You are on page 1of 3

International Journal of Engineering and Technical Research (IJETR)

ISSN: 2321-0869, Volume-3, Issue-5, May 2015

A Maximum Sensing Range Bounded Energy Node


Selection Approach to Optimise in WSN
A. P. Amit Mahal, Renu Goyat

limitations, battery power, enhancement of transmission


Abstract In wireless sensor networks, micro sensor nodes quality and coverage problems[5].
dispersed in real environmental field have constraint energy
capacity, so energy-efficient mechanism for wireless Network Design Challenges and Routing Issues
communication on each sensor node is so crucial. Specially, the
jobs sending and processing sensing data information from on
The design of routing protocols for WSNs is challenging
sensor node to the others are more majority parts than merely
sensing some events. Thus, energy-efficient routing protocol in because of several network constraints. WSNs suffer from the
wireless sensor networks is necessary for increasing the network limitations of several network resources, for example, energy,
lifetime and is also influenced by many challenging factors in WSNdwidth, central processing unit, and storage. The design
terms of energy, processing, and storage capacities. In this challenges in sensor networks involve the following main
paper, we designed and implemented a Reliable Energy Aware aspects:
Routing(REAR) protocol for wireless sensor networks and
evaluated the performance of REAR by comparing with existing 1. Limited energy capacity: Since sensor nodes are
routing protocols. REAR considers residual energy capacity of
battery powered, they have limited energy capacity.
each sensor node in establishing routing paths and supports
multi-path routing protocol for reliable data transmission.
Energy poses a big challenge for network designers
Furthermore, REAR allows each sensor node to confirm success in hostile environments, for example, a battlefield,
of data transmission to other sensor nodes by supporting the where it is impossible to access the sensors and
DATA-ACK oriented packet transmission. Finally, the recharge their batteries[4]. Furthermore, when the
performance evaluation results show that REAR provides energy of a sensor reaches a certain threshold, the
energy-efficiency and reliability related to wireless sensor will become faulty and will not be able to
communication in wireless sensor networks. function properly, which will have a major impact on
the network performance. Thus, routing protocols
Index Terms wireless sensor networks, routing protocol,
designed for sensors should be as energy efficient as
energy-efficiency, reliability, multi-path.
possible to extend their lifetime, and hence prolong
the network lifetime while guaranteeing good
performance overall.
I. INTRODUCTION
2. Sensor locations: Another challenge that faces the
Wireless networks have become increasingly popular in the design of routing protocols is to manage the
computing and communication industries, since their locations of the sensors [6]. Most of the proposed
emergence in the 70s. There are two variations of mobile protocols assume that the sensors either are
wireless networks [3] - the first is known as infrastructure equipped with global positioning system (GPS)
network, i.e., a network with fixed and wired gateways and the receivers or use some localization technique to learn
second is infrastructure-less mobile network, better known as about their locations.
an ad hoc network. Wireless networks are gaining popularity
to its peak today, as the user wants wireless connectivity 3. Limited hardware resources: In addition to limited
irrespective of their geographic position. Wireless Networks energy capacity, sensor nodes have also limited
enable users to communicate and transfer data with each other processing and storage capacities, and thus can only
without any wired medium between them. One of the reasons perform limited computational functionalities.
of the popularity of these networks is widely penetration of These hardware constraints present many challenges
wireless devices. Wireless applications and devices mainly in software development and network protocol
emphasize on Wireless Local Area Networks (WLANs). This design for sensor networks, which must consider not
has mainly two modes of operations, i.e. in the presence of only the energy constraint in sensor nodes, but also
Control Module(CM) also known as Base Stations and the processing and storage capacities of sensor
Ad-Hoc connectivity where there is no Control Module [2]. nodes[6].
Ad-Hoc networks do not depend on fixed infrastructure in
order to carry out their operations. The operation mode of 4. Massive and random node deployment: Sensor
such network is stand alone, or may be attached with one or node deployment in WSNs is application dependent
multiple points to provide internet and connectivity to cellular and can be either manual or random which finally
networks. These networks exhibits the same conventional affects the performance of the routing protocol[6]. In
problems of wireless communications i.e. WSN width most applications, sensor nodes can be scattered
randomly in an intended area or dropped massively
over an inaccessible or hostile region. If the resultant

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.

II. CONSTRAINTS IN WSNS IV. PROBLEM DEFINITION:-


A sensor node has limited resources. Most important ones are: Energy and efficiency are always the main concern in
WSNdwidth: The WSNdwidth of wireless links wireless Mobile network. A mobile network contains huge
among sensor nodes is very limited. This amount of data transmission over the network. Because of
communication constraint increases packet losses, this, there are more chances of data loss over the network. Our
latency and introduces communication failures work is defined in same area. We proposed an algorithm to get
(Ganesan, Krishnamachari, Woo, Culler, Estrin & the efficiency as well as the reliability. In this work an
Wicker, 2003). efficient maximally covered mobile network algorithm is
Processing: Sensor nodes have limited computing presented such that addresses the requirements of power
power; hence data processing power of a sensor efficient infrastructure issues for WSN [6]. In this work we
node is limited [7]. have combined the Path Selection Routing along with the
Storage: Because of limited memory of a senor node, concept of Energy Preserving. The initial route will be
its storage capability is restricted. identified by the Path Selection algorithm and in case of any
Power: Sensor nodes have limited power supply, a broken link or energy hole in the path it will look for the
typical sensor node works one week under full-load Alternate path using Energy Preserving [7].
and one year in the idle state (Yao and Gehrke,
2002). FLOW OF EXISTING WORK:-

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.

VI. FUTURE WORK:-


In this, the complete work is performed under the energy
constraint. It this work we have resolved the energy
consumption problem in a sensor area network by considering
the minimum hop path over the network. The improvement to
the work can be done in different direction [13].
In this work, the type of data communicating over the
network is not considered but in future type of data
can also considered.

In this work, the nodes are defined as normal sensor nodes.


But in future, smart sensors can also be used.

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

You might also like