DGCCF: Data Gathering Based on Closeness Centrality Forwarding in Opportunistic Mobile Sensor Networks

Abstract

Opportunistic Mobile Sensor Networks (OMSN) can be applied in many scenarios where the sensor data usually need to be transmitted from the source node to one of the multiple sink nodes. We propose the DGCCF (Data Gathering based on Closeness Centrality Forwarding) algorithm, which adopts "store-carry-forward" paradigm to transmit data from sensors to the sink nodes. In DGCCF, each sensor node keeps the Closeness Centrality (CC) to all sink nodes based on encounter history between the node and all the sink nodes. When two nodes encounter, the node with the lower CC value forwards its messages to the other nodes, until the messages are delivered to one of the sink nodes. Experimental results reveal that DGCCF can provide better performance on both the delivery ration and delivery latency than ZebraNet and the Random Forwarding algorithm.

6 Figures and Tables

Cite this paper

@article{Niu2011DGCCFDG, title={DGCCF: Data Gathering Based on Closeness Centrality Forwarding in Opportunistic Mobile Sensor Networks}, author={Jianwei Niu and Bin Dai and Jinkai Guo and Chao Tong}, journal={2011 7th International Conference on Wireless Communications, Networking and Mobile Computing}, year={2011}, pages={1-6} }