Joint Relay and Jammer Selection for Secure Two-Way Relay Networks

IEEE Topics:

Joint Relay and Jammer Selection for Secure Two-Way Relay Networks

Abstract:

In this paper, we investigate joint relay and jammer selection in two-way cooperative networks, consisting of two sources, one eavesdropper, and a number of intermediate nodes, with secrecy constraints. Specifically, the proposed schemes select two or three intermediate nodes to enhance security against the malicious eavesdropper. The first selected node operates in the conventional relay mode and assists the two sources to exchange data with each other in the amplify-and-forward protocol. The second and third selected nodes are used in different communication phases as jammers in order to create intentional interference upon the eavesdropper. We find that in a scenario where the relay and jamming nodes are randomly and sparsely distributed, the proposed schemes with cooperative jamming outperform the conventional non-jamming schemes within a certain transmitted power range. We also find that, in a scenario where the intermediate nodes gather as a close cluster, the cooperative jamming schemes may be less effective than their non-jamming counterparts. Therefore, we introduce a hybrid scheme to switch between jamming and non-jamming modes. Simulation results validate our theoretical analysis that the hybrid switching scheme further improves the secrecy rate.

Problems in this project:

                    Ø  Jamming the nodes randomly is really not possible.

                 Ø  This graph analysis is unreal because the movable nodes cannot be implemented and it cannot be jammed.

Reasons for declaring this project as fake project:

Ø  The process of delivering data from source to destination is done by using buttons and changing colors to the buttons to show a process flow.

Ø  Such project worth can only be around Rs. 500.

Ø  Hence this will not work in the real environment.

Suggestions to complete this project as genuine project:

Ø  This is not a suitable final year project to be implemented by students.

Fast Matrix Embedding by Matrix Extending

IEEE Topics:

Fast Matrix Embedding by Matrix Extending

Abstract:

When designing steganographic schemes, matrix embedding is an efficient method for increasing the embedding efficiency that is defined as an average number of bits embedded via per change on the cover. Random linear code-based matrix embedding can achieve high embedding efficiency but cost much in computation. In this paper, we propose a method to increase the embedding speed of matrix embedding by extending the matrix via some referential columns. Compared with the original matrix embedding, the proposed method can exponentially reduce the computational complexity for equal increment of embedding efficiency. Experimental results also show that this novel method achieves higher embedding efficiency and faster embedding speed than previous fast matrix embedding methods, and thus is more suitable for real-time steganogaphic systems.

Problems in this project:

                    Ø  This project is fully of graph analysis and just shows the efficiency of the matrix.

                 Ø  There is no process in this project it’s fully theory oriented and it cannot be implemented as final year project.

Reasons for declaring this project as fake project:

Ø  This project is not feasible by a final year student.

Ø  This project will not be a real project as it is fully theory oriented.

Suggestions to complete this project as genuine project:

Ø  The graphical analysis cannot be taken as project.

So, the students are suggested not to take this as their final year project. 

Automatic Reconfiguration for Large-Scale Reliable Storage Systems

IEEE Topics:

Automatic Reconfiguration for Large-Scale Reliable Storage Systems

Abstract:

Byzantine-fault-tolerant replication enhances the availability and reliability of Internet services that store critical state and preserve it despite attacks or software errors. However, existing Byzantine-fault-tolerant storage systems either assume a static set of replicas, or have limitations in how they handle reconfigurations (e.g., in terms of the scalability of the solutions or the consistency levels they provide). This can be problematic in long-lived, large-scale systems where system membership is likely to change during the system lifetime. In this paper, we present a complete solution for dynamically changing system membership in a large-scale Byzantine-fault-tolerant system. We present a service that tracks system membership and periodically notifies other system nodes of membership changes. The membership service runs mostly automatically, to avoid human configuration errors; is itself Byzantinefault-tolerant and reconfigurable; and provides applications with a sequence of consistent views of the system membership. We demonstrate the utility of this membership service by using it in a novel distributed hash table called dBQS that provides atomic semantics even across changes in replica sets. dBQS is interesting in its own right because its storage algorithms extend existing Byzantine quorum protocols to handle changes in the replica set, and because it differs from previous DHTs by providing Byzantine fault tolerance and offering strong semantics. We implemented the membership service and dBQS. Our results show that the approach works well, in practice: the membership service is able to manage a large system and the cost to change the system membership is low.

