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

1. Minimum Distance Packet Forwarding

This IEEE 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 IEEE Transaction paper.

2. Endpoint Admission Control

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

[:=Read Full Message Here=:]

code for implementing tabu list in AODV routing protocols. ....etc

[:=Read Full Message Here=:]

give me full explanation about flow cart of lighting overvoltage protection ....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=:]

HEURISTIC ALGORITHMS FOR DESIGNING SELF-REPAIRING PROTECTION TREES IN MESH NETWORKS


ABSTRACT:

Protection trees have been used in the past for restoring multicast and Uni-cast traffic in networks in various failure scenarios. In this paper we focus on shared self-repairing trees for page link protection in Uni-cast mesh networks. Shared protection trees have been proposed as a relatively simple approach that is easy to reconfigure and could provide sub-second restoration time ....etc

[:=Read Full Message Here=:]

Are you looking for what algorithm used in optimal jamming attacks and network defense policies in wireless sensor networks ? ....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=:]

Abstract—IEEE 802.16 OFDMA systems have gained much attention for their ability to support high transmission rates and broadband access services. For multiuser environments, IEEE 802.16 OFDMA systems require a resource allocation algorithm to use the limited downlink resource efficiently. The IEEE 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 ....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 concep ....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 h ....etc

[:=Read Full Message Here=:]