Distributed Hashing Table- based Routing Algorithm in Wireless Sensor Networks

Transcription

1 Winter CS99 Distributed Hashing Table- based Routing Algorithm in Wireless Sensor Networks Yurong Xu Prof. Fillia S. Makedon DevLab

2 Content 1. Introduction of WSN( 2. WSN Architecture 3. Challenges in WSN Our Term Project WSN(WirelessWireless Sensor Networks) 4.What is DHT 5. What you should do in the project?

3 What is WSN? A Wireless Sensor Networks: is a tiny smart node collection based on 1. Sensor Technology 2. Computation Technology 3. Wireless Technology

4 Generations of WSN 1. Passive WSN (RFID) 2. Active WSN (mote) 3. Mobile WSN (future) Berkeley mote Micro-Bug as a node of WSN (Future) Hitachi RFID chip

5 What can WSN do? Military :Like Smart Dust Industry :Control Automation Human Life :Smart Home (Oxygen MIT) &Health Monitor for the elder Commerce : RFID

6 Content 1. Introduction of WSN( 2. WSN Architecture WSN(WirelessWireless Sensor Networks)

7 How does WSN do them? Tiny digital sensors Very inexpensive and can be integrated into silicon. Wireless Communication Component Low power inexpensive RF Computation Component Fast and cheap CPU & large memory(flash)

8 A WSN Sensor Node (EE( part) A WSN sensor node has hardware: Sensing Physical Magnetic, Light, Sound Chemical CO, Chemical Weapons Biological Bacteria, Viruses, Proteins Wireless Wireless Communication like Bluetooth, ZigBee, WiFi CPU & Memory Fast embedded CPU Memory Analog/Digit Converter Power Supply Automatic power Solar, Vibration battery, RF Inductance Battery power Battery power,

9 A WSN Sensor Node (CS( part) A WSN sensor node has software: OS Resource Management Task Dispatching Networks PHY: guarantee the reliability of communication MAC: maintain the Network Include the routing algorithm etc Applications How to get useful data from WSN & use it.

10 Content 1. Introduction of WSN (Wireless( Sensor Networks) 2. WSN Architecture 3. Challenges in WSN

11 Challenges of WSN Protocol and algorithm design efficiently communication in especially in a large deployment System design Embedded design Human Implantable design Security and privacy How to keep data secure How to keep data private

12 Content 1. Introduction of WSN( 2. WSN Architecture 3. Challenges in WSN Our Term Project WSN(WirelessWireless Sensor Networks)

13 CS99 Term Project Description Simulation on an Efficient Routing Algorithm in Wireless Sensor Network (WSN) We will focus on how to implement and simulate an efficient routing algorithm which can be used in a power- constrain wireless sensor network. In one word, want to find a route to remote node. Why it is problem?

14 WSN Structures Structures of WSN: 2 Structures: Centralized star (small scale) tree Decentralized Structure mesh (our WSN) *pink node is a base station

15 Routing in Centralized WSN Centralized Routing (pro +, con -) route route B S D data +Simple - a single point of failure - impossible to store HUGE route table in a node with limited resource

16 Routing in Decentralized WSN Decentralized Routing (pro +, con -) Example: Flooding Routing +Robust +Need no routing table - average hops will be O(N), power-consuming D S

17 Our Solution Decentralized Hash Table based (because O(1) in single node) Distributed Hash Table-based Routing Algorithm

18 Content 1. Introduction of WSN( 2. WSN Architecture 3. Challenges in WSN Our Term Project 4.What is DHT WSN(WirelessWireless Sensor Networks)

19 What is Hashing Table A content-indexed table While traditional table is address-indexed Example: Lookup ( key (apple), table) = lookup ( app,, table) hash table traditional table Key app ora ban data apple orange banana address data apple orange banana

20 What is Distributed Hashing Table (DHT) Separate a whole table to lots small tables Every node store one DHT routing algorithm using DHT to store the routing information

21 More detail in DHT routing algorithm A n-table space node network # node node * * * N/A * Routing table for 3 rd node

22 What is DHT-cont. Chord ring #+16 #+32 N# #+1 #+2 #+4 (#+4) mod 2 m Dest. #+8 #+4 #+2 #+1 #

23 Limited physical range of Hops N5.lookup(k19) N5 N Dest N99 N110 N10 N20 N32 K33 K N80 N33 K N60

24 Content 1. Introduction of WSN( 2. WSN Architecture 3. Challenges in WSN Our Term Project WSN(WirelessWireless Sensor Networks) 4.What is DHT 5. What you should do in the project?

25 What you should do in project Read the paper in reference Understand DHT routing algorithm Implement it in Java or C Think about this problem

26 Multi-hot Problem in WSN for DHT DHT Assumption One hop connection: In one network, you can easily connect with remote nodes in one hop connection. WSN: Multi-hop connection: 1 0 Connect with remote nodes in multi-hop connection because of limited physical range of wireless signal

27 What you should do in project Read the paper in reference Understand DHT routing algorithm Implement it in 20-nodes networks Think about this problem How to improve the algorithm for this problem in 20-nodes simulation network Write report / presentation

28 Reference [1]I. Akyildiz et al., A A Survey on Sensor Networks,, IEEE Commun. Mag., vol. 40, no. 8, Aug. 2002, pp [2]Ahmed, A.A.; Shi, H.; Shang,, Y., A A survey on network protocols for wireless sensor networks, Proceedings of International Conference on Information Technology on Research and Education, ITRE2003, Aug. 2003, pp [3]Vieira, M.A.M.; Coelho, C.N., Jr.; da Silva, D.C., Jr.; da Mata, J.M., Survey on wireless sensor network devices,, Proceedings of IEEE conference on Emerging Technologies and Factory Automation, 2003 (ETFA '03), Sept. 2003, pp.: vol.1. [4]Al-Karaki, J.N.; Kamal,, A.E., Routing techniques in wireless sensor networks: a survey,ieee Wireless Communications, Dec. 2004, Pages:6 28,Vol.11. [5]Vincent D. Park, M. Scott Corson, A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks, Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution, p.1405, April 09-11, [6]Sylvia Ratnasamy,, Brad Karp, Scott Shenker,, Deborah Estrin, Ramesh Govindan,, Li Yin, and Fang Yu. Data-centric storage in sensornets with GHT, a geographic hash table. Mob. Netw. Appl., 8(4): , [7]Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan,, Chord: A scalable peer-to-peer lookup service for internet applications, Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, p , August 2001, San Diego, California, United States [8]G. Manku,, M. Bawa,, and P. Raghavan.. Symphony: distributed hashing in a small world. In 4th USENIX Symp.. on Internet Technologies and Systems, pages ,

29 Thank you