Annexure -A A Project Report

On

Economical Analysis of Solar Power in Steel Plant

Submitted to

Amity University Uttar Pradesh

In partial fulfillment of the requirements for the award of the degree of

Bachelor of Technologyin

Electrical Engineeringby

SUBHRANSU SEKHAR BISWAL

under the guidance of

Mr.

DEPARTMENT OF ELECTRICAL & ENGINEERINGAMITY SCHOOL OF ENGINEERING AND TECHNOLOGY

AMITY UNIVERSITY UTTAR PRADESHNOIDA (U.P.)

April 2015

Annexure -B

DECLARATION

I Subhransu Sekhar Biswal, student of B.Tech (ECE) hereby declare that the project titled

“Economical Analysis of Solar Power in Steel Plant” is submitted by me to Department of

Electrical Science & Engineering, Amity School of Engineering and Technology, Amity

University Uttar Pradesh, Noida, in partial fulfillment of requirement for the award of the degree

of Bachelor of Technology in 2015 , has not been previously formed the basis for the award of

any degree, diploma or other similar title or recognition.

Noida

Date:28/03/2016 Name and signature of Student

ii

Annexure -C

CERTIFICATE

On the basis of declaration submitted by Subhransu Sekhar Biswal, student of B. Tech ECE, I

hereby certify that the project titled “Economical Analysis of Solar Power in Steel Plant” which

is submitted to Department of Electrical Science & Engineering, Amity School of Engineering

and Technology, Amity University Uttar Pradesh, Noida, in partial fulfillment of the requirement

for the award of the degree of Bachelor of Technology in 2016, is an original contribution with

existing knowledge and faithful record of work carried out by her under my guidance and

supervision.

To the best of my knowledge this work has not been submitted in part or full for any Degree or

Diploma to this University or elsewhere.

Noida

Date Mr……………….

Department of Electrical Engineering

Amity School of Engineering and Technology

Amity University Uttar Pradesh, Noida

Iii

ACKNOWLEDGEMENT

I extend my gratitude towards Dr. Balvinder Shukla, our Vice Chancellor and Dr. Ravi

Prakash, Director, ASET for being my guiding light. I would also like to thank our respected

Head of Computer Science & Engineering Department Prof. (Dr.) ……………for providing me

an opportunity to display my talent.

I would like to express my special thanks of gratitude to my mentor Mr……..for giving me the

golden opportunity to work on the project “Economical Analysis of Solar Power in Steel

Plant”. He was of great help and guided my efforts in the right direction to achieve the best

results.

I am also grateful to my college, Amity School of Engineering and Technology, Amity

University Uttar Pradesh, for providing me the opportunity to work on this project and giving

me ample time amongst my studies to complete the project successfully.

And at the end, I would like to thank my friends who were always there for help and to my

parents for being patient, helpful and resourceful.

SUBHRANSU SEKHAR BISWAL

A2……………….

iv

ABSTRACT

A web document of an educational web site is a document which caters updated and latest

information to the user within precise time that defines the informativeness of a web document.

Informativeness defines the facts which are staged in contingent and prioritized demeanor that

makes a web document a user friendly document.

While navigating a web document user expects that the facts which are cited in a web document

must be Complete, Current, Accurate, and Reliable. On the basis of these factors in the ensuing

paper we took a survey of 6 educational web documents which was completed by 100 students

per web document in which we have enforced Factor Analysis and assertive tests which assures

the adequacy and significance of the sample using SPSS tool to find the principal components of

these factors.

On the basis of eigenvalue above 1 of those 4 factors in the ensuing paper we have prioritized the

factors on the basis of which equipped information should be commenced in a sequenced and

prioritized demeanor in a web document.

v

TABLE OF CONTENTS

Declaration…………………………………………………………………….ii

Certificate…………………………………………………………...................iii

Acknowledgement…………………………………………………………….iv

Abstract………………………………………………………………………...v

Contents………………………………………………………………………..vi

List of figures and tables……………………………………………………..vii

Chapter 1 Introduction……………………………………………………….1

Chapter 2 Literature Survey…………………………………………………2

Chapter 3 Proposed Methodology…………………………………………...4

3.1 Factor Analysis……………………………………....................4

3.2 Carrying out Component Analysis……………………………...5

