Code Explanation 

To develop the proposed Enterprise Collaboration Tool system, We have created a java based web application and used Oracle as my database to the application. All the required front end pages are created using jsp files, where the user interface is created. Following are few important jsp files used in this application and the detailed description and coding procedure followed is as discussed below

Login screen shot of the application is as shown below:

Login id and Password fields are created on the html file and the tags like td and tr used to align the text fields in a table. Role based login is provided to the end user, where a user and administrator can login to the system. Different set of activities are designated to the user and admin and they are activated based on the login mode selected by the end user. When the user login to the system, they are provided with some links like Meeting, Scheduling and Calendar. These links are the basic activities that any user can perform related to their enterprise collaboration. If Admin is the user and after the successful login to the system, a welcome page is shown to the user as shown in the below screen.

Administrator is provided with the options like Create user, Update user and deletes an existing user. Admin user can create a new user by clicking on the link Create User and the basic coding logic used is as explained below

A jsp file adduser is created to add a particular user to the database. This jsp holds the logic to enter the required field attributes related to the user details and below code is used to add the user

[php]
}

if(document.form1.fname.value==""){

alert("ENTER FIRST NAME OF THE USER");

document.form1.fname.focus();

return false;

}

if(document.form1.lname.value==""){

alert("ENTER LAST NAME OF THE USER");

document.form1.lname.focus();

return false;

}

if(document.form1.address.value==""){

alert("ENTER ADDRESS OF THE USER");

document.form1.address.focus();

return false;

}

