Progress Report Green Network Project Haluk Celebi Manu Dhundi Nourah Alhassoun Sushant Bhardwaj Yasser Mohammed.

Slides:



Advertisements
Similar presentations
Fundamental Relationship between Node Density and Delay in Wireless Ad Hoc Networks with Unreliable Links Shizhen Zhao, Luoyi Fu, Xinbing Wang Department.
Advertisements

Green Network Project Contract
Capacity of wireless ad-hoc networks By Kumar Manvendra October 31,2002.
Opportunistic Scheduling Algorithms for Wireless Networks
Base Station Operation and User Association Mechanisms For Energy- Delay Tradeoffs in Green Cellular Networks by Kyuho Son, Hongseok Kim, Yung Yi, Bhaskar.
Designing An g Ad-hoc Network for Multimedia Communication Chung-Wei Lee & Jonathan C.L. Liu Presented By: Mahendra Kumar.
Tufts Wireless Laboratory Tufts University School Of Engineering Energy-Efficient Structuralized Clustering for Sensor-based Cyber Physical Systems Jierui.
1 Channel Assignment Strategies Handoff (Handover) Process Handoff: Changing physical radio channels of network connections involved in a call,
Cell Design to Maximize Capacity in CDMA Networks Robert Akl, D.Sc.
Md. Manzoor MurshedAdaptive RED with Dynamic Threshold Adjustment CprE599: Creative Component Adaptive RED with Dynamic Threshold Adjustment.
1 Channel Capacity Issues For Mobile Teams Ameesh Pandya and Greg Pottie, UCLA Electrical Engineering Department.
Doc.: IEEE /0025r0 Submission Jan 2015 Dynamic Sensitivity Control Roaming Date: 2015-January Authors: Graham Smith, SR TechnologiesSlide 1.
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.
Differentiated Surveillance for Sensor Networks Ting Yan, Tian He, John A. Stankovic CS294-1 Jonathan Hui November 20, 2003.
802.11n MAC layer simulation Submitted by: Niv Tokman Aya Mire Oren Gur-Arie.
A Survey of Energy-Efficient Scheduling Mechanisms in Sensor Networks Author : Lan Wang·Yang Xiao(2006) Presented by Yi Cheng Lin.
On the Construction of Energy- Efficient Broadcast Tree with Hitch-hiking in Wireless Networks Source: 2004 International Performance Computing and Communications.
1 Token Bucket Based CAC and Packet Scheduling for IEEE Broadband Wireless Access Networks Chi-Hung Chiang
1 University of Southern California Security in Multiagent Systems by Policy Randomization Praveen Paruchuri, Milind Tambe, Fernando Ordonez University.
Dynamic Localization Control for Mobile Sensor Networks S. Tilak, V. Kolar, N. Abu-Ghazaleh, K. Kang (Computer Science Department, SUNY Binghamton)
Impact of LTE in Unlicensed Spectrum on Wi-Fi
Ns Simulation Final presentation Stella Pantofel Igor Berman Michael Halperin
Talha Naeem Qureshi Joint work with Tauseef Shah and Nadeem Javaid
Green Cellular Networks: A Survey, Some Research Issues and Challenges
Characterizing Energy Efficiency and Deployment Efficiency Relations for Green Architecture Design By Yan Chen, Shunqing Zhang and Shugong Xu Haluk Celebi.
Adaptive Traffic Light Control For Traffic Network.
Preliminary Questions 2B.1.1: Position, Velocity, Acceleration Plots The plot to the right represents the motion of an object. During period 1, the object’s.
CS 712 | Fall 2007 Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua. National University.
Enhanced power efficient sleep mode operation for IEEE e based WiMAX Shengqing Zhu, and Tianlei Wang IEEE Mobile WiMAX Symposium, 2007 IEEE Mobile.
Stochastic sleep scheduling (SSS) for large scale wireless sensor networks Yaxiong Zhao Jie Wu Computer and Information Sciences Temple University.
2015/10/1 A color-theory-based energy efficient routing algorithm for mobile wireless sensor networks Tai-Jung Chang, Kuochen Wang, Yi-Ling Hsieh Department.
Mobile Ad hoc Networks Sleep-based Topology Control
UNIVERSITY OF SOUTHERN CALIFORNIA 1 ELECTION: Energy-efficient and Low- latEncy sCheduling Technique for wIreless sensOr Networks S. Begum, S. Wang, B.
Cyber Physical Systems (Green Networks) Prof. Nicholas Maxemchuk Manu Dhundi.
Alexander Afanasyev Tutors: Seung-Hoon Lee, Uichin Lee Content Distribution in VANETs using Network Coding: Evaluation of the Generation Selection Algorithms.
A Distributed Clustering Framework for MANETS Mohit Garg, IIT Bombay RK Shyamasundar School of Tech. & Computer Science Tata Institute of Fundamental Research.
1 Mobility Increases the Capacity of Ad-hoc Wireless Networks Matthias Grossglauser, David Tse IEEE Infocom 2001 (Best paper award) Oct 21, 2004 Som C.
Maximum Network Lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Cardei, M.; Jie Wu; Mingming Lu; Pervaiz, M.O.; Wireless And Mobile.
Off By One Power-Save Protocols Corey Andalora Keith Needels.
1 Sensor Deployment –Sequential Deployment 1. Sequential Deployment Deploy one or more sensors Get Feedback from them Deploy another set And, so on Disadvantage.
An optimal power-saving class II for VoIP traffic and its performance evaluations in IEEE e JungRyun Lee School of Electrical and Electronics Eng,Chung-Ang.
An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks Seema Bandyopadhyay and Edward J. Coyle Presented by Yu Wang.
Cell Zooming for Cost-Efficient Green Cellular Networks
Packet Scheduling and Buffer Management Switches S.Keshav: “ An Engineering Approach to Networking”
1 Service Charge and Energy- Aware Vertical Handoff in Integrated IEEE e/ Networks Youngkyu Choi and Sunghyun Choi School of Electrical Engineering.
KAIS T On the problem of placing Mobility Anchor Points in Wireless Mesh Networks Lei Wu & Bjorn Lanfeldt, Wireless Mesh Community Networks Workshop, 2006.
Evaluating Wireless Network Performance David P. Daugherty ITEC 650 Radford University March 23, 2006.
Adaptive Sleep Scheduling for Energy-efficient Movement-predicted Wireless Communication David K. Y. Yau Purdue University Department of Computer Science.
Device-to-Device Load Balancing for Cellular Networks Lei Deng, Ying Zhang, Minghua Chen, Jack Y. B. Lee, Ying Jun (Angela) Zhang Zongpeng Li Lingyang.
Hybrid Power Saving Mechanism for VoIP Services with Silence Suppression in IEEE e Systems Hyun-Ho Choi, Jung-Ryun Lee, and Dong-Ho Cho IEEE Communications.
BOUNDS ON QOS- CONSTRAINED ENERGY SAVINGS IN CELLULAR ACCESS NETWORKS WITH SLEEP MODES - Sushant Bhardwaj.
Self-stabilizing energy-efficient multicast for MANETs.
Localized Low-Power Topology Control Algorithms in IEEE based Sensor Networks Jian Ma *, Min Gao *, Qian Zhang +, L. M. Ni *, and Wenwu Zhu +
Simulation of DeReClus Yingyue Xu September 6, 2003.
TCP transfers over high latency/bandwidth networks & Grid DT Measurements session PFLDnet February 3- 4, 2003 CERN, Geneva, Switzerland Sylvain Ravot
1 Energy-efficient Sleep- mode Operations for Broadband Wireless Access Systems You-Lin Chen and Shiao-Li Tsao IEEE 64th Vehicular Technology Conference,
Energy-efficient Sleep-mode Operations for Broadband Wireless Access Systems You-Lin Chen and Shiao-Li Tsao Department of Computer Science, National Chiao.
SERENA: SchEduling RoutEr Nodes Activity in wireless ad hoc and sensor networks Pascale Minet and Saoucene Mahfoudh INRIA, Rocquencourt Le Chesnay.
ComNets, RWTH Aachen University Relays in CDMA2000 Martha Clavijo Chair of Communication Networks RWTH Aachen University, Germany FFV 2007, ,
Cyber Physical Systems (Green Networks) Prof. Nicholas Maxemchuk Manu Dhundi.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
1 A Throughput Enhancement Handover Algorithm for WiMAX Network Architecture Hao-Ming Chang and Gwo-Jong Yu Graduate School of Mathematical Sciences, Aletheia.
Minimum spanning tree diameter estimation in random sensor networks in fractal dimension Students: Arthur Romm Daniel Kozlov Supervisor: Dr.Zvi Lotker.
Mingze Zhang, Mun Choon Chan and A. L. Ananda School of Computing
2010 IEEE Global Telecommunications Conference (GLOBECOM 2010)
ECE 7930 Advanced Topics in Wireless Networks
David K. Y. Yau Department of Computer Science Purdue University
Energy-Efficient Communication Protocol for Wireless Microsensor Networks by Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan Presented.
Net 435: Wireless sensor network (WSN)
Xin-She Yang, Nature-Inspired Optimization Algorithms, Elsevier, 2014
Presentation transcript:

