| Summary: | 博士 === 淡江大學 === 資訊工程學系博士班 === 94 === The wireless sensor networks (WSNs), a network comprising the huge number of sensor nodes, allow users to monitor a remote environment accurately by combining the data intelligently from the individual nodes. These networks require robust wireless communication protocols that are energy-efficient and provide lower latency. Therefore, in order to prolong the lifetime of the sensor nodes, designing efficient routing protocols is critical. Several approaches, including direct communication, flat, and clustering protocols, have been proposed to transmit data in randomly deployed sensor nodes.
In this thesis, we present a Hierarchical Multiple-Choice Routing Path Protocol (HMRP), a routing protocol for collecting data over multi-path, energy-balancing, and data aggregation to achieve good performance in terms of system lifetime and data delivery ratio. The design of the protocol aims to satisfy the requirements of sensor networks that every sensor transmits sensed data to the sink spontaneously. The sink constructs hierarchical tree by broadcasting its hop value to find the child nodes. Other nodes discover the child nodes in turn by the same way. The HMRP uses Candidates Information Table to avoid flooding and periodic updating of routing information. Moreover, the tree will automatically reconfigure according to nodes failure or adding the new nodes. The simulation results show that HMRP can increase the system lifetime and data delivery ratio by comparing with other general-purpose multi-hop clustering or tree-based approaches.
|
|---|