Chapter 4 Results & Discussion……………………………………………...7

4.1 Structural Validity………………………………………………7

Chapter 5 Conclusions…………………………………………....................14

Chapter 6 Future Prospect………………………………………………….15

Appendices……………………………………………………………………16

References…………………………………………………………………….21

vi

LIST OF FIGURES & TABLES

Fig 3.1- 5 Step Factor Analysis Protocol……………………………………..5

Fig 3.2- Flow Chart of proposed model………………………………………6

Fig 4.1- Exploratory Factor Analysis Correlation Diagram of the scale

(eigenvalue)…………………………………………………………………...12

Fig 4.2- Scree Plot…………………………………………………………….13

Table 4.1- KMO and Bartlett’s test…………………………………………..7

Table 4.2- Descriptive Statistics………………………………………………8

Table 4.3- Communalities……………………………………………………..9

Table 4.4- Component Matrix…………………………………………….....10

Table 4.5- Total Variance Explained………………………………………..11

vii

CHAPTER 1- INTRODUCTION

Traffic analysis is the process of intercepting and examining messages in order to deduce information from patterns in communication. It can be performed even when the messages are encrypted and cannot be decrypted. Traffic analysis tasks may be supported by dedicated computer software programs. Advanced traffic analysis techniques may include various forms of social network analysis.

A heterogeneous network which has been worked upon is a network connecting computers and other devices with different operating systems and/or protocols. For example, local area networks (LANs) that connect Microsoft Windows and Linux based personal computers with Apple Macintosh computers are heterogeneous.The term heterogeneous network is also used in wireless networks using different access technologies. For example, a wireless network which provides a service through a wireless LAN and is able to maintain the service when switching to a cellular network is called a wireless heterogeneous network.

From a semantical point of view, it is very important to note that the Heterogeneous Network terminology may have different connotations in wireless telecommunications. For instance, it may refer to the paradigm of seamless and ubiquitous interoperability between various multi-coverage protocols Otherwise, it may refer to the non-uniform spatial distribution of users or wireless nodes .

In the project Amity network is worked upon and the congestion between the nodes is checked.On the basis of the type of congestion different algorithms are studied and applied to improve the results and lessen the congestion hence produced.

1

CHAPTER 2- LITERATURE SURVEY

Questions to be Answered:

What are the markets for solar?How do we think about the cost of solar relative to other power sources?What do cost profiles need to be in order to achieve grid parity?Where is the industry today and where is it headed?

Figure.1. 1.Cumulative installed PV

1.1.Three Primary Types of Solar Power: Photovoltaics(PV) Concentrating PV Solar thermal

Figure.1.2.Photovoltaic and concentrating PV

A photovoltaic system employs solar panels composed of a number of solar cells to supply usable solar power. The process is both physical and chemical in nature, as the first step involves the photoelectric effect from which a second electrochemical process takes place involving crystallized atoms being ionized in a series, generating an electric current. The direct conversion of sunlight to electricity occurs without any moving parts or environmental emissions during operation.

In Concentrating Photovoltaics (CPV), a large area of sunlight is focused onto the solar cell with the help of an optical device. By concentrating sunlight onto a small area, this technology has three competitive advantages:

o Requires less photovoltaic material to capture the same sunlight as non-concentrating pv.

o Makes the use of high-efficiency but expensive multi-junction cells economically viable due to smaller space requirements.

o It is less dependant on the immature silicon supply chain. Moreover, optics are less expensive than cells.

Figure.1.3.Solar Thermal

Solar thermal power generation works essentially the same as power generation using fossil fuels, but instead of using steam produced from the combustion of fossil fuels, the steam is produced by heat collected from sunlight. Solar thermal technologies use concentrator systems to achieve the high temperatures needed to produce steam.Types of solar thermal power plantsThere are three main types of solar thermal power systems:▪ Parabolic trough▪ Solar dish

Solar power tower

1.2.Three Primary PV Markets Today

Figure 1.4. a.Residential rooftop b.Commercial rooftop

Figure1.4.c.Ground mounted usually utility scale

1.3 Emerging PV Markets:

Building-Integrated PV (BIPV) Enabled by flexible form-factor

Rural Electrification Requires cheaper batteries and panels for wide-spread adoption

Also niche applications: calculators, satellites, remote power, etc.

