센서네트워크에서 강인하고 확장 가능한 계층적 라우팅 프로토콜
A Robust Scalable Hierarchical Routing Protocol in sensor networks.
- 주제(키워드) Routing in sensor networks
- 주제(KDC) 569
- 주제(DDC) 621
- 발행기관 아주대학교
- 지도교수 김기형
- 발행년도 2007
- 학위수여년월 2007. 8
- 학위명 석사
- 학과 및 전공 일반대학원 전자공학과
- 본문언어 영어
초록/요약
Sensor networks are resource constrained in terms of battery and other physical resources. Conserving energy is one of the major goals in designing the sensor networks. Studies show that communication costs is one of the major burden on the energy budget of devices comprising the sensor networks. Thus reducing communication overhead would be of great significance in reducing overall energy consumption. Routing protocols determine the routes taken by data in the network, and thus play a key role in determining how energy is utilized in network. In this work we present a new routing protocol, which does not employ any route setup and still performs at a level close to that of traditional routing protocols. It accomplishes this by selecting the next hop node, based on their addresses, which are pre assigned in such a way that they represent the position of the node in the logical network. We analyze the results of our experiments on testbed and discuss the usefulness of the protocol.
more목차
1 Introduction
2 Related Work
2.1 Routing protocols for sensor networks
3 Hierarchical Routing
3.1 Introduction
3.2 Generalized addressing scheme
3.2 Zigbee addressing scheme
3.3 Routing in Hierarchical networks
3.4 6LoWPAN Hierarchical Routing, Hilow
3.4.1 Address Assignment
3.4.2 Routing in 6LoWPAN scheme
3.4.3 Shortcomings
3.4.3.1 Suboptimal path
3.4.3.2 Lack of robustness
4. Modified Hilow, Shortcut algorithm
4.1 Node Tree Distance (NTD)
4.1.1 Calculation of Node Tree Distance
4.2 Shortcut Routing protocol
4.2.1 Working of the algorithm
4.3 Loop freeness
5. Implementation Detail
5.1 Testing Environment
6. Performance Results
6.1 Single transmission
6.2 Two simultaneous transmissions
6.3 Three simultaneous transmissions
6.4 Four simultaneous transmissions
6.5 Observations
6.6 Shortcomings of the algorithm
7. Future Work
8. Analysis
9. Conclusion
10. Appendix
11. References