if(document.form1.mailid.value==""){

alert("ENTER MAILID OF THE USER");

document.form1.mailid.focus();

return false;

[/php]

Once the field values are entered to the jsp file, these values are finally added to the database. A database object is created to the Oracle database using Class.forName object and Driver manager is used to establish the connection to the database using thin driver. Below code is used to establish the connection to the database

[php]</pre>
ResultSet rset=null;

DBConnection dbcon=new dbgeneralimpl();

c=dbcon.getConnection();

con=dbcon.getConnection();

st=c.createStatement();
<pre>[/php]

Similar type of coding is implemented to update and delete users. Below screen shot shows the procedure to add a new user.

Once the users are registered with the database, now the user can login to the system and perform the activities like Sending a message, view the messages and request for a new key as shown in the below screen shot

Once the user login is successful, they are navigated to the user home page with a welcome message and then the user can perform the activities mentioned above and the corresponding screen shot is as below

At the first login of the user, they should raise a request for new private key by clicking on the link at the left frame “Generate a New Private Key”. Once the action is performed, navigation is shifted to new key generation request page and the corresponding code is as discussed below

[php]</pre>
Connection c=null;

Statement st=null;

ResultSet rs=null;

DBConnection dbcon=new dbgeneralimpl();

c=dbcon.getConnection();

st=c.createStatement();

String query="select userid from keygenerate_twm";

rs=st.executeQuery(query);

while(rs.next())

{

uuser1=rs.getString(1);

System.out.println("userid is : " +uuser1);

}

if(uuser.equals(uuser1))

{

%>

<tr><td> U R Already Have a Private Key </td></tr>

<% }

else

{

Random generator = new Random();

int ra = generator.nextInt(50000);

System.out.println("Random Value is : " +ra);

String query1="insert into keygenerate_twm(userid,keyvale,status) values(‘"+uuser+"’,’"+ra+"’,’pending’)";

System.out.println("Query 1 is : " +query1);

int in=st.executeUpdate(query1);

if(in==1)

{ %>

<tr><td> Your Request is Send to Admin </td></tr>

<%}

else

{%>

<tr><td> process is Pending </td></tr>
<pre>[/php]

User session is tracked by the session variable and the corresponding user id is fetched from the user login and based on the id, a query is build to the database table from keygenerate_twm. The coding logic first checks if the user has already a private key and if this is the case, an error message is displayed to the user and if this is the first time a user is requesting the private key, the logic is shifted toward new key generation. Random class is used to generate a random number and the same is updated to the table as the private key of the user and the corresponding status of the key request is updated by the administrator. Below screen shot shows the procedure discussed

Once a request is placed for a new Private key, now the users can track the status of the request by clicking on the link Private Key Status and the corresponding code used is explained as below

[php]
String query="select userid,keyvale,status from keygenerate_twm where userid=’"+uuser+"’";

System.out.println("Query is : " +query);

rs=st.executeQuery(query);

while(rs.next())

{

uuser1=rs.getString(1);

System.out.println("userid is : " +uuser1);

key=rs.getString(2);

System.out.println("Key is : " +key);

sta=rs.getString(3);

System.out.println("Status is : " +sta);

}

if(sta.equals(‘pending’))

{

%>

<tr><td> Your Request is Pending </td></tr>

<% }

else if(sta.equals(‘Accept’))

{

%>

<tr><td> Your Request is Accepted </td></tr>
<pre>[/php]

Based on the user id that was fetched from the session attributes, a query is built to the database to know the current status of the private key request. A result set is built from the query statement created and based on the result set; the status is compared with pending and accepts. If and else loops are used to compare the status and the corresponding status is updated to the user as shown in the below screen capture

Now the administrators can login to the their respective role and can approve the request from the users regarding the private key and coding followed is as explained below

[php]
ResultSet rs=null;

DBConnection dbcon=new dbgeneralimpl();

c=dbcon.getConnection();

st=c.createStatement();

String user=(String)session.getAttribute("user");

rs=st.executeQuery("select * from keygenerate_twm");

while(rs.next()){

String uid=rs.getString(1);

session.setAttribute("usid",uid);

%>

<tr align="center">

<td><font size="3" color="#DF4800"><%=uid%></font></td>

<td><a href="AcceptKey.jsp?id=<%=uid%>"><font size="3" color="#DF4800">Accept</font></a></td>

<td><a href="DeleteKey.jsp?id=<%=uid%>"><font size="3" color="#DF4800">Reject</font></a></td>

</tr>
<pre>[/php]

Below screen shot explains the procedure followed by the administrator

Once the requested for private key is accepted by the user, now the users can login back and check the status as shown in the below screen

Now the users can do rest of the activities like sending or receiving the data from different users and below screen shot shows the procedure to be followed

Once the user click on the Send message, they can select the desire users to whom they want to send the message and the corresponding screen and related code is as explained below

[php]</pre>
Connection c=null;

Statement st=null;

ResultSet rs=null;

DBConnection dbcon=new dbgeneralimpl();

c=dbcon.getConnection();

st=c.createStatement();

rs=st.executeQuery("select * from login_twm");

%>

<select name="receiver">

<%while(rs.next()){%>

<option value="<%=rs.getString(1)%>"><%=rs.getString(1)%></option >

<%}%>

</select>

</td> </tr><tr><td>
<pre>[/php]

A list with the entire existing user is populated at the user interface and this is derived by constructing a query to the database table login_twm and the list values are populated using the option tag. Result set is used to fetch all the results from the users table and the particular user name is fetched using the statement rs.getString(1), where the first column of the row fetched is listed at the user interface and the corresponding screen shot is as shown below

Now the user can view the messages in their inbox by clicking on the link view message at the user interface and the corresponding code and screen shot are as shown below

[php]</pre>
onnection c=null;

Statement st=null;

ResultSet rs=null;

DBConnection dbcon=new dbgeneralimpl();

c=dbcon.getConnection();

st=c.createStatement();

String sendid=null;

String user=(String)session.getAttribute("user");

rs=st.executeQuery("select * from messages_twm where receiverid=’"+user+"’");

while(rs.next()){

sendid=rs.getString(1);

System.out.println("SenderId is : " +sendid);

session.setAttribute("sid",sendid);

%>
<pre>[/php]

A session attribute is used to know the sender details and the corresponding receiver id is fetched from this session attribute. A query statement is built on the messages_twm, using the where condition and all the messages related to the current user are fetched from the database and displayed as shown in the below screen

Now the user can either view or delete the message and if the user clicks on the Open link, they can view the message after entering the valid private key of the user and the related code used to develop this logic is as explained below

[php]</pre>
Connection c=null;

Statement st=null;

ResultSet rs=null;

String key=null;

DBConnection dbcon=new dbgeneralimpl();

c=dbcon.getConnection();

st=c.createStatement();

String senderid=(String)session.getAttribute("sid");

String key1=request.getParameter("key");

System.out.println("Key Value is1 : " +key1);

System.out.println("SEnder is : " +senderid);

String query="select keyvale from keygenerate_twm where userid=’"+senderid+"’";

System.out.println("Query Value is : " +query);

rs=st.executeQuery(query);

while(rs.next()){

key=rs.getString(1);

System.out.println("Key Value is : " +key);

}

if(key.equals(key1))

{%>

<tr><td> Your Key is Validated Plz <a href=./OpenContent?receiver=<%=session.getAttribute("user") %>>Open Message

</a></td></tr>

<%}

else

{%><tr><td> Your Key is Not Validated Plz <a href=./Authenticate.jsp>Re Login</a></td></tr>

<%}%>

</table>
<pre>[/php]

Database connection is established and the corresponding key entered by the current user is validated across the database using the statement by fetching the original key of the sender. If both the keys match, now the user can open the message and Open content attribute is used to achieve this and if the key does not match an error message is displayed as shown in the below screens.

Abstract

With the increase in internet and intranet usage across the world, there are many sophisticated security system in existing and each of them have their own pros and corns. Since decades the common approach followed to send the data across any secure network is to encrypt the data and there are many encryption and decryption techniques across the literature. In general encryption process involves the keys, which are always are required to encrypt or decrypt the original message and usually  Public Key and Private Key pair is used proceed with the encryption.

There are many public key encryption techniques and Identity based encryption is one among them. Identity based encryption involves public key encryption, where the required public key is generated using some arbitrary strings or random numbers like users email id, their social security number or their contact number and the job to generated to Private Keys is designated to a trusted third party and they are commonly called Private Key Generators (PKG’s).

These PKG is responsible for the Private Key Management and should hold the private keys of any user using a particular security system. In most of the cases due to lack of intelligence or security breaches, there is a lot of scope to loose the private key of the users and to recover the lost private key, there are some predefined sequence of steps to be followed.

There are many existing techniques to recover the lost private key and most of them are complex in nature and requires lot of computation overhead and to overcome these limitation, I would like to develop a simple and less complex private key generator and private loss recovery system that can be used across Identity based encryption (IBE). My application can prove that its simple in nature and the key recovery can be done using is a simple Cache database implementation.

Introduction:

Project background

Security has become the primary requirement across any organization to protect the data across their internal business relations. There are many security implementations in place to secure the content and messages being transmitted across the network. In general the communication parties relay on many encryption and decryption techniques available to secure the data and each of them have their own pros and corns.

Cryptography is the common technique used across the encryption process, where the entire message is broken to number of chippers. Each and every chipper has a key to encrypt or decrypt. In general all the traditional cryptographic techniques have a single to key to encrypt or decrypt the message. Later in the literature, the concept of two keys has emerged, one is known as public key and former is known as private key.

Public key is commonly public in nature, where it can be shared to any one across the network, where the private key is set as confidential information that can’t be shared publicly and this procedure is known as public key cryptography and is provided across most of the web applications using SSL. In a typical SSL methodology, a server can make its own public and private key.

The server’s public key is advertised across the internet. Senders who wish to send any data to server should know the public key of server and server converts the encrypted chipper text to plain text using the private key. Later digital certificates are introduced to eliminate the hackers to replace the public key of server and this process is known as Signing, where the certificates of the server are verified by a trusted center before sending or receiving any data.

Even there are few flaws across this implementation, where the identity of the user is not revealed and any third party can pretend as the trusted center and replace the confidential information. To avoid these situations, Identity based encryption will be used, where the generation of keys is purely depending on the information related to identity of the sender and receiver.

Motivation

Identity based encryption is proved to be a successful implementation across many communication systems, where the required public or private keys are generated based on the personal identification attributes of the end user like their email id, Social Security Number or contact number.

In general a random number is assigned to their personal identification information. A separate Private Key Generator is used across the Identity based encryption, to issue the confidential private keys. Everything would work fine in the case of positive hypothesis and if in case the private keys issued by the PKG are lost, there are few techniques as well to recover the private key of a particular user.

I had found that all the existing techniques to recover the lost private key are complex in nature and really tedious to implement across small applications like Email or Content management systems. So I would like to extend the research to develop a simple and logical implementation to recover the private key lost by any user using a Cache database concept.

Problem Definition

Identity based encryption is implemented widely across many organizations and Government departments to secure the data and content. In general the public key is generated based on identification information of the end user such as telephone number or email id and the corresponding Private key is generated by a third party know as Private Key Generators (PKG’s). If the Private Key generated by the third party is lost by the user due to any reason, there are many existing techniques to recover them are discussed in Literature and Research analysis.

Most of the existing techniques depend on the User information and Organization information and the users need to answer some questions related to their personal information like Mothers maiden name etc, which are really difficult to remember in some cases. If the questions posed by the existing recovery system are not answerable, then the existing private key is lost permanently and the user should raise a new request to generate the private key again.

If this is the case, there could be chance of complex computation at the PKG side to generate a new private key always. To solve these problems, I would like to develop a Simple Private Key recovery system that uses the Cache database concept as discussed in the Proposed System description.

Proposed System

Based on the problems identified across the project background and problem definition, I would like to develop a less complex Private Key Recovery System. In this application I will provide two different logins, one is for User and one for Administrator. Users to the application are created by the Admin and a separate user id and password is assigned to each and every user.

Users can send message to other users based on the list provided at the user interface and also can raise a request for Private Key. This request is forwarded to Admin, where the admin will approve or reject the request and the status of the request can be tracked at the user side.

If the user forget or lost the private key, they can just click on the link provided to them, where the admin checks the request and sends the existing private key that was saved at the Cache database. Users can send any sort of data to the desired receiver and receiver should know the private key of the sender to view the data. Detailed description of the application is provided at the design chapter of this document.

Abstract

Wireless sensor networks have become popular these days due to their in terms of electronics, information processing and networking advancements. There are many applications across the Wireless Sensor networks and few of them are Health monitoring, forecasting and information processing.

There is lot of research done on the Wireless Sensor networks and there are few areas to be concentrated more the mainly the Traffic analysis, energy consumption and anomaly detection. This project helps in modeling the traffic analysis in various aspects like sequence relations among the packets that are being arrived, defining and modeling the traffic arrival rates across the WSN and load distribution of traffic across WSN.

This project proposes a technique to handle the network performance issues across the energy resource allocation process. An optimized energy allocation scheme is proposed in this project. Anomaly detection is done as per the traffic analysis across WSN. Main aim of this project is to consider three important problems in Wireless sensor networks and propose a solution to them.

One among these problems is to analyze the traffic caused by the incoming packets and model the traffic and also to model the sequence relationship among the arriving packets. Network optimization is also proposed based on the energy efficient resource allocation across the wireless sensor networks and finally to detect the anomalies based on the analyzed traffic.

Conclusion and future work:

Wireless Sensor networks are widely used across many real time applications and due to their demand they are widely accepted and integrated across every organization these days. In most of the applications all the deployed sensor nodes are inexpensive and all combined to act as a corporate network. Even though WSN is a good technology, there are some technical loop holes in the technology and there is lot of research done to overcome these limitations.

Most of the traffic dynamics in WSN technology are application dependent and there is no perfect traffic analysis model across WSN. In this project, It have done all the basic research on traffic analysis and modeling across WSN and proposed few optimization solutions for a perfect analysis and modeling sequence of traffic.

A window based scanning process is completely evaluated in this project to measure sequence relations among the arriving packets at individual sensors and all the sequence of packet arriving rates are mapped a character string to identify the exact sequence of packets and this character string can be used in perfect analysis and modeling of packets.

A typical ON/OFF model is used to measure the bursty traffic sequences. For better understanding the traffic dynamics, network optimization techniques are always required.

By traffic dynamics understanding WSN optimization research is activated. By designing WSN performance and energy consumption, communication traffic interrelation ship, information about energy consumption in network will be gathered and by energy resources availability performance investigation is preceded.

For correct deployment and future routing investigation results are useful. To minimize energy waste and maximized network life time optimized energy scheme is proposed by utilizing knowledge of symmetric dense WSN traffic load distribution.

When compared to internet which is traditional network, WSN traffic patterns are less dynamic and simple and this statement is derived by using research knowledge of traffic modeling and analysis.

By this information for whole network and individual nodes precise traffic profile is built because WSN normal traffic operations generate traffic which follow profiles of normal traffic and signals of normal traffic profile violated by irregularity.

In network optimization future work, limited resource inherent nature has high importance. In network processing node mobility bounds of fundamental performance are not clear. To verify WSN fundamental performance bounds, optimization model for network is designed and pre conditions of traffic model are option.

By centralized coordination algorithms optimal performance is achieved without network processing and mobility. So, for real implementation search is focused on distribution coordination algorithms development. For optimal energy for WSNs optimal resources are allocated. So, resources allocation development will be useful in WSN scenarios.

WSN anomaly detection will be very important in WSN by that for real deployment is available in WSN. In WSN anomaly detection packet traffic is necessary but it requires some support. In WSN alarm rates of high false are not acceptable and low probability events are malicious attacks. With alarm rates low false, anomaly detection system designing is hard.

When any problem is detected in network, detecting and recovering from that problem is necessary and some measures should be performed to recover from damage. In WSN future anomaly detection, emergency response strategies development will be need.

In this Simulation of Handoff Techniques in Mobile Cellular Networks project, the simulation procedure of hand-off techniques in mobile cellular networks has been presented. Several studies have been conducted to determine the cell hand-offs mean number and expected average strength of signal.

In literature part, the performance measures of MM1 queue and its waiting time distributions are estimated. To simulate both MMC and MM1 Queues, we made use of java coding. Also, we created a Queue class in java, where the clients of de-queue and en-queue are encoded.

We have also created histogram class to display results of simulation. At the end, the actual time as well as waiting time of both the queues is estimated and shown in the form of graphs.

Code and Results Explanation:

I have used to java coding to simulate the MM1 and MMC Queues. Below is the sample code of MM1 queue

double lambda = 0.6;  // arrival rate

double mu     = 0.8;  // service rate

I have taken an initial service and arrival rates of the clients and in this case a single server and infinite clients are used with a queue length of infinity. I have created a Queue Class in java where the en-queue and de-queue of clients are coded. A histogram class is created to display the simulation results and the actual service time and waiting time are shown in graph form as shown in the below code

Histogram hist = new Histogram(60);

hist.addDataPoint(Math.min(60,  (int) (Math.round(wait))));

hist.draw();

A random class is used to derive the service rate of the clients and the actual waiting time of the clients across the queue is also calculated using the below code

double nextArrival   = StdRandom.exp(lambda);     // time of next arrival

double nextDeparture = Double.POSITIVE_INFINITY;

By default the next departure of the client is considered as infinity and this variable is updated during the execution of the project. Initially the condition if next arrival rate of the client is less than next departure of the next client is checked and if the condition is satisfied another condition like whether the queue is empty or not is checked. Once all the conditions are satisfied, next arrival rate of the client is assigned with a random number as shown in the below code

if (nextArrival <= nextDeparture) {

if (q.isEmpty()) nextDeparture = nextArrival + StdRandom.exp(mu);

q.enqueue(nextArrival);

nextArrival += StdRandom.exp(lambda);

If the above mentioned conditions fail, the actual waiting time of the client in the queue is calculated using the below code

double wait = nextDeparture - q.dequeue();

The actual queue size used in this process is also calculated along with the mean queue length as shown in the below code

mql=row/(1-row);System.out.println(mql);

StdOut.printf(“Wait = %6.2f, queue size = %d\n”, wait, q.size());

After running this code the actual simulation results are as shown below

MMC Queue simulation:

Similar procedure is used to develop the MMC Queue simulation but the number of servers considered in this process is 4 and the only code change is as shown below

double wait = (nextDeparture - q.dequeue())/4;

row=lambda/(4*mu);

mql=row/(1-row);System.out.println(mql);

Now the actual wait time and mean queue length are decreased by 4 times using this MMC Queue implementation as shown in the below the screens

Peer to peer network has a wide role to play across the networking application and securing these peer groups has become really tough job.

Dynamic peer groups involve many nodes connected across the network architecture and to ensure the security across these peer groups there are many cryptographic techniques in implementation to share the secure information. To proceed with the encryption techniques, the public and private keys need to distributed across the peer to peer systems and proper authentication is required to share these keys.

There are many existing systems to distribute the keys, where a centralized key server is used to generate the keys and in this process, all the information related to the keys is available only with the centralized server and when ever the peers try to access this information, high computation cost is incurred on the server and thus the system performance is affected a lot.

Each and every node across the peer to peer network should individually re-key the generated keys when ever they join or leave the peer to peer system and this increase the computation speed.

I would like to develop a Queue batch algorithm, where the re-keying is done at a dynamic peer group, where this group is responsible for re-keying operation and thus the computation overhead is decreased a lot and the requirement of a dedicated centralized server is completely eliminated.

Performance of the proposed protocol will be efficient even in the case of frequent joins and leaves of the peer nodes across the system and thus it reduces the computation and communication cost a lot.

Aim: To develop a Queue batch algorithm that can implement the group level re-keying across dynamic peers and allows a less computation level collaborative key distribution.

Following are the objectives of this project 

• To understand the concept of Dynamic peer groups and the level of security requirements in collaborative key distribution process
• To prepare literature review on existing key distribution algorithm for peer to peer systems and their limitations
• To design Queue batch algorithm, where the keying and re-keying is done at each peer of the network and thus reducing the computation and communication overhead.
• To develop a java based application that can demonstrate the proposed system practically
• To test the application and document the results and observations

Latest 2014 Java Projects (B.Tech & M.Tech):

Students and institutes who are looking for latest java 2014 projects with full project source code, project report, paper presentation can contact us for buying projects in bulk. Projects listed here are developed based on latest technologies using java programming language. 

List of Latest 2014 Java Projects: