Data Query Protocol Based on Minimum Spanning Tree for Wireless Sensor Network

Author

Cui, Yanrong ; Hang Qin

Author_Institution

Sch. of Comput., Yangtze Univ., Jingzhou, China

fYear

2010

fDate

13-15 Dec. 2010

Firstpage

798

Lastpage

801

Abstract

In some applications of WSN, each node can communicate with the base station, if each node communicates with base station directly, there are will a lot of duplication of information and cause waste of nodes´ energy. For this reason, we put forward Data Query Protocol Based on Minimum Spanning Tree (QPMST) , QPMST protocol can create a minimum spanning tree with sink as root and other nodes as descendants, query tasks are transmitted from sink node, query results are sent to sink from leaves nodes, and aggregated in their parents. This protocol reduces the transmission of redundancy data, saves the nodes´ energy, and enhances the lifetime of WSN.

Keywords

protocols; query processing; telecommunication computing; trees (mathematics); wireless sensor networks; base station; data query protocol; leaves nodes; minimum spanning tree; node energy; query tasks; sink node; wireless sensor network; Aggregates; Data models; Integrated circuit modeling; Protocols; Query processing; Sensors; Wireless sensor networks; QPMST; data aggregation; data query;

fLanguage

English

Publisher

ieee

Conference_Titel

Genetic and Evolutionary Computing (ICGEC), 2010 Fourth International Conference on

Conference_Location

Shenzhen

Print_ISBN

978-1-4244-8891-9

Electronic_ISBN

978-0-7695-4281-2

Type

conf

DOI

10.1109/ICGEC.2010.202

Filename

5715552