Opportunistic Source Coding for Data Gathering in Wireless Sensor Networks

We propose a jointly opportunistic source coding and opportunistic routing (OSCOR) protocol for correlated data gathering in wireless sensor networks. OSCOR improves data gathering efficiency by exploiting opportunistic data compression and cooperative diversity associated with wireless broadcast advantage. The design of OSCOR involves several challenging issues across different network protocol layers. At the MAC layer, sensor nodes need to coordinate wireless transmission and packet forwarding to exploit multiuser diversity in packet reception. At the network layer, in order to achieve high diversity and compression gains, routing must be based on a metric that is dependent on not only link-quality but also compression opportunities. At the application layer, sensor nodes need a distributed source coding algorithm that has low coordination overhead and does not require the source distributions to be known. OSCOR provides practical solutions to these challenges incorporating a slightly modified 802.11 MAC, a distributed source coding scheme based on network coding and Lempel-Ziv coding, and a node compression ratio dependent metric combined with a modified Dijkstra's algorithm for path selection. We evaluate the performance of OSCOR through simulations, and show that OSCOR can potentially reduce power consumption by over 30% compared with an existing greedy scheme, routing driven compression, in a 4 x 4 grid network

Opportunistic source coding for data gathering in wireless sensor networks

We propose a jointly opportunistic source coding and oppor tunistic routing (OSCOR) protocol for correlated data gathering in wireless sensor networks. OSCOR improves data gathering efficiency by exploiting opportunistic data compression and multi-user diversity on wireless broadcast. OSCOR attacks challenges across network protocol layers by incorporating a slightly modified 802.11 MAC, a distributed source coding scheme based on Lempel-Ziv code and network coding, and a node compression ratio dependent metric combined with a modified Dijkstra's algorithm for path selection. We simulate OSCOR's performance and show it reduces the number of transmissions by nearly 25% compared with other schemes in small networks

Opportunistic source coding for data gathering in wireless sensor networks

We propose a jointly opportunistic source coding and oppor tunistic routing (OSCOR) protocol for correlated data gathering in wireless sensor networks. OSCOR improves data gathering efficiency by exploiting opportunistic data compression and multi-user diversity on wireless broadcast. OSCOR attacks challenges across network protocol layers by incorporating a slightly modified 802.11 MAC, a distributed source coding scheme based on Lempel-Ziv code and network coding, and a node compression ratio dependent metric combined with a modified Dijkstra's algorithm for path selection. We simulate OSCOR's performance and show it reduces the number of transmissions by nearly 25% compared with other schemes in small networks

Connectivity, Coverage and Placement in Wireless Sensor Networks

Wireless communication between sensors allows the formation of flexible sensor networks, which can be deployed rapidly over wide or inaccessible areas. However, the need to gather data from all sensors in the network imposes constraints on the distances between sensors. This survey describes the state of the art in techniques for determining the minimum density and optimal locations of relay nodes and ordinary sensors to ensure connectivity, subject to various degrees of uncertainty in the locations of the nodes

1 Opportunistic Source Coding for Data Gathering in Wireless Sensor Networks

Abstract — We propose a jointly opportunistic source coding and opportunistic routing (OSCOR) protocol for correlated data gathering in wireless sensor networks. OSCOR improves data gathering efficiency by exploiting opportunistic data compression and cooperative diversity associated with wireless broadcast advantage. The design of OSCOR involves several challenging issues across different network protocol layers. At MAC layer, sensor nodes need to coordinate wireless transmission and packet forwarding to exploit multiuser diversity in packet reception. At network layer, in order to achieve high diversity and compression gains, routing must be based on a metric that is dependent on not only link-quality but also compression opportunities. At application layer, sensor nodes need a distributed source coding algorithm that has low coordination overhead and does not require the source distributions to be known. OSCOR provides practical solutions to these challenges incorporating a slightly modified 802.11 MAC, a distributed source coding scheme based on Lempel-Ziv code and network coding, and a node compression ratio dependent metric combined with a modified Dijkstra’s algorithm for path selection. We evaluate the performance of OSCOR through simulations, and show that OSCOR reduces the number of transmissions by nearly 25% compared with existing greedy scheme in small networks. We expect a large gain in large networks. I