Bulk IEEE Projects

Bulk IEEE Projects

JP INFOTECH is a bloom in Providing Bulk IEEE Projects to the Software Companies, Training Institutes, IEEE Project Centres/Center, Tutors, Trainers involved in Providing Final year Project Solutions to the Students. JP INFOTECH also offers Final Year Project Solutions to Application Projects/Mini Projects/ Non-IEEE projects/ Web Projects and other latest Journal Paper Solutions. Our Expert Research Team also offers Paper Publication Services to our Clients by providing International Journal Publication, International Conference Publication, Journal Paper Writing Services, Thesis Writing, Scopus Journal Publication, SCI Journal Publication and all other Related to Research Work too. Our Team is rooted at Pondicherry / Puducherry and in Chennai locations. The team is ready to provide online / Offline supports according to the client requirements.

Experience in Bulk IEEE projects

JP INFOTECH is a Pioneer in the field of Bulk IEEE Projects for CSE, IT, ECE, EEE Departments. We have 8+ Years of experience in the service of Bulk IEEE projects and providing the Support to our beloved Clients. We had also created a milestone in providing the projects for the final year students of departments CSE, IT, ECE, EEE by providing such support to our Clients. We proudly announce that we are currently supporting more than 1000+ Clients all over the globe and most of them from India. The Client satisfaction makes us to encourage and improves our services every year and so we are having more numbers every year than the past.

Bulk IEEE Project Domains:

We offer Bulk IEEE Projects in All Major domains of CSE, IT, ECE, EEE Departments. A very few are here that we mention in the following. Cloud computing, Big Data (Hadoop), Networking, Wireless Communications, Mobile Computing, MANET, WSN, Network Security, Secure & Dependable Computing, Data Mining, Web Mining, Knowledge and Data Engineering, Image processing, Parallel & Distributed Systems, Information Security, ROBOTICS, EMBEDDED SYSTEMS, Power Electronics, Power Systems, VLSI And many more.

Technologies we Expertise: 

