Guinian Feng, Pingyi Fan Dept. of Electronic Engineerin Tsinghua University Beijing, China Soung Chang Liew Dept. of Information Engineering Chinese University.

Slides:

Advertisements

Similar presentations

Costas Busch Louisiana State University CCW08. Becomes an issue when designing algorithms The output of the algorithms may affect the energy efficiency.

Advertisements

Mobility Increase the Capacity of Ad-hoc Wireless Network Matthias Gossglauser / David Tse Infocom 2001.

Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.

Minimum Energy Mobile Wireless Networks IEEE JSAC 2001/10/18.

TOPOLOGIES FOR POWER EFFICIENT WIRELESS SENSOR NETWORKS ---KRISHNA JETTI.

1 A Novel Topology-blind Fair Medium Access Control for Wireless LAN and Ad Hoc Networks Z. Y. Fang and B. Bensaou Computer Science Department Hong Kong.

KAIST Adaptive Triangular Deployment Algorithm for Unattended Mobile Sensor Networks Suho Yang (September 4, 2008) Ming Ma, Yuanyuan Yang IEEE Transactions.

Wireless Mesh Networks 1. Architecture 2 Wireless Mesh Network A wireless mesh network (WMN) is a multi-hop wireless network that consists of mesh clients.

CS Dept, City Univ.1 Low Latency Broadcast in Multi-Rate Wireless Mesh Networks LUO Hongbo.

1 Multicast Routing with Minimum Energy Cost in Ad hoc Wireless Networks Xiaohua Jia, Deying Li and Frankie Hung Dept of Computer Science, City Univ of.

An Authentication Service Based on Trust and Clustering in Wireless Ad Hoc Networks: Description and Security Evaluation Edith C.H. Ngai and Michael R.

An Effective Placement of Detection Systems for Distributed Attack Detection in Large Scale Networks Telecommunication and Security LAB. Dept. of Industrial.

1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Mobile Ad Hoc Networks Theory of Interferences, Trade-Offs between.

On the Construction of Energy- Efficient Broadcast Tree with Hitch-hiking in Wireless Networks Source: 2004 International Performance Computing and Communications.

© Honglei Miao: Presentation in Ad-Hoc Network course (19) Minimal CDMA Recoding Strategies in Power-Controlled Ad-Hoc Wireless Networks Honglei.

1 TTS: A Two-Tiered Scheduling Algorithm for Effective Energy Conservation in Wireless Sensor Networks Nurcan Tezcan & Wenye Wang Department of Electrical.

Speaker: Li-Sheng Chen 1 Jan 2, 2012 EOBDBR: an Efficient Optimum Branching-Based Distributed Broadcast Routing Protocol for Wireless Ad Hoc Networks.

WiOpt’04: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks March 24-26, 2004, University of Cambridge, UK Session 2 : Energy Management.

Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.

Mario Čagalj supervised by prof. Jean-Pierre Hubaux (EPFL-DSC-ICA) and prof. Christian Enz (EPFL-DE-LEG, CSEM) Wireless Sensor Networks:

CS Dept, City Univ.1 The Complexity of Connectivity in Wireless Networks Presented by LUO Hongbo.

Elec 599 Report: Modeling Media Access in Embedded Two-Flow Topologies of Multi-hop Wireless Networks Jingpu Shi Advisor: Dr. Edward Knightly Department.

1 A Topology Control Approach to Using Directional Antennas in Wireless Mesh Networks Umesh Kumar, Himanshu Gupta and Samir R. Das Department of Computer.

1 Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment Infocom /12/20.

Minimizing interference for the highway model in Wireless Ad-hoc and Sensor Networks Haisheng Tan, Tiancheng, Lou, Francis C.M. Lau, YuexuanWang, Shiteng.

Steady and Fair Rate Allocation for Rechargeable Sensors in Perpetual Sensor Networks Zizhan Zheng Authors: Kai-Wei Fan, Zizhan Zheng and Prasun Sinha.

Tuning the Carrier Sensing Range of IEEE MAC Jing Deng,Ben Liang and Pramod K. Varshney Univ. of New Orleans Globecom 2004.

1 Power Control for Distributed MAC Protocols in Wireless Ad Hoc Networks Wei Wang, Vikram Srinivasan, and Kee-Chaing Chua National University of Singapore.

Hongyu Gong, Lutian Zhao, Kainan Wang, Weijie Wu, Xinbing Wang

Efficient Gathering of Correlated Data in Sensor Networks

