Font Size: a A A

Energy-balanced Data Gathering Protocol For Mobile Wireless Sensor Networks

Posted on:2010-10-18Degree:MasterType:Thesis
Country:ChinaCandidate:G Y SuFull Text:PDF
GTID:2178360278470232Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
The main function of wireless sensor networks is sensing surrounding environment, gathering and processing related data. The size of a sensor node is small and usually carries very limited energy. Due to the number of sensor nodes, low cost, wide distribution and complex environment of deployment which may not be reached, it is impossible that energy of nodes is recharged. It is a severe challenge of wireless sensor networks that maximize the lifetime of the networks by means of efficient usage of energy. Therefore, the energy is a primary factor for data collection protocol in wireless sensor networks. At the same time, the protocol should be able to collect event data so that applications can get more feedback from some incidents to avoid invalid data due to delay in some real-time applicationsIn this thesis, these issues in wireless sensor networks for data collection protocol have been investigated. The main task is to look in the wireless sensor networks using mobile Sink (MS) for energy balanced data collection. We also propose a novel energy-efficient data gathering algorithm, which is based on the greedy algorithm. The protocol uses the mobile Sink (MS) to collect data, and divides the monitoring area into grid structure. Every grid has a cluster-head node. The cluster-head node will generate a data-transfer-tree, and the MS lies near to the root node and receive the data instead of the root node. The data does not need to be buffered in the transfer node, but is transmitted along the transfer tree to the MS nearby the root node. It could avoid the problem of the storage capacity shortage and the data delay caused by data buffer. When a data flow from an adjacent cluster-head of the root exceeds the sum of the other adjacent cluster-heads data flow, the MS will move to this cluster-head and make this cluster-head node the new root node of the tree by side reverse at the same time. Since the MS always moves to the neighbor with the largest data flow, it will shorten the transmission path of large data flow and tend the energy consumption of the sensor node. When the network flow trends to relative balance, the MS will move to the adjacent area with the least energy to reduce the energy consumption of this area and balance the energy in the network. The simulation results demonstrate that our protocol of data collection based on greedy strategy prolongs the lifetime of the networks obviously.
Keywords/Search Tags:Wireless Sensor Networks, Data Gathering, Mobile Sink, Cluster, Forwarding-Tree
PDF Full Text Request
Related items