Java, J2EE (Netbeans and Eclipse), Android (Eclipse and Android Studio), Dot net (Asp.net, C#.net, VB.net), Hadoop (big data), Matlab (Image Processing), NS2, Network Simulator, OMNET++, Matlab (Communication Systems), VLSI (VHDL, Tanner), Embedded Systems, Matlab Simulink, Weka, R-Programming, Php and many more.

Bulk IEEE projects 2017 @ JP INFOTECH

Project Demos/ Output Videos:

We initially provide the Project Demo/ Output Video file for the list of the projects which we have. You can check the Output before the purchase of the projects. So you can know our quality and assurance of the execution. All our Project Videos are executed by our Expert development team in our office premises and so we provide 100% assurance on the execution for the same. So no need to worry about the project outputs. Based on the Output videos, you can provide the explanation part to the students.

We DONOT support Reselling of our projects to others Institutes / Project Consultants / Brokers / Resellers / Vendors. Projects should be given only to your students.

We affirm the Bulk IEEE Projects quality and you can also see the quality of the work from our past Project Output Videos on all major Domains. So we assure you the same in the present and future providing better satisfaction service by ensuring the quality deliver with timely deliver too. We are awaiting for Long Term relationship by having mutual benefits.

For any queries / clarifications, you can contact us.

Dr.R.JAYAPRAKASH BE, MBA, M.Tech., Ph.D.,

Managing Director, JP INFOTECH.

CONTACT NUMBER: (0)9952649690

EMAIL: jpinfotechprojects@gmail.com

Contact us

Toward a Statistical Framework for Source Anonymity in Sensor Networks

Toward a Statistical Framework for Source Anonymity in Sensor Networks

ABSTRACT:

In certain applications, the locations of events reported by a sensor network need to remain anonymous. That is, unauthorized observers must be unable to detect the origin of such events by analyzing the network traffic. Known as the source anonymity problem, this problem has emerged as an important topic in the security of wireless sensor networks, with variety of techniques based on different adversarial assumptions being proposed. In this work, we present a new framework for modeling, analyzing, and evaluating anonymity in sensor networks. The novelty of the proposed framework is twofold: first, it introduces the notion of “interval indistinguishability” and provides a quantitative measure to model anonymity in wireless sensor networks; second, it maps source anonymity to the statistical problem of binary hypothesis testing with nuisance parameters. We then analyze existing solutions for designing anonymous sensor networks using the proposed model. We show how mapping source anonymity to binary hypothesis testing with nuisance parameters leads to converting the problem of exposing private source information into searching for an appropriate data transformation that removes or minimize the effect of the nuisance information. By doing so, we transform the problem from analyzing real-valued sample points to binary codes, which opens the door for coding theory to be incorporated into the study of anonymous sensor networks. Finally, we discuss how existing solutions can be modified to improve their anonymity.

PROJECT OUTPUT VIDEO: (Click the below link to see the project output video):

ARCHITECTURE:

EXISTING SYSTEM:

While transmitting the “description” of a sensed event in a private manner can be achieved via encryption primitives, hiding the timing and spatial information of reported events cannot be achieved via cryptographic means.

Encrypting a message before transmission, for instance, can hide the context of the message from unauthorized observers, but the mere existence of the ciphertext is indicative of information transmission.

In the existing literature, the source anonymity problem has been addressed under two different types of adversaries, namely, local and global adversaries. A local adversary is defined to be an adversary having limited mobility and partial view of the network traffic. Routing based techniques have been shown to be effective in hiding the locations of reported events against local adversaries.

A global adversary is defined to be an adversary with ability to monitor the traffic of the entire network (e.g., coordinating adversaries spatially distributed over the network). Against global adversaries, routing based techniques are known to be ineffective in concealing location information in event-triggered transmission. This is due to the fact that, since a global adversary has full spatial view of the network, it can immediately detect the origin and time of the event-triggered transmission

DISADVANTAGES OF EXISTING SYSTEM:

The source anonymity problem in wireless sensor networks is the problem of studying techniques that provide time and location privacy for events reported by sensor nodes. (Time and location privacy will be used interchangeably with source anonymity throughout the paper.)

The source anonymity problem has been drawing increasing research attention recently.

PROPOSED SYSTEM:

In this paper, we investigate the problem of statistical source anonymity in wireless sensor networks. The main contributions of this paper can be summarized by the following points.

We introduce the notion of “interval in-distinguishability” and illustrate how the problem of statistical source anonymity can be mapped to the problem of interval indistinguishability.

We propose a quantitative measure to evaluate statistical source anonymity in sensor networks.

We map the problem of breaching source anonymity to the statistical problem of binary hypothesis testing with nuisance parameters.

We demonstrate the significance of mapping the problem in hand to a well-studied problem in uncovering hidden vulnerabilities. In particular, realizing that the SSA problem can be mapped to the hypothesis testing with nuisance parameters implies that breaching source anonymity can be converted to finding an appropriate data transformation that removes the nuisance information.

We analyze existing solutions under the proposed model. By finding a transformation of observed data,we convert the problem from analyzing real-valued samples to binary codes and identify a possible anonymity breach in the current solutions for the SSA problem.

We pose and answer the important research question of why previous studies were unable to detect the possible anonymity breach identified in this paper.

We discuss, by looking at the problem as a coding problem, a new direction to enhance the anonymity of existing SSA solutions.

ADVANTAGES OF PROPOSED SYSTEM:

Removes or minimize the effect of the nuisance information

SYSTEM CONFIGURATION:-

HARDWARE REQUIREMENTS:-

ü Processor                  –        Pentium –IV

ü Speed                        –        1.1 Ghz

ü RAM                         –        512 MB(min)

ü Hard Disk                 –        40 GB

ü Key Board                –        Standard Windows Keyboard

ü Mouse                       –        Two or Three Button Mouse

ü Monitor                     –        LCD/LED

 

SOFTWARE REQUIREMENTS:-

v   Operating System          : LINUX

v   Tool                               : Network Simulator-2

v   Front End                      : OTCL (Object Oriented Tool Command  Language)

 

REFERENCE:

Basel Alomair, Member, IEEE, Andrew Clark, Student Member, IEEE, Jorge Cuellar, and Radha Poovendran, Senior Member, IEEE, “Toward a Statistical Framework for Source Anonymity in Sensor Networks”, IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 12, NO. 2, FEBRUARY 2013.

[youtube]https://www.youtube.com/watch?v=GgRcvt7N-9k[/youtube]

Target Tracking and Mobile Sensor Navigation in Wireless Sensor Networks

Target Tracking and Mobile Sensor Navigation in Wireless Sensor Networks

ABSTRACT:

This work studies the problem of tracking signal-emitting mobile targets using navigated mobile sensors based on signal reception. Since the mobile target’s maneuver is unknown, the mobile sensor controller utilizes the measurement collected by a wireless sensor network in terms of the mobile target signal’s time of arrival (TOA). The mobile sensor controller acquires the TOA measurement information from both the mobile target and the mobile sensor for estimating their locations before directing the mobile sensor’s movement to follow the target. We propose a min-max approximation approach to estimate the location for tracking which can be efficiently solved via semi definite programming (SDP) relaxation, and apply a cubic function for mobile sensor navigation. We estimate the location of the mobile sensor and target jointly to improve the tracking accuracy. To further improve the system performance, we propose a weighted tracking algorithm by using the measurement information more efficiently. Our results demonstrate that the proposed algorithm provides good tracking performance and can quickly direct the mobile sensor to follow the mobile target.

PROJECT OUTPUT VIDEO: (Click the below link to see the project output video):

EXISTING SYSTEM:

There exist a number target localization approaches-based various measurement models such as received signal strength (RSS), time of arrival (TOA), time difference of arrival (TDOA), signal angle of arrival (AOA), and their combinations. For target tracking, Kalman filter was proposed, where a geometric-assisted predictive location tracking algorithm can be effective even without sufficient signal sources. Li et al.investigated the use of extended Kalman filter in TOA measurement model for target tracking. Particle filtering has also been applied with RSS measurement model under correlated noise to achieve high accuracy. In addition to the use of stationary sensors, several other works focused on mobility management and control of sensors for better target tracking and location estimation. Zou and Chakrabarty studied a distributed mobility management scheme for target tracking, where sensor node movement decisions were made by considering the tradeoff among target tracking quality improvement, energy consumption, loss of connectivity, and coverage. Rao and Kesidis further considered the cost of node communications and movement as part of the performance tradeoff

DISADVANTAGES OF EXISTING SYSTEM:

The mobile target’s maneuver is unknown

PROPOSED SYSTEM:

In this work, we consider the joint problem of mobile sensor navigation and mobile target tracking based on a TOA measurement model. Our chief contributions include a more general TOA measurement model that accounts for the measurement noise due to multipath propagation and sensing error. Based on the model, we propose a min-max approximation approach to estimate the location for tracking that can be efficiently and effectively solved by means of semidefinite programming (SDP) relaxation. We apply the cubic function for navigating the movements of mobile sensors. In addition, we also investigate the simultaneous localization of the mobile sensor and the target to improve the tracking accuracy. We present a weighted tracking algorithm in order to exploit the measurement information more efficiently. The numerical result shows that the proposed tracking approach works well

ADVANTAGES OF PROPOSED SYSTEM:

  • Ø TOA measurements are easy to acquire, as each sensor only needs to identify a special signal feature such as a known signal preamble to record its arrival time.
  • Ø Our particular use of TOA is a more practical model because we do not need the sensors to know the transmission start time of the signal a priori. As a result, our TOA model enables us to directly estimate the source location by processing the TOA measurement data.
  • Ø The mobile sensor navigation control depends on the estimated location results, more accurate localization algorithm from TOA measurements leads to better navigation control.

SYSTEM CONFIGURATION:-

HARDWARE REQUIREMENTS:-

ü Processor                  –        Pentium –IV

ü Speed                        –        1.1 Ghz

ü RAM                         –        512 MB(min)

ü Hard Disk                 –        40 GB

ü Key Board                –        Standard Windows Keyboard

ü Mouse                       –        Two or Three Button Mouse

ü Monitor                     –        LCD/LED

 

SOFTWARE REQUIREMENTS:-

v   Operating System          : LINUX

v   Tool                               : Network Simulator-2

v   Front End                      : OTCL (Object Oriented Tool Command  Language)

 

REFERENCE:

Enyang Xu, Zhi Ding,Fellow, IEEE, and Soura Dasgupta, Fellow, IEEE “Target Tracking and Mobile Sensor Navigation in Wireless Sensor Networks” – IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 12, NO. 1, JANUARY 2013.

[youtube]http://www.youtube.com/watch?v=5RfrKB86IjE[/youtube]

Proteus: Multiflow Diversity Routing for Wireless Networks with Cooperative Transmissions

Proteus: Multiflow Diversity Routing for Wireless Networks with Cooperative Transmissions

ABSTRACT:

In this paper, we consider the use of cooperative transmissions in multihop wireless networks to achieve Virtual Multiple Input Single Output (VMISO) links. Specifically, we investigate how the physical layer VMISO benefits translate into network level performance improvements. We show that the improvements are nontrivial (15 to 300 percent depending on the node density) but rely on two crucial algorithmic decisions: the number of cooperating transmitters for each link; and the cooperation strategy used by the transmitters. We explore the tradeoffs in making routing decisions using analytical models and derive the key routing considerations. Finally, we present Proteus, an adaptive diversity routing protocol that includes algorithmic solutions to the above two decision problems and leverages VMISO links in multihop wireless network to achieve performance improvements. We evaluate Proteus using NS2-based simulations with an enhanced physical layer model that accurately captures the effect of VMISO transmissions

PROJECT OUTPUT VIDEO: (Click the below link to see the project output video):

EXISTING SYSTEM:

In a VMISO system, multiple transmitters transmit encoded versions of the same signal so that the error performance at the receiver is improved significantly compared to a traditional Single Input Single Output (SISO) system. In this work, we consider a specific instance of VMISO communication, where all transmitters of the array transmit with the same fixed power. In such systems, the cooperation gain directly leads to a smaller SNR requirement to achieve the same error performance. The gain in SNR in turn can be used to either increase the data rate by the use of higher order modulations or to increase communication range, thereby improving communication performance in the wireless channel. Although there are several challenges to realizing the potential of VMISO communications, the scope of this paper is restricted to routing.

DISADVANTAGES OF EXISTING SYSTEM:

    First, of the different virtual array approaches, VMISO requires the lowest coordination effort because it can leverage the broadcast property of the wireless channel to distribute information to the cooperating transmitters with a single transmission. This is unlike VSIMO or VMIMO, where multiple information exchanges are required at the receiver to decode information.

    Second, although VMISO allows improved data rates, the coordination overhead and complexity of channel state information and processing are significant challenges in VMIMO which do not affect VMISO.

PROPOSED SYSTEM:

Although there are several challenges to realizing the potential of VMISO communications, the scope of this paper is restricted to routing. In this context, we first investigate the benefits achievable when using VMISO in a multihop wireless network. While there have been several related works that discuss how cooperative diversity can improve performance at the physical layer, the higher layer benefits of cooperative diversity have been explored only by a few related works. More importantly none of the related works identify the routing considerations in a wireless network with multiple active flows and using cooperative transmissions. Using a combination of theoretical analysis, simulations and specific examples with arbitrary topologies, we study how physical layer benefits of cooperative diversity translate to network level performance metrics. Our studies reveal that the network benefits of using VMISO links are nontrivial. We then identify two important decisions that influence the achievable benefits in a multihop wireless network that uses VMISO: the choice of the number of cooperating transmitters such that the diversity gain and interference tradeoff is appropriately leveraged; and the choice of the cooperation strategy such that the diversity gain is appropriately used for either an increase in the range or the rate of the links or both. Finally, we propose centralized and distributed versions of a diversity routing protocol that includes algorithms for optimally arriving at both of the above decisions.

ADVANTAGES OF PROPOSED SYSTEM:

  • We highlight that the joint adaptation of rate and range becomes especially important for VMISO rather than MIMO/MISO due to the larger diversity gains obtainable with VMISO.
  • We show that a simple approach of optimizing the throughput of links followed by optimizing the range can greatly reduce the aggregate throughput of flows compared to jointly optimizing the link rates and the hop distances.
  • We propose an adaptive clustering algorithm that dynamically adjusts the cluster size for each flow in the network.
  • We also identify several approaches for adapting the rate, range, and cluster size and establish the limitations of each of them.

 

 

SYSTEM CONFIGURATION:-

HARDWARE REQUIREMENTS:-

ü Processor                  –        Pentium –IV

ü Speed                        –        1.1 Ghz

ü RAM                         –        512 MB(min)

ü Hard Disk                 –        40 GB

ü Key Board                –        Standard Windows Keyboard

ü Mouse                       –        Two or Three Button Mouse

ü Monitor                     –        LCD/LED

 

SOFTWARE REQUIREMENTS:-

v   Operating System          : LINUX

v   Tool                               : Network Simulator-2

v   Front End                      : OTCL (Object Oriented Tool Command  Language)

 

REFERENCE:

Sriram Lakshmanan and Raghupathy Sivakumar “Proteus: Multiflow Diversity Routing for Wireless Networks with Cooperative Transmissions”, IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 12, NO. 6, JUNE 2013.

 [youtube]http://www.youtube.com/watch?v=6d26mIAT95k[/youtube]

Optimal Multicast Capacity and Delay Tradeoffs in MANETs

Optimal Multicast Capacity and Delay Tradeoffs in MANETs

ABSTRACT:

In this paper, we give a global perspective of multicast capacity and delay analysis in Mobile Ad Hoc Networks (MANETs). Specifically, we consider four node mobility models: (1) two-dimensional i.i.d. mobility, (2) two-dimensional hybrid random walk, (3) one-dimensional i.i.d. mobility, and (4) one-dimensional hybrid random walk. Two mobility time-scales are investigated in this paper: (i) Fast mobility where node mobility is at the same time-scale as data transmissions; (ii) Slow mobility where node mobility is assumed to occur at a much slower time-scale than data transmissions. Given a delay constraint D, we first characterize the optimal multicast capacity for each of the eight types of mobility models, and then we develop a scheme that can achieve a capacity-delay tradeoff close to the upper bound up to a logarithmic factor. In addition, we also study heterogeneous networks with infrastructure support.

EXISTING SYSTEM:

Many works have been conducted to investigate the improvement by introducing different kinds of mobility into the network. Other works attempt to improve capacity by introducing base stations as infrastructure support. As the demand of information sharing increases rapidly, multicast flows are expected to be predominant in many of the emerging applications, such as the order delivery in battlefield networks and wireless video conferences. Related works are including static, mobile and hybrid networks.

Introducing mobility into the multicast traffic pattern, Hu et al. studied a motion cast model. Fast mobility was assumed. Capacity and delay were calculated under two particular algorithms, and the tradeoff derived from them. In their work, the network is partitioned into cells similar to TDMA scheme is used to avoid interference. Zhou and Ying also studied the fast mobility model and provided an optimal tradeoff under their network assumptions.

DISADVANTAGES OF EXISTING SYSTEM:

PROPOSED SYSTEM:

In this paper, we give a general analysis on the optimal multicast capacity-delay tradeoffs in both homogeneous and heterogeneous MANETs. We assume a mobile wireless network that consists of n nodes, among which ns nodes are selected as sources and nd destined nodes are chosen for each. Thus, ns multicast sessions are formed. Our results in homogeneous network are further used to study the heterogeneous network, where m = nβ base stations connected with wires are uniformly distributed in the unit square. The purpose of this paper is to conduct extensive analysis on the multicast capacity-delay tradeoff in mobile wireless networks. We study a variety of mobility models which are also widely adopted in previous works. The results obtained may provide valuable insights on how multicast will affect the network performance compared to unicast networks.  By removing some limitations and constraints, we try to present a fundamental and more general result than previous works.

ADVANTAGES OF PROPOSED SYSTEM:

  • Ø In homogeneous networks, we established the upper bound on the optimal multicast capacity-delay tradeoffs under two-dimensional/one-dimensional i.i.d./hybrid random walk fast/slow mobility models and proposed capacity achieving schemes to achieve capacity close to the upper bound.
  • Ø We find that though the one dimensional mobility model constrains the direction of nodes’ mobility, it achieves larger capacity than the two dimensional model since it is more predictable.
  • Ø Also, slow mobility brings better performance than fast mobility because there are more possible routing schemes.

SYSTEM CONFIGURATION:-

HARDWARE REQUIREMENTS:-

ü Processor                  –        Pentium –IV

ü Speed                        –        1.1 Ghz

ü RAM                         –        512 MB(min)

ü Hard Disk                 –        40 GB

ü Key Board                –        Standard Windows Keyboard

ü Mouse                       –        Two or Three Button Mouse

ü Monitor                     –        LCD/LED

 

SOFTWARE REQUIREMENTS:-

v   Operating System          : LINUX

v   Tool                               : Network Simulator-2

v   Front End                      : OTCL (Object Oriented Tool Command  Language)

 

REFERENCE:

Jinbei Zhang, Xinbing Wang, Senior Member, IEEE , Xiaohua Tian, Member, IEEE Yun Wang, Xiaoyu Chu, and Yu Cheng, Senior Member, IEEE “Optimal Multicast Capacity and Delay Tradeoffs in MANETs” – IEEE TRANSACTIONS ON MOBILE COMPUTING VOL:PP NO:99 2013

 [youtube]https://www.youtube.com/watch?v=9YDS-Ohu7-g[/youtube]

Opportunistic MANETs: Mobility Can Make Up for Low Transmission Power

Opportunistic MANETs: Mobility Can Make Up for Low Transmission Power

ABSTRACT:

Opportunistic mobile ad hoc networks (MANETs) are a special class of sparse and disconnected MANETs where data communication exploits sporadic contact opportunities among nodes. We consider opportunistic MANETs where nodes move independently at random over a square of the plane. Nodes exchange data if they are at a distance at most within each other, where is the node transmission radius. The flooding time is the number of time-steps required to broadcast a message from a source node to every node of the network. Flooding time is an important measure of how fast information can spread in dynamic networks. We derive the first upper bound on the flooding time, which is a decreasing function of the maximal speed of the nodes. The bound holds with high probability, and it is nearly tight. Our bound shows that, thanks to node mobility, even when the network is sparse and disconnected, information spreading can be fast.

PROJECT OUTPUT VIDEO: (Click the below link to see the project output video):

EXISTING SYSTEM:

Previous experimental works in this topic in fact show that data communication can benefit from node mobility even though all the snapshots of the network are not connected.

The impact of node mobility in data propagation is currently one of the major issues in network theory. The new trend is to consider node mobility as a resource for data forwarding rather than a hurdle. This is well captured by the model known as opportunistic mobile ad hoc networks (opportunistic MANETs), an interesting recent evolution of MANETs. Several emerging application scenarios can be considered as instances of opportunistic MANETs, such as vehicular networks (at least when traffic density is not high), certain types of mobile sensor networks, and pocket switched networks. The latter type of network is formed by powerful handheld devices—able to establish direct wireless communication links through, e.g., a Wi-Fi interface—carried around by humans in their everyday life.

DISADVANTAGES OF EXISTING SYSTEM:

  • The term opportunistic also refers to the fact that the communication protocol does not control node mobility (think about cars, bikes, or pedestrians), however mobility can be exploited. This is the main reason why the energy consumption due to node mobility is not considered in the protocol analysis.
  • Data communication can benefit from node mobility even though all the snap shots of the network are not connected.

PROPOSED SYSTEM:

The aim of this work is to investigate the speed of data propagation in opportunistic MANETs: Here, classic static concepts like global connectivity and network diameter are not very meaningful.

In order to investigate the speed of data propagation, we consider the flooding time. The flooding is the simple broadcast protocol where every informed node sends the source message at every time-step (a node is said to be informed if it knows the source message). The flooding time is the first time-step in which all nodes are informed. It is a natural lower bound for any broadcast protocol, and it bounds the maximal speed of data propagation: the same role of the diameter in static networks.

ADVANTAGES OF PROPOSED SYSTEM:

Our flooding analysis does not consider the interference problem in message transmissions: This is typically managed at the MAC layer of a wireless network architecture.

SYSTEM CONFIGURATION:-

HARDWARE REQUIREMENTS:-

ü Processor                  –        Pentium –IV

ü Speed                        –        1.1 Ghz

ü RAM                         –        512 MB(min)

ü Hard Disk                 –        40 GB

ü Key Board                –        Standard Windows Keyboard

ü Mouse                       –        Two or Three Button Mouse

ü Monitor                     –        LCD/LED

 

SOFTWARE REQUIREMENTS:-

v   Operating System          : LINUX

v   Tool                               : Network Simulator-2

v   Front End                      : OTCL (Object Oriented Tool Command  Language)

REFERENCE:

Andrea Clementi, Francesco Pasquale, and Riccardo Silvestri “Opportunistic MANETs: Mobility Can Make Up for Low Transmission Power”- IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 21, NO. 2, APRIL 2013.

 [youtube]http://www.youtube.com/watch?v=nlSyZBakBag[/youtube]

Enhanced OLSR for Defense against DOS Attack in Ad Hoc Networks

Enhanced OLSR for Defense against DOS Attack in Ad Hoc Networks

ABSTRACT:

A mobile ad hoc network (MANET) refers to a network designed for special applications for which it is difficult to use a backbone network. In MANETs, applications are mostly involved with sensitive and secret information. Since MANET assumes a trusted environment for routing, security is a major issue. In this paper we analyze the vulnerabilities of a pro-active routing protocol called optimized link state routing (OLSR) against a specific type of denial-of-service (DOS) attack called node isolation attack. Analyzing the attack, we propose a mechanism called enhanced OLSR (EOLSR) protocol which is a trust based technique to secure the OLSR nodes against the attack. Our technique is capable of finding whether a node is advertising correct topology information or not by verifying its Hello packets, thus detecting node isolation attacks. The experiment results show that our protocol is able to achieve routing security with 45% increase in packet delivery ratio and 44% reduction in packet loss rate when compared to standard OLSR under node isolation attack. Our technique is light weight because it doesn’t involve high computational complexity for securing the networks.

PROJECT OUTPUT VIDEO: (Click the below link to see the project output video):

EXISTING SYSTEM:

When a network topology changes, respective updates must be propagated throughout the network to notify the change. In reactive routing protocols for mobile ad hoc networks, which are also called “on-demand” routing protocols, routing paths are searched for, when needed. Even though many research works had been carried out for routing attacks in MANET, most of it concentrated mainly on reactive routing protocols. Optimized link state routing (OLSR) routing protocol which is a proactive routing protocol offers promising performance in terms of bandwidth and traffic overhead but it does not incorporate any security measures.

DISADVANTAGES OF EXISTING SYSTEM:

OLSR is vulnerable to various kinds of attacks such as flooding attack, link withholding attack, replay attack, denial-of-service (DOS) attack and colluding misrelay attack.

PROPOSED SYSTEM:

In this paper, we analyze a specific DOS attack called node isolation attack and propose a solution for it. Node isolation attack can be easily launched on OLSR after observing the network activity for a period of time. We propose a solution called enhanced OLSR (EOLSR) that is based on verifying the hello packets coming from the node before selecting it as a multipoint relay (MPR) node for forwarding packets.

ADVANTAGES OF PROPOSED SYSTEM:

  • The proposed solution called EOLSR, which is based on OLSR, uses a simple verification scheme of hello packets coming from neighbor nodes to detect the malicious nodes in the network.
  • The experiment results show that the percentage of packets received through our proposed work is better than OLSR in presence of multiple attacker nodes.
  • Compared to other related works, the proposed protocol has more merits; the most important merit is that it achieves degradation in packet loss rate without any computational complexity or promiscuous listening.

SYSTEM CONFIGURATION:-

HARDWARE CONFIGURATION:-

ü Processor             –        Pentium –IV

ü Speed                             –        1.1 Ghz

ü RAM                    –        256 MB(min)

ü Hard Disk            –        20 GB

ü Key Board            –        Standard Windows Keyboard

ü Mouse                  –        Two or Three Button Mouse

ü Monitor                –        SVGA

 

SOFTWARE REQUIREMENTS:-

v   Operating System          : LINUX

v   Tool                               : Network Simulator-2

v   Front End                      : OTCL (Object Oriented Tool Command  Language)

 

REFERENCE:

Mohanapriya Marimuthu and Ilango Krishnamurthi “Enhanced OLSR for Defense against DOS Attack in Ad Hoc Networks”- JOURNAL OF COMMUNICATIONS AND NETWORKS, VOL. 15, NO. 1, FEBRUARY 2013.

 [youtube]http://youtu.be/siLKV69SOnw[/youtube]

Efficient Algorithms for Neighbor Discovery in Wireless Networks

Efficient Algorithms for Neighbor Discovery in Wireless Networks

ABSTRACT:

Neighbor discovery is an important first step in the initialization of a wireless ad hoc network. In this paper, we design and analyze several algorithms for neighbor discovery in wireless networks. Starting with a single-hop wireless network of nodes, we propose a ALOHA-like neighbor discovery algorithm when nodes cannot detect collisions, and an order-optimal receiver feedback-based algorithm when nodes can detect collisions. Our algorithms neither require nodes to have a priori estimates of the number of neighbors nor synchronization between nodes. Our algorithms allow nodes to begin execution at different time instants and to terminate neighbor discovery upon discovering all their neighbors. We finally show that receiver feedback can be used to achieve a running time, even when nodes cannot detect collisions. We then analyze neighbor discovery in a general multihop setting. We establish an upper bound of on the running time of the ALOHA-like algorithm, where denotes the maximum node degree in the network and the total number of nodes. We also establish a lower bound of on the running time of any randomized neighbor discovery algorithm. Our result thus implies that the ALOHA-like algorithm is at most a factor worse than optimal.

PROJECT OUTPUT VIDEO: (Click the below link to see the project output video):

EXISTING SYSTEM:

1) Neighbor discovery needs to cope with collisions. Ideally, a neighbor discovery algorithm needs to minimize the probability of collisions and, therefore, the time to discover neighbors.

