Trustworthy Coordination of Web Services Atomic Transactions

TRUSTWORTHY COORDINATION OF WEB SERVICES ATOMIC TRANSACTION AIM To protect the core services described in the WS-AT (Web Services Atomic Transactions) specification namely Activation Service, Registration Service ,the Completion Service and the Coordinator Service against Byzantine Fault. INTRODUCTION Driven by the need for business collaboration and integration, more and more applications are being deployed over the Internet using Web Services technology. Many such applications involve distributed transaction processing. To provide interoperability among transactional Web Services, the Web Services Atomic Transactions (WSAT) specification was developed by a consortium of companies (led…

Read More

SPOC A Secure and Privacy-preserving Opportunistic Computing Framework for Mobile-Healthcare Emergency

SPOC A Secure and Privacy-preserving Opportunistic Computing Framework for Mobile-Healthcare Emergency- projects SPOC A Secure and Privacy-preserving Opportunistic Computing Framework for Mobile-Healthcare Emergency- projects Abstract With the pervasiveness of smart phones and the advance of wireless body sensor networks (BSNs), mobile Healthcare (m-Healthcare), which extends the operation of Healthcare provider into a pervasive environment for better health monitoring, has attracted considerable interest recently. However, the flourish of m-Healthcare still faces many challenges including information security and privacy preservation. In this paper, we propose a secure and privacy-preserving opportunistic computing framework,…

Read More

Distributed Packet Buffers for High-Bandwidth Switches and Routers

Distributed Packet Buffers for High-Bandwidth Switches and Routers – projects 2012 High-speed routers rely on well-designed packet buffers that support multiple queues, provide large capacity and short response times. Some researchers suggested combined SRAM/DRAM hierarchical buffer architectures to meet these challenges. However, these architectures suffer from either large SRAM requirement or high time-complexity in the memory management. In this paper, we present scalable, efficient, and novel distributed packet buffer architecture. Two fundamental issues need to be addressed to make this architecture feasible: 1) how to minimize the overhead of an…

Read More

On Optimizing Overlay Topologies for Search in Unstructured Peer-to-Peer Networks

Projects | Projects 2012 | Projects 2011 | Project | Final year Projects | Real Time Projects | Ns2 Projects On Optimizing Overlay Topologies for Search in Unstructured Peer-to-Peer Networks Unstructured peer-to-peer (P2P) file-sharing networks are popular in the mass market. As the peers participating in unstructured networks interconnect randomly, they rely on flooding query messages to discover objects of interest and thus introduce remarkable network traffic. Empirical measurement studies indicate that the peers in P2P networks have similar preferences, and have recently proposed unstructured P2P networks that organize participating…

Read More

Footprint: Detecting Sybil Attacks in Urban Vehicular Networks

Footprint: Detecting Sybil Attacks in Urban Vehicular Networks In urban vehicular networks, where privacy, especially the location privacy of anonymous vehicles is highly concerned, anonymous verification of vehicles is indispensable. Consequently, an attacker who succeeds in forging multiple hostile identifies can easily launch a Sybil attack, gaining a disproportionately large influence. In this paper, we propose a novel Sybil attack detection mechanism, Footprint, using the trajectories of vehicles for identification while still preserving their location privacy. More specifically, when a vehicle approaches a road-side unit (RSU), it actively demands an…

Read More

A Network Coding Equivalent Content Distribution Scheme for Efficient Peer-to-Peer Interactive VoD Streaming

A Network Coding Equivalent Content Distribution Scheme for Efficient Peer-to-Peer Interactive VoD Streaming – projects Although random access operations are desirable for on-demand video streaming in peer-to-peer systems, they are difficult to efficiently achieve due to the asynchronous interactive behaviors of users and the dynamic nature of peers. In this paper, we propose a network coding equivalent content distribution (NCECD) scheme to efficiently handle interactive video-on-demand (VoD) operations in peer-to-peer systems. In NCECD, videos are divided into segments that are then further divided into blocks. These blocks are encoded into…

Read More

the three-tier security scheme in wireless sensor networks with mobile sinks

projects 2012 projects 2012  – the three-tier security scheme in wireless sensor networks with mobile sinks The Three-Tier Security Scheme in Wireless Sensor Networks with Mobile Sinks – projects 2012 Mobile sinks (MSs) are vital in many wireless sensor network (WSN) applications for efficient data accumulation, localized sensor reprogramming, and for distinguishing and revoking compromised sensors. However, in sensor networks that make use of the existing key predistribution schemes for pairwise key establishment and authentication between sensor nodes and mobile sinks, the employment of mobile sinks for data collection elevates…

Read More

Catching Packet Droppers and Modifiers in Wireless Sensor Networks

projects 2012 Catching Packet Droppers and Modifiers in Wireless Sensor Networks- projects 2012 ABSTRACT:Catching Packet Droppers and Modifiers in Wireless Sensor Networks- projects 2012 Packet dropping and modification are common attacks that can be launched by an adversary to disrupt communication in wireless multihop sensor networks. Many schemes have been proposed to mitigate or tolerate such attacks, but very few can effectively and efficiently identify the intruders. To address this problem, we propose a simple yet effective scheme, which can identify misbehaving forwarders that drop or modify packets. Extensive analysis…

Read More

Capacity of Data Collection in Arbitrary Wireless Sensor Networks

projects 2012 Capacity of Data Collection in Arbitrary Wireless Sensor Networks -  projects 2012 Technology Used: Java ABSTRACT:Capacity of Data Collection in Arbitrary Wireless Sensor Networks -  projects 2012 Data collection is a fundamental function provided by wireless sensor networks. How to efficiently collect sensing data from all sensor nodes is critical to the performance of sensor networks. The proposed work aims to understand the theoretical limits of data collection in a TDMA-based sensor network in terms of possible and achievable maximum capacity. Previously, the study of data collection capacity…

Read More

Cut Detection in Wireless Sensor Networks

projects 2012 Cut Detection in Wireless Sensor Networks – projects 2012 ABSTRACT:Cut Detection in Wireless Sensor Networks – projects 2012 A wireless sensor network can get separated into multiple connected components due to the failure of some of its nodes, which is called a “cut.” In this paper, we consider the problem of detecting cuts by the remaining nodes of a wireless sensor network. We propose an algorithm that allows 1) every node to detect when the connectivity to a specially designated node has been lost, and 2) one or…

Read More