Supervised By: Prof. Bassem M.Mokhtar Mohamed Wagdy Nomeir

Slides:



Advertisements
Similar presentations
February 20, Spatio-Temporal Bandwidth Reuse: A Centralized Scheduling Mechanism for Wireless Mesh Networks Mahbub Alam Prof. Choong Seon Hong.
Advertisements

Simulation of Feedback Scheduling Dan Henriksson, Anton Cervin and Karl-Erik Årzén Department of Automatic Control.
Capacity of wireless ad-hoc networks By Kumar Manvendra October 31,2002.
Routing and Congestion Problems in General Networks Presented by Jun Zou CAS 744.
VSMC MIMO: A Spectral Efficient Scheme for Cooperative Relay in Cognitive Radio Networks 1.
A Centralized Scheduling Algorithm based on Multi-path Routing in WiMax Mesh Network Yang Cao, Zhimin Liu and Yi Yang International Conference on Wireless.
Min Song 1, Yanxiao Zhao 1, Jun Wang 1, E. K. Park 2 1 Old Dominion University, USA 2 University of Missouri at Kansas City, USA IEEE ICC 2009 A High Throughput.
WHITE – Achieving Fair Bandwidth Allocation with Priority Dropping Based on Round Trip Time Name : Choong-Soo Lee Advisors : Mark Claypool, Robert Kinicki.
L OUISIANA T ECH U NIVERSITY Department of Electrical Engineering and Institute for Micromanufacturing INTRODUCTION PROBLEM FORMULATION STATE FEEDBACK.
DYNAMIC POWER ALLOCATION AND ROUTING FOR TIME-VARYING WIRELESS NETWORKS Michael J. Neely, Eytan Modiano and Charles E.Rohrs Presented by Ruogu Li Department.
1 “Multiplexing Live Video Streams & Voice with Data over a High Capacity Packet Switched Wireless Network” Spyros Psychis, Polychronis Koutsakis and Michael.
Pattern Classification All materials in these slides were taken from Pattern Classification (2nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John Wiley.
Dynamic Tuning of the IEEE Protocol to Achieve a Theoretical Throughput Limit Frederico Calì, Marco Conti, and Enrico Gregori IEEE/ACM TRANSACTIONS.
© Manasa Quantifying Metrics for Resilient and Survivable Networks EECS 801 Graduate Reading © 2008–Manasa K 6 June 2008 Manasa K Department of Electrical.
Deployment Strategies for Differentiated Detection in Wireless Sensor Network Jingbin Zhang, Ting Yan, and Sang H. Son University of Virginia From SECON.
© Manasa Resilience of Flooding Protocol – A Case Study EECS 801 Graduate Reading © 2008–Manasa K Aug Manasa K Department of Electrical Engineering.
Scheduling Algorithms for Wireless Ad-Hoc Sensor Networks Department of Electrical Engineering California Institute of Technology. [Cedric Florens, Robert.
On the Construction of Energy- Efficient Broadcast Tree with Hitch-hiking in Wireless Networks Source: 2004 International Performance Computing and Communications.
Design and Analysis of an MST-Based Topology Control Algorithm Ning Li and Jennifer Hou Department of Computer Science University of Illinois at Urbana-Champaign.
Chapter 6: Multilayer Neural Networks
Xiaohua (Edward) Li1 and E. Paul Ratazzi2
Enhancing TCP Fairness in Ad Hoc Wireless Networks Using Neighborhood RED Kaixin Xu, Mario Gerla University of California, Los Angeles {xkx,
1 SOUTHERN TAIWAN UNIVERSITY ELECTRICAL ENGINEERING DEPARTMENT Gain Scheduler Middleware: A Methodology to Enable Existing Controllers for Networked Control.
Chonggang Wang, Kazem Sohraby, Victor Lawrence, Bo Li, Yueming Hu4 Dept. Of Elec. Engi., University of Arkansas, Fayetteville, AR 72701, USA Stevens Institute.
Seyed Mohamad Alavi, Chi Zhou, Yu Cheng Department of Electrical and Computer Engineering Illinois Institute of Technology, Chicago, IL, USA ICC 2009.
1 Secure Cooperative MIMO Communications Under Active Compromised Nodes Liang Hong, McKenzie McNeal III, Wei Chen College of Engineering, Technology, and.
WPMC 2003 Yokosuka, Kanagawa (Japan) October 2003 Department of Information Engineering University of Padova, ITALY A Soft-QoS Scheduling Algorithm.
A Shaft Sensorless Control for PMSM Using Direct Neural Network Adaptive Observer Authors: Guo Qingding Luo Ruifu Wang Limei IEEE IECON 22 nd International.
Load Balancing in Distributed Computing Systems Using Fuzzy Expert Systems Author Dept. Comput. Eng., Alexandria Inst. of Technol. Content Type Conferences.
A Simple and Effective Cross Layer Networking System for Mobile Ad Hoc Networks Wing Ho Yuen, Heung-no Lee and Timothy Andersen.
1 Optimal Power Allocation and AP Deployment in Green Wireless Cooperative Communications Xiaoxia Zhang Department of Electrical.
1 Performance Analysis of Coexisting Secondary Users in Heterogeneous Cognitive Radio Network Xiaohua Li Dept. of Electrical & Computer Engineering State.
IEEE Globecom 2010 Tan Le Yong Liu Department of Electrical and Computer Engineering Polytechnic Institute of NYU Opportunistic Overlay Multicast in Wireless.
A Distributed Clustering Framework for MANETS Mohit Garg, IIT Bombay RK Shyamasundar School of Tech. & Computer Science Tata Institute of Fundamental Research.
Performance Analysis of an innovative scheduling algorithm for OFDMA based IEEE a systems E. Baccarelli, M.Biagi, C.Pelizzoni, N.Cordeschi This work.
Delay-Throughput Tradeoff with Correlated Mobility in Ad-Hoc Networks Shuochao Yao*, Xinbing Wang*, Xiaohua Tian* ‡, Qian Zhang † *Department of Electronic.
Fen Hou and Pin-Han Ho Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Ontario Wireless Communications and Mobile.
User Cooperation via Rateless Coding Mahyar Shirvanimoghaddam, Yonghui Li, and Branka Vucetic The University of Sydney, Australia IEEE GLOBECOM 2012 &
November 4, 2003APOC 2003 Wuhan, China 1/14 Demand Based Bandwidth Assignment MAC Protocol for Wireless LANs Presented by Ruibiao Qiu Department of Computer.
Department of Information Engineering University of Padova, ITALY A Soft QoS scheduling algorithm for Bluetooth piconets {andrea.zanella, daniele.miorandi,
Optimal Selection of Power Saving Classes in IEEE e Lei Kong, Danny H.K. Tsang Department of Electronic and Computer Engineering Hong Kong University.
The Application of The Improved Hybrid Ant Colony Algorithm in Vehicle Routing Optimization Problem International Conference on Future Computer and Communication,
Statistical-Time Access Fairness Index of One-Bit Feedback Fair Scheduler Fumio Ishizaki Dept. of Systems Design and Engineering Nanzan University, Japan.
TEMPLATE DESIGN © Observer Based Control of Decentralized Networked Control Systems Ahmed M. Elmahdi, Ahmad F. Taha School.
6 December On Selfish Routing in Internet-like Environments paper by Lili Qiu, Yang Richard Yang, Yin Zhang, Scott Shenker presentation by Ed Spitznagel.
A Cluster Based On-demand Multi- Channel MAC Protocol for Wireless Multimedia Sensor Network Cheng Li1, Pu Wang1, Hsiao-Hwa Chen2, and Mohsen Guizani3.
Data Consolidation: A Task Scheduling and Data Migration Technique for Grid Networks Author: P. Kokkinos, K. Christodoulopoulos, A. Kretsis, and E. Varvarigos.
A Bandwidth Scheduling Algorithm Based on Minimum Interference Traffic in Mesh Mode Xu-Yajing, Li-ZhiTao, Zhong-XiuFang and Xu-HuiMin International Conference.
CHANNEL ALLOCATION FOR SMOOTH VIDEO DELIVERY OVER COGNITIVE RADIO NETWORKS Globecom 2010, FL, USA 1 Sanying Li, Tom H. Luan, Xuemin (Sherman) Shen Department.
Fair and Efficient multihop Scheduling Algorithm for IEEE BWA Systems Daehyon Kim and Aura Ganz International Conference on Broadband Networks 2005.
Chance Constrained Robust Energy Efficiency in Cognitive Radio Networks with Channel Uncertainty Yongjun Xu and Xiaohui Zhao College of Communication Engineering,
1 Low Latency Multimedia Broadcast in Multi-Rate Wireless Meshes Chun Tung Chou, Archan Misra Proc. 1st IEEE Workshop on Wireless Mesh Networks (WIMESH),
Network Dynamics and Simulation Science Laboratory Structural Analysis of Electrical Networks Jiangzhuo Chen Joint work with Karla Atkins, V. S. Anil Kumar,
A Low Interference Channel Assignment Algorithm for Wireless Mesh Networks Can Que 1,2, Xinming Zhang 1, and Shifang Dai 1 1.Department of Computer Science.
Uplink scheduling in LTE Presented by Eng. Hany El-Ghaish Under supervision of Prof. Amany Sarhan Dr. Nada Elshnawy Presented by Eng. Hany El-Ghaish Under.
Impact of Interference on Multi-hop Wireless Network Performance
Presented by Tae-Seok Kim
SOUTHERN TAIWAN UNIVERSITY ELECTRICAL ENGINEERING DEPARTMENT
Distributed Energy Efficient Clustering (DEEC) Routing Protocol
“Promising Shuffle-Exchange
Rutgers Intelligent Transportation Systems (RITS) Laboratory
En Wang 1,2 , Yongjian Yang 1 , and Jie Wu 2
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks
Javad Ghaderi, Tianxiong Ji and R. Srikant
Student: Mallesham Dasari Faculty Advisor: Dr. Maggie Cheng
Unfolding with system identification
Information Theoretical Analysis of Digital Watermarking
Further Topics on Random Variables: Derived Distributions
Further Topics on Random Variables: Derived Distributions
Further Topics on Random Variables: Derived Distributions
Presentation transcript:

Enhanced Network performance measure for priority inhibited Networks using information theory Supervised By: Prof. Bassem M.Mokhtar Mohamed Wagdy Nomeir Faculty of Engineering, Alexandria University bmokhtar@alexu.edu.eg, es-mohamed.nomeir1318@alexu.edu.eg Abstract Methodology & System Setup Our setup is the simplest priority network environment, static priority, however the measure used before couldn’t give the accurate performance measure needed. We will use 3 nodes y1, y2 and y3. Each node is independent and has a different priority; y2 has the highest priority then y1 then y3, they are Bernoulli random variables where 1 means that they have message to send. A central controller (scheduler) that decides which node to send the data in the network given the network information. We extend information theory, rate distortion measures for measuring the network performance. We consider the network information as our information source and the minimum required information to achieve a given performance. Let X= [ y1, y2 , y3] be the complete network information and be the estimated network information in the controller due to transmission error probabilities. is the distortion measure used before which resembles the cost of not using the complete information. In this poster we investigate a well known network performance measure and detect some network properties and parameters that it doesn’t satisfy or grasp. We propose an extra factor that will help in enhancing the measuring of network performance. Introduction Network performance can be quantified by many measures such as throughput, latency, link capacity, and data error rate. Also available network information is a key factor in determining network performance. Network information can be any information concerning traffic information, channel state or the topology of the network. In ideal case scenario as the information increases the performance increases, but in many real networks it might not be the case where there might be an inverse relation; Consider a network with small capacity and large demand for network information, if we increase the information in a low capacity network the overall performance decreases. Real networks that should be studied must have capacity threshold, transition error probability also one important factor is the priority constraints in the network. Priority inside the network should be considered in its performance measure to fully define the performance of the network. Priority can be static, dynamic (stochastic) or location dependent. In this poster we apply a well known performance measure in a priority constrained network and show its defects by simulation results using MATLAB then we introduce an extra weighting factor in order to grasp this property in the measure without the need for a new one. Results The measure matrix doesn’t show any cost for priority property. This indifference gives non accurate results as shown in the figures. We should add an extra weighting: System Parameters D is the accepted distortion threshold. denotes the network performance function. is the priority of the chosen node. is the priority of the node that should be chosen with full network information. is the lowest priority (highest magnitude) in the network. Conclusions The measure gives non accurate results. The results can be modified by extra weighting to grasp the priority property in the network. For different type of priority constraint, stochastic or location, N won’t be constant. If there are many priorities in the network and the weighting factor is not used, the errors will be more apparent and the measure won’t be useful. References J. Hong, V. O. Li, Impact of information on network performance-an information-theoretic perspective, in: Global Telecommunications Conference, 2009. S. M. Ross, Introduction to probability models, Academic press, 2014. T. M. Cover, J. A. Thomas, Elements of information theory, John Wiley & Sons, 2012. Biography Bassem M. Mokhtar is assistant professor in the Department of the Electrical Engineering in Faculty of Engineering, University of Alexandria, Egypt. He received his BS and MS degrees in Electrical Engineering from Alexandria University, Egypt, in 2004 and 2008, respectively. He received PhD in Computer Engineering from Virginia Tech, USA in 2014. Mohamed Wagdy Nomeir is a 3rd year student in the Department of the Electrical Engineering in Faculty of Engineering, University of Alexandria, Egypt. 33rd NATIONAL RADIO SCIENCE CONFERENCE (NRSC 2016), www.nrsc2016.aast.edu