2) In many practical settings, nodes have no knowledge of the number of neighbors, which makes coping with collisions even harder.

3) When nodes do not have access to a global clock, they need to operate asynchronously and still be able to discover their neighbors efficiently.

4) In asynchronous systems, nodes can potentially start neighbor discovery at different times and, consequently, may miss each other’s transmissions.

5) Furthermore, when the number of neighbors is unknown, nodes do not know when or how to terminate the neighbor discovery process.

PROPOSED SYSTEM:

In this paper, we present neighbor discovery algorithms that comprehensively address each of these practical challenges under the standard collision channel model. Unlike existing approaches that assume a priori knowledge of the number of neighbors or clock synchronization among nodes, we propose neighbor discovery algorithms that:

P1 do not require nodes to have a priori knowledge of the number of neighbors;

P2 do not require synchronization among nodes;

P3 allow nodes to begin execution at different time instants;

P4 enable each node to detect when to terminate the neighbor discovery process.

To the best of our knowledge, our work provides the first solution to the neighbor discovery problem that satisfies all of the properties P1–P4. Our approach is to start with a single-hop wireless network in which nodes are synchronized and know exactly how many neighbors they have. As we will see, the analysis in such a simplistic setting yields several valuable insights about the neighbor discovery problem. These insights allow us to progressively relax each of the assumptions leading to a complete and practical solution to the neighbor discovery problem in a multihop network setting.