1.4. Electricity Supply Chain

Figure 1.5.Generation,transmission and distribution of electricity

CHAPTER 3- ANALYSED AND PROPOSED MODEL

PROCESS FLOW:

• Basic TCP congestion control model

• Over flooding and checking the network for the maximum load it can handle

• Real time network analysis: generation of logs

• Apply and check for packet routing and AODV.

• Propose an algorithm for the given network and generate results.

3.1.ALGORITHMS STUDIED:

ZONE ROUTING PROTOCOL:

In network context,the hybrid Zone Routing Protocol (ZRP) framework can adapt to a wide variety of network scenarios by adjusting the range of the nodes'proactively maintained routing zones. Large routing zones are preferred when demand for routes is high and/or the network consists of many slowly moving nodes. In the extreme case of a network with fixed topology, the ideal routing zone radius would be infinitely large. (Consider the purely proactive routing protocols used on the fixed Internet). On the other hand, smaller routing zones are appropriate in situations where route demand is low and/or the network consists of a small number of nodes that move fast relativeto one another. In the "worst case", a routing zone radius of one hop is best, and the ZRP defaults to a traditional reactive flooding protocol.

When the ZRP is properly configured for a particular network scenario,it can perform at least as well as (and often better than) its purelyproactive and reactive constituent protocols. In situations where the network behavior varies across different regions,

the ZRP performance can be fine-tuned by individual adjustment of each node's routing zone.

The global reactive component of the ZRP uses the multicast based "bordercast" mechanism to propagate route queries throughout the network efficiently, rather than relying on neighbor-broadcast flooding found in traditional reactive protocols.Consequently, the ZRP provides the most benefit in networks where reliable neighbor broadcasting is either inefficient or altogether impossible. In particular, the ZRP is well suited for multi-channel, multi-technology routing fabrics and networks operating under high load.

One of the major challenges in designing a routing protocol for the ad hoc networks stems from the fact that, on one hand, to determine a packet route, a node needs to know at least the reachability information to its neighbors. On the other hand, in an ad hoc network, the network topology can change quite often. Furthermore, as the number of network nodes can be large, the potential number of destinations is also large, requiring large and frequent exchange of data (e.g., routes, routes updates, or routing tables) among the network nodes. Thus, the amount of update traffic can be quite high.This is in contradiction with the fact that all updates in a wirelessly interconnected ad hoc network travel over the air and,thus, are costly in resources.

In general, the existing routing protocols can be classified either as proactive or as reactive. Proactive protocols attempt to continuously evaluate the routes within the network, so that when a packet needs to be forwarded, the route is already known and can be immediately used. The family of Distance-Vector protocols is an example of a proactive scheme. Examples of proactive routing protocols include the Wireless Routing Protocol (WRP) and Destination-Sequenced Distance-Vector (DSDV) routing . Reactive protocols, on the other hand, invoke a route determination procedure on demand only. Thus, when a route is needed, some sort of global search procedure is employed. The family of classical flooding algorithms belong to the reactive group. Some other examples of reactive (also called on-demand) ad hoc network routing protocols are Dynamic Source Routing (DSR) , Ad-hoc On demand Distance Vector Routing (AODV) and the Temporally Ordered Routing Algorithm (TORA).

The advantage of the proactive schemes is that, once a route is needed, there is little delay until the route is determined. In reactive protocols, because route information

may not be available at the time a datagram is received, the delay to determine a route can be quite significant. Furthermore, the global flood-search procedure of the reactive protocols requires significant control traffic. Because of this long delay and excessive control traffic, pure reactive routing protocols may not be applicable to real-time communication. However, pure proactive schemes are likewise not appropriate for the ad hoc networking environment, as they continuously use a large portion of the network capacity to keep the routing information current. Since nodes in an ad hoc network move quite fast, and as the changes may be more frequent than the route requests, most of this routing information is never even used! This results in a further waste of the wireless network capacity. What is needed is a protocol that, on one hand, initiates the route determination procedure on-demand, but at limited search cost. The protocol described in this draft, termed the "Zone Routing Protocol(ZRP)".

The ZRP, on one hand, limits the scope of the proactive procedure only to the node's local neighborhood. On the other hand, the search throughout the network, although global in nature, is done by efficiently querying selected nodes in the network, as opposed to querying all the network nodes.

