IEEE 2015 NS2 Projects
0 likes53 views
The document outlines various IEEE 2015 NS2 projects, focusing on advanced networking techniques and security protocols. Key topics include optimal scheduling for cognitive cellular networks, an en-route filtering scheme for combating false data injection attacks in cyber-physical systems, and a privacy-preserving authentication protocol for cloud computing. Additional projects address efficient congestion control in high-performance computing networks and joint power splitting with antenna selection in relay channels.
More Related Content
![[IJCT-V3I2P21] Authors: Swati Govil, Dr.Paramjeet Rawat](https://cdn.slidesharecdn.com/ss_thumbnails/ijct-v3i2p21-160609061900-thumbnail.jpg?width=560&fit=bounds)
Similar to IEEE 2015 NS2 Projects (20)
IEEE 2015 NS2 Projects
- 1. IEEE 2015 NS2 Projects Web : www.kasanpro.com Email : [email protected] List Link : http://kasanpro.com/projects-list/ieee-2015-ns2-projects Title :Optimal Scheduling for Multi-radio Multi-channel Multi-hop Cognitive Cellular Networks Language : NS2 Project Link : http://kasanpro.com/p/ns2/optimal-scheduling-multi-radio-multi-channel-cognitive-cellular-networks Abstract : Due to the emerging various data services, current cellular networks have been experiencing a surge of data traffic and already overloaded, thus not able to meet the ever exploding traffic demand. In this study, we first introduce a Multi-radio Multi-channel Multi-hop Cognitive Cellular Network (M3C2N) architecture to enhance network throughput. Under the proposed architecture, we then investigate the minimum length scheduling problem by exploring joint frequency allocation, link scheduling, and routing. In particular, we first formulate a maximal independent set based joint scheduling and routing optimization problem called Original Optimization Problem (OOP). It is a Mixed Integer Non-Linear Programming (MINLP) and generally NP-hard problem. Then, employing a column generation based approach, we develop an ?-bounded approximation algorithm which can obtain an ?-bounded approximate result of OOP. Noticeably, in fact we do not need to find all the maximal independent sets in the proposed algorithm, which are usually assumed to be given in previous works although finding all of them is NP-complete. We also revisit the minimum length scheduling problem by considering uncertain channel availability. Simulation results show that we can efficiently find the ?-bounded approximate results and the optimal result as well, i.e., when ? = 0% in the algorithm. Title :A Novel En-route Filtering Scheme against False Data Injection Attacks in Cyber-Physical Networked Systems Language : NS2 Project Link : http://kasanpro.com/p/ns2/en-route-filtering-scheme-false-data-injection-attacks-cyber-physical-networked-systems Abstract : In Cyber-Physical Networked Systems (CPNS), the adversary can inject false measurements to the controller through compromised sensor nodes, which not only threaten the security of the system, but also consumes network resources. To deal with this issue, a number of en-route filtering schemes have been designed for wireless sensor networks in the past. However, these schemes either lack resilience to the number of compromised nodes or depend on the statically configure routes and node localization, which are not suitable for CPNS. In this paper, we propose a Polynomial-based Compromise-Resilient En-route Filtering scheme (PCREF), which can filter false injected data effectively and achieve a high resilience to the number of compromised nodes without relying on static routes and node localization. Particularly, PCREF adopts polynomials instead of MACs (Message Authentication Codes) for endorsing measurement reports to achieve the resilience to attacks. Each node stores two types of polynomials: authentication polynomial and check polynomial, derived from the primitive polynomial, and used for endorsing and verifying the measurement reports. Via extensive theoretical analysis and experiments, our data show that PCREF achieves better filtering capacity and resilience to the large number of compromised nodes in comparison to the existing schemes. Title :Shared Authority Based Privacy-preserving Authentication Protocol in Cloud Computing Language : NS2 Project Link : http://kasanpro.com/p/ns2/privacy-preserving-authentication-protocol-shared-authority-cloud Abstract : Cloud computing is emerging as a prevalent data interactive paradigm to realize users' data remotely stored in an online cloud server. Cloud services provide great conveniences for the users to enjoy the on-demand cloud applications without considering the local infrastructure limitations. During the data accessing, different users may be in a collaborative relationship, and thus data sharing becomes significant to achieve productive benefits. The existing security solutions mainly focus on the authentication to realize that a user's privative data cannot be unauthorized accessed, but neglect a subtle privacy issue during a user challenging the cloud server to request other users for data sharing. The challenged access request itself may reveal the user's privacy no matter whether or not it can obtain the data access permissions. In this paper, we propose a shared authority based privacy-preserving authentication protocol (SAPA) to address above privacy issue for cloud storage. In the SAPA, 1) shared access authority is achieved by anonymous access request matching mechanism with security and privacy considerations (e.g., authentication, data anonymity, user privacy, and forward security); 2) attribute based access control is adopted to realize that the user can only access its own data fields; 3) proxy re-encryption is applied by the cloud server to provide data sharing among the multiple users. Meanwhile, universal composability (UC) model is established to prove that the SAPA theoretically has the design correctness. It indicates that the proposed protocol realizing privacy-preserving data access authority sharing, is attractive for multi-user collaborative cloud applications. IEEE 2015 NS2 Projects Title :Efficient and Cost-Effective Hybrid Congestion Control for HPC Interconnection Networks Language : NS2
- 2. Project Link : http://kasanpro.com/p/ns2/efficient-cost-effective-hybrid-congestion-control Abstract : Interconnection networks are key components in high-performance computing (HPC) systems, their performance having a strong influence on the overall system one. However, at high load, congestion and its negative effects (e.g., Head-of-line blocking) threaten the performance of the network, and so the one of the entire system. Congestion control (CC) is crucial to ensure an efficient utilization of the interconnection network during congestion situations. As one major trend is to reduce the effective wiring in interconnection networks to reduce cost and power consumption, the network will operate very close to its capacity. Thus, congestion control becomes essential. Existing CC techniques can be divided into two general approaches. One is to throttle traffic injection at the sources that contribute to congestion, and the other is to isolate the congested traffic in specially designated resources. However, both approaches have different, but non-overlapping weaknesses: injection throttling techniques have a slow reaction against congestion, while isolating traffic in special resources may lead the system to run out of those resources. In this paper we propose EcoCC, a new Efficient and Cost-Effective CC technique, that combines injection throttling and congested-flow isolation to minimize their respective drawbacks and maximize overall system performance. This new strategy is suitable for current commercial switch architectures, where it could be implemented without requiring significant complexity. Experimental results, using simulations under synthetic and real trace-based traffic patterns, show that this technique improves by up to 55 percent over some of the most successful congestion control techniques. Title :Joint Power Splitting and Antenna Selection in Energy Harvesting Relay Channels Language : NS2 Project Link : http://kasanpro.com/p/ns2/joint-power-splitting-antenna-selection Abstract : The simultaneous wireless transfer of information and power with the help of a relay equipped with multiple antennas is considered in this letter, where a "harvest-and-forward" strategy is proposed. In particular, the relay harvests energy and obtains information from the source with the radio-frequent signals by jointly using the antenna selection (AS) and power splitting (PS) techniques, and then the processed information is amplified and forwarded to the destination relying on the harvested energy. This letter jointly optimizes AS and PS to maximize the achievable rate for the proposed strategy. Considering that the joint optimization is according to the non-convex problem, a two-stage procedure is proposed to determine the optimal ratio of received signal power split for energy harvesting, and the optimized antenna set engaged in information forwarding. Simulation results confirm the accuracy of the two-stage procedure, and demonstrate that the proposed "harvest-and-forward" strategy outperforms the conventional amplify-and-forward (AF) relaying and the direct transmission. Title :Detectors for Cooperative Mesh Networks With Decode-and-Forward Relays Language : NS2 Project Link : http://kasanpro.com/p/ns2/detectors-cooperative-mesh-networks-with-decode-forward-relays Abstract : We consider mesh networks composed of groups of relaying nodes which operate in decode-and-forward mode. Each node from a group relays information to all the nodes in the next group. We study these networks in two setups, one where the nodes have complete state information about the channels through which they receive the signals, and anotherwhen they only have the statistics of the channels. We derive recursive expressions for the probabilities of errors of the nodes and present several implementations of detectors used in these networks. We compare the mesh networks with multihop networks formed by a set of parallel sections of multiple relaying nodes. We demonstrate with numerous simulations that there are significant improvements in performance of mesh over multihop networks in various scenarios. IEEE 2015 NS2 Projects