ALGORITHMS USED:

SYSTEM CONFIGURATION:-

HARDWARE REQUIREMENTS:-

ü Processor                  –        Pentium –IV

ü Speed                        –        1.1 Ghz

ü RAM                         –        512 MB(min)

ü Hard Disk                 –        40 GB

ü Key Board                –        Standard Windows Keyboard

ü Mouse                       –        Two or Three Button Mouse

ü Monitor                     –        LCD/LED

SOFTWARE REQUIREMENTS:-

v   Operating System          : LINUX

v   Tool                               : Network Simulator-2

v   Front End                      : OTCL (Object Oriented Tool Command  Language)

 

REFERENCE:

Sudarshan Vasudevan, Micah Adler, Dennis Goeckel, and Don Towsley, “Efficient Algorithms for Neighbor Discovery in Wireless Networks”, IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 21, NO. 1, FEBRUARY 2013.

[youtube]https://www.youtube.com/watch?v=oPaaatJzcVk[/youtube]

EAACK—A Secure Intrusion-Detection System for MANETs

EAACK—A Secure Intrusion-Detection System for MANETs

ABSTRACT:

The migration to wireless network from wired network has been a global trend in the past few decades. The mobility and scalability brought by wireless network made it possible in many applications. Among all the contemporary wireless networks, Mobile Ad hoc NETwork (MANET) is one of the most important and unique applications. On the contrary to traditional network architecture, MANET does not require a fixed network infrastructure; every single node works as both a transmitter and a receiver. Nodes communicate directly with each other when they are both within the same communication range. Otherwise, they rely on their neighbors to relay messages. The self-configuring ability of nodes inMANETmade it popular among critical mission applications like military use or emergency recovery. However, the open medium and wide distribution of nodes make MANET vulnerable to malicious attackers. In this case, it is crucial to develop efficient intrusion-detection mechanisms to protect MANET from attacks. With the improvements of the technology and cut in hardware costs, we are witnessing a current trend of expanding MANETs into industrial applications. To adjust to such trend, we strongly believe that it is vital to address its potential security issues. In this paper, we propose and implement a new intrusion-detection system named Enhanced Adaptive ACKnowledgment (EAACK) specially designed for MANETs. Compared to contemporary approaches, EAACK demonstrates higher malicious-behavior-detection rates in certain circumstances while does not greatly affect the network performances.