A related issue is that of updates in the network topology. For a routing protocol to be efficient, changes in the network topology should have only a local effect. In other words, creation of a new link at one end of the network is an important local event but, most probably, not a significant piece of information at the other end of the network. Globally proactive protocols tend to distribute such topological changes widely in the network, incurring large costs. The ZRP limits propagation of such information to the neighborhood of the change only, thus limiting the cost of topological updates.

OVERVIEW:

In the Zone Routing framework, a proactive routing protocol provides a detailed and fresh view of each node's surrounding local topology (routing zone) at the local level.The knowledge of local topology is used to support services such as proactive route maintenance, unidirectional link discovery and guided message distribution. One particular message distribution service, called bordercasting, directs queries throughout the network across overlapping routing zones. Bordercasting is used in place of traditional broadcasting to improve the efficiency of a global reactive routing protocol.

The benefits provided by routing zones, compared with the overhead of proactively tracking routing zone topology, determine the optimal framework configuration. As network conditions change, the framework can be dynamically reconfigured through adjustment of each node's routing zone.

K-MEANS CLUSTERING:

k-means clustering is a method of vector quantization, originally from signal processing, that is popular for cluster analysis in data mining. k-means clustering aims to partition n observations into k clusters in which each observation belongs to the cluster with the nearest mean serving as a prototype of the cluster. This results in a partitioning of the data space into Voronoi cells.

The problem is computationally difficult (NP-hard); however, there are efficient heuristic algorithms that are commonly employed and converge quickly to a local optimum. These are usually similar to the expectation-maximization algorithm for mixtures of Gaussia distributions via an iterative refinement approach employed by both algorithms. Additionally, they both use cluster centers to model the data; however, k-means clustering tends to find clusters of comparable spatial extent, while the expectation-maximization mechanism allows clusters to have different shapes.

The algorithm has nothing to do with and should not be confused with k-nearest neighbor another popular machine learning technique.

Clustering is the process of partitioning a group of data points into a small number of clusters. For instance, the items in a supermarket are clustered in categories (butter, cheese and milk are grouped in dairy products). Of course this is a qualitative kind of partitioning. A quantitative approach would be to measure certain features of the products, say percentage of milk and others, and products with high percentage of milk would be grouped together. In general, we have n  data points x i ,i=1...n  that have to be partitioned in k  clusters. The goal is to assign a cluster to each data point. K-means is a clustering method that aims to find the positions μ i ,i=1...k of the clusters that minimize the distance from the data points to the cluster. K-means clustering solves

where c i   is the set of points that belong to cluster i  . The K-means clustering uses the square of the Euclidean distance d(x,μ i )=∥x−μ i ∥ 2 2   . This problem is not trivial (in fact it is NP-hard), so the K-means algorithm only hopes to find the global minimum, possibly getting stuck in a different solution.

Deciding the number of clusters

The number of clusters should match the data. An incorrect choice of the number of clusters will invalidate the whole process. An empirical way to find the best number of clusters is to try K-means clustering with different number of clusters and measure the resulting sum of squares.

Initializing the position of the clusters

It is really up to you! Here are some common methods:

Forgy: set the positions of the k  clusters to k  observations chosen randomly from the dataset.

Random partition: assign a cluster randomly to each observation and compute means as in step 3.

Since the algorithm stops in a local minimum, the initial position of the clusters is very important

Initialization method

Commonly used initialization methods are Forgy and Random Partition. The Forgy method randomly chooses k observations from the data set and uses these as the initial means. The Random Partition method first randomly assigns a cluster to each observation and then proceeds to the update step, thus computing the initial mean to be the centroid of the cluster's randomly assigned points. The Forgy method tends to spread the initial means out, while Random Partition places all of them close to the center of the data set. According to Hamerly et al.,http://en.wikipedia.org/wiki/K-means_clustering - cite_note-hamerly-9 the Random Partition method is generally preferable for algorithms such as the k-harmonic means and fuzzy k-means. For expectation maximization and standard k-means algorithms, the Forgy method of initialization is preferable.

Demonstartion of the algortihm:

1) k initial "means" (in this case k=3) are randomly generated within the data domain (shown in color).

2) k clusters are created by associating every observation with the nearest mean. The partitions here represent the Voronoi diagram generated by the means.