College of Engineering Non-uniform Grid- based Coordinated Routing Priyanka Kadiyala Major Advisor: Dr. Robert Akl Department of Computer Science and Engineering.

1 11 Subcarrier Allocation and Bit Loading Algorithms for OFDMA-Based Wireless Networks Gautam Kulkarni, Sachin Adlakha, Mani Srivastava UCLA IEEE Transactions.

1 Core-PC: A Class of Correlative Power Control Algorithms for Single Channel Mobile Ad Hoc Networks Jun Zhang and Brahim Bensaou The Hong Kong University.

Improving Capacity and Flexibility of Wireless Mesh Networks by Interface Switching Yunxia Feng, Minglu Li and Min-You Wu Presented by: Yunxia Feng Dept.

Prediction Assisted Single-copy Routing in Underwater Delay Tolerant Networks Zheng Guo, Bing Wang and Jun-Hong Cui Computer Science & Engineering Department,

On Energy-Efficient Trap Coverage in Wireless Sensor Networks Junkun Li, Jiming Chen, Shibo He, Tian He, Yu Gu, Youxian Sun Zhejiang University, China.

G-REMiT: An Algorithm for Building Energy Efficient Multicast Trees in Wireless Ad Hoc Networks Bin Wang and Sandeep K. S. Gupta NCA’03 speaker ： Chi-Chih.

1 A Distributed Architecture for Multimedia in Dynamic Wireless Networks By UCLA C.R. Lin and M. Gerla IEEE GLOBECOM'95.

Routing and Scheduling for mobile ad hoc networks using an EINR approach Harshit Arora Advisor : Dr. Harlan Russell Mobile ad Hoc Networks A self-configuring.

Optimization of Wavelength Assignment for QoS Multicast in WDM Networks Xiao-Hua Jia, Ding-Zhu Du, Xiao-Dong Hu, Man-Kei Lee, and Jun Gu, IEEE TRANSACTIONS.

Design and Analysis of an MST-Based Topology Control Algorithm Ning Li, Jennifer C. Hou, and Lui Sha Department of Computer Science University of Illinois.

OPTIMUM INTEGRATED LINK SCHEDULING AND POWER CONTROL FOR MULTI-HOP WIRELESS NETWORKS Arash Behzad, and Izhak Rubin, IEEE Transactions on Vehicular Technology,

/ 22 1 A Distributed and Efficient Flooding Scheme Using 1-hop Information in Mobile Ad Hoc Networks Hai Liu Xiaohua Jia Peng-Jun Wan Dept. of Comput.

Collision-free Time Slot Reuse in Multi-hop Wireless Sensor Networks

Riku Jantti Telecommunication Engineering at University of Vaasa, Finland Seong-Lyun Kim Electrical and Electronic Engineering, Yonsei University, Seoul,

Efficient Computing k-Coverage Paths in Multihop Wireless Sensor Networks XuFei Mao, ShaoJie Tang, and Xiang-Yang Li Dept. of Computer Science, Illinois.

A New Link Scheduling Algorithm for Concurrent Tx/Rx Wireless Mesh Networks Author: Kwan-Wu Chin University of Wollongong, Australia From: ICC 2008 Speaker:

Energy-Efficient Wake-Up Scheduling for Data Collection and Aggregation Yanwei Wu, Member, IEEE, Xiang-Yang Li, Senior Member, IEEE, YunHao Liu, Senior.

Distributed Data Gathering Scheduling in Multi-hop Wireless Sensor Networks for Improved Lifetime Subhasis Bhattacharjee and Nabanita Das International.

Localized Low-Power Topology Control Algorithms in IEEE based Sensor Networks Jian Ma *, Min Gao *, Qian Zhang +, L. M. Ni *, and Wenwu Zhu +

Maximizing Angle Coverage in Visual Sensor Networks Kit-Yee Chow, King-Shan Lui and Edmund Y. Lam Department of Electrical and Electronic Engineering The.

Multicast Scaling Laws with Hierarchical Cooperation Chenhui Hu, Xinbing Wang, Ding Nie, Jun Zhao Shanghai Jiao Tong University, China.

A Bandwidth Scheduling Algorithm Based on Minimum Interference Traffic in Mesh Mode Xu-Yajing, Li-ZhiTao, Zhong-XiuFang and Xu-HuiMin International Conference.

Adaptive Triangular Deployment Algorithm for Unattended Mobile Sensor Networks Ming Ma and Yuanyuan Yang Department of Electrical & Computer Engineering.

