Submit the following documents for the second review will be held on 11.03.2011 at 11 a.m. One page description for the following
1. INTRODUCTION
1.1 about the Organization
1.2 System requirement specification
1.2.1 objective
1.2.2 purpose
1.2.3 scope
1.2.4 overview
1.2.5 functionality’s
1.2.6 performance requirements
2.SYSTEM ANALYSIS
2.1 Project Introduction
2.2 Feasibility Study
2.2.1 Economical feasibility
2.2.2 Technical feasibility
2.2.3 Operational feasibility
2.2.4 Initial investigation
2.2.5 Existing System
2.2.6 Proposed System
2.2.7 Benefits of Proposed System
2.2.8 Limitations of Proposed System
3.DEVELOPMENT ENVIRONMENT (should not exceed 10 pages)
3.1 Software and Hardware Requirements
3.2Programming Environment
4. SYSTEM DESIGN
4.1 System Diagram
4.2 Data Flow Diagram
4.3 Table Design
4.4 Normalization
4.5 Modular design
4.6 Data Dictionary
4.7 Inputs and Output Design
5. CODING STYLE
5.1 file naming and organization
5.2 file suffices
6.TESTING
6.1 Unit Testing
6.2 Module Testing
6.3 Integrated Testing
7. QUALITY ASSURANCE
8.SYSTEM SECRITY
9.IMPLEMENTATION
10.MAINTANENCE
11. FUTURE ENHANCEMENT
12.CONCLUSION
13.BIBLIOGRAPHY
APPENDIX I
Entity relationship diagram
SCREEN SHOTS
Note: Only those who had paid the final semester tuition fee are permitted to attend the review
1. INTRODUCTION
1.1 about the Organization
1.2 System requirement specification
1.2.1 objective
1.2.2 purpose
1.2.3 scope
1.2.4 overview
1.2.5 functionality’s
1.2.6 performance requirements
2.SYSTEM ANALYSIS
2.1 Project Introduction
2.2 Feasibility Study
2.2.1 Economical feasibility
2.2.2 Technical feasibility
2.2.3 Operational feasibility
2.2.4 Initial investigation
2.2.5 Existing System
2.2.6 Proposed System
2.2.7 Benefits of Proposed System
2.2.8 Limitations of Proposed System
3.DEVELOPMENT ENVIRONMENT (should not exceed 10 pages)
3.1 Software and Hardware Requirements
3.2Programming Environment
4. SYSTEM DESIGN
4.1 System Diagram
4.2 Data Flow Diagram
4.3 Table Design
4.4 Normalization
4.5 Modular design
4.6 Data Dictionary
4.7 Inputs and Output Design
5. CODING STYLE
5.1 file naming and organization
5.2 file suffices
6.TESTING
6.1 Unit Testing
6.2 Module Testing
6.3 Integrated Testing
7. QUALITY ASSURANCE
8.SYSTEM SECRITY
9.IMPLEMENTATION
10.MAINTANENCE
11. FUTURE ENHANCEMENT
12.CONCLUSION
13.BIBLIOGRAPHY
APPENDIX I
Entity relationship diagram
SCREEN SHOTS
Note: Only those who had paid the final semester tuition fee are permitted to attend the review
I am doing my project in EGATE Solution.
ReplyDeleteContinuous Monitoring of Spatial Queries
ReplyDeleteIn Wireless Broadcast Environments
Purpose:
We propose an air indexing framework that
1) Outperforms the existing (i.e., snapshot) techniques in terms of energy consumption while achieving low access latency and
2) Constitutes the first method supporting efficient processing of continuous spatial queries over moving objects.
Overview:
The data are continuously broadcast by the server, interleaved with some indexing information for query processing. Clients may then tune in the broadcast channel and process their queries locally without contacting the server. Previous work on spatial query processing for wireless broadcast systems has only considered snapshot queries over static data.
Scope:
A user (mobile client) in an unfamiliar city, who would like to know the 10 closest restaurants. This is an instance of a k nearest neighbor (kNN) query, where the query point is the current location of the client and the set of data objects contains the city restaurants. Alternatively, the user may ask for all restaurants located within a certain distance, i.e., within 200 meters. This is an instance of a range query.
1.2.1 Objective
ReplyDeleteWe prove that three-edge connectivity is a necessary and sufficient condition for constructing MCs that uniquely identify any single-link failure in the network. For this case, we formulate the problem of constructing MCs as an integer linear program (ILP).
We also develop heuristic approaches for constructing MCs in the presence of one or more monitoring locations.
We proposed a new scheme finally called fault-detection scheme that can uniquely identify all single-link failures in an arbitrarily connected network. We provided a necessary and sufficient condition on the number of monitors, and an algorithm to calculate the minimum number of monitoring locations.
1.2.2 Purpose
We propose a heuristic (MC-M heuristic) approach to find the FD set for multiple monitoring locations. Finally, we described a fault-detection scheme that can uniquely identify all single-link failures in an arbitrarily connected network. We provided a necessary and sufficient condition on the number of monitors, and an algorithm to calculate the minimum number of monitoring locations.
1.2.3 Scope
For an arbitrary network (not necessarily three-edge connected), we describe a fault localization technique that uses both MPs and MCs and that employs multiple monitoring locations. We also provide a linear-time algorithm to compute the minimum number of required monitoring locations.
1.2.4 Overview
We consider the problem of fault localization in all-optical networks. We introduce the concept of monitoring cycles (MCs) and monitoring paths (MPs) for unique identification of single-link failures. MCs and MPs are required to pass through one or more monitoring locations. They are constructed such that any single-link failure results in the failure of a unique combination of MCs and MPs that pass through the monitoring location(s).
For a network with only one monitoring location, we prove that three-edge connectivity is a necessary and sufficient condition for constructing MCs that uniquely identify any single-link failure in the network. For this case, we formulate the problem of constructing MCs as an integer linear program (ILP).We also develop heuristic approaches for constructing MCs in the presence of one or more monitoring locations. For an arbitrary network (not necessarily three-edge connected), we describe a fault localization technique that uses both MPs and MCs and that employs multiple monitoring locations. We also provide a linear-time algorithm to compute the minimum number of required monitoring locations.
We introduce the concept of monitoring cycles (MCs) and monitoring paths (MPs) for unique identification of single-link failures. MCs and MPs are required to pass through one or more monitoring locations. They are constructed such that any single-link failure results in the failure of a unique combination of MCs and MPs that pass through the monitoring location(s).
Objective
ReplyDeleteThe RFID Generation-2 specification (Gen2 in brief) has been approved for global use, but the identity of tag (TID) is transmitted in plaintext which makes the tag traceable and clonable. Several solutions have been proposed based on traditional encryption methods, such as symmetric or asymmetric ciphers, but they are not suitable for low-cost RFID tags. Recently, some lightweight authentication protocols conforming to Gen2 have been proposed. However, the message flow of these protocols is different from Gen2. Existing readers may fail to read new tags.
Purpose
We present a candidate set finding algorithm that will produce a ck0 close enough to be accepted. After single processes, the back-end database generates ck0 and lets the reader forward it to the tag. Consider the target CRC value ck as a codeword in the code space of 2 power16, where t is the acceptable range of the tag. We want to find a suitable codeword that falls into this range. If the tag does not respond, which means ckj is outside the range, we then eliminate some entries in the database. Note that a and b changes every round and ckj must be recomputed. The following is a pseudo code of the candidate set finding algorithm for the back-end database.
Scope
Radio Frequency Identification (RFID) systems are a common and useful tool in manufacturing, supply chain management and retail inventory control. In the near future, low-cost RFID “electronic product codes” or “smart-labels” may be a practical replacement for optical barcodes on consumer items.
Overview
The RFID Generation-2 specification (Gen2 in brief) has been approved for global use, but the identity of tag (TID) is transmitted in plaintext which makes the tag traceable and clonable. Several solutions have been proposed based on traditional encryption methods, such as symmetric or asymmetric ciphers, but they are not suitable for low-cost RFID tags. Recently, some lightweight authentication protocols conforming to Gen2 have been proposed. However, the message flow of these protocols is different from Gen2. Existing readers may fail to read new tags.
In this project, we propose a novel authentication protocol based on Gen2, called Gen2+, for low-cost RFID tags. Our protocol follows every message flow in Gen2 to provide backward compatibility. Gen2+ is a multiple round protocol using shared pseudonyms and Cyclic Redundancy Check (CRC) to achieve reader-to-tag authentication. Conversely, Gen2+ uses the memory read command defined in Gen2 to achieve tag-to-reader authentication. We show that Gen2+ is more secure under tracing and cloning attacks.
By
K.Rakesh jayavendhan
Objective
ReplyDeleteSecurity has become one of the major issues for data communication over wired and wireless networks.An analytic study on the proposed algorithm is presented, and experiments are conducted to verify the analytic results and to show the capability of the proposed algorithm.
Purpose
A distance-vector-based algorithm for dynamic routing to improve the security of data transmission. We propose to rely on existing distance information exchanged among neighboring nodes (referred to as routers as well in this paper) for the seeking of routing paths. In many distance-vector-based implementations, e.g., those based on RIP, each node Ni maintains a routing table in which each entry is associated with a tuple and Next hop denote some unique destination node, an estimated minimal cost to send a packet to t, and the next node along the minimal-cost path to the destination node, respectively.
Scope
We will propose a dynamic routing algorithm that could randomize delivery paths for data transmission. The algorithm is easy to implement and compatible with popular routing protocols, such as the Routing Information Protocol in wired networks and Destination-Sequenced Distance Vector protocol in wireless networks, without introducing extra control messages.
Overview
Security has become one of the major issues for data communication over wired and wireless networks. Different from the past work on the designs of cryptography algorithms and system infrastructures, we will propose a dynamic routing algorithm that could randomize delivery paths for data transmission.
The algorithm is easy to implement and compatible with popular routing protocols, such as the Routing Information Protocol in wired networks and Destination-Sequenced Distance Vector protocol in wireless networks, without introducing extra control messages. An analytic study on the proposed algorithm is presented, and a series of simulation experiments are conducted to verify the analytic results and to show the capability of the proposed algorithm.
Objective
ReplyDeleteMaximizing network throughput while providing fairness is one of the key challenges in wireless LANs (WLANs). This goal is typically achieved when the load of access points (APs) is balanced. Recent studies on operational WLANs, however, have shown that AP load is often substantially uneven. To alleviate such imbalance of load, several load balancing schemes have been proposed. These schemes commonly require proprietary software or hardware at the user side for controlling the user-AP association. In this paper we present a new load balancing technique by controlling the size of WLAN cells (i.e., AP's coverage range), which is conceptually similar to cell breathing in cellular networks.
Purpose
The proposed system requires the ability of dynamically changing the transmission power of the AP beacon messages. We develop a set of polynomial time algorithms that find the optimal beacon power settings which minimize the load of the most congested AP. We also consider the problem of network-wide min-max load balancing. Simulation results show that the performance of the proposed method is comparable with or superior to the best existing association-based methods.
Scope
The algorithm iteratively finds a minmax priority-load-balanced state that yields the optimal load vector ~Y. At any iteration m, we call a routine to calculate a network state that minimizes the priority load of the mth coordinate of the load vector. The routine needs to satisfy two requirements: Requirement 1. The initial state of each iteration, m, must dominate the optimal state. Requirement 2. The calculated network state at the mth iteration should not affect (increase) the load of the APs that their load have already been determined by the previous iterations.
Overview
Maximizing network throughput while providing fairness is one of the key challenges in wireless LANs (WLANs). This goal is typically achieved when the load of access points (APs) is balanced. Recent studies on operational WLANs, however, have shown that AP load is often substantially uneven. To alleviate such imbalance of load, several load balancing schemes have been proposed. These schemes commonly require proprietary software or hardware at the user side for controlling the user-AP association. In this paper we present a new load balancing technique by controlling the size of WLAN cells (i.e., AP's coverage range), which is conceptually similar to cell breathing in cellular networks. The proposed scheme does not require any modification to the users neither the IEEE 802.11 standard. It only requires the ability of dynamically changing the transmission power of the AP beacon messages. We develop a set of polynomial time algorithms that find the optimal beacon power settings which minimize the load of the most congested AP. We also consider the problem of network-wide min-max load balancing. Simulation results show that the performance of the proposed method is comparable with or superior to the best existing association-based methods.
Objective
ReplyDelete(1) balance the lifetime of all the sensor nodes in the network to increase the network lifetime.
(2) reduce the energy consumption by activating the sensors only when the target arrives in that region.
Purpose
An energy-efficient collaborative target tracking paradigm is developed for wireless sensor networks (WSNs). In addition, a novel approach to energy savings in WSNs is devised in the information-controlled transmission power (ICTP) adjustment, where nodes with more information use higher transmission powers than those that are less informative to share their target state information with the neighboring nodes.
Scope
Protocol EST (energy saving schedule for target tracking sensor networks) that provides a dynamic sleep schedule for the radios such that maximum energy is saved without affecting the sensors' activities. When there is no target, the communication modules of sensor nodes are put into sleep using a static schedule, except the border nodes. Interior nodes do not perform the sensing activity in the surveillance state. If a target arrives, the sleep schedule for the radios is changed dynamically in order to send the arrival message to neighboring sensors.