3) The centroid of each of the k clusters becomes the new mean.

4) Steps 2 and 3 are repeated until convergence has been reached.

Algorithm:

1. Place K points into the space represented by the objects that are being clustered. These points represent initial group centroids.

2. Assign each object to the group that has the closest centroid.3. When all objects have been assigned, recalculate the positions of the K centroids.4. Repeat Steps 2 and 3 until the centroids no longer move. This produces a separation

of the objects into groups from which the metric to be minimized can be calculated.

3.2. Carrying out study on MANET protocols.

Infrastructure Networks Infrastructure network consists of a network with fixed and wired gateways. A mobile host communicates with a bridge in the network (called base station) within its communication radius. The mobile unit can move geographically while it is communicating. When it goes out of range of one base station, it connects with new base station and starts communicating through it. This is called handoff. In this approach the base stations are fixed.

Infrastructure Network

In ad hoc networks all nodes are mobile and can be connected dynamically in an arbitrary manner. As the range of each host’s wireless transmission is limited, so to communicate with hosts outside its transmission range, a host needs to enlist the aid of its nearby hosts in forwarding packets to the destination. So all nodes of these networks behave as routers and take part in discovery and maintenance of routes to other nodes in the network.

Mobile Ad hoc Network

Challenges in MANETs -> Power controlling at Physical layer ->Efficient routing at Network layer->Quality of service at Transport layer

Routing Protocols It is difficult to design an efficient routing protocol in the MANET environment because of its property of “short living”.As the network topologies are changed dynamically, routing protocols for MANETs can be broadly classified into two categories. Those are Proactive i.e table-driven routing protocols Reactive i.e on-demand routing protocols.

Proactive routing protocols Proactive MANET protocols are table-driven and will actively determine the layout of the network. Through a regular exchange of network topology packets between the nodes of the network, a complete picture of the network is maintained at every single node. There is hence minimal delay in determining the route to be selected. Some Proactive MANET Protocols include: DSDV, DBF, GSR, WRP, ZRP, and FSR.

Reactive routing protocols On-demand routing is a popular routing category for wireless ad hoc routing. It is a relatively new routing philosophy that provides a scalable solution to relatively large network topologies. The design follows the idea that each node tries to reduce routing overhead by only sending routing packets when communication is requested. Common for most on-demand routing protocols are the route discovery phase where packets are flooded into the network in search of an optimal path to the destination node in the network. Some Reactive MANET Protocols include: DSR, AODV and TORA.

The emphasis in this paper is concentrated on the comparison of various Proactive and Reactive protocols like ZRP and AODV

DSDVThis protocol is based on classical Bellman-Ford routing algorithm [3] designed for MANETS. Each node maintains a list of all destinations and number of hops to each destination. Each entry is marked with a sequence number. It uses full dump or incremental update to reduce network traffic generated by route updates. The broadcast of route updates is delayed by settling time. The only improvement made here is avoidance of routing loops in a mobile network of routers. With this improvement, routing information is always available, regardless whether the source node requires the information or not. With the addition of sequence numbers, routes for the same destination are selected based on the following rules:

1. A route with a newer sequence number is preferred

2. In the case that two routes have a same sequence number, the one with a better cost metric is preferred. The list which is maintained is called routing table. The routing table contains the following:

The sequence number is used to distinguish stale routes from new ones and thus it avoids the formation of loops. The stations periodically transmit their routing tables to their immediate neighbors. A station also transmits its routing table if a significant change has occurred in its table from the last update sent. So, the update is both time-driven and event-driven.

Each row of the update send is of the following form: <Dest. IP address, Dest. sequence number, Hop count> After receiving an update neighboring nodes utilizes it to compute the routing table entries.

No.of hops Sequence no. Install timeNext hopDestination

Resolving route failure in DSDV

DSR

The Dynamic Source Routing protocol (DSR) is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes. DSR allows the network to be completely self-organizing and self-configuring, without the need for any existing network infrastructure or administration. It uses source routing which means that the source must know the complete hop sequence to the destination. Each node maintains a route cache, where all the known routes are stored. The route discovery process is initiated only if the desired route cannot be found in the route cache. To limit the number of route requests propagated, a node processes the route request message only if it has not already received the message and its address is not present in the route record of the message. The advantage is that intermediate nodes can learn routes from the source routes in the packets they receive. The protocol is composed of the two main mechanisms of "Route Discovery" and "Route Maintenance", which work together to allow nodes to discover and maintain routes to arbitrary destinations in the ad hoc network. The protocol allows multiple routes to any destination and allows each sender to select and control the routes used in routing its packets, for example, for use in load balancing or for increased robustness.

