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

Author

Niu, Jianwei ; Dai, Bin ; Guo, Jinkai ; Tong, Chao

Author_Institution

Sch. of Comput. Sci. & Eng., Beihang Univ., Beijing, China

fYear

2011

Firstpage

1

Lastpage

6

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.

Keywords

mobile radio; wireless sensor networks; CC; DGCCF; OMSN; ZebraNet; closeness centrality; closeness centrality forwarding algorithm; data gathering; delivery latency; delivery ration; multiple sink nodes; opportunistic mobile sensor networks; store-carry-forward paradigm; wireless sensor networks; Algorithm design and analysis; Delay; Educational institutions; Mobile communication; Mobile computing; Prediction algorithms; Wireless sensor networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communications, Networking and Mobile Computing (WiCOM), 2011 7th International Conference on

Conference_Location

Wuhan

ISSN

2161-9646

Print_ISBN

978-1-4244-6250-6

Type

conf

DOI

10.1109/wicom.2011.6040325

Filename

6040325