Documente Academic
Documente Profesional
Documente Cultură
MOTIVATION
As described, WSN consists of thousands of tiny sensor nodes or even more.
These nodes individually possess limited capabilities but collectively via
coordination they can perform many useful networking tasks for various applications
like disaster management, healthcare, habitat monitoring etc. WSN performs its tasks
in an unattended manner and each sensor node has limited battery capacity.
Transmission and reception of data consumes energy. Energy of every sensor node
keeps on deteriorating with time. A stage is reached when the energy of the whole
sensor network is exhausted and network dies down. So energy is the main constraint
regardless of the application area in a WSN. In a large scale WSN, the nodes which
are closer to the sink are always used for forwarding packets from distant nodes.
Energy holes are created near the sink and the sink becomes unreachable even as
many nodes in the network are still alive. As the sensor nodes are densely deployed
in a WSN, the physical environment tends to produce similar data in close by sensor
nodes and most of the data is more or less redundant. If sensor nodes take turns for
alternatively performing data collection, data processing and communication tasks
then the lifetime of the WSN can be improved.
In a WSN, sink is usually a powerful device and fails very rarely. But
due to energy constraints and some other unavoidable issues, node failures are pretty
commonly encountered in WSN. Although for a densely deployed WSN, a single
nodes failure does not have affect much, yet when some individual nodes failure
creates an energy hole in the network, then it a effects the performance of the whole
WSN. Keeping in mind, the importance and widely growing applications of WSN,
we have decided to carry out work on this subject. We want to reduce the energy
consumption of the nodes for increasing the lifetime of WSN. Energy efficiency is
the most important metric for the design of an algorithm for data collection,
processing and communication.
LITERATURE SURVEY
Description:
Wireless sensor networks (WSNs) are often expected to perform for
prolonged periods of time without human intervention. As one of the most frequent
reasons for maintenance is replacement or manual recharging of batteries, periodic
recharging of node batteries can significantly extend the WSN lifetime Recharging
may be accomplished using energy harvesting from the network surrounding, which
is unreliable since there is no guarantee that the environment will be capable of
supplying the required amount of energy when needed. Alternatively, node batteries
may be recharged through RF pulses emitted by the network coordinator or base
station which results in more predictable operation since the energy increment
provided by a single recharging pulse depends only on the attenuation of wireless
between the coordinator and the node.
Advantages:
The energy increment provided by a single recharging pulse depends only on
the attenuation of wireless signal between the coordinator and the node.
Maintenance-free operation and the desired level of communications
performance.
Disadvantages:
Unreliable power source.
Title: Wireless power transfer and applications to sensor networks
Author: Ligaungu Xi, Yi shi.
Year:2013
Description:
As wireless and portable mobile devices become pervasive, charging batteries for
these deviceshas become a critical problem. Existing battery charging technologies
are dominated by wired technology, which requires a wired power plug to be
connected to an electrical wall outlet. This article explores recent advances in
wireless power transfer (WPT), which achieves the same goal but without the hassle
of wires. WPT technologies are revolutionizing the way energy is transferred and
have the potential to make our lives truly “wireless.
Algorithm:
Heuristic Algorithm
Optimistic Algorithm
Advantages:
Higher efficiency in WPT.
Higher power transfer efficiency even under omni-direction, and not
requiring LOS.
Disadvantages:
Wireless sensor networks have attracted a plethora of research efforts since recent
technological advances allow us to envision the future as a world embedded with
networked sensors. Active research has been conducted in the area of environmental
energy harvesting techniques . Although recent developments in this area can be
employed to replenish the power supply of sensor networks, energy management is
still an important issue since the replenishing rates are typically small and the
stochastic energy renewal process only provides a partial solution to the aggressive
power demands of a large-scale network.
Algorithm:
Advantages:
The existence of optimal thresholds that maximize the average reward rate.
The unconditional transmit-all policy, which transmits every message as long
as the energy storage is positive, optimal transmission policy, is to achieve
significant gains in the average reward rate.
Disadvantages:
Power management is still a crucial issue for such networks due to the
uncertainty of stochastic replenishment.
CHAPTER 3
SYSTEM ANLAYSIS
EXISTING SYSTEM:
PROPOSED SYSTEM:
PRELIMINARY INVESTIGATION
The first and foremost strategy for development of a project starts from the
thought of designing a mail enabled platform for a small firm in which it is easy and
convenient of sending and receiving messages, there is a search engine ,address book
and also including some entertaining games. When it is approved by the organization
and our project guide the first activity, ie. preliminary investigation begins. The
activity has three parts:
Request Clarification
Feasibility Study
Request Approval
Request Clarification
After the approval of the request to the organization and project guide,
with an investigation being considered, the project request must be examined to
determine precisely what the system requires. Here our project is basically meant for
users within the company whose systems can be interconnected by the Local Area
Network(LAN). In today’s busy schedule man need everything should be provided in
a readymade manner. So taking into consideration of the vastly use of the net in day
to day life, the corresponding development of the portal came into existence.
FEASIBILITY ANALYSIS
Operational Feasibility
Economic Feasibility
Technical Feasibility
Operational Feasibility
Operational Feasibility deals with the study of prospects of the system to be
developed. This system operationally eliminates all the tensions of the Admin and
helps him in effectively tracking the project progress. This kind of automation will
surely reduce the time and energy, which previously consumed in manual work.
Based on the study, the system is proved to be operationally feasible.
Economic Feasibility
Technical Feasibility
According to Roger S. Pressman, Technical Feasibility is the assessment of
the technical resources of the organization. The organization needs IBM compatible
machines with a graphical web browser connected to the Internet and Intranet. The
system is developed for platform Independent environment. Java Server Pages,
JavaScript, HTML, SQL server and WebLogic Server are used to develop the
system. The technical feasibility has been carried out. The system is technically
feasible for development and can be developed with the existing facility.
Request Approval
Not all request projects are desirable or feasible. Some organization receives
so many project requests from client users that only few of them are pursued.
However, those projects that are both feasible and desirable should be put into
schedule. After a project request is approved, it cost, priority, completion time and
personnel requirement is estimated and used to determine where to add it to any
project list. Truly speaking, the approval of those above factors, development works
can be launched.
CHAPTER 4
SYSTEM SPECIFICATION
Hardware Requirement:
• Processor : Intel core processor
• Ram : 1GB
• Hard Disk : 160 GB
Software Requirement:
• Operating System : Ubuntu 9.0
• Coding Language : OTCL
Simulator:
• Package : NS 2 Simulator
NS-2
2. After giving the command, the NAM Editor command prompt will opened
like this.
Fig 7.2: Opening NAM Window
3. Then type the command “cd c:” in NAM Editor command prompt, the
Cygwin will enter into the drive to process the data.
4. After entering into the c drive, it defines the path “cd cygwin/usr/local/ns-
allinone-2.28/ns-2.28 to search the executing file and get the result.
Fig 7.4: Entering into NAM Drive
Ns2 is written in C++ and Otcl to separate the control and data path
implementations. The simulator supports a class hierarchy in C++ (the compiled
hierarchy) and a corresponding hierarchy within the Otcl interpreter (interpreted
hierarchy).
The most common agents used in ns2 are UDP and TCP agents. In case of a
TCP agent, several types are available. The most common agent types are:
The most common applications and traffic sources provided by ns2 are:
Traffic Sinks
If the information flows are to be terminated without processing, the udp and
tcp sources have to be connected with traffic sinks. A TCP sink is defined in the class
Agent/TCPSink and an UDP sink is defined in the class Agent/Null.
A UDP sink can be attached to n2 and connected with udp0 in the following
way:
A standard TCP sink that creates one acknowledgement per a received packet
can be attached to n3 and connected with tcp1 with the commands:
There is also a shorter way to define connections between a source and the
destination with the command:
For example, to create a standard TCP connection between n1 and n3 with a class ID
of 1:
One can very easily create several tcp-connections by using this command inside a
for-loop.
Links
Links are required to complete the topology. In ns2, the output queue of a
node is implemented as part of the link, so when creating links the user also has to
define the queue-type.
Figure 7.1 Link in ns2
For example, to create a duplex-link with Drop Tail queue management between n0
and n2:
This section presents a simple NS simulation script and explains what each
line does. Example 3 is an OTcl script which creates the simple network
configuration and runs the simulation scenario in Figure 4. To run this simulation,
copy the code in Example 3 in a file named "ns-simple.tcl" and type "ns ns-
simple.tcl" at shell prompt.
The network consists of 4 nodes (n0, n1, n2, n3) as shown in above figure.
The duplex links between n0 and n2, and n1 and n2 have 2 Mbps of bandwidth and
10 ms of delay. The duplex link between n2 and n3 has 1.7 Mbps of bandwidth and
20 ms of delay. Each node uses a DropTail queue, of which the maximum size is 10.
A "tcp" agent is attached to n0, and a connection is established to a tcp "sink" agent
attached to n3. As default, the maximum size of a packet that a "tcp" agent can
generate is 1KByte. A tcp "sink" agent generates and sends ACK packets to the
sender (tcp agent) and frees the received packets. A "udp" agent that is attached to n1
is connected to a "null" agent attached to n3. A "null" agent just frees the packets
received. A "ftp" and a "cbr" traffic generator are attached to "tcp" and "udp" agents
respectively, and the "cbr" is configured to generate 1 KByte packets at the rate of 1
Mbps. The "cbr" is set to start at 0.1 sec and stop at 4.5 sec, and "ftp" is set to start at
1.0 sec and stop at 4.0 sec.
One can extend NS by adding new protocols. This section will discuss about
how a new agent can be created in NS using an example. The code in this section
implements some sort of simple ‘ping’ protocol. One node will send n user defined
number packets, one at a time at regular intervals, to another node which will return
the packet immediately. For each packet the sender will then calculate the round trip
time.
CHAPTER 5
SYSTEM DESIGN
System Architecture
1. The DFD is also called as bubble chart. It is a simple graphical formalism that
can be used to represent a system in terms of input data to the system, various
processing carried out on this data, and the output data is generated by this
system.
2. The data flow diagram (DFD) is one of the most important modeling tools. It
is used to model the system components. These components are the system
process, the data used by the process, an external entity that interacts with the
system and the information flows in the system.
3. DFD shows how the information moves through the system and how it is
modified by a series of transformations. It is a graphical technique that
depicts information flow and the transformations that are applied as data
moves from input to output.
4. DFD is also known as bubble chart. A DFD may be used to represent a
system at any level of abstraction. DFD may be partitioned into levels that
represent increasing information flow and functional detail.
MAC PARAMETERS
CHAPTER 8
SYSTEM TESTING
System Testing
Ns Traffic.tcl
in ns-2.28/tcl/ex: a simple demo to illustrate link failure and recovery; no
dynamic routing is done to heal the failure.
Ns Traffic-avg.tcl
in ns-2.28/tcl/ex: a dynamic routing demo.
Ns Main.tcl
in ns-2.28/tcl/ex: Neighbor node through two equal cost routes.
Broadcasting Routing (HSRP)
nsmcast.tcl
in ns-2/tcl/ex: a multicast routing demo. Comments in mcast.txt.
nscmcast.tcl
in ns-2/tcl/ex/newmcast: centralized multicast computation for use in
``session-level'' simulations. Instead of using join messages and implementing
multicast routing protocols in the individual routers, the multicast routing
tables are implemented in a centralized fashion for the entire topology. PIM
sparse mode shared trees and source-specific trees are supported. Comments
in cmcast.txt.
nscmcast-spt.tcl
uses source-specific trees.
ns cmcast-100.tcl
creates a topology of 100 nodes and 950 edges. 10 members join the multicast
group. One sender sends for 90 seconds.
ns detailed*.tcl
in ns-2/tcl/ex/newmcast: Dense Mode protocol that adapts to network changes
and works with LAN topologies (LANs created by the multi-link method).
Note that this is the recommended version of the dense mode protocol in ns.
Comments in detailedDM.txt.
ns traffic*.tcl
in ns-2/tcl/ex/traffic*.tcl: multicast routing demos to illustrate the use of
Centralized multicast and the dense mode protocols. Comments in mcast.txt
To validate the Node Structure and Position
for Each node.If the transmission node to
control for CH to CH.
Transport protocols (UDP, TCP, RTP):
Routing:
Link-layer mechanisms:
Other:
Software system meets its requirements and user expectations and does not fail in an
unacceptable manner. There are various types of test. Each test type addresses a
specific testing requirement.
TYPES OF TESTS
Unit testing
Unit testing involves the design of test cases that validate that the internal
program logic is functioning properly, and that program inputs produce valid outputs.
All decision branches and internal code flow should be validated. It is the testing of
individual software units of the application .it is done after the completion of an
individual unit before integration. This is a structural testing, that relies on
knowledge of its construction and is invasive. Unit tests perform basic tests at
component level and test a specific business process, application, and/or system
configuration. Unit tests ensure that each unique path of a business process performs
accurately to the documented specifications and contains clearly defined inputs and
expected results.
Integration testing
Integration tests are designed to test integrated software components to
determine if they actually run as one program. Testing is event driven and is more
concerned with the basic outcome of screens or fields. Integration tests demonstrate
that although the components were individually satisfaction, as shown by
successfully unit testing, the combination of components is correct and consistent.
Integration testing is specifically aimed at exposing the problems that arise from the
combination of components.
Functional test
Functional tests provide systematic demonstrations that functions tested are
available as specified by the business and technical requirements, system
documentation, and user manuals.
Unit Testing:
Unit testing is usually conducted as part of a combined code and unit test
phase of the software lifecycle, although it is not uncommon for coding and unit
testing to be conducted as two distinct phases.
Features to be tested
Test Results: All the test cases mentioned above passed successfully. No defects
encountered.
Acceptance Testing
User Acceptance Testing is a critical phase of any project and requires
significant participation by the end user. It also ensures that the system meets the
functional requirements.
Test Results: All the test cases mentioned above passed successfully. No defects
encountered.
CHAPTER 6
SYSTEM IMPLEMENTATION
List of MODULES:
Process of admin
Network Process
Navigating Destination
Emergency Navigation
MODULES DESCRIPTION:
Centralized system stores the map details to determine shortest path. Sensor nodes
compute the hop count to find the shortest path according to the maps, thus the user
can escape from the danger area. Sensor node have three emergency process are
Network Formation, Destination Navigation, Emergency Navigation.
1. Process of admin
To navigate properly at the time of emergency, the admin should have the
whole knowledge about the area by preprocessing the environment as it needs to add
the block details and the exit -path to the central system so that it can guide correctly
when needed.
A. Network Organization
Node considers 100 sensor nodes that are homogeneous and are
deployed randomly in 100 m x 100 m field. The deployment can be uniform
as well as non-uniform. The BS is assumed to be placed at (150, 50) and
(300, 50) coordinates. A powerful BS capable of forwarding the data from the
CHs to the intended recipients is used.
The total sensing area is partitioned into fixed number of equal sized
rectangular clusters by the BS. We present the case of nine clusters formed by
the BS to explain the protocol operation. ZBEEC offers reliable coverage and
connectivity. Equal sized clusters ensure uniform energy consumption among
the clusters and cluster formation is energy-efficient.
2. Network Process:
A connection is created within the user and sensor that also covers the neighbour
nodes each sensor are also connected with the mobile nodes of the user.
A. Formation of Network based on Clusters
The clusters form two zones known as near and far zone. The
zone near the BS is termed as near zone and rest of the field makes up
the far zone. Near zone has three and far zone has six clusters. Far
zone is further divided into two subzones. The zone based topology
balances the traffic across the zones, lends support for multi-hop
communication and prohibits formation of hot-spots. The near zone
restricts the number of transmissions above the threshold distance.
ZBEEC scheme is fully centralized and CHs are allotted by the BS.
The CH IDs are broadcasted by the BS and in the situation of being a match
between a sensor node and CH IDs, that node becomes a CH. Otherwise, the
node gets its time slot for data transmission. Each near zone cluster contains
two CHs, one main cluster head (MCH) and one auxiliary cluster head
(ACH).
3. Navigating Destination
At the time of emergency the user request the sensor to show him/her the
particular path for escaping. The centralized server then checks the source of the user
and determines the suitable path and shows it to the user using the maps.
4. Emergency Navigation
The wireless sensor networks continuously checks the environmental condition and if
it senses any kind of abnormality it immediately informs the user that are connected
with the sensor. An emergency situation is alarmed and soon the navigation maps are
shown to the users in their handheld devices to navigate them to the safe places.
The proper navigation path can be done by using the following ways:
If any emergency situation arises, the sensor networks send the information that are
needed to the users to guide them and to move them from the hazardous area. The
WSN provides them the necessary safety guide to the users. The proposed system,
SEND, provides the users a better way to avoid the hazardous area or to make them
possible to reach safe places while having the minimum congestion. Using the human
navigation is not as suitable as sensor navigation, because, human navigation as fast
as sensor navigation and at the first chance it could nothave detected the safest route.
SEND searches all the sub-optimal paths and suggest the most appropriate path for
the evacuation process.