PROJECT OUTPUT VIDEO: (Click the below link to see the project output video):

EXISTING SYSTEM:

By definition, Mobile Ad hoc NETwork (MANET) is a collection of mobile nodes equipped with both a wireless transmitter and a receiver that communicate with each other via bidirectional wireless links either directly or indirectly. Unfortunately, the open medium and remote distribution of MANET make it vulnerable to various types of attacks. For example, due to the nodes’ lack of physical protection, malicious attackers can easily capture and compromise nodes to achieve attacks. In particular, considering the fact that most routing protocols in MANETs assume that every node in the network behaves cooperatively with other nodes and presumably not malicious, attackers can easily compromise MANETs by inserting malicious or noncooperative nodes into the network. Furthermore, because of MANET’s distributed architecture and changing topology, a traditional centralized monitoring technique is no longer feasible in MANETs. In such case, it is crucial to develop an intrusion-detection system (IDS) specially designed for MANETs.

DISADVANTAGES OF EXISTING SYSTEM:

Watchdog scheme fails to detect malicious misbehaviors with the presence of the following: 1) ambiguous collisions; 2) receiver collisions; 3) limited transmission power; 4) false misbehavior report; 5) collusion; and 6) partial dropping.

The TWOACK scheme successfully solves the receiver collision and limited transmission power problems posed by Watchdog. However, the acknowledgment process required in every packet transmission process added a significant amount of unwanted network overhead. Due to the limited battery power nature of MANETs, such redundant transmission process can easily degrade the life span of the entire network.

