A Service Discovery Architecture for IP-based Wireless Sensor Networks
- 주제(키워드) IP-based Wirelss Sensor Networks , Service Discovery , Directory Proxy
- 발행기관 아주대학교 일반대학원
- 지도교수 Kim, Ki-Hyung
- 발행년도 2008
- 학위수여년월 2008. 2
- 학위명 박사
- 학과 및 전공 일반대학원 전자공학과
- 본문언어 영어
초록/요약
The IEEE 802.15.4 standard for Low Power Wireless Personal Area Networks (LoWPANs) has emerged as a promising technology to bring envisioned ubiquitous paragon, into realization. Considerable efforts are being carried on to integrate LoWPANs with other wired and wireless IP networks, in order to make use of pervasive nature and existing infrastructure associated with IP technologies. Provisioning of service discovery and network selection in such pervasive environments puts heavy communication and processing overhead in networks with highly constrained resources. Localization of communication, through accessing the closest services reduces the service discovery overhead traffic, and increases the total network capacity and network life. We present a hierarchical service discovery architecture based on SSLP, in which we propose directory proxy agents to act as cache service for directory agent, in order to localize the service discovery communication and access the closest services. We also propose algorithms to make sure that service users are connected to the closest proxy agent in order to access the closest service in the vicinity. The results show that our architecture and algorithms help finding the closest services, reduce the traffic overhead for service discovery, decrease the service discovery time, and save nodes’ energy considerably in 6LoWPANs
more목차
1 Introduction = 1
1.1 Motivation = 1
1.2 Thesis Focus and Contribution = 4
1.3 Thesis Organization = 7
1.4 Related Publications = 10
2 IP over LoWPAN (6LoWPAN) = 11
2.1 IEEE Standard 802.15.4 LoWPAN = 11
2.2 IPv6 over LoWPAN (6LoWPAN) = 15
3 Service Discovery Solution Architecture: Requirements for 6LoWPAN = 24
3.1 Operational Framework of Service Discovery Architectures = 24
3.2 Service Discovery Architectures = 26
3.2.1 Directory-based Architectures = 26
3.2.2 Non Directory-based Architectures = 28
3.2.3 Hybrid Architectures = 29
3.3 Service Discovery Requirements for 6LoWPAN = 30
3.3.1 Service Discovery Model for 6LoWPAN = 32
3.3.2 Interoperability issues = 33
3.3.3 Scalability issues = 38
3.3.4 Unpredictability issues = 38
3.3.5 Context-awareness issues = 39
3.4 Summary = 40
4 Related Work = 41
4.1 Traditional Service Discovery Protocols = 42
4.1.1 Jini = 42
4.1.2 Salutation = 45
4.1.3 Bluetooth = 47
4.1.4 Universal Plug and Play UPnP = 49
4.1.5 Service Location Protocol = 50
4.2 Some Modern Service Discovery Proposals = 53
4.2.1 DEAPspace = 53
4.2.2 Rendezvous = 54
4.2.3 Konark = 54
4.2.4 Other Architectures = 55
4.3 Service Discovery in Sensor Networks = 55
4.3.1 Service Discovery in Zigbee = 57
4.4 Service Discovery in 6LoWPAN = 59
4.4.1 Simple Service Location Protocol = 59
4.5 Summary = 63
5 Proxy-based Service discovery = 64
5.1 Terminology = 66
5.2 Proxy-based Service Discovery Protocol (PSDP) = 67
5.3 Service Discovery Principles for PSDP = 71
5.4 Protocol Overview = 72
5.5 Directory Proxy Agent (DPA) = 73
5.5.1 Interaction with UA = 74
5.5.2 Interaction with SA = 78
5.5.3 Interaction with Peer DPAs = 81
5.5.4 Interaction with Directory Server = 82
5.5.5 Maintenance of Information Tables = 82
5.5.6 Directory maintenance = 82
5.6 Neighbor assisted DPA discovery protocol = 83
5.7 Finding the closest service = 86
5.8 Placing DPAs Optimally = 89
5.9 Cache Cooperation = 91
6 Interworking with Service Location Protocol = 93
6.1 The Translation Agent (TA) = 96
6.1.1 SLP Message Manager = 97
6.1.2 Proxy-based Message Manager = 98
6.1.3 Shared Tables and Rule Set = 99
7 Performance Evaluation = 100
7.1 Theoretical Analysis = 102
7.1.1 Service Discovery Overhead = 102
7.1.2 Service Discovery Latency = 104
7.2 Simulation Results = 106
7.2.1 Service Discovery Time = 107
7.2.2 Number of Generated Control Packets = 109
7.2.3 Energy Consumption = 111
7.2.4 Proximity-based Service Access = 113
7.2.5 Effect of Cache Cooperation = 114
7.3 Summary = 115
8 Conclusion = 117