Problems in this project:

               Ø  Implementing dBQS for complex and changing nodes is time consuming, critical and tedious to be done within the short duration of final year project.

                   Ø  Joining multiple nodes using dBQS requires a WAN network which is not possible in a final year project.

Ø  The preserved data should be secured from software errors but that cannot be implemented with dBQS as the failure of the  nodes and networks pose a great risk.

Reasons for declaring this project as fake project:

Ø  This project will not be a real project and it won’t work in the real environment because of lack of storage consistency.

Ø  Thus it’s a fake project and it’s not advisable to do it.

Suggestions to complete this project as genuine project:

Ø  Therefore students are suggested not to take this as their final year project.

Design and Implementation of TARF: A Trust-Aware Routing Framework for WSNs.

IEEE Topics:

Design and Implementation of TARF: A Trust-Aware Routing Framework for WSNs.

Abstract:

The multi-hop routing in wireless sensor networks (WSNs) offers little protection against identity deception through replaying routing information. An adversary can exploit this defect to launch various harmful or even devastating attacks against the routing protocols, including sinkhole attacks, wormhole attacks and Sybil attacks. The situation is further aggravated by mobile and harsh network conditions. Traditional cryptographic techniques or efforts at developing trust-aware routing protocols do not effectively address this severe problem. To secure the WSNs against adversaries misdirecting the multi-hop routing, we have designed and implemented TARF, a robust trust-aware routing framework for dynamic WSNs. Without tight time synchronization or known geographic information, TARF provides trustworthy and energy efficient route. Most importantly, TARF proves effective against those harmful attacks developed out of identity deception; the resilience of TARF is varied through extensive evaluation with both simulation and empirical experiment on large-scale WSNs under various scenarios including mobile and RF-shielding network conditions. Further, we have implemented a low-overhead TARF module in Tiny OS; as demonstrated, this implementation can be incorporated into existing routing protocols with the least effort. Based on TARF, we also demonstrated a proof-of-concept mobile target detection application that functions well against an anti-detection mechanism.

Problems in this project:

                       Ø  Creating multiple nodes in a network and maintaing them is a critical and tedious task..

  Ø  The base station cannot be created in the final year project because it costs more to implement real sensor networks.

   Ø  Hence selection of one hop node cannot be performed as there is no proper network.

  Ø  The wireless sensors cannot be used because it costs more and hence students may not be able to purchase it.

Reasons for declaring this project as fake project:

 Ø  This project cannot be implemented by a final year student because it costs more to purchase base station and sensors.  
 Ø  The process of delivering data from source to destination can only be done by using buttons and giving multiple colors to it in the single system. But this dummy project’s worth cannot exceed Rs. 400. 
 Ø  This project won’t work in the real environment because of the missing wireless sensor networks. 
 Ø  So the students are suggested not to take this as their final year project

Suggestions to complete this project as genuine project:

  Ø  This is purely a research project.

Protecting Location Privacy in Sensor Networks Against a Global Eavesdropper

IEEE Topics:

Protecting Location Privacy in Sensor Networks Against a Global Eavesdropper

Abstract:

