A Data Aggregation and Routing Scheme of cobweb model in wireless sensor networks

Author

Jizan, Zhang

Author_Institution

Sch. of Math. & Inf., Ludong Univ., Yantai, China

fYear

2009

fDate

27-29 Oct. 2009

Firstpage

323

Lastpage

327

Abstract

In wireless sensor networks (WSNs), energy of the sensor nodes applied by battery is the important resource. Data aggregation and routing, eliminating data redundancy and reducing traffic to improve the energy efficiency, is essential for WSNs. Hence, cobweb model and data aggregation and routing scheme of cobweb (DARSC) are proposed in this paper. In cobweb model, the network topology is layered and the sink node is in the center, the sensor nodes need maintain the Neighbor_inf about their neighbors. In DARSC, data aggregation stage is used to eliminate data redundancy and data transmission repeatedly, and data transmission stage is used to select reasonable path of data transmission. The results of analysis and experiments show DARSC has outstanding performance in packets delay, dissipated energy and network lifetime.

Keywords

telecommunication network routing; telecommunication network topology; telecommunication traffic; wireless sensor networks; cobweb model; data aggregation; data packets delay; network topology; routing scheme; sensor nodes; sink node; wireless sensor networks; Batteries; Broadcasting; Clustering algorithms; Data communication; Euclidean distance; Greedy algorithms; Routing; Sensor phenomena and characterization; Telecommunication traffic; Wireless sensor networks; Cobweb Model; DARSC; Data aggregation; Routing; Wireless sensor networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Microwave, Antenna, Propagation and EMC Technologies for Wireless Communications, 2009 3rd IEEE International Symposium on

Conference_Location

Beijing

Print_ISBN

978-1-4244-4076-4

Type

conf

DOI

10.1109/MAPE.2009.5355947

Filename

5355947