Route Discovery Route Discovery is used whenever a source node desires a route to a destination node. First, the source node looks up its route cache to determine if it contains a route to the destination. If the source finds a valid route to the destination, it uses this route to send its data packets. If the node does not have a valid route to the

destination, it initiates the route discovery process by broadcasting a route request message. The route request message contains the address of the source and the destination, and a unique identification number. An intermediate node that receives a route request message searches its route cache for a route to the destination. If no route is found, it appends its address to the route record of the message and forwards the message to its neighbors. The message propagates through the network until it reaches either the destination or an intermediate node with a route to the destination. Then a route reply message, containing the proper hop sequence for reaching the destination, is generated and unicast back to the source node.

Route maintenance Route Maintenance is used to handle route breaks. When a node encounters a fatal transmission problem at its data link layer, it removes the route from its route cache and generates a route error message. The route error message is sent to each node that has sent a packet routed over the broken link. When a node receives a route error message, it removes the hop in error from its route cache. Acknowledgment messages are used to verify the correct operation of the route links.

DSR request and reply

AODV

The Ad hoc On Demand Vector routing algorithm [5] is a routing protocol designed for ad hoc mobile networks. AODV is capable of both unicast and multicast routing. It is an on demand routing algorithm, means that it builds routes between nodes only as desired by the source nodes. It maintains these routes as long as they are needed by the sources. AODV uses sequence numbers to ensure the freshness of routes. It is a loop-free, self starting and scales to large number of mobile nodes. For example, node S intends to find a route to node D.the process is explained in the figure:

AODV Routing Protocol Model

AODV builds routes using a route REQUEST and route REPLY query cycle. When a source node desires a route to a destination for which it does not have a route, it broadcasts a route request (RREQ) packet across the network. Nodes receiving the packet update their information for the source node and set up backwards pointers to the source node in the route tables. In addition to the source node’s IP address, current sequence number and broadcast ID, the RREQ also contains the most recent sequence number for the destination of which the source node is aware. A node receiving the RREQ may send a route reply (RREP) if it is either the destination or if it has a route to the destination with the corresponding sequence number greater than or equal to that contained in the RREQ. If this is the case, it unicasts a RREP back to the source. Otherwise, it rebroadcasts the RREQ. Nodes keep track of the RREQ’s source IP address and broadcast ID. If they receive a RREQ which they have already processed, they discard the RREQ and do not forward it. RREP propagates back to the source, nodes set up forward pointers to the destination. Once the source node receives the RREP, it may begin to forward data packets to the destination. As long as the route remains active, it will continue to be maintained. A route is considered active as long as there are data packets periodically travelling from the source to the destination along that path. Once the source stops sending data packets, the links will timeout and eventually be deleted from the intermediate node routing tables. If a link break occurs while the route is active, the node upstream of the break propagates a route error (RERR) message to the source node to inform it of the now unreachable destination(s). After receiving the RERR, if the source node still desires the route, it can reinitiate route discovery.

CHAPTER 4- RESULTS AND DISCUSSION

NS3 Performance :Time

NS3 Performance :Memory

PERFORMANCE METRICS: Packet Delivery Ratio = Number of packets received successfully/Number of packets sent Average Throughput = Total Received size/Elapsed time between sent and receive Average Routing Load = Number of Routing Control Packets/Total Simulation Time Average End to End Delay = Sum (for each i equal to packet number, (packet i received time- packet i sent time))

Packet delivery ratio

Average end to end delay

Throughput

Routing load