Progress Report Green Network Project Haluk Celebi Manu Dhundi Nourah Alhassoun Sushant Bhardwaj Yasser Mohammed

General Project Description The project deals with small cells (i. e. femto cells, pico cells) The goal is to develop scalable sleep/awake scheduling algorithms, minimize energy consumed by base stations and maintain connectivity

Objectives till mid-term 1.Define 2 simple on/off algorithms for baseline project 2. Define max threshold distance X max of a base station and define a maximum tolerable delay t max for each user 3. Write simulators for the 2 baseline projects. 4. Plot average delays t avg and X avg vs. range of X th 5. Calculate the percentage of energy saved w.r.t operation when BSs are not turned off.

Simulation Parameters Topology: 100 x 100 Box size is 5 i.e. 400 boxes in the grid Number of Base Stations: 50 Number of Mobile Stations (Users): 2500 BS active rate: 0.5; BS sleep rate: 0.2 (Poisson)

Objectives: I. Initial Simulations Experiment 1 1.Randomly populate the topology (grid) with BSs and MSs. Max of 1 BS per BS box. 2.Define an on/off algorithm: A base station is turned off for a fixed percentage of the total period 3.Define threshold distance R max of a base station = 1 to 36 4.Define a maximum tolerable delay t max for each user = 1

Simulation Results: Ravg: When the Rth is large, the Ravg reaches an expected value. This is expected to be almost constant for large values of Rth. When Rth is very small, then there is a very low chance that the MS will find a BS within the Rth in time Tmax. Chance of finding a BS will increase with increase in Rth. Hence the Ravg decreases initially with the increase of Rth.

Tavg: It monotonically decreases with Rth. This is because larger the Rth, higher chance of finding a BS within the Rth without having to wait. Simulation Results:

Objectives: I. Initial Simulations Experiment 2 1.Randomly populate the topology (grid) with MSs. Placing BSs on first 50 highest populated areas. 2.Define an on/off algorithm: A base station is turned off for a fixed percentage of the total period 3.Define threshold distance R max of a base station = 1 to 40 4.Define a maximum tolerable delay t max for each user = 5

Simulation Results: Ravg: When the Rth is large, the Ravg almost reaches a constant value. When Rth is very small, probability that MS will find a BS within the Rth in time Tmax is small.

Simulation Results: Tavg decreases with Rth. The larger Rth, the higher chance MS finds a BS within the Rth without any waiting time

Combining Experiment 1 and 2 Results (Ravg):

Combining Experiment 1 and 2 Results (Tavg):

Percentage of Energy Saved:

Q & A