These are the Various projects that are developed (so far) using OMNeT++ 3.2/4.0. Video of the simulation executions are available at youtube under the username victerpaul. Comment on any clarification.
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 to search the node in the P2P
networks efficiently is the key problem of the perception of the P2P network.
However, the node search process in unstructured P2P is not efficient because
the same search message may go through a node multiple times. To ease the
complex search and improve the search efficiency, we propose a mechanism using
the interconnection structure called Distributed Spanning Tree (DST) which
facilitates the P2P Network into a layered structure to improve the node search
technique. The performance evaluations of simulation demonstrate that the proposed
mechanism can improve the node search efficiency of P2P systems.
2.
Global Replica Management in Distributed Environment using OMNeT
(Type-C)
Basepaper: QoS enhancements for global replication
management in peer to peer networks (Future Generation Computer Systems (2011),
Elsevier, Volume 28, Issue 3, March 2012)
Replica Management is a key issue to reduce the
bandwidth consumption, to improve data availability and to maintain data
consistency in large distributed systems. Global Replica Management (GRM) means
to maintain the data consistency across the entire network. It is preferable
particularly for multi-group distributed systems. On the other hand, GRM is not
favorable for many applications because a very large number of message passes
is needed for replica management processes. In this paper, in order to reduce
the number of message passes needed to achieve the efficient GRM strategy, an
interconnection structure called the Distributed Spanning Tree (DST) has been
employed. The application of DST converts the peer network into logical layered
structures and thereby provides a hierarchical mechanism for replication
management. It is proved that this hierarchical approach improves the data
availability and consistency across the entire network. In addition to these,
it is also proved that the proposed approach reduces the data latency and the
required number of message passes for any specific application in the network.
3.
Minimum Distance Packet Forwarding using OMNeT (Type-B)
Base
Paper: MDPF: Minimum Distance
Packet Forwarding for Search Applications in Mobile Ad Hoc Networks (IEEE
TRANSACTIONS ON MOBILE COMPUTING, VOL. 8, NO. 10, OCTOBER 2009)
This work introduces a message forwarding
algorithm for search applications within mobile ad hoc networks (connected)
that is based on the concept of selecting the nearest node from a set of
designated nodes. The algorithm, which is called Minimum Distance Packet
Forwarding (MDPF), uses routing information to select the node with the minimum
distance. The goal of the proposed algorithm is to minimize the average number
of hops taken to reach the node that holds the desired data. Numerical analysis
and experimental evaluations using the network simulation software OMNeT++ to
derive the lower and upper bounds of the confidence interval for the mean hop
count between the source node of the data request, on one hand, and the node
that holds the desired data and the last node in the set of search nodes, on
the other hand.
4.
Cooperative Cache Technique using OMNeT (Type-B)
Basepaper: Cluster-Based Cross-Layer Design for
Cooperative Caching in Mobile Ad Hoc Networks (IEEE SYSTEMS JOURNAL,
VOL. 3, NO. 4, DECEMBER 2009)
Several protocols have been proposed to improve
data accessibility and reduce query delay in MANETs. Some of these proposals
have adopted the cooperative caching scheme, allowing multiple mobile hosts
(connected) within a neighborhood to cache and share data items in their local
caches. Cross-layer optimization has not been fully exploited to further
improve the performance of cooperative caching in these proposals. In this
paper we propose a clusterbased cooperative caching scheme. A cross-layer
design approach is employed to further improve the performance of cooperative
caching and prefetching schemes. The experimental results in the OMNeT++
simulation environment demonstrate that the proposed approach improves caching
performance in terms of data accessibility, query delay and query distance
compared to the caching scheme that does not adopt the cooperative caching
strategy.
5.
Effective Query Retrieval in Mobile Environment using OMNeT (Type-A)
Basepaper: EFFECTIVE QUERY RETRIEVAL SYSTEM IN MOBILE
BUSINESS ENVIRONMENT ((IJCSIS) International Journal of Computer Science and
Information Security, Vol. 7, No. 3, March 2010)
Query Management System (WBQMS) is a methodology
to design and to implement Mobile Business, in which a server is the gateway to
connect databases with clients which sends requests and receives responses in a
distributive manner. The gateway, which communicates with mobile phone via GSM
Modem, receives the coded queries from users and sends packed results back. The
software which communicates with the gateway system via SHORT MESSAGE, packs
users’ requests, IDs and codes, and sends the package to the gateway; then
interprets the packed data for the users to read on a page of GUI. Whenever and
wherever they are, the customer can query the information by sending messages
through the client device which may be mobile phone or PC. The mobile clients
can get the appropriate services through the mobile business architecture in
distributed environment
6.
Endpoint Admission Control using OMNeT (Type-B)
Basepaper: Congestion Notification and Probing Mechanisms
for Endpoint Admission Control (IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 14,
NO. 3, JUNE 2006)
There has been much interest in admission
control schemes that place the burden of admission control decisions on the end
users. In these schemes, referred to as Endpoint Admission Control, the
decision to join the network is taken by the user, based on the probing of the
network using probe packets. Depending on the level of congestion, routers mark
the probe packets and thus inform the user of the state of the network. We
analyze the probing duration necessary to guarantee the required QoS and
achieve high link utilization
7.
Effective Packet Marking to find the real attacks in Internet (Type-B) (under
development)
Basepaper:
Flexible Deterministic
Packet Marking: An IP Traceback System to Find the Real Source of Attacks (IEEE
TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 20, NO. 5, MAY 2009)
Internet Protocol (IP) traceback is the enabling
technology to control Internet crime. In this paper, we present a novel and practical
IP traceback system called Flexible Deterministic Packet Marking (FDPM) which
provides a defense system with the ability to find out the real sources of
attacking packets that traverse through the network. While a number of other
traceback schemes exist, FDPM provides innovative features to trace the source
of IP packets and can obtain better tracing capability than others.
Comment on queries..