Distributed Topology Control In Wireless Sensor Networks with Assymetric Links Presenter: Himali Saxena.

1 Low Latency Multimedia Broadcast in Multi-Rate Wireless Meshes Chun Tung Chou, Archan Misra Proc. 1st IEEE Workshop on Wireless Mesh Networks (WIMESH),

Junchao Ma +, Wei Lou +, Yanwei Wu *, Xiang-Yang Li *, and Guihai Chen & Energy Efficient TDMA Sleep Scheduling in Wireless Sensor Networks + Department.

Construction of Optimal Data Aggregation Trees for Wireless Sensor Networks Deying Li, Jiannong Cao, Ming Liu, and Yuan Zheng Computer Communications and.

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.

Introduction Wireless Ad-Hoc Network  Set of transceivers communicating by radio.

-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 Spatial-based Multi-resolution Data Dissemination Scheme for Wireless Sensor Networks Jian Chen, Udo Pooch Department of Computer Science Texas A&M University.

Power-Aware Topology Control for Wireless Ad-Hoc Networks Wonseok Baek and C.-C. Jay Kuo Department of Electrical Engineering University of Southern California.

Maximizing Ad-Hoc network lifetime Yael Ochbaum Orit Varsano Supervised by Michael Segal.

2010 IEEE Global Telecommunications Conference (GLOBECOM 2010)

Constraint-Based Routing

Does Topology Control Reduce Interference?

Computing and Compressive Sensing in Wireless Sensor Networks

Introduction Wireless Ad-Hoc Network

On Achieving Maximum Network Lifetime Through Optimal Placement of Cluster-heads in Wireless Sensor Networks High-Speed Networking Lab. Dept. of CSIE,

Presentation transcript:

Guinian Feng, Pingyi Fan Dept. of Electronic Engineerin Tsinghua University Beijing, China Soung Chang Liew Dept. of Information Engineering Chinese University of Hong Kong Hong Kong, China IEEE ICC 2008

outline Introduction Network graph model and notation Interference condition and definition The MIA algorithm Evaluation of MIA performance Conclusion

Introduction Ad hoc network The battery life of nodes is limited Energy is a precious resource To conserve energy To investigate minimizing mutual interference Topology control has been proposed to reduce transmit powers

Network graph model and notation n nodes randomly and uniformly distributed G=(V, E), |V|=n, |E|=m All node The same maximum transmission power P max The same maximum transmission range r max The same received power threshold P th

Network graph model and notation a → b:the directional link from node a to node b d ab : the distance between a and b p a → b =f ‧ p a /d ab α e i =(u i,v i ), i=1,2,…,m : the ith edge in the graph

Interference condition-(1) Consider simultaneous transmissions on two directional links a → b and c → d No collision at receiver b uiui vivi ujuj vjvj

Interference condition-(2) The minimum-power strategy

Interference condition-(3) The equal-power power strategy

Interference definition-(1) The distance d ij between two edges e i =(u i,v i ) and e j =(u j,v j )

Interference definition-(2) Consider e i =(u i,v i ) The area around e i is divided into three regions uiui vivi c

Interference definition-(2) Consider e i =(u i,v i ) The area around e i is divided into three regions uiui vivi c

Interference definition-(2) Consider e i =(u i,v i ) The area around e i is divided into three regions uiui vivi c

Interference definition-(2) I h (e i ) : the interference coefficient of node h with respect to e i q h : the number of edges having an interference relationship with e i among the p h p h : the number of edges incident to node h

Interference definition-(3) The mean partial interference coefficient K(e i ) of e i

Interference definition-(4) The interference of e i

Interference definition-(5) The network interference of G=(V, E)

The MIA algorithm

It aims at reducing energy cost while maintaining network connectivity a b c

Evaluation of MIA performance

Conclusion To considered one such particular algorithm Minimum Interference Algorithm(MIA) Conserving energy Maintaining good spanner property

Conclusion To establish the “pair-wise” interference condition between two links To consider the interference of a link with respect to all its surrounding links

Conclusion Have tackled the topology control problem with the goal of minimizing network interference To establish the “pair-wise” interference condition between two links To consider the interference of a link with respect to all its surrounding links

uiui vivi ujuj vjvj uiui vivi ujuj vjvj

Interference definition-(2) Consider e i =(u i,v i ) The area around e i is divided into three regions uiui vivi

The value of K