While many protocols for sensor network security provide confidentiality for the content of messages, contextual information usually remains exposed. Such information can be critical to the mission of the sensor network, such as the location of a target object in a monitoring application, and it is often important to protect this information as well as message content. There have been several recent studies on providing location privacy in sensor networks. However, these existing approaches assume a weak adversary model where the adversary sees only local network traffic. We first argue that a strong adversary model, the global eavesdropper, is often realistic in practice and can defeat existing techniques. We then formalize the location privacy issues under this strong adversary model and show how much communication overhead is needed for achieving a given level of privacy. We also propose two techniques that prevent the leakage of location information: periodic collection and source simulation. Periodic collection provides a high level of location privacy, while source simulation provides trade-offs between privacy, communication cost, and latency. Through analysis and simulation, we demonstrate that the proposed techniques are efficient and effective in protecting location information from the attacker.

Problems in this project:

  Ø  This simulation project cannot be done as a final year project.

 Ø  Creation and maintenance of nodes is impossible in short term projects.

 Ø  The sensors cannot be used because it costs more.

Ø  This graph analysis is unreal because the movable nodes cannot be furnished.

Reasons for declaring this project as fake project:

Ø  This project cannot be implemented by a final year student because it costs more to buy sensors.
Ø  Also the nodes pose a great risk of failure and node property changes.
Ø  This project will not be a real project and it won’t work in the real environment because of unavailable wireless network and dedicated signals for communication.
Ø  Hence the students are suggested not to take this as their project.

Suggestions to complete this project as genuine project:

Ø  This is a research project to be implemented and tested well and hence requires more cost and more time.

 

Network Assisted Mobile Computing with Optimal Uplink Query Processing

IEEE Topics:

Network Assisted Mobile Computing with Optimal Uplink Query Processing

Abstract:

Many mobile applications retrieve content from remote servers via user generated queries. Processing these queries is often needed before the desired content can be identified. Processing the request on the mobile devices can quickly sap the limited battery resources. Conversely, processing user-queries at remote servers can have slow response times due communication latency incurred during transmission of the potentially large query. We evaluate a network-assisted mobile computing scenario where mid network nodes with “leasing” capabilities are deployed by a service provider. Leasing computation power can reduce battery usage on the mobile devices and improve response times. However, borrowing processing power from mid-network nodes comes at a leasing cost which must be accounted for when making the decision of where processing should occur. We study the tradeoff between battery usage, processing and transmission latency, and mid-network leasing. We use the dynamic programming framework to solve for the optimal processing policies that suggest the amount of processing to be done at each mid-network node in order to minimize the processing and communication latency and processing costs. Through numerical studies, we examine the properties of the optimal processing policy and the core tradeoffs in such systems.

Problems in this project:

 Ø  The creation of Mobile Station (MS), Base Station (BS) and nodes is impossible in less duration that’s allotted for final year projects.

  Ø  If the processing is done at the AS, communication latency can be high due to limited bandwidth of the wireless access link.

  Ø  Increasing battery usage will decrease latency and leasing costs, but also limits the lifetime of the mobile device.

            Ø  The lifetime of the device can be extended by increasing leasing costs which will decrease latency and battery usage.

Reasons for declaring this project as fake project:

      Ø  This project cannot be implemented by a final year student because it costs more to buy the required hardware equipments.

      Ø  This project will not be a real project because it can be done only at the organization level.

      Ø  It is absolutely a fake project and students should not do this project.

Suggestions to complete this project as genuine project:

   Ø This is a research project to be implemented by high level organization with a vast network area and well established stations. 

Cooperative download in vehicular environments

IEEE Topics:

Cooperative download in vehicular environments

Abstract:

We consider a complex (i.e., non-linear) road scenario where users aboard vehicles equipped with communication interfaces are interested in downloading large files from road-side Access Points (APs). We investigate the possibility of exploiting opportunistic encounters among mobile nodes so to augment the transfer rate experienced by vehicular downloader’s. To that end, we devise solutions for the selection of carriers and data chunks at the APs, and evaluate them in real-world road topologies, under different AP deployment strategies. Through extensive simulations, we show that carry & forward transfers can significantly increase the download rate of vehicular users in urban/suburban environments, and that such a result holds throughout diverse mobility scenarios, AP placements and network loads.

