* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Download A Simple and Efficient MAC-Routing Integrated Algorithm for Sensor
Survey
Document related concepts
Asynchronous Transfer Mode wikipedia , lookup
TCP congestion control wikipedia , lookup
IEEE 802.1aq wikipedia , lookup
Recursive InterNetwork Architecture (RINA) wikipedia , lookup
Drift plus penalty wikipedia , lookup
Cracking of wireless networks wikipedia , lookup
Airborne Networking wikipedia , lookup
Wake-on-LAN wikipedia , lookup
Backpressure routing wikipedia , lookup
Deep packet inspection wikipedia , lookup
Transcript
A Simple and Efficient MACRouting Integrated Algorithm for Sensor Network R. Rugin and G. Mazzini University of Ferrara, via Saragat 1, 44100 Ferrara, Italy ICC 2004 Outline • • • • Introduction The Proposed Algorithm Simulations Conclusion Introduction • Sensor networks – Battery limitation • Common problems – Optimizing the whole network battery life • Single unit should be very low power consumption – Messages transmission could be multi-hop • By using intermediate sensors as relay Introduction • GeRaF[5] – Two radios is used – When a node has a packet to send, it listens both the frequencies • Either is active – The node goes in back off • Both are inactive – The node starts the transmission • Disadvantages – It uses two radio channels The proposed algorithm • • • • • Transmitter Receiver Collision Avoidance Scheme Last Hop Routing Algorithm The proposed algorithm • Assumption – The nodes • position are fixed • coordinates are directly linked to their addresses • TX: the node which has a packet to transmit • RX: nodes that are in the condition to work as relay for TX • RN: is the selected relay node • DEST: is always assumed switched on The proposed algorithm Probe packet: Address of Tx and DEST SelectRelay message a Tx DEST Rx RN Alive packet: IP and IE r l I E EMin IP 1 E EMax EMin m Rx b m S r R l D The proposed algorithm NSLOT Slot 1 Slot 2 Slot 3 Slot 4 TX Slot N Probe Sel Rly RN RX Data Alive Alive Transmitting Listening sleep Data Probe The proposed algorithm: last hop Probe Packet: Address of Tx and DESTT X Rx DEST Rx Tx “dummy” Data Probe Probe Data Data Dummy Probe RX DSET Rx Transmitting Listening sleep Simulations • • • • • • • • Simulator is written in C Network size: 400m*400m The whole network traffic: T = NTDATA Data packet: 1000bits packet: 10bits Radio’s bit rate: 19200Kbps With a range: 50m Nslot: 9 Simulations (N = 50) Simulations (N = 50) Simulations (D = 0.1) Simulations (D = 0.1) Simulations (D = 0.1) Conclusion • We address this paper to present a new algorithm – Using a single radio – And a simple delivery mechanism