The concept of adopting a hybrid scheme in AACK greatly reduces the network overhead, but both TWOACK and AACK still suffer from the problem that they fail to detect malicious nodes with the presence of false misbehavior report and forged acknowledgment packets.

PROPOSED SYSTEM:

In fact, many of the existing IDSs in MANETs adopt an acknowledgment-based scheme, including TWOACK and AACK. The functions of such detection schemes all largely depend on the acknowledgment packets. Hence, it is crucial to guarantee that the acknowledgment packets are valid and authentic. To address this concern, we adopt a digital signature in our proposed scheme named Enhanced AACK (EAACK).

ADVANTAGES OF PROPOSED SYSTEM:

Our proposed approach EAACK is designed to tackle three of the six weaknesses of Watchdog scheme, namely, false misbehavior, limited transmission power, and receiver collision.

 

SYSTEM CONFIGURATION:-

HARDWARE CONFIGURATION:-

ü Processor             –        Pentium –IV

ü Speed                             –        1.1 Ghz

ü RAM                    –        256 MB(min)

ü Hard Disk            –        20 GB

ü Key Board            –        Standard Windows Keyboard

ü Mouse                  –        Two or Three Button Mouse

ü Monitor                –        SVGA

 

SOFTWARE REQUIREMENTS:-

v   Operating System          : LINUX