Problems in this project:

                    Ø  Downloading large files form the road side access points is not possible in the real environment.

             Ø  This process needs wireless network for connecting movable vehicles which is a costly and lengthy implementation and hence highly impossible.

Ø  This flow cannot be possible because of the unavailability of real APs.

Reasons for declaring this project as fake project:

Ø  This project cannot be implemented by a final year student because it costs more to create Access Points for wireless connections.

Ø  The downloading process, in movable traffic is highly impossible.

Ø  This project will not be a real project and it won’t work in the real environment because of wireless networks.

Suggestions to complete this project as genuine project:

Ø  This is purely a research based project to be created and tested with real APs and real wireless networks and dedicated signals. But it is costly and time consuming and can be done only by high level organization.

Cooperative Data Dissemination via Roadside WLANs

IEEE Topics:

Cooperative Data Dissemination via Roadside WLANs

Abstract:

Data dissemination services embrace a wide variety of telematic applications where data packets are generated at a remote server in the Internet and destined to a group of nomadic users such as vehicle passengers and pedestrians. The quality of a data dissemination service is highly dependent on the availability of network infrastructures in terms of the access points (APs). In this article, we investigate the utilization of roadside wireless local area networks (RSWLANs) as a network infrastructure for data dissemination. A two-level cooperative data dissemination approach is presented. With the network-level cooperation, the resources in the RS-WLANs are used to facilitate the data dissemination services for the nomadic users. The packet-level cooperation is exploited to improve the packet transmission rate to a nomadic user. Various techniques for the two levels of cooperation are discussed. A case study is presented to evaluate the performance of the data dissemination approach.

Problems in this project:

     Ø  The routers cannot be used in the small duration projects because it costs more and also is a time consuming task.

     Ø  The high packet transmission rate cannot be achieved for sure.

        Ø  From the figure, we can understand that this project is impossible without routers, AP and LAN and hence cannot be implemented with a single system.

                     Ø  The wireless networks cannot be possible for final year project, as it requires separate bandwidth and wide area for connection and communication.

  Reasons for declaring this project as fake project:

Ø  This project cannot be implemented by a final year student because it costs more.

Ø  Multiple routers are needed to do this project.

Ø  The process of delivering data from source to destination can only be done with a single machine by using buttons and giving multiple colors to it to indicate a process flow.  But this project is a mere waste and makes the project worth to just around Rs. 300.

Ø  So this is absolutely a fake project and students are advised not to do this project.

 Suggestions to complete this project as genuine project:

Ø  This project cannot be done as final year project because it consists of wireless connection which cannot be possible in the short term and with low price.

Ø  Therefore students are suggested not to take this as their final year project. If they take it as their project they should face many issues while trying to get a job.

AMPLE: An Adaptive Traffic Engineering System Based on Virtual Routing Topologies

IEEE Topics:

AMPLE: An Adaptive Traffic Engineering System Based on Virtual Routing Topologies

Abstract:

Handling traffic dynamics in order to avoid network congestion and subsequent service disruptions is one of the key tasks performed by contemporary network management systems. Given the simple but rigid routing and forwarding functionalities in IP base environments, efficient resource management and control solutions against dynamic traffic conditions is still yet to be obtained. In this article, we introduce AMPLE — an efficient traffic engineering and management system that performs adaptive traffic control by using multiple virtualized routing topologies. The proposed system consists of two complementary components: offline link weight optimization that takes as input the physical network topology and tries to produce maximum routing path diversity across multiple virtual routing topologies for long term operation through the optimized setting of link weights. Based on these diverse paths, adaptive traffic control performs intelligent traffic splitting across individual routing topologies in reaction to the monitored network dynamics at short timescale. According to our evaluation with real network topologies and traffic traces, the proposed system is able to cope almost optimally with unpredicted traffic dynamics and, as such, it constitutes a new proposal for achieving better quality of service and overall network performance in IP networks.

