| Summary: | 碩士 === 東海大學 === 資訊管理學系 === 100 === With wireless network technology’s advancement, there are a variety of applications in our life. Among that wireless sensor network is the popular research area in recent years. As the wireless sensor network node move at any time and the topology fast change feature, nodes often have void problem. When node transports packet, we can’t predict void problem will occur in when and where. This will produce packet losing, resending, rerouting, additional transmission cost and electric power output. Thus, how to improve wireless network technology’s geographic routing method is important. In this research, we use the find void algorithm to find void. Then we propose a greedy void avoiding algorithm to solve wireless sensor network’s void problem. We use source node and void to draw two tangents form the announce void existence’s fan range, then use source node and target node to draw a line with the fan range’s angle to select next neighbor node for routing. In the rapidly changing dynamic wireless sensor network environment, we expect this research’s greedy void avoiding algorithm that we proposed can be more time-saving and more efficient to forward packet. And improve current wireless sensor network’s geographical void problem.
|
|---|
