Networking ieee-2014-projects
0 likes291 views
The document outlines various projects related to networking, including frameworks for secure and privacy-preserving vehicle tracking, dynamic pricing mechanisms for charging electric vehicles, and efficient multicast scheduling algorithms for OFDMA relay networks. It examines both the theoretical aspects and practical implementations of these technologies while addressing challenges in security, user privacy, and resource optimization. Several case studies and simulations are discussed to demonstrate the effectiveness of proposed solutions in different networking scenarios.
Networking ieee-2014-projects
- 1. Networking IEEE 2014 Projects Web : www.kasanpro.com Email : sales@kasanpro.com List Link : http://kasanpro.com/projects-list/networking-ieee-2014-projects Title :Verification and Inference of Positions in Vehicular Networks through Anonymous Beaconing Language : C# Project Link : http://kasanpro.com/p/c-sharp/verification-inference-positions-vehicular-networks-anonymous-beaconing Abstract : A number of vehicular networking applications require continuous knowledge of the location of vehicles and tracking of the routes they follow, including, e.g., real-time traffic monitoring, e-tolling, and liability attribution in case of accidents. Locating and tracking vehicles has however strong implications in terms of security and user privacy. On the one hand, there should be a mean for an authority to verify the correctness of positioning information announced by a vehicle, so as to identify potentially misbehaving cars. On the other, public disclosure of identity and position of drivers should be avoided, so as not to jeopardize user privacy. In this paper, we address such issues by introducing A-VIP, a secure, privacy-preserving framework for continuous tracking of vehicles. A-VIP leverages anonymous position beacons from vehicles, and the cooperation of nearby cars collecting and reporting the beacons they hear. Such information allows a location authority to verify the positions announced by vehicles, or to infer the actual ones if needed, without resorting to computationally expensive asymmetric cryptography. We assess the effectiveness of A-VIP via realistic simulation and experimental testbeds. Title :Verification and Inference of Positions in Vehicular Networks through Anonymous Beaconing Language : NS2 Project Link : http://kasanpro.com/p/ns2/verification-inference-positions-vehicular-networks-anonymous-beaconing-code Abstract : A number of vehicular networking applications require continuous knowledge of the location of vehicles and tracking of the routes they follow, including, e.g., real-time traffic monitoring, e-tolling, and liability attribution in case of accidents. Locating and tracking vehicles has however strong implications in terms of security and user privacy. On the one hand, there should be a mean for an authority to verify the correctness of positioning information announced by a vehicle, so as to identify potentially misbehaving cars. On the other, public disclosure of identity and position of drivers should be avoided, so as not to jeopardize user privacy. In this paper, we address such issues by introducing A-VIP, a secure, privacy-preserving framework for continuous tracking of vehicles. A-VIP leverages anonymous position beacons from vehicles, and the cooperation of nearby cars collecting and reporting the beacons they hear. Such information allows a location authority to verify the positions announced by vehicles, or to infer the actual ones if needed, without resorting to computationally expensive asymmetric cryptography. We assess the effectiveness of A-VIP via realistic simulation and experimental testbeds. Title :Information Flow Control for Secure Cloud Computing Language : C# Project Link : http://kasanpro.com/p/c-sharp/information-flow-control-secure-cloud-computing Abstract : Security concerns are widely seen as an obstacle to the adoption of cloud computing solutions. Information Flow Control (IFC) is a well understood Mandatory Access Control methodology. The earliest IFC models targeted security in a centralised environment, but decentralised forms of IFC have been designed and implemented, often within academic research projects. As a result, there is potential for decentralised IFC to achieve better cloud security than is available today. In this paper we describe the properties of cloud computing-- Platform-as-a-Service clouds in particular--and review a range of IFC models and implementations to identify opportunities for using IFC within a cloud computing context. Since IFC security is linked to the data that it protects, both tenants and providers of cloud services can agree on security policy, in a manner that does not require them to understand and rely on the particulars of the cloud software stack in order to effect enforcement.
- 2. Title :Information Flow Control for Secure Cloud Computing Language : NS2 Project Link : http://kasanpro.com/p/ns2/information-flow-control-secure-cloud-computing-code Abstract : Security concerns are widely seen as an obstacle to the adoption of cloud computing solutions. Information Flow Control (IFC) is a well understood Mandatory Access Control methodology. The earliest IFC models targeted security in a centralised environment, but decentralised forms of IFC have been designed and implemented, often within academic research projects. As a result, there is potential for decentralised IFC to achieve better cloud security than is available today. In this paper we describe the properties of cloud computing-- Platform-as-a-Service clouds in particular--and review a range of IFC models and implementations to identify opportunities for using IFC within a cloud computing context. Since IFC security is linked to the data that it protects, both tenants and providers of cloud services can agree on security policy, in a manner that does not require them to understand and rely on the particulars of the cloud software stack in order to effect enforcement. Title :Location Management in Cellular Networks Language : C# Project Link : http://kasanpro.com/p/c-sharp/location-management-cellular-networks Abstract : In a cellular network, a service coverage area is divided into smaller areas of hexagonal shape, referred to as cells. The cellular concept was introduced to reuse the radio frequency. In order to accommodate more subscribers, the size of cells must be reduced to make more efficient use of the limited frequency spectrum allocation. This will add to the challenge of some fundamental issues in cellular networks. Location management is one of the fundamental issues in cellular networks. It deals with how to track subscribers on the move. This chapter surveys recent research on location management in cellular networks. Networking IEEE 2014 Projects Title :Location Management in Cellular Networks Language : NS2 Project Link : http://kasanpro.com/p/ns2/location-management-cellular-networks-code Abstract : In a cellular network, a service coverage area is divided into smaller areas of hexagonal shape, referred to as cells. The cellular concept was introduced to reuse the radio frequency. In order to accommodate more subscribers, the size of cells must be reduced to make more efficient use of the limited frequency spectrum allocation. This will add to the challenge of some fundamental issues in cellular networks. Location management is one of the fundamental issues in cellular networks. It deals with how to track subscribers on the move. This chapter surveys recent research on location management in cellular networks. Title :Cooperation Versus Multiplexing: Multicast Scheduling Algorithms for OFDMA Relay Networks Language : C# Project Link : http://kasanpro.com/p/c-sharp/cooperation-versus-multiplexing-multicast-scheduling-algorithms-ofdma-relay-networks Abstract : With the next-generation cellular networks making a transition toward smaller cells, two-hop orthogonal frequency-division multiple access (OFDMA) relay networks have become a dominant, mandatory component in the 4G standards (WiMAX 802.16j, 3GPP LTE-Adv). While unicast flows have received reasonable attention in two-hop OFDMA relay networks, not much light has been shed on the design of efficient scheduling algorithms for multicast flows. Given the growing importance of multimedia broadcast and multicast services (MBMS) in 4G networks, the latter forms the focus of this paper. We show that while relay cooperation is critical for improving multicast performance, it must be carefully balanced with the ability to multiplex multicast sessions and hence maximize aggregate multicast flow. To this end, we highlight strategies that carefully group relays for cooperation to achieve this balance. We then solve the multicast scheduling problem under two OFDMA subchannelization models. We establish the NP-hardness of the scheduling problem even for the simpler model and provide efficient algorithms with approximation guarantees under both models. Evaluation of the proposed solutions reveals the efficiency of the scheduling algorithms as well as the significant benefits obtained from the multicasting strategy.
- 3. Title :Cooperation Versus Multiplexing: Multicast Scheduling Algorithms for OFDMA Relay Networks Language : NS2 Project Link : http://kasanpro.com/p/ns2/cooperation-multiplexing-multicast-scheduling-algorithms-ofdma-relay-networks Abstract : With the next-generation cellular networks making a transition toward smaller cells, two-hop orthogonal frequency-division multiple access (OFDMA) relay networks have become a dominant, mandatory component in the 4G standards (WiMAX 802.16j, 3GPP LTE-Adv). While unicast flows have received reasonable attention in two-hop OFDMA relay networks, not much light has been shed on the design of efficient scheduling algorithms for multicast flows. Given the growing importance of multimedia broadcast and multicast services (MBMS) in 4G networks, the latter forms the focus of this paper. We show that while relay cooperation is critical for improving multicast performance, it must be carefully balanced with the ability to multiplex multicast sessions and hence maximize aggregate multicast flow. To this end, we highlight strategies that carefully group relays for cooperation to achieve this balance. We then solve the multicast scheduling problem under two OFDMA subchannelization models. We establish the NP-hardness of the scheduling problem even for the simpler model and provide efficient algorithms with approximation guarantees under both models. Evaluation of the proposed solutions reveals the efficiency of the scheduling algorithms as well as the significant benefits obtained from the multicasting strategy. http://kasanpro.com/ieee/final-year-project-center-karur-reviews Title :D2P: Distributed Dynamic Pricing Policy in Smart Grid for PHEVs Management Language : C# Project Link : http://kasanpro.com/p/c-sharp/d2p-distributed-dynamic-pricing-policy-smart-grid-phevs-management Abstract : Future large-scale deployment of plug-in hybrid electric vehicles (PHEVs) will render massive energy demand on the electric grid during peak-hours. We propose an intelligent distributed dynamic pricing (D2P) mechanism for the charging of PHEVs in a smart grid architecture -- an effort towards optimizing the energy consumption profile of PHEVs users. Each micro-grid decides real-time dynamic price as home-price and roaming-price, depending on the supply-demand curve, to optimize its revenue. Consequently, two types of energy services are considered -- home micro-grid energy, and foreign microgrid energy. After designing the PHEVs' mobility and battery models, the pricing policies for the home-price and the roamingprice are presented. A decision making process to implement a cost-effective charging and discharging method for PHEVs is also demonstrated based on the real-time price decided by the micro-grids. We evaluate and compare the results of distributed pricing policy with other existing centralized/distributed ones. Simulation results show that using the proposed architecture, the utility corresponding to the PHEVs increases by approximately 34% over that of the existing ones for optimal charging of PHEVs. Title :D2P: Distributed Dynamic Pricing Policy in Smart Grid for PHEVs Management Language : NS2 Project Link : http://kasanpro.com/p/ns2/d2p-distributed-dynamic-pricing-policy-smart-grid-phevs-management-code Abstract : Future large-scale deployment of plug-in hybrid electric vehicles (PHEVs) will render massive energy demand on the electric grid during peak-hours. We propose an intelligent distributed dynamic pricing (D2P) mechanism for the charging of PHEVs in a smart grid architecture -- an effort towards optimizing the energy consumption profile of PHEVs users. Each micro-grid decides real-time dynamic price as home-price and roaming-price, depending on the supply-demand curve, to optimize its revenue. Consequently, two types of energy services are considered -- home micro-grid energy, and foreign microgrid energy. After designing the PHEVs' mobility and battery models, the pricing policies for the home-price and the roamingprice are presented. A decision making process to implement a cost-effective charging and discharging method for PHEVs is also demonstrated based on the real-time price decided by the micro-grids. We evaluate and compare the results of distributed pricing policy with other existing centralized/distributed ones. Simulation results show that using the proposed architecture, the utility corresponding to the PHEVs increases by approximately 34% over that of the existing ones for optimal charging of PHEVs. Networking IEEE 2014 Projects Title :Retransmission Delays With Bounded Packets: Power-Law Body and Exponential Tail Language : C# Project Link :
- 4. http://kasanpro.com/p/c-sharp/retransmission-delays-with-bounded-packets-power-law-body-exponential-tail Abstract : Retransmissions serve as the basic building block that communication protocols use to achieve reliable data transfer. Until recently, the number of retransmissions was thought to follow a geometric (light-tailed) distribution. However, recent work shows that when the distribution of the packet sizes have infinite support, retransmission-based protocols may result in heavy-tailed delays and possibly zero throughput even when the aforementioned distribution is light-tailed. In reality, however, packet sizes are often bounded by the maximum transmission unit (MTU), and thus the aforementioned result merits a deeper investigation. To that end, in this paper, we allow the distribution of the packet size to have finite support. Under mild conditions, we show that the transmission duration distribution exhibits a transition from a power-law main body to an exponential tail. The timescale to observe the power-law main body is roughly equal to the average transmission duration of the longest packet. The power-law main body, if significant, may cause the channel throughput to be very close to zero. These theoretical findings provide an understanding on why some empirical measurements suggest heavy tails. We use these results to further highlight the engineering implications of distributions with power-law main bodies and light tails by analyzing two cases: 1) the throughput of ON-OFF channels with retransmissions, where we show that even when packet sizes have small means and bounded support the variability in their sizes can greatly impact system performance; 2) the distribution of the number of jobs in an queue with server failures. Here, we show that retransmissions can cause long-range dependence and quantify the impact of the maximum job sizes on the long-range dependence. Title :Retransmission Delays With Bounded Packets: Power-Law Body and Exponential Tail Language : NS2 Project Link : http://kasanpro.com/p/ns2/retransmission-delays-with-bounded-packets-power-law-body-exponential-tail-code Abstract : Retransmissions serve as the basic building block that communication protocols use to achieve reliable data transfer. Until recently, the number of retransmissions was thought to follow a geometric (light-tailed) distribution. However, recent work shows that when the distribution of the packet sizes have infinite support, retransmission-based protocols may result in heavy-tailed delays and possibly zero throughput even when the aforementioned distribution is light-tailed. In reality, however, packet sizes are often bounded by the maximum transmission unit (MTU), and thus the aforementioned result merits a deeper investigation. To that end, in this paper, we allow the distribution of the packet size to have finite support. Under mild conditions, we show that the transmission duration distribution exhibits a transition from a power-law main body to an exponential tail. The timescale to observe the power-law main body is roughly equal to the average transmission duration of the longest packet. The power-law main body, if significant, may cause the channel throughput to be very close to zero. These theoretical findings provide an understanding on why some empirical measurements suggest heavy tails. We use these results to further highlight the engineering implications of distributions with power-law main bodies and light tails by analyzing two cases: 1) the throughput of ON-OFF channels with retransmissions, where we show that even when packet sizes have small means and bounded support the variability in their sizes can greatly impact system performance; 2) the distribution of the number of jobs in an queue with server failures. Here, we show that retransmissions can cause long-range dependence and quantify the impact of the maximum job sizes on the long-range dependence. Title :Secure Data Retrieval for Decentralized Disruption-Tolerant Military Networks Language : C# Project Link : http://kasanpro.com/p/c-sharp/secure-data-retrieval-decentralized-disruption-tolerant-military-networks Abstract : Mobile nodes in military environments such as a battlefield or a hostile region are likely to suffer from intermittent network connectivity and frequent partitions. Disruption-tolerant network (DTN) technologies are becoming successful solutions that allow wireless devices carried by soldiers to communicate with each other and access the confidential information or command reliably by exploiting external storage nodes. Some of the most challenging issues in this scenario are the enforcement of authorization policies and the policies update for secure data retrieval. Ciphertext-policy attribute-based encryption (CP-ABE) is a promising cryptographic solution to the access control issues. However, the problem of applying CP-ABE in decentralized DTNs introduces several security and privacy challenges with regard to the attribute revocation, key escrow, and coordination of attributes issued from different authorities. In this paper, we propose a secure data retrieval scheme using CP-ABE for decentralized DTNs where multiple key authorities manage their attributes independently. We demonstrate how to apply the proposed mechanism to securely and efficiently manage the confidential data distributed in the disruption-tolerant military network. Title :Secure Data Retrieval for Decentralized Disruption-Tolerant Military Networks Language : NS2 Project Link : http://kasanpro.com/p/ns2/secure-data-retrieval-decentralized-disruption-tolerant-military-networks-code
- 5. Abstract : Mobile nodes in military environments such as a battlefield or a hostile region are likely to suffer from intermittent network connectivity and frequent partitions. Disruption-tolerant network (DTN) technologies are becoming successful solutions that allow wireless devices carried by soldiers to communicate with each other and access the confidential information or command reliably by exploiting external storage nodes. Some of the most challenging issues in this scenario are the enforcement of authorization policies and the policies update for secure data retrieval. Ciphertext-policy attribute-based encryption (CP-ABE) is a promising cryptographic solution to the access control issues. However, the problem of applying CP-ABE in decentralized DTNs introduces several security and privacy challenges with regard to the attribute revocation, key escrow, and coordination of attributes issued from different authorities. In this paper, we propose a secure data retrieval scheme using CP-ABE for decentralized DTNs where multiple key authorities manage their attributes independently. We demonstrate how to apply the proposed mechanism to securely and efficiently manage the confidential data distributed in the disruption-tolerant military network.