Problems in this project:

   Ø  Handling the dynamic network traffic cannot be possible in the final year project because it needs analysis of multiple nodes and routers, which is really a time consuming process.

   Ø  The routing topology cannot be implemented with a single system. But this project needs multiple routing topologies which are indicated by pink color squares in the figure below.

Ø  Hence multiple routers are needed to do this project and it is highly impossible.

Reasons for declaring this project as fake project:

Ø  This project cannot be implemented by a final year student because of routers which costs more to establish a real wireless network.

Ø  This project will not be a real project and it won’t work in the real environment without multiple routing topologies.

Ø  Also there is a huge requirement for hardware components.

Ø  Therefore students are suggested not to take this as their final year project.

Ø  If students take it as their final year project they need to face serious issues on getting job.

Suggestions to complete this project as genuine project:

Ø  If the students are willing to do this project they should have more time and should be ready for a huge investment to establish  proper sensor networks.

Ø  This project will cost more because of wireless networks.

TOPOLOGY CONTROL IN MOBILE AD HOC NETWORKS WITH COOPERATIVE COMMUNICATIONS

IEEE Topics:

TOPOLOGY CONTROL IN MOBILE AD HOC NETWORKS WITH COOPERATIVE COMMUNICATIONS

Abstract:

Cooperative communication has received tremendous interest for wireless networks. Most existing works on cooperative communications are focused on link-level physical layer issues. Consequently, the impacts of cooperative communications on network-level upper layer issues, such as topology control, routing and network capacity, are largely ignored. In this article, we propose a Capacity-Optimized Cooperative (COCO) topology control scheme to improve the network capacity in MANETs by jointly considering both upper layer network capacity and physical layer cooperative communications. Through simulations, we show that physical layer cooperative communications have significant impacts on the network capacity, and the proposed topology control scheme can substantially improve the network capacity in MANETs with cooperative communications.

Problems in this project:

                  Ø  This wireless and sensor network based project cannot be implemented as a final year project.

                  Ø  The topology of a MANET with 30 nodes randomly deployed in 800 × 800m square area in real time is highly impossible.

Ø  Delivering datas from source to destination nodes with non-cooperative communication is definitely not possible.

Reasons for declaring this project as fake project:

Ø  This project cannot be implemented by a final year student because it costs more.

Ø  Without sensor nodes this project is of no worth.

Ø  Building dynamic MANET is highly impossible.

Ø  This project will not be a real project and it won’t work in the real environment because of the unavailable wireless networks.

Suggestions to complete this project as genuine project:

Ø  This is a research project to be implemented by a high level organization with well structured MANETs and wireless connections.

Joint Top-K Spatial Keyword Query Processing.

IEEE TOPICS:

JOINT TOP -K SPATIAL KEYWORD QUERY PROCESSING 

ABSTRACT:

Web users and content are increasingly being geo-positioned, and increased focus is being given to serving local content in response to web queries. This development calls for spatial keyword queries that take into account both the locations and textual descriptions of content. We study the efficient, joint processing of multiple top-k spatial keyword queries. Such joint processing is attractive during high query loads and also occurs when multiple queries are used to obfuscate a user’s true query. We propose a novel algorithm and index structure for the joint processing of top-k spatial keyword queries. Empirical studies show that the proposed solution is efficient on real datasets. We also offer analytical studies on synthetic datasets to demonstrate the efficiency of the proposed solution.

PROBLEMS IN THIS PROJECT:

REASONS FOR DECLARING THIS PROJECT AS FAKE PROJECT:

1. Spatial datatype needs to be done. Most of the project centers have used normal datatype concept to implement.

SUGGESTIONS TO COMPLETE THIS PROJECT AS GENUINE PROJECT:

1. This project costs Rs. 175 in Tamil Nadu. Students can buy it.