v   Tool                               : Network Simulator-2

v   Front End                      : OTCL (Object Oriented Tool Command  Language)

REFERENCE:

 

Elhadi M. Shakshuki, Senior Member, IEEE, Nan Kang, and Tarek R. Sheltami, Member, IEEE, “EAACK—A Secure Intrusion-Detection System for MANETs”, IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS, VOL. 60, NO. 3, MARCH 2013.

[youtube]http://www.youtube.com/watch?v=WJtmkp9reUs[/youtube]

Distributed Cooperative Caching in Social Wireless Networks

Distributed Cooperative Caching in Social Wireless Networks

ABSTRACT:

This paper introduces cooperative caching policies for minimizing electronic content provisioning cost in Social Wireless Networks (SWNET).SWNETs are formed by mobile devices, such as data enabled phones, electronic book readers etc., sharing common interests in electronic content, and physically gathering together in public places. Electronic object caching in such SWNETs are shown to be able to reduce the content provisioning cost which depends heavily on the service and pricing dependences among various stakeholders including content providers (CP), network service providers, and End Consumers (EC). Drawing motivation from Amazon’s Kindle electronic book delivery business, this paper develops practical network, service, and pricing models which are then used for creating two object caching strategies for minimizing content provisioning costs in networks with homogenous and heterogeneous object demands. The paper constructs analytical and simulation models for analyzing the proposed caching strategies in the presence of selfish users that deviate from network-wide cost-optimal policies. It also reports results from an Android phone based prototype SWNET, validating the presented analytical and simulation results.

