Nowadays, Wireless Sensor Network has been greatly used
with RFID technology because of its certain advantages. RFID
is abbreviated as radio frequency identification. The frequency
identification RFID technology is similar to a Wireless Sensor
Network (WSN) as it also captures the physical environment
data, process it and provide the rapid response about location
and target tracking [3]. RFID active tags are connected with
sensors to communicate with users [4]. RFID technology uses
radio waves to communicate the data and other necessary
information. It includes RFID tags and RFID readers. The
tags are equipped on an object which we want to sense. It
can discover the information about that object even without
coming in contact with it. The data is then send to the host
system through intranet. RFID can easily discern the objects
and can trace the location even if no information about the
physical position is provided. The main difference is that RFID
provides much more and accurate information about physical
environment than a Wireless Sensor Network could provide.
There is a major drawback of this technology which is its
lowest communication range up to 12m only due to limited
battery problem. This drawback can be made insignificant by
integrating it with WSN. As a result, combination of RFID and
WSN can provide us with a bundle of environment related
information such as how the data is routed by the nodes,
which routing protocol is used, resource ID, location and ID of
communicating nodes and also the physical condition of nodes.
80 percent of the node’s energy is utilized during the process
of communication, processing, and activation [3]. Figure 1
shows the advantages that we can have by integrating these
two technologies.
EVENT DRIVEN ROUTING PROTOCOLS FOR WIRELESS SENSOR NETWORK- A SURVEYijcsa
Advances in embedded systems have resulted in the development of wireless sensor networks, which not
only provide unique opportunities for monitoring but also controlling homes, cities and the environments.
Recent advancements in wireless sensor network have resulted into many new protocols some of them are
specifically designed for sensor network for detecting the event and routing the event related information to
the base station in efficient manner. This paper surveys recent event driven routing protocols for wireless
sensor network. We have compared various event driven routing protocols using different parameters like
Sink Centric, Node Centric, Reliability, Congestion control, Energy Efficiency, Loss reliability and loss
recovery. We have also described LEACH and MECN protocols but as they are not e
An implementation of recovery algorithm for fault nodes in a wireless sensor ...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
EVENT DRIVEN ROUTING PROTOCOLS FOR WIRELESS SENSOR NETWORK- A SURVEYijcsa
Advances in embedded systems have resulted in the development of wireless sensor networks, which not
only provide unique opportunities for monitoring but also controlling homes, cities and the environments.
Recent advancements in wireless sensor network have resulted into many new protocols some of them are
specifically designed for sensor network for detecting the event and routing the event related information to
the base station in efficient manner. This paper surveys recent event driven routing protocols for wireless
sensor network. We have compared various event driven routing protocols using different parameters like
Sink Centric, Node Centric, Reliability, Congestion control, Energy Efficiency, Loss reliability and loss
recovery. We have also described LEACH and MECN protocols but as they are not e
An implementation of recovery algorithm for fault nodes in a wireless sensor ...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Node Failure Prevention by Using Energy Efficient Routing In Wireless Sensor ...IJTET Journal
The most necessary issue that has to be solved in coming up with an information transmission rule for
wireless unplanned networks is a way to save unplanned node energy whereas meeting the wants of applications
users because the unplanned nodes are battery restricted. Whereas satisfying the energy saving demand, it’s
conjointly necessary to realize the standard of service. Just in case of emergency work, it's necessary to deliver the
information on time. Achieving quality of service in is additionally necessary. So as to realize this demand, Power -
efficient Energy-Aware routing protocol for wireless unplanned networks is planned that saves the energy by
expeditiously choosing the energy economical path within the routing method. When supply finds route to
destination, it calculates α for every route. The worth α is predicated on largest minimum residual energy of the trail
and hop count of the trail. If a route has higher α, then that path is chosen for routing the information. The worth of α
are higher, if the most important of minimum residual energy of the trail is higher and also the range of hop count is
lower. Once the trail is chosen, knowledge is transferred on the trail. So as to extend the energy potency any
transmission power of the nodes is additionally adjusted supported the situation of their neighbour. If the neighbours
of a node are closely placed thereto node, then transmission vary of the node is diminished. Thus it's enough for the
node to own the transmission power to achieve the neighbour at intervals that vary. As a result transmission power
of the node is cut back that later on reduces the energy consumption of the node. Our planned work is simulated
through Network machine (NS-2). Existing AODV and Man-Min energy routing protocol conjointly simulated
through NS-2 for performance comparison. Packet Delivery quantitative relation, Energy Consumption and end-toend
delay.
LOAD BALANCED CLUSTERING WITH MIMO UPLOADING TECHNIQUE FOR MOBILE DATA GATHER...Munisekhar Gunapati
A three-layer framework is proposed for mobile data collection in wireless sensor networks, which includes the sensor layer, cluster head layer, and mobile collector (called SenCar) layer. The framework employs distributed load balanced clustering and dual data uploading, which is referred to as LBC-MIMO. The objective is to achieve good scalability, long network lifetime and low data collection latency. At the sensor layer, a distributed load balanced clustering (LBC) algorithm is proposed for sensors to self-organize themselves into clusters. In contrast to existing clustering methods, our scheme generates multiple cluster heads in each cluster to balance the work load and facilitate dual data uploading. At the cluster head layer, the inter-cluster transmission range is carefully chosen to guarantee the connectivity among the clusters. Multiple cluster heads within a cluster cooperate with each other to perform energy-saving inter-cluster communications. Through inter-cluster transmissions, cluster head information is forwarded to SenCar for its moving trajectory planning. At the mobile collector layer, SenCar is equipped with two antennas, which enables two cluster heads to simultaneously upload data to SenCar in each time by utilizing multi-user multiple-input and multiple-output (MU-MIMO) technique. The trajectory planning for SenCar is optimized to fully utilize dual data uploading capability by properly selecting polling points in each cluster. By visiting each selected polling point, SenCar can efficiently gather data from cluster heads and transport the data to the static data sink. Extensive simulations are conducted to evaluate the effectiveness of the proposed LBC-MIMO scheme. The results show that when each cluster has at most two cluster heads, LBC-MIMO achieves over 50 percent energy saving per node and 60 percent energy saving on cluster heads comparing with data collection through multi-hop relay to the static data sink, and 20 percent shorter data collection time compared to traditional mobile data gathering.
Wireless sensor network can get separated into multiple connected components due to the failure of some
of its nodes, which is called a “cut.” In this paper, we consider the problem of detecting cuts by the remaining
nodes of a wireless sensor network. We propose an algorithm that allows 1) every node to detect when the
connectivity to a specially designated node has been lost, and 2) one or more nodes (that are connected to the
special node after the cut) to detect the occurrence of the cut. The algorithm is distributed and asynchronous:
every node needs to communicate with only those nodes that are within its communication range. The
algorithm is based on the iterative computation of a fictitious “electrical potential” of the nodes. The
convergence rate of the underlying iterative scheme is independent of the size and structure of the network.
Introduction
Background
WSN Design Issues: MAC Protocols, Routing Protocols, Transport Protocols
Performance Modeling of WSNs: Performance Metrics, Basic Models, Network Models
Case Study: Simple Computation of the System Life Span
Practical Example.
Node Failure Prevention by Using Energy Efficient Routing In Wireless Sensor ...IJTET Journal
The most necessary issue that has to be solved in coming up with an information transmission rule for
wireless unplanned networks is a way to save unplanned node energy whereas meeting the wants of applications
users because the unplanned nodes are battery restricted. Whereas satisfying the energy saving demand, it’s
conjointly necessary to realize the standard of service. Just in case of emergency work, it's necessary to deliver the
information on time. Achieving quality of service in is additionally necessary. So as to realize this demand, Power -
efficient Energy-Aware routing protocol for wireless unplanned networks is planned that saves the energy by
expeditiously choosing the energy economical path within the routing method. When supply finds route to
destination, it calculates α for every route. The worth α is predicated on largest minimum residual energy of the trail
and hop count of the trail. If a route has higher α, then that path is chosen for routing the information. The worth of α
are higher, if the most important of minimum residual energy of the trail is higher and also the range of hop count is
lower. Once the trail is chosen, knowledge is transferred on the trail. So as to extend the energy potency any
transmission power of the nodes is additionally adjusted supported the situation of their neighbour. If the neighbours
of a node are closely placed thereto node, then transmission vary of the node is diminished. Thus it's enough for the
node to own the transmission power to achieve the neighbour at intervals that vary. As a result transmission power
of the node is cut back that later on reduces the energy consumption of the node. Our planned work is simulated
through Network machine (NS-2). Existing AODV and Man-Min energy routing protocol conjointly simulated
through NS-2 for performance comparison. Packet Delivery quantitative relation, Energy Consumption and end-toend
delay.
LOAD BALANCED CLUSTERING WITH MIMO UPLOADING TECHNIQUE FOR MOBILE DATA GATHER...Munisekhar Gunapati
A three-layer framework is proposed for mobile data collection in wireless sensor networks, which includes the sensor layer, cluster head layer, and mobile collector (called SenCar) layer. The framework employs distributed load balanced clustering and dual data uploading, which is referred to as LBC-MIMO. The objective is to achieve good scalability, long network lifetime and low data collection latency. At the sensor layer, a distributed load balanced clustering (LBC) algorithm is proposed for sensors to self-organize themselves into clusters. In contrast to existing clustering methods, our scheme generates multiple cluster heads in each cluster to balance the work load and facilitate dual data uploading. At the cluster head layer, the inter-cluster transmission range is carefully chosen to guarantee the connectivity among the clusters. Multiple cluster heads within a cluster cooperate with each other to perform energy-saving inter-cluster communications. Through inter-cluster transmissions, cluster head information is forwarded to SenCar for its moving trajectory planning. At the mobile collector layer, SenCar is equipped with two antennas, which enables two cluster heads to simultaneously upload data to SenCar in each time by utilizing multi-user multiple-input and multiple-output (MU-MIMO) technique. The trajectory planning for SenCar is optimized to fully utilize dual data uploading capability by properly selecting polling points in each cluster. By visiting each selected polling point, SenCar can efficiently gather data from cluster heads and transport the data to the static data sink. Extensive simulations are conducted to evaluate the effectiveness of the proposed LBC-MIMO scheme. The results show that when each cluster has at most two cluster heads, LBC-MIMO achieves over 50 percent energy saving per node and 60 percent energy saving on cluster heads comparing with data collection through multi-hop relay to the static data sink, and 20 percent shorter data collection time compared to traditional mobile data gathering.
Wireless sensor network can get separated into multiple connected components due to the failure of some
of its nodes, which is called a “cut.” In this paper, we consider the problem of detecting cuts by the remaining
nodes of a wireless sensor network. We propose an algorithm that allows 1) every node to detect when the
connectivity to a specially designated node has been lost, and 2) one or more nodes (that are connected to the
special node after the cut) to detect the occurrence of the cut. The algorithm is distributed and asynchronous:
every node needs to communicate with only those nodes that are within its communication range. The
algorithm is based on the iterative computation of a fictitious “electrical potential” of the nodes. The
convergence rate of the underlying iterative scheme is independent of the size and structure of the network.
Introduction
Background
WSN Design Issues: MAC Protocols, Routing Protocols, Transport Protocols
Performance Modeling of WSNs: Performance Metrics, Basic Models, Network Models
Case Study: Simple Computation of the System Life Span
Practical Example.
This presentation is all about the wireless sensor networks, how they collect data using aggregation, and how they evaluate or calculate the parameters
This PowerPoint presentation is about Advantages and disadvantages of Mobile phones 2016
All animations and Transitions effects are included.
This will completely support for PowerPoint 2013
An energy aware scheme for layered chain in underwater wireless sensor networ...IJECEIAES
Extending the network lifetime is a very challenging problem that needs to be taken into account during routing data in wireless sensor networks in general and particularly in underwater wireless sensor networks (UWSN). For this purpose, the present paper proposes a multilayer chain based on genetic algorithm routing (MCGA) for routing data from nodes to the sink. This algorithm consists to create a limited number of local chains constructed by using genetic algorithm in order to obtain the shortest path between nodes; furthermore, a leader node (LN) is elected in each chain followed by constructing a global chain containing LNs. The selection of the LN in the closest chain to the sink is as follows: Initially, the closest node to sink is elected LN in this latter because all nodes have initially the same energy value; then the future selection of the LN is based on the residual energy of the nodes. LNs in the other chains are selected based on the proximity to the previous LNs. Data transmission is performed in two steps: intra-chain transmission and inter-chain transmission. Furthermore, MCGA is simulated for different scenarios of mobility and density of nodes in the networks. The performance evaluation of the proposed technique shows a considerable reduction in terms of energy consumption and network lifespan.
sensors are what we experience the most in our life. they are even working in our body in different aspects. they may be as eyes, ears, skin, tongue etc. when we combine them they make a network. it may be a human sensor network. but i have shared something interesting about wireless sensor networks.
Congestion Prediction and Adaptive Rate Adjustment Technique for Wireless Sen...IJORCS
In general, nodes in Wireless Sensor Networks (WSNs) are equipped with limited battery and computation capabilities but the occurrence of congestion consumes more energy and computation power by retransmitting the data packets. Thus, congestion should be regulated to improve network performance. In this paper, we propose a congestion prediction and adaptive rate adjustment technique for Wireless Sensor Networks. This technique predicts congestion level using fuzzy logic system. Node degree, data arrival rate and queue length are taken as inputs to the fuzzy system and congestion level is obtained as an outcome. When the congestion level is amidst moderate and maximum ranges, adaptive rate adjustment technique is triggered. Our technique prevents congestion by controlling data sending rate and also avoids unsolicited packet losses. By simulation, we prove the proficiency our technique. It increases system throughput and network performance significantly.
Congestion in Wireless Sensor Networks has negative impact on the Quality of Service.
Congestion effects the performance metrics, namely throughput and per-packet energy
consumption, network lifetime and packet delivery ratio. Reducing congestion allows better
utilization of the network resources and thus enhances the Quality of Service metrics of the
network. Traffic Aware Dynamic Routing to Alleviate Congestion in Wireless Sensor Networks
reduces congestion by considering one hop neighbor routing in the network. This paper
proposed an algorithm for Quality of Service Based Traffic-Aware Data forwarding for
congestion control in wireless sensor networks based on two hop neighbor information. On
detection of congestion, the algorithm forwards data packets around the congestion areas by
spreading the excessive packets through multiple paths. The path with light load or under
loaded nodes is efficiently utilized whenever congestion occurs. The main aspect of the
algorithm is to build path to the destination using two independent potential fields depth and
queue length. Queue length field solves the traffic-aware problem. Depth field creates a
backbone to forward packets to the sink. Both fields are combined to yield a hybrid potential
field to make dynamic decision for data forwarding. Network Simulator used for simulating the
algorithm is NS2. The proposed algorithm performs better.
TTACCA: TWO-HOP BASED TRAFFIC AWARE CONGESTION CONTROL ALGORITHM FOR WIRELESS...cscpconf
Congestion in Wireless Sensor Networks has negative impact on the Quality of Service.
Congestion effects the performance metrics, namely throughput and per-packet energy
consumption, network lifetime and packet delivery ratio. Reducing congestion allows better
utilization of the network resources and thus enhances the Quality of Service metrics of the
network. Traffic Aware Dynamic Routing to Alleviate Congestion in Wireless Sensor Networks
reduces congestion by considering one hop neighbor routing in the network. This paper
proposed an algorithm for Quality of Service Based Traffic-Aware Data forwarding for
congestion control in wireless sensor networks based on two hop neighbor information. On
detection of congestion, the algorithm forwards data packets around the congestion areas by
spreading the excessive packets through multiple paths. The path with light load or under
loaded nodes is efficiently utilized whenever congestion occurs. The main aspect of the
algorithm is to build path to the destination using two independent potential fields depth and
queue length. Queue length field solves the traffic-aware problem. Depth field creates a
backbone to forward packets to the sink. Both fields are combined to yield a hybrid potential
field to make dynamic decision for data forwarding. Network Simulator used for simulating the
algorithm is NS2. The proposed algorithm performs better.
In wireless sensor network energy cutback is considered as a principle intensive challenge which is studied largely in the Wireless Sensor Networks (WSN) literature. Wireless Sensor Networks (WSNs) are pertinent in numerous arenas where WSNs may be used for sensing, ciphering, and communication elements that give a user or administrator the ability to instrument, observe, and retort to events and phenomena in a specific environment. But sensor devices are resource curbed, positioned in an open and unattended environment, different types of attacks and conventional techniques against these attacks are not desirable due to the resource constrained nature of these kinds of networks. An energy-balanced routing method based on forward-aware factor (FAF-EBRM) in which the next-hop node is elected according to the awareness of link weight and forward energy density. FAF-EBRM is compared with Ladder Diffusion Algorithm, which balances the energy utilization, sustain the function era and guarantees high QoS of WSN. The FAF-EBRM is proposed with Secure Routing Layer (SRL) Protocol which ensures that the secure data transmission is achieved without releasing private sensor readings and without introducing significant overhead on the battery-limited sensors.
Similar to Priority Based Congestion Avoidance Hybrid Scheme published in IEEE (20)
It includes:
Introduction to Graphs
Applications
Graph representation
Graph terminology
Graph operations
Adding vertex and edge in Adjacency matrix representation using C++ program
Adjacency List implementation in C++
Homework Problems
References
Our Facebook Page url: https://www.facebook.com/programming.cplusplus
C++ language was developed by Bjarne Stroustrup. C++ is just C with classes where class is a user-defined datatype just like structure but with more advance features of object-oriented programming language.
An object is a variable of type class which is created during runtime. That's why the objects are allocated memory in heap and are called as reference types.
Static variables scope remains within the whole program. IT is not reinitialised again and again. We can declare the members of a class as static as well. Both possess same properties.
Our Facebook page:
https://www.facebook.com/programming.cplusplus/
Definition of Computer
Classification of Computer
Applications of Computer
Block Diagram and Working of Computer System
Different Peripheral Devices
Main Storage and Auxiliary Storage Devices
Computer Hardware and Software
If any class have multiple functions with same names but different parameters then they are said to be overloaded. Function overloading allows you to use the same name for different functions, to perform, either same or different functions in the same class.
If you have to perform one single operation but with different number or types of arguments, then you can simply overload the function.
While doing programming in any programming language, you need to use various variables to store various information. Variables are nothing but reserved memory locations to store values. This means that when you create a variable you reserve some space in memory.
You may like to store information of various data types like character, wide character, integer, floating point, double floating point, boolean etc. Based on the data type of a variable, the operating system allocates memory and decides what can be stored in the reserved memory.
C++ is a middle-level programming language developed by Bjarne Stroustrup starting in 1979 at Bell Labs. C++ runs on a variety of platforms, such as Windows, Mac OS, and the various versions of UNIX
Most C++ compilers don't care what extension you give your source code, but if you don't specify otherwise, many will use .cpp by default
Most frequently used and free available compiler is GNU C/C++ compiler, otherwise you can have compilers either from HP or Solaris if you have respective Operating Systems.
With Remote Desktop Connection, you can connect to a computer running Windows from another computer running Windows that's connected to the same network or to the Internet. For example, you can use all of your work computer's programs, files, and network resources from your home computer, and it's just like you're sitting in front of your computer at work.
To connect to a remote computer, that computer must be turned on, it must have a network connection, Remote Desktop must be enabled, you must have network access to the remote computer (this could be through the Internet), and you must have permission to connect. For permission to connect, you must be on the list of users. Before you start a connection, it's a good idea to look up the name of the computer you're connecting to and to make sure Remote Desktop connections are allowed through its firewall.
To find the Remote Desktop Connection shortcut, click the Start button Start button, click All Programs, and then click Accessories. To quickly open Remote Desktop Connection, click the Start button Start button, type mstsc in the search box, and then press Enter.
Redirecting a device on your computer makes it available for use in a Remote Desktop session. If a Remote Desktop Connection dialog box appears after you click Connect and enter your credentials, you can redirect local devices and resources, such as your local drives or Clipboard. Click Details, and then select the check box for each item you want to redirect.
An operator is a symbol that tells the compiler to perform specific mathematical or logical manipulations.
C language supports a rich set of built-in operators. An operator is a symbol that tells the compiler to perform certain mathematical or logical manipulations. Operators are used in program to manipulate data and variables.
A pointer is a variable whose value is the address of another variable, i.e., direct address of the memory location. Like any variable or constant, you must declare a pointer before you can use it to store any variable address.
There are few important operations, which we will do with the help of pointers very frequently. (a) we define a pointer variable (b) assign the address of a variable to a pointer and (c) finally access the value at the address available in the pointer variable. This is done by using unary operator * that returns the value of the variable located at the address specified by its operand.
Garbage Value:
If any variable is not initialized then that variables having garbage value(unassigned value).
For example:
int i;
Variable ‘i’ is integer type but it wont assign any value.so,it take garbage value.It maybe any value.
Before allocating memory in run time system does not clear the memory before allocating the variable.So,default value of the variable is garbage value.
My Tours and Travels Project. New user can login and book their travel. description of various places with their maps is also given.
Editing the new records of customers and tourists by administrator.
2) Verifying customers(tourists) registration and complaint forms filled by visitors.
3) Creation of new admin by administrator.
4) Viewing of accounts information by customer online.
5) Creation of new records of tours, number of days and nights, bookings and customers.
6) Amending the records of existing customers and administrator.
7) Each customer or member of the ‘Country Drive’ having unique id and password.
8) Viewing all the details of his/her account, tours and bookings
9) Only administrator can grant permission for bookings, view customers, add customer and admin etc.
10) Password confirmation for customers and admin is applied.
11) Viewing of receipts and balance by tourists and customers.
12) Previous records of customers are also available to admin.
13) Full Proof and ease to use online tour booking, handling services & registration.
14) Admin can add max 2 advertisements on the home page of the website.
15) Also there is complaint form for visitors to enquire about the tours and their booking during, before or after their travel.
16) There are tour details of every tour, description of popular places and their photographs to make tourists know more about the place they are going to visit.
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdfTechSoup
In this webinar you will learn how your organization can access TechSoup's wide variety of product discount and donation programs. From hardware to software, we'll give you a tour of the tools available to help your nonprofit with productivity, collaboration, financial management, donor tracking, security, and more.
Instructions for Submissions thorugh G- Classroom.pptxJheel Barad
This presentation provides a briefing on how to upload submissions and documents in Google Classroom. It was prepared as part of an orientation for new Sainik School in-service teacher trainees. As a training officer, my goal is to ensure that you are comfortable and proficient with this essential tool for managing assignments and fostering student engagement.
Model Attribute Check Company Auto PropertyCeline George
In Odoo, the multi-company feature allows you to manage multiple companies within a single Odoo database instance. Each company can have its own configurations while still sharing common resources such as products, customers, and suppliers.
Unit 8 - Information and Communication Technology (Paper I).pdfThiyagu K
This slides describes the basic concepts of ICT, basics of Email, Emerging Technology and Digital Initiatives in Education. This presentations aligns with the UGC Paper I syllabus.
Macroeconomics- Movie Location
This will be used as part of your Personal Professional Portfolio once graded.
Objective:
Prepare a presentation or a paper using research, basic comparative analysis, data organization and application of economic information. You will make an informed assessment of an economic climate outside of the United States to accomplish an entertainment industry objective.
Operation “Blue Star” is the only event in the history of Independent India where the state went into war with its own people. Even after about 40 years it is not clear if it was culmination of states anger over people of the region, a political game of power or start of dictatorial chapter in the democratic setup.
The people of Punjab felt alienated from main stream due to denial of their just demands during a long democratic struggle since independence. As it happen all over the word, it led to militant struggle with great loss of lives of military, police and civilian personnel. Killing of Indira Gandhi and massacre of innocent Sikhs in Delhi and other India cities was also associated with this movement.
Honest Reviews of Tim Han LMA Course Program.pptxtimhan337
Personal development courses are widely available today, with each one promising life-changing outcomes. Tim Han’s Life Mastery Achievers (LMA) Course has drawn a lot of interest. In addition to offering my frank assessment of Success Insider’s LMA Course, this piece examines the course’s effects via a variety of Tim Han LMA course reviews and Success Insider comments.
Read| The latest issue of The Challenger is here! We are thrilled to announce that our school paper has qualified for the NATIONAL SCHOOLS PRESS CONFERENCE (NSPC) 2024. Thank you for your unwavering support and trust. Dive into the stories that made us stand out!
The Roman Empire A Historical Colossus.pdfkaushalkr1407
The Roman Empire, a vast and enduring power, stands as one of history's most remarkable civilizations, leaving an indelible imprint on the world. It emerged from the Roman Republic, transitioning into an imperial powerhouse under the leadership of Augustus Caesar in 27 BCE. This transformation marked the beginning of an era defined by unprecedented territorial expansion, architectural marvels, and profound cultural influence.
The empire's roots lie in the city of Rome, founded, according to legend, by Romulus in 753 BCE. Over centuries, Rome evolved from a small settlement to a formidable republic, characterized by a complex political system with elected officials and checks on power. However, internal strife, class conflicts, and military ambitions paved the way for the end of the Republic. Julius Caesar’s dictatorship and subsequent assassination in 44 BCE created a power vacuum, leading to a civil war. Octavian, later Augustus, emerged victorious, heralding the Roman Empire’s birth.
Under Augustus, the empire experienced the Pax Romana, a 200-year period of relative peace and stability. Augustus reformed the military, established efficient administrative systems, and initiated grand construction projects. The empire's borders expanded, encompassing territories from Britain to Egypt and from Spain to the Euphrates. Roman legions, renowned for their discipline and engineering prowess, secured and maintained these vast territories, building roads, fortifications, and cities that facilitated control and integration.
The Roman Empire’s society was hierarchical, with a rigid class system. At the top were the patricians, wealthy elites who held significant political power. Below them were the plebeians, free citizens with limited political influence, and the vast numbers of slaves who formed the backbone of the economy. The family unit was central, governed by the paterfamilias, the male head who held absolute authority.
Culturally, the Romans were eclectic, absorbing and adapting elements from the civilizations they encountered, particularly the Greeks. Roman art, literature, and philosophy reflected this synthesis, creating a rich cultural tapestry. Latin, the Roman language, became the lingua franca of the Western world, influencing numerous modern languages.
Roman architecture and engineering achievements were monumental. They perfected the arch, vault, and dome, constructing enduring structures like the Colosseum, Pantheon, and aqueducts. These engineering marvels not only showcased Roman ingenuity but also served practical purposes, from public entertainment to water supply.
Priority Based Congestion Avoidance Hybrid Scheme published in IEEE
1. Chandigarh University
University Institute of Engineering
Department of CCE & CSE
“PRIORITY BASED CONGESTION AVOIDANCE
HYBRID SCHEME FOR WIRELESS SENSOR
NETWORK”
JASLEEN KAUR
2. Chandigarh University
University Institute of Engineering
Department of CCE & CSE
• Introduction
• Literature survey
• Problem Formulation
• Objectives
• Methodology
• Work Done
• References
CONTENTS
DEPARTMENT OF CSE
3. Chandigarh University
University Institute of Engineering
Department of CCE & CSE
INTRODUCTION-WIRELESS SENSOR NETWORKS
(WSNs)
• Dense wireless networks which consists of small, low cost sensors
• Monitors the physical environment
• Pass the data through the network to the Base Station for evaluation.
• Base station is a kind of node which is away from the area of sensor
nodes
• Energy of nodes keeps on dissipating
• Sensor nodes have limited battery life
• Sensors are connected to the waspmotes or mica motes in order to
make a sensor node.
DEPARTMENT OF CSE
4. Chandigarh University
University Institute of Engineering
Department of CCE & CSE
• Pressure/ Weight sensor
• Bend sensor
• Hall effect sensor
• Liquid Presence sensor
• Luminosity sensor
• Presence(PIR) sensor
• Temperature sensor
TYPES OF SENSORS
DEPARTMENT OF CSE
5. Chandigarh University
University Institute of Engineering
Department of CCE & CSE
• Monitoring of parking spaces available in the city [14]
• Monitoring of vibrations and material conditions in buildings,
bridges, and historical monuments
• Smartphone Detection
• Intelligent and weather adaptive lightening in street lights.
• Smart Roads
• Forest Fire Detection
• Snow level Monitoring
• Detecting leakage and wastes of factories in rivers
• Animal Tracking
• Patients Surveillance
APPLICATIONS OF WIRELESS SENSOR NETWORKS
DEPARTMENT OF CSE
6. Chandigarh University
University Institute of Engineering
Department of CCE & CSE
DEPLOYMENT
OF NODES IN
WSN
STATIC
DEPLOYMENT
DYNAMIC
DEPLOYMENT
DEPLOYMENT OF NODES IN WSN
Figure1. Types of sensor nodes deployment in WSNs
DEPARTMENT OF CSE
7. Chandigarh University
University Institute of Engineering
Department of CCE & CSE
CONGESTION IN WSNs
• Congestion , in simple terms, means “ An excess of traffic” .
• In terms of a network whether it is wired or wireless, congestion occurs
when the traffic load exceeds the available capacity.
• Congestion happens mainly in the sensors-to-sink direction when
packets are transported in a many-to-one manner.
• In wired networks can provision bandwidth. But difficult in
wireless.
• Radio is unpredictable.
• Channel quality and radio interference can change and reduce the
bandwidth.
• Adding new nodes to WSN introduces more interference, thus
congestion.
DEPARTMENT OF CSE
Why?
8. Chandigarh University
University Institute of Engineering
Department of CCE & CSE
• Finally, sensor network’s traffic patterns can be derived from the
physical processes that they can sense.
• Resulting in extremely bursty and event-driven traffic.
• The results is CONGESTION COLLAPSE.
DEPARTMENT OF CSE
9. Chandigarh University
University Institute of Engineering
Department of CCE & CSE
CONGESTION IN WSNs
• Nowadays, with the ever-increasing use of environmental sensing and
smart grids, in the wireless sensor networks, especially in multi-hop
networks, the quantity of data volume is rapidly increasing.
• To reach the main goal of creating the “smart environments”, in a
narrow space, a large number of sensors are being used and
transmission packets in the same time also increases.
• They have caused an increase traffic in WSN.
• When there is a sudden surge of simultaneous data transmission,
problems arise. This type of surge causes traffic overload at a full buffer
at the receiving node. This state is called traffic congestion.
• Deployment of sensor networks results in network congestion due to
many concurrent transmission attempts made by several sensor nodes.
[9].
DEPARTMENT OF CSE
10. Chandigarh University
University Institute of Engineering
Department of CCE & CSE
• Congestion can result into
– high dropping of packets and delay of packets
– Low throughput
– More energy consumption due to retransmissions
• Congestion can occur at node level or link level [2].
CONGESTION IN WSN continued..
Node level congestion Link level congestion
Figure2. Types of congestion in WSNs
DEPARTMENT OF CSE
12. Chandigarh University
University Institute of Engineering
Department of CCE & CSE
NAME OF
PROTOCOL
YEAR DESCRIPTION
ARC (Adaptive
Rate control)
2001 Mohamed A.K., ARC uses packet loss as collision or
congestion indication at each hop to adjust transmission rate.
If an intermediate nodes overhears that the packets it sent
previously are successfully forwarded again by its parent
node, it will increase its transmission rate. Otherwise it
decreases its sourced rate.
Disadvantage: Prioritized fairness has been envisaged with
ARC. Course rate adjustment could result in packet loss.
ESRT (Event to
sink reliable
transport)
2003 Xong et al., sensors change their sending rate using the sinks
feedback regarding the reliability level or congestion
detection. Every node sets the CN congestion notification bit
in the packets as soon as its buffer reaches its threshold.
When sink receives a packet with CN bit set, it broadcasts a
control signal notifying all source nodes to reduce their
reporting frequency.
LITERATURE SURVEY
DEPARTMENT OF CSE
13. Chandigarh University
University Institute of Engineering
Department of CCE & CSE
NAME OF
PROTOCOL
YEAR DESCRIPTION
CODA 2003 Wan,C-Y et al. proposed Congestion detection and
avoidance in sensor networks. It detects congestion based
on buffer occupancy as well as wireless channel load.
Drawback: This scheme does not consider the fairness issue.
It also results in decreased reliability under conditions such
as high data rate.
FUSION 2004 Mohamad et al., Congestion is detected in each node based
on measurement of queue length. The node that detects
congestion sets CN bit in the header of each outgoing
packet. Once CN bit is set, neighboring nodes can over hear
it and stop forwarding packets to the congested node.
DEPARTMENT OF CSE
14. Chandigarh University
University Institute of Engineering
Department of CCE & CSE
NAME OF
PROTOCOL
YEAR DESCRIPTION
PCCP 2007 Wang et al. proposed “upstream congestion control in WSNs”.
It considers that sensor nodes may have different priorities and
need different throughput. It periodically detects the
congestion using the ratio between packet service time and
packet interval arrival time at MAC Layer. It considers to work
under both single path and multi-path routing scenario.
Drawback: It also does not consider the fairness issue.
Priority-based
rate control for
service
differentiation
and congestion
control
2009 Yaghmaee,M.H.,Adjeroh et al. says that this scheme uses
packet inter-arrival time along with packet service time to
measure a parameter defined as congestion degree and
furthermore imposes hop-by-hop control based on the
measured congestion degree as well as the node priority index.
DEPARTMENT OF CSE
15. Chandigarh University
University Institute of Engineering
Department of CCE & CSE
NAME OF
PROTOCOL
YEAR DESCRIPTION
CSNM 2014 Joy Iong-Zong, a cooperative strong node mechanism is
presented and is named as Cooperative Strong Node
Mechanism(CSNM), in which a threshold is set to determine
whether node traffic is over or not. When the load exceeds, the
privilege of corresponding sensor nodes is upgraded so that it
can command its child nodes to change the transmission path
to distribute the traffic effectively.
SUIT 2014 Cagatay Sonmez et al. In this paper, the authors proposed a
new protocol called Sensor fuzzy-based image transmission
(SUIT) which is a first and new progressive image transport
protocol for efficient multimedia transmission over wireless
multimedia sensor networks (WMSNs). SUIT uses the error
resilience advantage of PJPEG (progressive JPEG) format.
DEPARTMENT OF CSE
16. Chandigarh University
University Institute of Engineering
Department of CCE & CSE
NAME OF
PROTOCOL
YEAR DESCRIPTION
Mobile Sink
based
congestion
avoidance
2014 Authors had compared their scheme with the scenario where the
sink is static. Thus, they have got the improved results for delay,
packet loss and throughput. Still there are some limitations like
more packet loss in the network.
Load balanced
clustering
algorithm
2003 It tries to balance the load among the cluster head nodes named
as gateway nodes here. These gateway nodes initiate the
clustering in the network by broadcasting a message to the nearby
nodes. Every gateway node figure out the communication cost and
exchange this information with other gateway nodes. Only some of
the nodes are selected to be the part of clusters whose distance is
less than the threshold defined distance value.
DEPARTMENT OF CSE
17. Chandigarh University
University Institute of Engineering
Department of CCE & CSE
• Congestion in the network causes the packet loss, reduced throughput,
reliability ,inter packet arrival time and packet service time, and increased
energy consumption and end to end delay.
• In some applications like in in healthcare WSN applications, it is very
important to control the congestion because increase in energy
consumption and end-to-end delay for the packets that carry EKG signals
may even results in the death of the patient.
• So, there is a need to develop an algorithm which detects and controls the
incipient congestion occurring in a wireless sensor network.
Problem Formulation
DEPARTMENT OF CSE
18. Chandigarh University
University Institute of Engineering
Department of CCE & CSE
• To simulate the proposed PCAH algorithm for avoiding the congestion in
wireless sensor network.
• To analyze the results with existing techniques: CSNM and Congestion
avoidance using Mobile sink, in terms of PDR, end-to-end delay, Packet
loss and energy consumption.
Objectives
DEPARTMENT OF CSE
19. Chandigarh University
University Institute of Engineering
Department of CCE & CSE
INFORMATION FLOW OF PROPOSED SCHEME (PCAH)
DEPARTMENT OF CSE
Figure4. Congestion
Avoidance Algorithm
20. Chandigarh University
University Institute of Engineering
Department of CCE & CSE
• Radio duty cycling helps in saving node energy and power.
• The energy wasted in idle listening when node has no data to send
can be saved.
• The cluster head nodes will stay in awake mode all the times
whereas the cluster member nodes can go to sleep mode when
directed by the cluster head node.
• The energy of the cluster member node in sleep mode will be
reduced by unit 1 i.e. En = En – 1 where En is the energy of node n.
• The energy of rest of the nodes in awake mode will decrease by
unit Ω which is directly proportional to the time when the node is
up to transmit the data.
Reason to use RDC
DEPARTMENT OF CSE
21. Chandigarh University
University Institute of Engineering
Department of CCE & CSE
• The nature of the wireless medium is unstable due to the
– channel fading,
– interference between the nodes and from other wireless standards
like nodes with 802.11 mac layer protocol faces interference with
nodes with 802.15.4 protocol.
– Also, the wireless link faces connectivity and coverage problems due
to node mobility.
• Hence, it results in network degradation.
• To attain the better performance under various circumstances, the
wireless nodes needs to adjust their transmission rates dynamically.
Reason to use Rate adaptation approach
DEPARTMENT OF CSE
22. Chandigarh University
University Institute of Engineering
Department of CCE & CSE
• Each node in a network has different task to do.
• There are very few chances that the nodes will be performing the
same task. So if the nodes are performing the same task, then each
node must have different priority.
• So, it’s important to distinguish the task of node according to its
priority.
• For example, a node measuring the heart rate of heart patient has
higher priority than a node measuring the blood rate of diabetic
patient. Node priority could be set initially by the base station.
Reason for giving nodes ‘a priority’
DEPARTMENT OF CSE
25. Chandigarh University
University Institute of Engineering
Department of CCE & CSE
Tools used
SKILLS REQUIRED IN
SOFTWARE
SOFTWARE DESIGNATION
Front End NAM
Back End NS2.35
Operating System Ubuntu 12.04
DEPARTMENT OF CSE
27. Chandigarh University
University Institute of Engineering
Department of CCE & CSE
Getting Updated Energy of each Sensor Node
Figure 7 Accessing Updated energy of nodes
DEPARTMENT OF CSE
28. Chandigarh University
University Institute of Engineering
Department of CCE & CSE
Data Transmission Phase
Figure 8. Multi-node transmission to cluster head (CH)
DEPARTMENT OF CSE
31. Chandigarh University
University Institute of Engineering
Department of CCE & CSE
Accessing Queue Length of Sensor Nodes
Figure 11 Accessing Queue of nodes
DEPARTMENT OF CSE
37. Chandigarh University
University Institute of Engineering
Department of CCE & CSE
Comparison Results-Packet Delivery Ratio
Figure 17. Average PDR ratio of network using PCAH is 96%
Packets generated by CBR=12570 , Packets received = 11961
DEPARTMENT OF CSE
38. Chandigarh University
University Institute of Engineering
Department of CCE & CSE
• Use following command to get the number of packets sent and received
by the traffic source.
grep "^s.*AGT.* cbr.*" out1.tr | wc -l
grep "^r.*AGT.* cbr.*" out1.tr | wc -l
PDR Calculation
40. Chandigarh University
University Institute of Engineering
Department of CCE & CSE
End-to-end Delay
Figure 19. Minimum average delay of 0.01009 seconds (10.09ms) for
PCAH , 0.02067 sec (20.67 ms) for CSNM and 0.38444 sec for Mobile sinks
DEPARTMENT OF CSE
41. Chandigarh University
University Institute of Engineering
Department of CCE & CSE
Residual Energy
Figure 20. Minimum residual energy of nodes using PCAH is 79.9967 Joules
DEPARTMENT OF CSE
43. Chandigarh University
University Institute of Engineering
Department of CCE & CSE
Remaining Energy of Nodes 11-20
Figure 21. Minimum energy of nodes 11-20
DEPARTMENT OF CSE
44. Chandigarh University
University Institute of Engineering
Department of CCE & CSE
Remaining Energy of nodes 21-40
Figure 22(a) Energy of nodes 21-30 Figure 22(b) Energy of nodes 31-40
DEPARTMENT OF CSE
45. Chandigarh University
University Institute of Engineering
Department of CCE & CSE
Remaining Energy of nodes 41-50
Figure 23 Remaining Energy of nodes 41-50
DEPARTMENT OF CSE
46. Chandigarh University
University Institute of Engineering
Department of CCE & CSE
1. Zhang, Hongwei, Anish Arora, Young-ri Choi, and Mohamed G. Gouda.
"Reliable bursty convergecast in wireless sensor networks." Computer
Communications 30, no. 13 (2007), pp. 2560-2576.
2. Yang, Shuang-Hua. “Chapter2: Principle of Wireless Sensor Networks” in
Wireless Sensor Networks: Principles, Design and Applications, Springer,
Edition-1, Series of Signals and Communication Technology, ISSN: 1860-
4862, pp. 7-47, 2014.
3. Pablo Garcia Ansola, Andres Garcia, Javier De Las Morenas, Javier Garcia
Escribano, Franciso Javier Otamendi. “ZigID: Improving visibility in
industrial environments by combining WSN and RFID” in Journal of
Zhejiang University SCIENCE A (Applied physics and engineering), Volume
12, Issue 11, pp. 849-859, Nov 03, 2011.
4. G.Escribano et al., J Zhejiang Univ-Sci C. “Human condition monitoring in
hazardous locations using pervasive RFID sensor tags and energy-efficient
wireless networks” in Journal of Zhejiang University-SCIENCE C
(Computers & Electronics) ,Volume 13, Issue 9, pp. 674-678.
References
DEPARTMENT OF CSE
47. Chandigarh University
University Institute of Engineering
Department of CCE & CSE
5. Joseph Kabara and Maria Calle. “MAC Protocols Used by Wireless Sensor
Networks and a General Method of Performance Evaluation” in
International Journal of Distributed Sensor Networks,
Volume 2012 (2012), Article ID 834784, 11 pages, Sep 16, 2011.
6. Ahmad Abed Alhameed and Gurvinder Singh Baicher. “MAC Layer
Overview for Wireless Sensor Networks” in 2012 International Conference
on Computer Networks and Communication Systems (CNCS 2012) IPCSIT,
Volume 35(2012), IACSIT Press, Singapore, pp.16-19, 2012.
7. Joy Iong-Zong Chen, Chu-Hsing Lin. “Wireless Sensor networks:
Throughput Evaluation of a Novel Scheme to Mitigate the Congestion
over WSNs” in Wireless Pers Commun (2014) 75, pp. 1863-1877 Springer
Science + Business Media New York 2013, 16 October 2013.
8. Kafi, Mohamed Amine, Djamel Djenouri, Jalel Ben-Othman, and Nesrine
Badache. "Congestion control protocols in wireless sensor networks: A
survey." Communications Surveys & Tutorials, IEEE 16, no. 3 (2014), pp.
1369-1390.
References continued..
DEPARTMENT OF CSE
48. Chandigarh University
University Institute of Engineering
Department of CCE & CSE
9. Dashkova, Ekaterina, and Andrei Gurtov. "Survey on congestion control
mechanisms for wireless sensor networks." In Internet of Things, Smart
Spaces, and Next Generation Networking, pp. 75-85. Springer Berlin
Heidelberg, 2012.
10. Saima Zafar. “A survey of transport layer protocols for wireless sensor
networks” in International journal of Computer applications (0975-8887)
Volume33 No.1, November 2011.
11. Michopoulos, Vasilis, Lin Guan, George Oikonomou, and Iain Phillips. "A
comparative study of congestion control algorithms in IPv6 wireless
sensor networks." In Distributed Computing in Sensor Systems and
Workshops (DCOSS), 2011 International Conference on, pp. 1-6. IEEE,
2011.
12. Sonmez, Cagatay, Ozlem Durmaz Incel, Sinan Isik, Mehmet Yunus
Donmez, and Cem Ersoy. "Fuzzy-based congestion control for wireless
multimedia sensor networks." EURASIP Journal on Wireless
Communications and Networking 2014, no. 1 (2014), pp. 1-17.
References Continued..
DEPARTMENT OF CSE
49. Chandigarh University
University Institute of Engineering
Department of CCE & CSE
13. Sankarasubramaniam, Yogesh, Ozgur B. Akan, and Ian F. Akyildiz. "ESRT:
event-to-sink reliable transport in wireless sensor networks."
In Proceedings of the 4th ACM international symposium on Mobile ad
hoc networking & computing, pp. 177-188. ACM, 2003.
14. Wan, Chieh-Yih, Shane B. Eisenman, and Andrew T. Campbell. “CODA:
Congestion detection and avoidance in sensor networks” in proceedings
of 1st international conference on Embedded Networked sensor systems,
pp. 266-279, 2003.
15. Yaghmaee, Mohammad Hossein, and Donald A. Adjeroh. "Priority-based
rate control for service differentiation and congestion control in wireless
multimedia sensor networks." Computer Networks 53, no. 11 (2009), pp.
1798-1811.
16. Wang, Chonggang, Bo Li, Kazem Sohraby, Mahmoud Daneshmand, and
Yueming Hu. "Upstream congestion control in wireless sensor networks
through cross-layer optimization." Selected Areas in Communications,
IEEE Journal on 25, no. 4 (2007),pp. 786-795.
References Continued..
DEPARTMENT OF CSE