ECMANSI - Energy Conserving Multicast for Ad- Hoc Networks with Swam Intelligence Chaiporn Jaikaeo Vinay Sridhara Chien-Chung Shen.

Slides:



Advertisements
Similar presentations
Ranveer Chandra Ramasubramanian Venugopalan Ken Birman
Advertisements

Multicasting in Mobile Ad hoc Networks By XIE Jiawei.
Directed Diffusion for Wireless Sensor Networking
Multicasting in Mobile Ad Hoc Networks Ravindra Vaishampayan Department of Computer Science University of California Santa Cruz, CA 95064, U.S.A. Advisor:
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
指導教授:許子衡 教授 報告學生:馬敏修 2010/8/ Introduction 2. Geocast Routing Protocols  2.1 GAMER Overview 3. GAMER Details  3.1 Building the Mesh  3.2 Adaptation.
Network Layer Routing Issues (I). Infrastructure vs. multi-hop Infrastructure networks: Infrastructure networks: ◦ One or several Access-Points (AP) connected.
An Interest-Driven Approach to Integrated Unicast and Multicast Routing in MANETs Rolando Menchaca-Mendez J.J. Garcia-Luna-Aceves 280N Seminar: 4/28/2008.
Rumor Routing Algorithm For sensor Networks David Braginsky, Computer Science Department, UCLA Presented By: Yaohua Zhu CS691 Spring 2003.
Ranveer Chandra , Kenneth P. Birman Department of Computer Science
MANETs Routing Dr. Raad S. Al-Qassas Department of Computer Science PSUT
Multicasting in Mobile Ad-Hoc Networks (MANET)
Scalable Team Multicast in Wireless Ad hoc networks Exploiting Coordinated Motion Mario Gerla University of California, Los Angeles.
An Analysis of the Optimum Node Density for Ad hoc Mobile Networks Elizabeth M. Royer, P. Michael Melliar-Smith and Louise E. Moser Presented by Aki Happonen.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #4 Mobile Ad-Hoc Networks AODV Routing.
Efficient Flooding in Ad hoc Networks using On-demand (Passive) Cluster Formation ICNS Lab Na Gajin.
Exploiting the Unicast Functionality of the On- Demand Multicast Routing Protocol Sung-Ju Lee, William Su, and Mario Gerla
Dissemination protocols for large sensor networks Fan Ye, Haiyun Luo, Songwu Lu and Lixia Zhang Department of Computer Science UCLA Chien Kang Wu.
E-ODMRP: Enhanced ODMRP with Motion Adaptive Refresh Soon Y. Oh, Joon-Sang Park, Mario Gerla Computer Science Dept. UCLA.
Di Wu 03/03/2011 Geographic Routing in Clustered Multi-layer Vehicular Ad Hoc Networks for Load Balancing Purposes.
Milano, 4-5 Ottobre 2004 IS-MANET The Virtual Routing Protocol for Ad Hoc Networks ISTI – CNR S. Chessa.
Anonymous Gossip: Improving Multicast Reliability in Mobile Ad-Hoc Networks Ranveer Chandra (joint work with Venugopalan Ramasubramanian and Ken Birman)
1 A Novel Mechanism for Flooding Based Route Discovery in Ad hoc Networks Jian Li and Prasant Mohapatra Networks Lab, UC Davis.
Swarm Intelligent Networking Martin Roth Cornell University Wednesday, April 23, 2003.
CS401 presentation1 Effective Replica Allocation in Ad Hoc Networks for Improving Data Accessibility Takahiro Hara Presented by Mingsheng Peng (Proc. IEEE.
Ad Hoc Wireless Routing COS 461: Computer Networks
ENHANCING AND EVALUATION OF AD-HOC ROUTING PROTOCOLS IN VANET.
Itrat Rasool Quadri ST ID COE-543 Wireless and Mobile Networks
AD HOC WIRELESS MUTICAST ROUTING. Multicasting in wired networks In wired networks changes in network topology is rare In wired networks changes in network.
1 Spring Semester 2009, Dept. of Computer Science, Technion Internet Networking recitation #3 Mobile Ad-Hoc Networks AODV Routing.
Mobile Adhoc Network: Routing Protocol:AODV
College of Engineering Non-uniform Grid- based Coordinated Routing Priyanka Kadiyala Major Advisor: Dr. Robert Akl Department of Computer Science and Engineering.
Multicast Routing in Mobile Ad Hoc Networks (MANETs)
Wireless Sensor Networks COE 499 Energy Aware Routing
Presented by Chaitanya Nemallapudi Understanding and Exploiting the Trade-Offs between Broadcasting and Multicasting in Mobile Ad Hoc Networks Lap Kong.
Dynamic Source Routing in ad hoc wireless networks Alexander Stojanovic IST Lisabon 1.
ODMRP (On-Demand Multicast Routing Protocol in Multihop Wireless Mobile Networks ) Sung-Ju Lee William Su Mario Gerla Presented By: Meenakshi Bangad.
Routing Protocols for Mobile Ad-Hoc Networks By : Neha Durwas For: Professor U.T. Nguyen COSC 6590.
A Novel Multicast Routing Protocol for Mobile Ad Hoc Networks Zeyad M. Alfawaer, GuiWei Hua, and Noraziah Ahmed American Journal of Applied Sciences 4:
DDR-based Multicast routing Protocol with Dynamic Core (DMPDC) Shiyi WU, Navid Nikaein, Christian BONNET Mobile Communications Department EURECOM Institute,
Energy-Efficient Shortest Path Self-Stabilizing Multicast Protocol for Mobile Ad Hoc Networks Ganesh Sridharan
S Master’s thesis seminar 8th August 2006 QUALITY OF SERVICE AWARE ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Thesis Author: Shan Gong Supervisor:Sven-Gustav.
KAIS T High-throughput multicast routing metrics in wireless mesh networks Sabyasachi Roy, Dimitrios Koutsonikolas, Saumitra Das, and Y. Charlie Hu ICDCS.
Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,
Design of energy-efficient routing protocol in multicast ad-hoc mobile networks using directional antennas J. seetaram, Assoc.prof., Sree chaitanya college.
a/b/g Networks Routing Herbert Rubens Slides taken from UIUC Wireless Networking Group.
CSR: Cooperative Source Routing Using Virtual MISO in Wireless Ad hoc Networks IEEE WCNC 2011 Yang Guan, Yao Xiao, Chien-Chung Shen and Leonard Cimini.
Ad Hoc Multicast Routing
SHORT: Self-Healing and Optimizing Routing Techniques for Mobile Ad Hoc Networks Presenter: Sheng-Shih Wang October 30, 2003 Chao Gui and Prasant Mohapatra.
Self-stabilizing energy-efficient multicast for MANETs.
M ulti m edia c omputing laboratory Biologically Inspired Cooperative Routing for Wireless Mobile Sensor Networks S. S. Iyengar, Hsiao-Chun Wu, N. Balakrishnan,
Ad Hoc On-Demand Distance Vector Routing (AODV) ietf
A Multicast Routing Algorithm Using Movement Prediction for Mobile Ad Hoc Networks Huei-Wen Ferng, Ph.D. Assistant Professor Department of Computer Science.
Using Ant Agents to Combine Reactive and Proactive strategies for Routing in Mobile Ad Hoc Networks Fredrick Ducatelle, Gianni di caro, and Luca Maria.
On Mobile Sink Node for Target Tracking in Wireless Sensor Networks Thanh Hai Trinh and Hee Yong Youn Pervasive Computing and Communications Workshops(PerComW'07)
Peter Pham and Sylvie Perreau, IEEE 2002 Mobile and Wireless Communications Network Multi-Path Routing Protocol with Load Balancing Policy in Mobile Ad.
Nov. 29, 2006GLOBECOM /17 A Location-based Directional Route Discovery (LDRD) Protocol in Mobile Ad-hoc Networks Stephen S. Yau, Wei Gao, and Dazhi.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
A Cluster-based Routing Protocol for Mobile Ad hoc Networks
Author:Zarei.M.;Faez.K. ;Nya.J.M.
Dominik Kaspar, Eunsook Kim, Carles Gomez, Carsten Bormann
Mesh-based Geocast Routing Protocols in an Ad Hoc Network
MZR: A Multicast Protocol based on Zone Routing
Mobicom ‘99 Per Johansson, Tony Larsson, Nicklas Hedman
ODMRP Enhancement.
Net 435: Wireless sensor network (WSN)
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Wireless Ad Hoc Multicast and ODMRP CS 218 Fall 2017
A Routing Protocol for WLAN Mesh
Presentation transcript:

ECMANSI - Energy Conserving Multicast for Ad- Hoc Networks with Swam Intelligence Chaiporn Jaikaeo Vinay Sridhara Chien-Chung Shen

Motivation Swarm Intelligence – Biological Metaphor MANSI – Overview MANSI – Framework Protocol Description ECMANSI – Description ECMANSI – Simulation Scenario ODMRP – Overview ECMANSI – Simulation Results Summary and Future work

More than often Point to Multipoint communication is required Power efficient multicast for MANETs –The mobile nodes are energy constrained –The communication module often accounts for a considerable amount of energy expenditure –Also the topology of the Ad-Hoc networks can be controlled by adjusting the transmission power of each individual node to reduce interference –Controlling the transmission power of node may increase the overall network lifetime MOTIVATION

Motivation Swarm Intelligence – Biological Metaphor MANSI – Overview MANSI – Framework Protocol Description ECMANSI – Description ECMANSI – Simulation Scenario ODMRP – Overview ECMANSI – Simulation Results Summary and Future work

Swarm Intelligence Biological Metaphor Essence of Swarm Intelligence –Positive and negative feedback search good solutions and stabilize the results –Amplification of fluctuation discover new solutions and adapt to changing environment –Multiple interactions Allows collaborations among distributed entities to coordinate and self-organize  A distributed adaptive control system

Ants likely choose paths with higher pheromone intensity Trail gets reinforced (positive feedback) skip Ants lay pheromone Without reinforcement, pheromone evaporates (negative feedback)

skip Most ants follow trail with highest intensity But some may choose alternate paths with small probability (amplification of fluctuation) Pheromone Trail

Motivation Swarm Intelligence – Biological Metaphor MANSI – Overview MANSI – Framework Protocol Description ECMANSI – Description ECMANSI – Simulation Scenario ODMRP – Overview ECMANSI – Simulation Results Summary and Future work

MANSI – Overview Connected subgraph containing all the forwarding nodes are extracted – Forwarding Set Forwarding Set consists of nodes which are shared by all the group members – Group Shared Approach Forwarding Nodes always rebroadcasts the packet regardless of the previous hop node – Mesh Based Approach Forwarding set is constructed only when a node (Source) has data to send – Reactive Approach  MANSI – Multicast for Ad Hoc Networks with Swarm Intelligence m1m1 m2m2 m3m3 skip

MANSI – Overview Each member establishes connectivity to a designed member which serves as the focal point. Multicast connectivity is more efficient when group members share existing forwarding nodes Forwarding set of 6 nodes m1m1 m3m3 m2m2 Forwarding set of 4 nodes m1m1 m3m3 m2m2

Motivation Swarm Intelligence – Biological Metaphor MANSI – Overview MANSI – Framework Protocol Description ECMANSI – Description ECMANSI – Simulation Scenario ODMRP – Overview ECMANSI – Simulation Results Summary and Future work

MANSI-Framework Protocol Operations  Three step process Source Node Neighbor Discovery –A node which has data to send becomes CORE node and broadcasts a JOIN_REQUEST –All the nodes that receive the JOIN_REQUEST rebroadcast the request and the one hop neighbor information is discovered skip

MANSI-Framework Protocol Operations Forwarding Set Initialization –A forwarding set is rapidly constructed on-demand –Non-duplicate announcement is rebroadcast by all nodes –Other members request to join the group via the reverse paths –Requested nodes become forwarding nodes and form the forwarding set Core Core floods announcement Members reply via reverse paths Initial Forwarding set has formed skip

MANSI-Framework Protocol Operations Forwarding Set Evolution –Forward Ants (packets) are deployed by members to opportunistically learn new connectivity that yields lower cost –A Forward Ant turns into a Backward Ant when it encounters another existing path and returns to its originator Core Cost = 3 Cost = 2 Ants follow current best paths and update costs Core Ants opportunistically discover other paths Cost = 2Cost = 1 Total cost = 5Total cost = 4 skip

MANSI-Framework Protocol Operations Pheromone Updating –The Backward Ant deposits pheromone on its return trip to the sender –The Amount of Pheromone deposited is inversely proportional to the cost of the trip. Shorter the trip  Higher the pheromone deposition skip Core Cost = 0 Cost = 1 Cost = 2 m2m2 m1m1 turn into Backward Ant B C A D E

Motivation Swarm Intelligence – Biological Metaphor MANSI – Overview MANSI – Framework Protocol Description ECMANSI – Description ECMANSI – Simulation Scenario ODMRP – Overview ECMANSI – Simulation Results Summary and Future work

Energy Conserving MANSI Assumptions –Nodes are capable of adjusting their transmission power levels (0, P max ) –Ant packets and Hello packets are always transmitted at full power Objective –Reduce total energy consumed per multicast packet –The cost of a node becoming a forwarding node is the transmission power level required by the node to transmit the multicast packet

30 mW 20 mW 2 mW 4 mW 8 mW Total of - 2 transmissions - 50 mW Total of - 2 transmissions - 50 mW Total of - 5 transmissions - 18 mW Total of - 5 transmissions - 18 mW Energy Conserving MANSI Number of transmission VS total power consumption

Energy Conserving MANSI Required Transmission Power Generic Propagation Formula Required Sensitivity Required Transmission power Calculated by transmitting HELLO packet at full power

Energy Conserving MANSI Required Transmission Power Calculated by transmitting HELLO packet at full power For data packets, a forwarding node i computes its transmission power level as follows: where Di is a set of nodes who request and are requested by i to be a forwarding node i i ’s communication range when broadcasting data packets

Cost of a node can increase when a farther node choose the current node as a forwarder Energy Conserving MANSI Join Request Path

ECMANSI – MANSI (Comparative illustration) Energy Conserving MANSI MANSI EC-MANSI

Forwarding cost over time Energy Conserving MANSI

With mobility, multicast connectivity becomes fragile (EC)MANSI with mobility-adaptive mechanism –Each node keeps track of link failure frequency which indicates stability of its surrounding area. –When link failure frequency is higher than the threshold, a forwarding/member node picks two forwarding nodes with highest pheromone intensities, instead of one Energy Conserving MANSI Without mobility-adaptiveWith mobility-adaptive – more robust group connectivity Adaptability to mobility

Motivation Swarm Intelligence – Biological Metaphor MANSI – Overview MANSI – Framework Protocol Description ECMANSI – Description ECMANSI – Simulation Scenario ODMRP – Overview ECMANSI – Simulation Results Summary and Future work

Energy Conserving MANSI Terrain dimension1000×1000 m 2 # Nodes Communication range250 m Mobility speed0-10 m/s # Members10 # Senders1-8 Application Traffic CBR (4  512B/s from each sender) Ten random networks on QualNet simulator Multicast sessions running for 30 minutes Network parameters Simulation Scenario

Motivation Swarm Intelligence – Biological Metaphor MANSI – Overview MANSI – Framework Protocol Description ECMANSI – Description ECMANSI – Simulation Scenario ODMRP – Overview ECMANSI – Simulation Results Summary and Future work

ODMRP Overview On Demand Multicast Routing Protocol (Lee, Su, Gerla – UCLA) Each sender floods JOIN-DATA (data+query) to find members on-demand Members propagate JOIN-REPLY back to the sender, resulting in mesh creation As long as a sender still has data to send, it periodically floods JOIN-DATA to refresh the mesh Flooding by every sender causes a scalability problem in large networks, especially with many senders

ODMRP Overview F A B E D G H I SenderNextHop HC SenderNextHop HD SenderNextHop HH C skip

Motivation Swarm Intelligence – Biological Metaphor MANSI – Overview MANSI – Framework Protocol Description ECMANSI – Description ECMANSI – Simulation Scenario ODMRP – Overview ECMANSI – Simulation Results Summary and Future work

Energy Conserving MANSI Simulation Results Network Size Number of Sources Mobility Packet Delivery Ratio

Energy consumed per multicast Packet Energy Conserving MANSI Simulation Results Network Size Number of Sources Mobility

Energy Conserving MANSI Simulation Results Control Packet Overhead Network Size Number of Sources Mobility

Motivation Swarm Intelligence – Biological Metaphor MANSI – Overview MANSI – Framework Protocol Description ECMANSI – Description ECMANSI – Simulation Scenario ODMRP – Overview ECMANSI – Simulation Results Summary and Future work

An Energy Conserving Multicast protocol – ECMANSI is proposed By adopting the Swarm Intelligence metaphor, forwarding nodes are chosen and their transmission power levels are adjusted dynamically Simulation experiments show that energy consumption can be reduced drastically Future Work –Incorporate changing of reception power into pheromone table maintenance, to deal with mobility more appropriately –Having an extra cost field for each node – amounting to remaining battery power

Questions

Thank You !!!