Graph 1 shows packet delivery ratio with pause time varying from 0 to 300 for DSR, DSDV and AODV routing protocols. The red line shows graph for DSR, the green line shows the graph for DSDV and the blue line shows the graph for AODV protocol. The delivery ratio for all the protocols is always greater than 65 percent. The basic difference between these protocols is very less. But generally the graph for the DSR protocol lies above that of DSDV and AODV for most cases. However in certain cases the DSDV protocols is also better. Graph 2 shows the average end-to-end delay is less for the DSDV approach than for the DSR approach, mean while AODV maintains consistency in this performance metric. The reason is that the periodic gateway information sent by the gateways allows the mobile nodes to update their route entries for the gateways more often, resulting in fresher and shorter routes in DSDV. With the DSR (reactive approach) a mobile node continues to use a route to a gateway until it is broken. Graph 3 shows the result shows that the average throughput for DSDV and DSR are better with high mobility nodes. At the end of simulation times the AODV goes closer to the other in Average throughput.

Graph 4 shows the routing overhead for AODV always in a high peak rate when compared to the other protocols this is because AODV periodically sends RREQ, RREP packets. The routing overload for DSDV is less in all situations with any number of nodes. The routing overhead for DSR is somewhat closer to DSDV and which are far from AODV.

CHAPTER 5- CONCLUSION

In this paper we have presented how informativeness of an educational web document

depends on the 4 factors Complete, Accuracy, Relevance and Currency with the help of

previous work performed by other researchers and a task which was completed by 100

students on 6 different educational web documents by enforcing factor analysis and by

finding the principal components of these factors by enforcing principal component analysis

using SPSS tool and assertive tests has been done such as KMO having value 0.8139 which

represents that our collected sample is adequate and Bartlett’s test which measures null

hypothesis and all these factors also been represented graphically with the help of scree plot

having eigenvalue above 1 .

With the help of this assessment we came to know that in what order the factual information

presented in a document must be prioritized and sequenced which will give user a

contentment to retrieve latest and updated information within precise time in a user friendly

manner.

CHAPTER 6- FUTURE PROSPECTS

In this project we have taken the survey of 6 different educational web documents,

100 students per web document, and on that basis we have concluded the result but in

future we can collect the large sample and on that we can perform factor analysis to

get more accurate and real results.

In this project we have analyzed and prioritized 4 factors Currency, Accuracy,

Reliability and Completeness on the basis of which information should present in a

web document but in future we can consider more factors to get more accurate and

real results.

In future we can compare our results of Exploratory Factor Analysis using SPSS with

Conformatory Factor Analysis using SPSS AMOS to get accurate results.

When information is added in a web document then side by side its complexity and

response time also increases so in order to reduce complexity and response time we

can make a software which will collect all the factual information and will help in

removing the information which has not been updated from a long time.

Appendices

Task Questionnaire

1. Check the availability of the fee structure in the given web site of college.

a) Break structure is given(Tuition fee, security fee, project fee)

b) Semester wise fee structure is given

c) Course wise fee structure is given

d) Complete fee structure is given

e) Fee structure is not available

2. Find the hostel details of the given college.

a) Only the number of available seats are mentioned

b) Hostel fee structure is given

c) Separate girls and boys hostel are available

d) Complete details of hostel are given

e) Hostel facility is not available

3. Find the placement details of the given college.

a) Specification of companies are given only

b) Course wise companies names are mentioned

c) Package offered by company is also mentioned with its specification.

d) Complete details are given

e) Placement details are not available

4. Find the details of the placements in regard to students who got placed during campus

recruitment process.

a) Number of placed students are mentioned of respective companies

b) Package offered by company is mentioned with student details

c) Future training and joining details are mentioned in brief by the company

d) Complete details are given

e) Details about students are not given

5. Find the in-campus services (medical facility, canteen, sports facility ) mentioned in the

given website of a college.

a) Only number of services are given

b) Types of services are given

c) Services are mentioned in detail

d) Services are available to a extent without any detail

e) No such services are available

6. Find the services offered by library in the given website of a college.

a) Department wise books are available

b) Only number of books available are mentioned

c) With books, technical (computer) facility is also given

d) Complete details are given

e) Details about library services are not given

7. Find the details of the available departments in the given website of a college.

a) Only number of courses/departments are mentioned

b) Course wise staff details are available

c) Facilities (labs) offered by respective departments (course wise) are mentioned

d) Complete details are available

e) Department details are not available

8. Check the availability of news and events of a college in the given website

a) Either of upcoming events or events which recently took place are mentioned

b) Both the upcoming events or events which recently took place are mentioned

c) With the event details, details of training programs and workshops are also given

d) Complete details are available

e) No such news and event details are available on the website

