Hi.. Here you can find the topics of latest IEE Network Simulation Projects implemented in tool OMNeT++ 3.2.

1. Minimum Distance Packet Forwarding

This IEE Journal Technology Simulation Project is the simulation of Minimum Distance Packet Forwarding for search application in Network (P2P) using OMNeT++ 3.2 tool. This technique is based on technique published on IEE Transaction paper.

2. Endpoint Admission Control

This IEE Journal Technology Simulation Project is the simulation of Probing Mechanism for Endpoint Admission Control in ....etc

[:=Read Full Message Here=:]

give me full explanation about flow cart of lighting overvoltage protection ....etc

[:=Read Full Message Here=:]

BRANCH: COMPUTER SCIENCE AND ENGINEERING

CS 010 405- MICROPROCESSOR SYSTEMS (CS)

Part A

Answer all questions.

Each Question Carries 3 marks

1. What is microprocessor? Give the power supply and Clock frequency of 8085

2. Define instruction cycle, machine cycle and T-state

3. Explain the signals HOLD, READY and SID.

4. What is synchronous data transfer?

5. What is the use of modem control unit in 8251?

Part B

Answer all questions

Each question carries 5 marks

6. Compare CALL and PUSH instructions

7. Difference between memory mapped ....etc

[:=Read Full Message Here=:]

Heuristic and Metaheuristic Algorithms


Heuristic algorithms What are they?

Wikipedia says:

In computer science, a heuristic is a technique designed to solve a problem that ignores whether the solution can be proven to be correct, but which usually produces a good solution or solves a simpler problem that contains or intersects with the solution of the more complex problem.

Heuristics are intended to gain computational performance or conceptual simplicity, potentia ....etc

[:=Read Full Message Here=:]

These are the various Network simulation Projects developed in OMNeT++ 3.2 which can be used for M.Tech, B.Tech and M.C.A students. On need of any project source code. Please Contact me.

1. Efficient Routing via Clustering using OMNeT (Type-A)

Basepaper: Efficient Node Search in P2P Using Distributed Spanning Tree ((IJCSIS) International Journal of Computer Science and Information Security,
Vol. 8, No. 3, June 2010)

Peer to Peer (P2P) networks are the important part of the next cohort of Internet, so how ....etc

[:=Read Full Message Here=:]

This paper provides a heuristic algorithm for an NP-Complete problem. It is a result of a research on an NP-Complete problem known as Clique problem. I have succeeded in developing an algorithm which will give the maximum size Clique, for a given graph G, as its output. This paper explains the algorithm, its time complexity, applications and its implementation in C. This is a research paper based on an interesting class of problems known as ?NP-Complete? problems. No polynomial-time algorithm has yet been discovered for an NP-Complete problem, ....etc

[:=Read Full Message Here=:]

Topics

Abs Computers

Srno. Project Titles
1 Home Appliance Control From Remote System Voice Based
2 Payroll System RFID
3 Real Patient Monitoring System
4 Movie Bookie Using Smart Phone
5 Audio Steganography (No MATLAB)
6 Image Steganography (No MATLAB)
7 PC Based Graph Follower Robot
8 Voice Operated Car
9 SMS Based Railway Reservation System
10 J2ME Based Railway Reservation System
11 Attendance Management System
12 PCB Drilling System
13 Mega Travel Management System
14 Millions of Acres.com
15 Media Player in C#
16 ....etc

[:=Read Full Message Here=:]

Tabu search, created by Fred W. Glover in 1986 and formalized in 1989, is a metaheuristic search method employing local search methods used for mathematical optimization.

Local (neighborhood) searches take a potential solution to a problem and check its immediate neighbors (that is, solutions that are similar except for one or two minor details) in the hope of finding an improved solution. Local search methods have a tendency to become stuck in suboptimal regions or on plateaus where many solutions are equally fit.

Tabu search enhances the pe ....etc

[:=Read Full Message Here=:]

Abstract IEE 802.16 OFDMA systems have gained much attention for their ability to support high transmission rates and broadband access services. For multiuser environments, IEE 802.16 OFDMA systems require a resource allocation algorithm to use the limited downlink resource efficiently. The IEE 802.16 standard defines that resource allocation should be performed with a rectangle region of slots, called a burst. However, the standard does not specify how to construct bursts. In this paper, we propose a heuristic burst construction algorithm, ca ....etc

[:=Read Full Message Here=:]

Please provide the heuristic based query processing for large rdf graphs using cloud computing coding and documentation ....etc

[:=Read Full Message Here=:]