PROJECT OUTPUT VIDEO: (Click the below link to see the project output video):

EXISTING SYSTEM:

With the existence of such SWNETs, an alternative approach to content access by a device would be to first search the local SWNET for the requested content before downloading it from the CP’s server. The expected content provisioning cost of such an approach can be significantly lower since the download cost to the CSP would be avoided when the content is found within the local SWNET. This mechanism is termed as cooperative caching. In order to encourage the End-Consumers (EC) to cache previously downloaded content and to share it with other end-consumers, a peer-to-peer rebate mechanism is proposed. This mechanism can serve as an incentive so that the end-consumers are enticed to participate in cooperative content caching in spite of the storage and energy costs. In order for cooperative caching to provide cost benefits, this peer-to-peer rebate must be dimensioned to be smaller than the content download cost paid to the CSP. This rebate should be factored in the content provider’s overall cost.

DISADVANTAGES OF EXISTING SYSTEM:

Due to their limited storage, mobile handheld devices are not expected to store all downloaded content for long. This means after downloading and using a purchased electronic content, a device may remove it from the storage.

PROPOSED SYSTEM:

In this paper drawing motivation from Amazon’s Kindle electronic book delivery business, this paper develops practical network, service, and pricing models which are then used for creating two object caching strategies for minimizing content provisioning costs in networks with homogenous and heterogeneous object demands. The paper constructs analytical and simulation models for analyzing the proposed caching strategies in the presence of selfish users that deviate from network-wide cost-optimal policies. It also reports results from an Android phone based prototype SWNET, validating the presented analytical and simulation results.

ADVANTAGES OF PROPOSED SYSTEM:

  • Based on a practical service and pricing case, a stochastic model for the content provider’s cost computation is developed.
  • A cooperative caching strategy, Split Cache, is proposed, numerically analyzed, and theoretically proven to provide optimal object placement for networks with homogenous content demands.
  • A benefit-based strategy, Distributed Benefit, is proposed to minimize the provisioning cost in heterogeneous networks consisting of nodes with different content request rates and patterns.
  • The impacts of user selfishness on object provisioning cost and earned rebate is analyzed.

SYSTEM CONFIGURATION:-

HARDWARE REQUIREMENTS:-

ü Processor                  –        Pentium –IV

ü Speed                        –        1.1 Ghz

ü RAM                         –        512 MB(min)

ü Hard Disk                 –        40 GB

ü Key Board                –        Standard Windows Keyboard

ü Mouse                       –        Two or Three Button Mouse

ü Monitor                     –        LCD/LED

SOFTWARE REQUIREMENTS:-

v   Operating System          : LINUX

v   Tool                               : Network Simulator-2

v   Front End                      : OTCL (Object Oriented Tool Command  Language)

REFERENCE:

Mahmoud Taghizadeh,Member, IEEE, Kristopher Micinski, Member, IEEE, Charles Ofria, Eric Torng, and Subir Biswas,Senior Member, IEEE “Distributed Cooperative Caching in Social Wireless Networks”- IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 12, NO. 6, JUNE 2013.