Energy-Efficient Mobile Data Collection Adopting Node Cooperation in an Underwater Acoustic Sensor Network

This paper considers an underwater acoustic sensor network with one mobile surface node to collect data from multiple underwater nodes,where the mobile destination requests retransmission from each underwater node individually employing traditional automatic-repeat-request(ARQ) protocol.We propose a practical node cooperation(NC) protocol to enhance the collection efficiency,utilizing the fact that underwater nodes can overhear the transmission of others.To reduce the source level of underwater nodes,the underwater data collection area is divided into several sub-zones,and in each sub-zone,the mobile surface node adopting the NC protocol could switch adaptively between selective relay cooperation(SRC) and dynamic network coded cooperation(DNC) .The difference of SRC and DNC lies in whether or not the selected relay node combines the local data and the data overheard from undecoded node(s) to form network coded packets in the retransmission phase.The NC protocol could also be applied across the sub-zones due to the wiretap property.In addition,we investigate the effects of different mobile collection paths,collection area division and cooperative zone design for energy saving.The numerical results showthat the proposed NC protocol can effectively save energy compared with the traditional ARQ scheme.

Physical Layer Deterministic Network Coding Using PUM Turbo Codes over AWGN Channel, N Nodes through a Base Station Scenario

Network Coding (NC) is a recent technique which is used to improve the transmission data rate and the power efficiency. These goals are obtained by combining data together before transmitting them, resulting to less transmitted data that carry the same amount of information. NC research work over the physical layer and the upper layers are popular and needed to be more investigated. In this paper, we propose a practical system of large-number of connected multi-source network coding (LMSNC), at the physical layer that exploits the broadcast nature of the wireless channel, using the practical and bandwidth-efficient schemes decode-and-forward (DF) and then compare it with Amplify and Forward (AF). The theoretical analysis and the simulation results show the effect of the noise when it cumulates in AF system and how DF is solving this severe default. Moreover, we consider the MSNC for Small-number of connected sources (SMSNC) and the two-way communication setup where two users exchange their information over an intermediate network node (ideally called Base Station), as two reference cases to compare with. With SMSNC, the number of necessary downlink transmissions from the intermediate node to the users is reduced, and thus the throughput is increased. Simulation results obtained using high-performance non-binary turbo codes, based on Partial Unit Memory (PUM) codes (4, 2, 1, 4) and (8, 4, 3, 8);confirm that combining PUM Turbo Code (PUMTC) and NC in the proposed MSNC setup gives almost the same BER performance as that for SMSNC at the small number of processing steps mainly when PUMTC (8, 4, 3, 8) is performed, which is required to retrieve the received coded messages. In the scenario of AF, combining packets results to cumulate the noise, which justifies the reason we decided to increase the number of transmitted coded messages in the network, i.e., the BER performance improves when sending extra coded messages. Finally, the possibility for a trade-off among BER, data rate and the number of transmitted coded messages is shown for LMSNC through graphics and simulation results.

Degree-Based Probabilistic Caching in Content-Centric Networking

Content-Centric Networking is a novel future network architecture that attracts increasing research interests in recent years. In-network caching has been regarded as a prominent feature of Content-Centric Networking since it is able to reduce the network traffic, alleviate the server bottleneck and decrease the user access latency. However, the CCN default caching scheme results in a high caching redundancy, causing an urgent need for an efficient caching scheme. To address this issue, we propose a novel implicit cooperative caching scheme to efficiently reduce the caching redundancy and improve the cache resources utilization. The simulation results show that our design achieves a higher hit ratio and a shorter cache hit distance in comparison with the other typical caching schemes.