Compressed-Sensing-Enabled Video Streaming for Wireless Multimedia Sensor Networks

projects 2012 Compressed-Sensing-Enabled Video Streaming for Wireless Multimedia Sensor Networks This article presents the design of a networked system for joint compression, rate control and error correction of video over resource-constrained embedded devices based on the theory of compressed sensing. The objective of this work is to design a cross-layer system that jointly controls the video encoding rate, the transmission rate, and the channel coding rate to maximize the received video quality. First, compressed sensing based video encoding for transmission over wireless multimedia sensor networks (WMSNs) is studied. It is…

Read More

Hop-by-Hop Routing in Wireless Mesh Networks with Bandwidth Guarantees

projects 2012 Hop-by-Hop Routing in Wireless Mesh Networks with Bandwidth Guarantees Wireless Mesh Network (WMN) has become an important edge network to provide Internet access to remote areas and wireless connections in a metropolitan scale. In this paper, we study the problem of identifying the maximum available bandwidth path, a fundamental issue in supporting quality-of-service in WMNs. Due to interference among links, bandwidth, a well-known bottleneck metric in wired networks, is neither concave nor additive in wireless networks. We propose a new path weight which captures the available path bandwidth…

Read More

Handling Selfishness in Replica Allocation over a Mobile Ad Hoc Network

projects 2012 Handling Selfishness in Replica Allocation over a Mobile Ad Hoc Network– Mobile Computing, projects 2012 Abstract:Handling Selfishness in Replica Allocation over a Mobile Ad Hoc Network In a mobile ad hoc network, the mobility and resource constraints of mobile nodes may lead to network partitioning or performance degradation. Several data replication techniques have been proposed to minimize performance degradation. Most of them assume that all mobile nodes collaborate fully in terms of sharing their memory space. In reality, however, some nodes may selfishly decide only to cooperate partially,…

Read More

Toward Reliable Data Delivery for Highly Dynamic Mobile Ad Hoc Networks

projects 2012 Toward Reliable Data Delivery for Highly Dynamic Mobile Ad Hoc Networks- Mobile Computing, projects 2012 Abstract:Toward Reliable Data Delivery for Highly Dynamic Mobile Ad Hoc Networks This paper addresses the problem of delivering data packets for highly dynamic mobile ad hoc networks in a reliable and timely manner. Most existing ad hoc routing protocols are susceptible to node mobility, especially for large-scale networks. Driven by this issue, we propose an efficient Position-based Opportunistic Routing (POR) protocol which takes advantage of the stateless property of geographic routing and the…

Read More

Fast Data Collection in Tree-Based Wireless Sensor Networks

projects 2012 Fast Data Collection in Tree-Based Wireless Sensor Networks– Mobile Computing, projects 2012 Abstract:Fast Data Collection in Tree-Based Wireless Sensor Networks We investigate the following fundamental question – how fast can information be collected from a wireless sensor network organized as tree? To address this, we explore and evaluate a number of different techniques using realistic simulation models under the many-to-one communication paradigm known as convergecast. We first consider time scheduling on a single frequency channel with the aim of minimizing the number of time slots required (schedule length)…

Read More

Energy-Efficient Cooperative Video Distribution with Statistical QoS Provisions over Wireless Networks

projects 2012 Energy-Efficient Cooperative Video Distribution with Statistical QoS Provisions over Wireless Networks – projects 2012 Abstract:Energy-Efficient Cooperative Video Distribution with Statistical QoS Provisions over Wireless Networks- projects 2012 Technology Used: Java AIM Minimizing energy consumption in battery-operated mobile devices is essential for the development of next generation heterogeneous wireless communications systems. In this work, we develop optimized flow selection and resource allocation schemes that can provide end-to-end statistical delay bounds and minimized energy consumption for video distribution over cooperative wireless networks. ABSTRACT For real-time video broadcast where multiple users…

Read More

Generalized Probabilistic Flooding In Unstructured Peer-To-Peer Networks

Generalized Probabilistic Flooding In Unstructured Peer-To-Peer Networks

Generalized Probabilistic Flooding In Unstructured Peer-To-Peer Networks Technology Used: Java 2011 Generalization of the basic flooding search strategy for decentralized unstructured peer-to-peer (P2P) networks is done. A peer forwards a query to one of its neighbors using a probability that is a function of the number of connections in the overlay network of both. Moreover, this probability may also depend on the distance from the query originator. To analyze the performance of the proposed search strategy in heterogeneous decentralized unstructured P2P networks we develop a generalized random graph (GRG) based…

Read More

On Efficient And Scalable Support Of Continuous Queries In Mobile Peer-To-Peer Environments

On Efficient And Scalable Support Of Continuous Queries In Mobile Peer-To-Peer Environments Technology Used: Java 2011 An efficient and scalable query processing framework for continuous spatial queries in mobile peer-to-peer (P2P) environment is proposed. Due to the limitations in mobile P2P environments, for example, user mobility, limited battery power, limited communication range, and scarce communication bandwidth, it is costly to maintain the exact answer of continuous spatial queries. This work enables user to find an approximate answer with quality guarantees. Two key features to adapt continuous spatial query processing to…

Read More

Dynamic Conflict-Free Transmission Scheduling for Sensor Network Queries

Dynamic Conflict-Free Transmission Scheduling for Sensor Network Queries

Technology Used: Java 2011 Download Projects 2011 Basepaper ABSTRACT With the emergence of high data rate sensor network applications, there is an increasing demand for high-performance query services. To meet this challenge, we propose Dynamic Conflict-free Query Scheduling (DCQS), a novel scheduling technique for queries in wireless sensor networks. In contrast to earlier TDMA protocols designed for general-purpose workloads, DCQS is specifically designed for query services in wireless sensor networks. DCQS has several unique features. First, it optimizes the query performance through conflict-free transmission scheduling based on the temporal properties…

Read More

Fast Detection of Mobile Replica Node Attacks in Wireless Sensor Networks Using Sequential Hypothesis Testing

Fast Detection of Mobile Replica Node Attacks in Wireless Sensor Networks Using Sequential Hypothesis Testing

Technology Used: Java 2011 Download Projects 2011 Basepaper ABSTRACT Due to the unattended nature of wireless sensor networks, an adversary can capture and compromise sensor nodes, make replicas of them, and then mount a variety of attacks with these replicas. These replica node attacks are dangerous because they allow the attacker to leverage the compromise of a few nodes to exert control over much of the network. Several replica node detection schemes have been proposed in the literature to defend against such attacks in static sensor networks. However, these schemes…

Read More