IEEE 2014 NS2 Projects
0 likes373 views
The document presents summaries of various research projects related to network and cloud computing technologies, focusing on innovative solutions such as a framework for localizing jammers in wireless networks, a fault-tolerant multi-cloud storage system, and a privacy-preserving vehicle tracking method. Each project tackles specific challenges in these fields, including enhancing data security, improving service composition, and optimizing resource management. Overall, the projects contribute to advancing the efficiency and reliability of networked systems and cloud services.
IEEE 2014 NS2 Projects
- 1. IEEE 2014 NS2 Projects Web : www.kasanpro.com Email : sales@kasanpro.com List Link : http://kasanpro.com/projects-list/ieee-2014-ns2-projects Title :An Error Minimizing Framework for Localizing Jammers in Wireless Networks Language : NS2 Project Link : http://kasanpro.com/p/ns2/error-minimizing-localizing-jammers-wireless-networks-code Abstract : Jammers can severely disrupt the communications in wireless networks, and jammers' position information allows the defender to actively eliminate the jamming attacks. Thus, in this paper, we aim to design a framework that can localize one or multiple jammers with a high accuracy. Most of existing jammer-localization schemes utilize indirect measurements (e.g., hearing ranges) affected by jamming attacks, which makes it difficult to localize jammers accurately. Instead, we exploit a direct measurement-the strength of jamming signals (JSS). Estimating JSS is challenging as jamming signals may be embedded in other signals. As such, we devise an estimation scheme based on ambient noise floor and validate it with real-world experiments. To further reduce estimation errors, we define an evaluation feedback metric to quantify the estimation errors and formulate jammer localization as a non-linear optimization problem, whose global optimal solution is close to jammers' true positions. We explore several heuristic search algorithms for approaching the global optimal solution, and our simulation results show that our error-minimizing-based framework achieves better performance than the existing schemes. In addition, our error minimizing framework can utilize indirect measurements to obtain a better location estimation compared with prior work. Title :NCCloud: A Network-Coding-Based Storage System in a Cloud-of-Clouds Language : NS2 Project Link : http://kasanpro.com/p/ns2/nccloud-network-coding-based-storage-system-cloud-clouds-code Abstract : To provide fault tolerance for cloud storage, recent studies propose to stripe data across multiple cloud vendors. However, if a cloud suffers from a permanent failure and loses all its data, we need to repair the lost data with the help of the other surviving clouds to preserve data redundancy. We present a proxy-based storage system for fault-tolerant multiple-cloud storage called NCCloud, which achieves cost-effective repair for a permanent single-cloud failure. NCCloud is built on top of a network-coding-based storage scheme called the functional minimum-storage regenerating (FMSR) codes, which maintain the same fault tolerance and data redundancy as in traditional erasure codes (e.g., RAID-6), but use less repair traffic and hence incur less monetary cost due to data transfer. One key design feature of our FMSR codes is that we relax the encoding requirement of storage nodes during repair, while preserving the benefits of network coding in repair. We implement a proof-of-concept prototype of NCCloud and deploy it atop both local and commercial clouds. We validate that FMSR codes provide significant monetary cost savings in repair over RAID-6 codes, while having comparable response time performance in normal cloud storage operations such as upload/download. Title :Compatibility-aware Cloud Service Composition Under Fuzzy Preferences Language : NS2 Project Link : http://kasanpro.com/p/ns2/compatibility-aware-cloud-service-composition-under-fuzzy-preference Abstract : When a single Cloud service (i.e., a software image and a virtual machine), on its own, cannot satisfy all the user requirements, a composition of Cloud services is required. Cloud service composition, which includes several tasks such as discovery, compatibility checking, selection, and deployment, is a complex process and users find it difficult to select the best one among the hundreds, if not thousands, of possible compositions available. Service composition in Cloud raises even new challenges caused by diversity of users with different expertise requiring their applications to be deployed across difference geographical locations with distinct legal constraints. The main difficulty lies in selecting a combination of virtual appliances (software images) and infrastructure services that are compatible and satisfy a user with vague preferences. Therefore, we present a framework and algorithms which simplify Cloud service composition for unskilled users. We develop an ontologybased approach to analyze Cloud service compatibility by applying reasoning on the expert knowledge. In addition, to minimize effort of users in expressing
- 2. their preferences, we apply combination of evolutionary algorithms and fuzzy logic for composition optimization. This lets users express their needs in linguistics terms which brings a great comfort to them compared to systems that force users to assign exact weights for all preferences. Title :DOTS: A Propagation Delay-aware Opportunistic MAC Protocol for Underwater Sensor Networks Language : NS2 Project Link : http://kasanpro.com/p/ns2/dots-propagation-delay-aware-opportunistic-mac-protocol-underwater-sensor-network Abstract : Underwater Acoustic Sensor Networks (UW-ASNs) use acoustic links as a means of communications and are accordingly confronted with long propagation delays, low bandwidth, and high transmission power consumption. This unique situation, however, permits multiple packets to concurrently propagate in the underwater channel, which must be exploited in order to improve the overall throughput. To this end, we propose the Delay-aware Opportunistic Transmission Scheduling (DOTS) algorithm that uses passively obtained local information (i.e., neighboring nodes' propagation delay map and their expected transmission schedules) to increase the chances of concurrent transmissions while reducing the likelihood of collisions. Our extensive simulation results document that DOTS outperforms existing solutions and provides fair medium access. Title :From MAP to DIST: The Evolution of a Large-Scale WLAN Monitoring System Language : NS2 Project Link : http://kasanpro.com/p/ns2/from-map-dist-the-evolution-large-scale-wlan-monitoring-system-code Abstract : The edge of the Internet is increasingly becoming wireless. Therefore, monitoring the wireless edge is important to understanding the security and performance aspects of the Internet experience. We designed and implemented a large-scale WLAN monitoring system, the Dartmouth Internet security testbed (DIST), at Dartmouth College. It is equipped with distributed arrays of "sniffers" that cover 210 diverse campus locations and more than 5,000 users. In this paper, we describe our approach, designs, and solutions for addressing the technical challenges that have resulted from efficiency, scalability, security, and management perspectives. We also present extensive evaluation results on a production network, and summarize the lessons learned. IEEE 2014 NS2 Projects 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 : 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
- 3. 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 :The Silence of the LANs: Efficient Leakage Resilience for IPsec VPNs Language : NS2 Project Link : http://kasanpro.com/p/ns2/efficient-leakage-resilience-ipsec-vpns-code Abstract : Virtual Private Networks (VPNs) are increasingly used to build logically isolated networks. However, existing VPN designs and deployments neglected the problem of traffic analysis and covert channels. Hence, there are many ways to infer information from VPN traffic without decrypting it. Many proposals have been made to mitigate network covert channels, but previous works remained largely theoretical or resulted in prohibitively high padding overhead and performance penalties. In this work, we (1) analyse the impact of covert channels in IPsec, (2) present several improved and novel approaches for covert channel mitigation in IPsec, (3) propose and implement a system for dynamic performance trade-o_s, and (4) implement our design in the Linux IPsec stack and evaluate its performance for different types of traffic and mitigation policies. At only 24% overhead, our prototype enforces tight information-theoretic bounds on all information leak- age. To encourage further research on practical systems, our prototype is available for public use. http://kasanpro.com/ieee/final-year-project-center-madurai-reviews Title :Balancing Performance, Accuracy, and Precision for Secure Cloud Transactions Language : NS2 Project Link : http://kasanpro.com/p/ns2/balancing-performance-accuracy-precision-secure-cloud-distributed-transactions Abstract : In distributed transactional database systems deployed over cloud servers, entities cooperate to form proofs of authorization that are justified by collections of certified credentials. These proofs and credentials may be evaluated and collected over extended time periods under the risk of having the underlying authorization policies or the user credentials being in inconsistent states. It therefore becomes possible for policy-based authorization systems to make unsafe decisions that might threaten sensitive resources. In this paper, we highlight the criticality of the problem. We then define the notion of trusted transactions when dealing with proofs of authorization. Accordingly, we propose several increasingly stringent levels of policy consistency constraints, and present different enforcement approaches to guarantee the trustworthiness of transactions executing on cloud servers. We propose a Two-Phase Validation Commit protocol as a solution, which is a modified version of the basic Two-Phase Commit protocols. We finally analyze the different approaches presented using both analytical evaluation of the overheads and simulations to guide the decision makers to which approach to use. 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. IEEE 2014 NS2 Projects Title :Localized Movement-Assisted Sensor Deployment Algorithm for Hole Detection and Healing Language : NS2 Project Link : http://kasanpro.com/p/ns2/localized-movement-assisted-sensor-deployment-algorithm-hole-detection-healing
- 4. Abstract : One of the fundamental services provided by a wireless sensor network (WSN) is the monitoring of a specified region of interest (RoI). Considering the fact that emergence of holes in the RoI is unavoidable due to the inner nature of WSNs, random deployment, environmental factors, and external attacks, assuring that the RoI is completely and continuously covered is very important. This paper seeks to address the problem of hole detection and healing in mobile WSNs. We discuss the main drawbacks of existing solutions and we identify four key elements that are critical for ensuring effective coverage in mobile WSNs: 1) determining the boundary of the RoI, 2) detecting coverage holes and estimating their characteristics, 3) determining the best target locations to relocate mobile nodes to repair holes, and 4) dispatching mobile nodes to the target locations while minimizing the moving and messaging cost. We propose a lightweight and comprehensive solution, called holes detection and healing (HEAL), that addresses all of the aforementioned aspects. The computation complexity of HEAL is O2 where v is the average number of 1-hop neighbors. HEAL is a distributed and localized algorithm that operates in two distinct phases. The first identifies the boundary nodes and discovers holes using a lightweight localized protocol over the Gabriel graph of the network. The second treats the hole healing, with novel concept, hole healing area. We propose a distributed virtual forces-based local healing approach where only the nodes located at an appropriate distance from the hole will be involved in the healing process. Through extensive simulations we show that HEAL deals with holes of various forms and sizes, and provides a cost-effective and an accurate solution for hole detection and healing. Title :Achieving Effective Cloud Search Services: Multi-keyword Ranked Search over Encrypted Cloud Data Supporting Synonym Query Language : NS2 Project Link : http://kasanpro.com/p/ns2/multi-keyword-ranked-search-cloud-search-services-encrypted-cloud Abstract : In recent years, consumer-centric cloud computing paradigm has emerged as the development of smart electronic devices combined with the emerging cloud computing technologies. A variety of cloud services are delivered to the consumers with the premise that an effective and efficient cloud search service is achieved. For consumers, they want to find the most relevant products or data, which is highly desirable in the "pay-as-you use" cloud computing paradigm. As sensitive data (such as photo albums, emails, personal health records, financial records, etc.) are encrypted before outsourcing to cloud, traditional keyword search techniques are useless. Meanwhile, existing search approaches over encrypted cloud data support only exact or fuzzy keyword search, but not semantics-based multi-keyword ranked search. Therefore, how to enable an effective searchable system with support of ranked search remains a very challenging problem. This paper proposes an effective approach to solve the problem of multi-keyword ranked search over encrypted cloud data supporting synonym queries. The main contribution of this paper is summarized in two aspects: multi-keyword ranked search to achieve more accurate search results and synonym-based search to support synonym queries. Extensive experiments on real-world dataset were performed to validate the approach, showing that the proposed solution is very effective and efficient for multikeyword ranked searching in a cloud environment. Title :A Mechanism Design Approach to Resource Procurement in Cloud Computing Language : NS2 Project Link : http://kasanpro.com/p/ns2/resource-procurement-cloud-computing Abstract : We present a cloud resource procurement approach which not only automates the selection of an appropriate cloud vendor but also implements dynamic pricing. Three possible mechanisms are suggested for cloud resource procurement: cloud-dominant strategy incentive compatible (C-DSIC), cloud-Bayesian incentive compatible (C-BIC), and cloud optimal (C-OPT). C-DSIC is dominant strategy incentive compatible, based on the VCG mechanism, and is a low-bid Vickrey auction. C-BIC is Bayesian incentive compatible, which achieves budget balance. C-BIC does not satisfy individual rationality. In C-DSIC and C-BIC, the cloud vendor who charges the lowest cost per unit QoS is declared the winner. In C-OPT, the cloud vendor with the least virtual cost is declared the winner. C-OPT overcomes the limitations of both C-DSIC and C-BIC. C-OPT is not only Bayesian incentive compatible, but also individually rational. Our experiments indicate that the resource procurement cost decreases with increase in number of cloud vendors irrespective of the mechanisms. We also propose a procurement module for a cloud broker which can implement C-DSIC, C-BIC, or C-OPT to perform resource procurement in a cloud computing context. A cloud broker with such a procurement module enables users to automate the choice of a cloud vendor among many with diverse offerings, and is also an essential first step toward implementing dynamic pricing in the cloud. Title :A Novel Model for Competition and Cooperation Among Cloud Providers Language : NS2 Project Link : http://kasanpro.com/p/ns2/competition-cooperation-model-among-cloud-providers Abstract : Having received significant attention in the industry, the cloud market is nowadays fiercely competitive with many cloud providers. On one hand, cloud providers compete against each other for both existing and new cloud
- 5. users. To keep existing users and attract newcomers, it is crucial for each provider to offer an optimal price policy which maximizes the final revenue and improves the competitive advantage. The competition among providers leads to the evolution of the market and dynamic resource prices over time. On the other hand, cloud providers may cooperate with each other to improve their final revenue. Based on a Service Level Agreement, a provider can outsource its users' resource requests to its partner to reduce the operation cost and thereby improve the final revenue. This leads to the problem of determining the cooperating parties in a cooperative environment. This paper tackles these two issues of the current cloud market. First, we solve the problem of competition among providers and propose a dynamic price policy. We employ a discrete choice model to describe the user's choice behavior based on his obtained benefit value. The choice model is used to derive the probability of a user choosing to be served by a certain provider. The competition among providers is formulated as a non-cooperative stochastic game where the players are providers who act by proposing the price policy simultaneously. The game is modelled as a Markov Decision Process whose solution is a Markov Perfect Equilibrium. Then, we address the cooperation among providers by presenting a novel algorithm for determining a cooperation strategy that tells providers whether to satisfy users' resource requests locally or outsource them to a certain provider. The algorithm yields the optimal cooperation structure from which no provider unilaterally deviates to gain more revenue. Numerical simulations are carried out to evaluate the performance of the proposed models. Title :Consistency as a Service: Auditing Cloud Consistency Language : NS2 Project Link : http://kasanpro.com/p/ns2/consistency-as-a-service-auditing-cloud-consistency Abstract : Cloud storage services have become commercially popular due to their overwhelming advantages. To provide ubiquitous always-on access, a cloud service provider (CSP) maintains multiple replicas for each piece of data on geographically distributed servers. A key problem of using the replication technique in clouds is that it is very expensive to achieve strong consistency on a worldwide scale. In this paper, we first present a novel consistency as a service (CaaS) model, which consists of a large data cloud and multiple small audit clouds. In the CaaS model, a data cloud is maintained by a CSP, and a group of users that constitute an audit cloud can verify whether the data cloud provides the promised level of consistency or not. We propose a two-level auditing architecture, which only requires a loosely synchronized clock in the audit cloud. Then, we design algorithms to quantify the severity of violations with two metrics: the commonality of violations, and the staleness of the value of a read. Finally, we devise a heuristic auditing strategy (HAS) to reveal as many violations as possible. Extensive experiments were performed using a combination of simulations and real cloud deployments to validate HAS. IEEE 2014 NS2 Projects Title :Panda: Public Auditing for Shared Data with Efficient User Revocation in the Cloud Language : NS2 Project Link : http://kasanpro.com/p/ns2/panda-public-auditing-shared-data-efficient-user-revocation-cloud-code Abstract : With data storage and sharing services in the cloud, users can easily modify and share data as a group. To ensure shared data integrity can be verified publicly, users in the group need to compute signatures on all the blocks in shared data. Different blocks in shared data are generally signed by different users due to data modifications performed by different users. For security reasons, once a user is revoked from the group, the blocks which were previously signed by this revoked user must be re-signed by an existing user. The straightforward method, which allows an existing user to download the corresponding part of shared data and re-sign it during user revocation, is inefficient due to the large size of shared data in the cloud. In this paper, we propose a novel public auditing mechanism for the integrity of shared data with efficient user revocation in mind. By utilizing the idea of proxy re-signatures, we allow the cloud to re-sign blocks on behalf of existing users during user revocation, so that existing users do not need to download and re-sign blocks by themselves. In addition, a public verifier is always able to audit the integrity of shared data without retrieving the entire data from the cloud, even if some part of shared data has been re-signed by the cloud. Moreover, our mechanism is able to support batch auditing by verifying multiple auditing tasks simultaneously. Experimental results show that our mechanism can significantly improve the efficiency of user revocation. http://kasanpro.com/ieee/final-year-project-center-madurai-reviews Title :Performance and cost evaluation of an adaptive encryption architecture for cloud databases Language : NS2 Project Link : http://kasanpro.com/p/ns2/performance-cost-evaluation-adaptive-encryption-architecture-cloud-databases-code
- 6. Abstract : The cloud database as a service is a novel paradigm that can support several Internet-based applications, but its adoption requires the solution of information confidentiality problems. We propose a novel architecture for adaptive encryption of public cloud databases that offers an interesting alternative to the trade-off between the required data confidentiality level and the flexibility of the cloud database structures at design time. We demonstrate the feasibility and performance of the proposed solution through a software prototype. Moreover, we propose an original cost model that is oriented to the evaluation of cloud database services in plain and encrypted instances and that takes into account the variability of cloud prices and tenant workload during a medium-term period. Title :Cloud-Assisted Mobile-Access of Health Data With Privacy and Auditability Language : NS2 Project Link : http://kasanpro.com/p/ns2/cloud-assisted-mobile-access-health-data-privacy-auditability Abstract : Motivated by the privacy issues, curbing the adoption of electronic healthcare systems and the wild success of cloud service models, we propose to build privacy into mobile healthcare systemswith the help of the private cloud. Our system offers salient features including efficient key management, privacy-preserving data storage, and retrieval, especially for retrieval at emergencies, and auditability for misusing health data. Specifically, we propose to integrate key management from pseudorandom number generator for unlinkability, a secure indexing method for privacypreserving keyword searchwhich hides both search and access patterns based on redundancy, and integrate the concept of attributebased encryption with threshold signing for providing role-based access control with auditability to prevent potential misbehavior, in both normal and emergency cases. Title :Efficient Authentication for Mobile and Pervasive Computing Language : NS2 Project Link : http://kasanpro.com/p/ns2/efficient-authentication-mobile-pervasive-computing-code Abstract : With today's technology, many applications rely on the existence of small devices that can exchange information and form communication networks. In a significant portion of such applications, the confidentiality and integrity of the communicated messages are of particular interest. In this work, we propose two novel techniques for authenticating short encrypted messages that are directed to meet the requirements of mobile and pervasive applications. By taking advantage of the fact that the message to be authenticated must also be encrypted, we propose provably secure authentication codes that are more efficient than any message authentication code in the literature. The key idea behind the proposed techniques is to utilize the security that the encryption algorithm can provide to design more efficient authentication mechanisms, as opposed to using standalone authentication primitives. Title :Map-Aware Models for Indoor Wireless Localization Systems: An Experimental Study Language : NS2 Project Link : http://kasanpro.com/p/ns2/map-aware-models-indoor-wireless-localization-systems-code Abstract : The accuracy of indoor wireless localization systems can be substantially enhanced by map-awareness, i.e., by the knowledge of the map of the environment in which localization signals are acquired. In fact, this knowledge can be exploited to cancel out, at least to some extent, the signal degradation due to propagation through physical obstructions, i.e., to the so called non-line-of-sight bias. This result can be achieved by developing novel localization techniques that rely on proper mapaware statistical modelling of the measurements they process. In this manuscript a unified statistical model for the measurements acquired in map-aware localization systems based on time-ofarrival and received signal strength techniques is developed and its experimental validation is illustrated. Finally, the accuracy of the proposed map-aware model is assessed and compared with that offered by its map-unaware counterparts. Our numerical results show that, when the quality of acquired measurements is poor, map-aware modelling can enhance localization accuracy by up to 110% in certain scenarios. IEEE 2014 NS2 Projects Title :Preserving Location Privacy in Geo-Social Applications Language : NS2 Project Link : http://kasanpro.com/p/ns2/preserving-location-privacy-geo-social-applications-code Abstract : Using geo-social applications, such as FourSquare, millions of people interact with their surroundings
- 7. through their friends and their recommendations. Without adequate privacy protection, however, these systems can be easily misused, e.g., to track users or target them for home invasion. In this paper, we introduce LocX, a novel alternative that provides significantly-improved location privacy without adding uncertainty into query results or relying on strong assumptions about server security. Our key insight is to apply secure user-specific, distance-preserving coordinate transformations to all location data shared with the server. The friends of a user share this user's secrets so they can apply the same transformation. This allows all location queries to be evaluated correctly by the server, but our privacy mechanisms guarantee that servers are unable to see or infer the actual location data from the transformed data or from the data access. We show that LocX provides privacy even against a powerful adversary model, and we use prototype measurements to show that it provides privacy with very little performance overhead, making it suitable for today's mobile devices. Title :Privacy-Preserving Optimal Meeting Location Determination on Mobile Devices Language : NS2 Project Link : http://kasanpro.com/p/ns2/privacy-preserving-optimal-meeting-location-determination-mobile-devices-code Abstract : Equipped with state-of-the-art smartphones and mobile devices, today's highly interconnected urban population is increasingly dependent on these gadgets to organize and plan their daily lives. These applications often rely on current (or preferred) locations of individual users or a group of users to provide the desired service, which jeopardizes their privacy; users do not necessarily want to reveal their current (or preferred) locations to the service provider or to other, possibly untrusted, users. In this paper, we propose privacy-preserving algorithms for determining an optimal meeting location for a group of users. We perform a thorough privacy evaluation by formally quantifying privacy-loss of the proposed approaches. In order to study the performance of our algorithms in a real deployment, we implement and test their execution efficiency on Nokia smartphones. By means of a targeted user-study, we attempt to get an insight into the privacy-awareness of users in locationbased services and the usability of the proposed solutions. 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. 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.
- 8. http://kasanpro.com/ieee/final-year-project-center-madurai-reviews 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. IEEE 2014 NS2 Projects 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 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.