9. Find the details of research and development department in the website of a given college

a) Information about Incubator is available

b) Information about consultancy projects are available

c) Information about conferences are available

d) All the above information are available

e) No such R&D department is available

10. Check the availability of alumni details in the given website of the college

a) Details of last alumni meet are available

b) Details of upcoming alumni meet are available

c) Both the above details are available

d) With the availability of above details registration facility for alumni meet is also

available for those who passed out 10 or 15 years ago from this college

e) No such information is available

11. Check for circular and notices

a) notice/circular tab available

b) News flash for the latest/upcoming events.

c) recent updates are available

d) Above all information is given

e) No recent updation.

12. How quickly you reached to the desired information

a) Immediately

b) Quickly

c) Slowly

d) Easily

e) Not able to found

13. Are you able to find the relevant information in time?

a) All the desired information is found

b) Not all but most of the information found

c) To an extent

d) Only some of the information is found.

e) NOT FOUND

14. Difficulty in finding the information rate on 1-5 scale

a) 5

b) 4

c) 3

d)2

e)1

15. Does the information available on the website help you to understand facilities and

features of the institute, rate on 1-5 scale

a)5

b)4

c)3

d)2

e)1

16.Are you able to find the result summary on the website of the institute

a) result tab is available.

b) summary of the result is available.

c) merit holders names are given.

d) result and examination related information available. .

e) no detail given.

17. Are you able to find the "CONTACT US" tab on the home page.

a) Complete details available

b) sitemap given("How to reach")

c) name of the contact person with its detail available .

d) contact number of the institute available.

e) no information given.

18. Is any "PHOTO GALLERY" available

a) virtual tour of the institute available.

b) infrastructure photographs available.

c) photographs of event held available

d) some unrelated photographs available.

e) not available.

19. Information regarding the MOUs and accreditation

a) complete information available

b) details of rankings and accreditation available

c) details of affiliations available.

d) 2

e) no information available.

20. Information regarding the infrastructure available

a) complete information available.

b) information regarding the bandwidth available.

c) information regarding the software available.

d) smart classes information available.

e) no information available.

REFERENCES

1. Pett MA, Lackey NR, Sullivan JJ. Making Sense of Factor Analysis: The use of factor analysis for instrument development in health care research. California: Sage Publications Inc; 2003.

2. Gorsuch RL. Factor Analysis. Hillsdale, NJ: Erlbaum; 1983.

3. Hair J, Anderson RE, Tatham RL, Black WC. Multivariate data analysis. 4th ed. New Jersey: Prentice-Hall Inc; 1995.

4. Tabachnick BG, Fidell LS. Using Multivariate Statistics. Boston: Pearson Education Inc; 2007.

5. Thompson B. Exploratory and confirmatory factor analysis: understanding concepts and applications. Washington, DC: American Psychological Association; 2004.

6. Sharmishtha Roy, Prasant Kumar Pattnaik, Rajib Mall. A quantitative approach to evaluate usability of academic websites based on human perception. CrossMark 2014

7. Robin Beauont. An introduction to Principal Component Analysis and Factor Analysis usin SPSS 19 and R. Psych Package 2012

8. Lautenbach MAE, Schegget IS, Schoute AM, Witteman CLM. Evaluating the usability of web pages: a case study; 19999. M. Manzoor, W. Hussain A web usability evaluation model for higher education providing Universities of Asia Sci Technol Dev, 31 (2) (2012)

10. S.A. Mentes, A.H. Turan Assessing the usability of university websites: an empiric study on Namik Kemal University Turk Online J Educat Technol

11. Thompson B, Daniel LG. Factor analytic evidence for the construct validity of scores: A historical overview and some guidelines. Educational and PsychologicalMeasurement. 1996;56(2):197-208.

12. Kaiser HF. The application of electronic computers to factor analysis. Educational andPsychological Measurement. 1960;20:141-51.

13. Cattell RB. The scree test for the number of factors. Multivariate Behavioral Research.1966;1(2):245-76.

14. Horn JL. A rationale and test for the number of factors in factor analysis. Psychometrika. 1965;30(2):179-85.

15. Pallant J. SPSS Survival Guide: A Step by Step Guide to Data Analysis using SPSS for Windows. 3rd ed. New York: Open University Press; 2007.