Effect of Power Control in Forwarding Strategies for Wireless Ad-Hoc Networks Supervisor:- Prof. Swades De Presented By:- Aditya Kawatra 2004EE10313 Pratik.

Slides:



Advertisements
Similar presentations
A DISTRIBUTED CSMA ALGORITHM FOR THROUGHPUT AND UTILITY MAXIMIZATION IN WIRELESS NETWORKS.
Advertisements

The Capacity of Wireless Networks Danss Course, Sunday, 23/11/03.
Chorus: Collision Resolution for Efficient Wireless Broadcast Xinyu Zhang, Kang G. Shin University of Michigan 1.
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
Queuing Network Models for Delay Analysis of Multihop Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute.
CLUSTERING IN WIRELESS SENSOR NETWORKS B Y K ALYAN S ASIDHAR.
TOPOLOGIES FOR POWER EFFICIENT WIRELESS SENSOR NETWORKS ---KRISHNA JETTI.
Computer Networks Group Universität Paderborn Ad hoc and Sensor Networks Chapter 9: Localization & positioning Holger Karl.
David Ripplinger, Aradhana Narula-Tam, Katherine Szeto AIAA 2013 August 21, 2013 Scheduling vs Random Access in Frequency Hopped Airborne.
Delay and Throughput in Random Access Wireless Mesh Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department Rensselaer Polytechnic Institute (RPI)
Network Coding Testbed Using Software-Defined Radio Abstract In current generation networks, network nodes operate by replicating and forwarding the packets.
Generated Waypoint Efficiency: The efficiency considered here is defined as follows: As can be seen from the graph, for the obstruction radius values (200,
1 Channel Capacity Issues For Mobile Teams Ameesh Pandya and Greg Pottie, UCLA Electrical Engineering Department.
A Novel Cluster-based Routing Protocol with Extending Lifetime for Wireless Sensor Networks Slides by Alex Papadimitriou.
1(48) An Analysis of the Throughput of Packet Radio Networks André Stranne Licentiate thesis presentation Lund, 16/5 – 2003 André Stranne Licentiate thesis.
Localized Techniques for Power Minimization and Information Gathering in Sensor Networks EE249 Final Presentation David Tong Nguyen Abhijit Davare Mentor:
Modeling OFDM Radio Channel Sachin Adlakha EE206A Spring 2001.
On the Construction of Energy- Efficient Broadcast Tree with Hitch-hiking in Wireless Networks Source: 2004 International Performance Computing and Communications.
Performance Enhancement of TFRC in Wireless Ad Hoc Networks Mingzhe Li, Choong-Soo Lee, Emmanuel Agu, Mark Claypool and Bob Kinicki Computer Science Department.
Napoli - 21 February 2004 – Simone Merlin SLIDE 1 Analysis of the hidden terminal effect in multi-rate IEEE b networks Simone Merlin Department of.
1 MOBMAC - An Energy Efficient and low latency MAC for Mobile Wireless Sensor Networks Proceedings of the 2005 Systems Communications (ICW ’ 05)
Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Network Wei-Peng Chen, Jennifer C. Hou, Lui Sha Presented by Ray Lam Oct 23, 2004.
CS401 presentation1 Effective Replica Allocation in Ad Hoc Networks for Improving Data Accessibility Takahiro Hara Presented by Mingsheng Peng (Proc. IEEE.
Chap 4 Multiaccess Communication (Part 1)
International Technology Alliance In Network & Information Sciences International Technology Alliance In Network & Information Sciences 1 Cooperative Wireless.
RTS/CTS-Induced Congestion in Ad Hoc Wireless LANs Saikat Ray, Jeffrey B. Carruthers, and David Starobinski Department of Electrical and Computer Engineering.
1 SenMetrics’05, San Diego, 07/21/2005 SOSBRA: A MAC-Layer Retransmission Algorithm Designed for the Physical-Layer Characteristics of Clustered Sensor.
Does Packet Replication Along Multipath Really Help ? Swades DE Chunming QIAO EE Department CSE Department State University of New York at Buffalo Buffalo,
Tuning the Carrier Sensing Range of IEEE MAC Jing Deng,Ben Liang and Pramod K. Varshney Univ. of New Orleans Globecom 2004.
Comparison of Data-driven Link Estimation Methods in Low-power Wireless Networks Hongwei Zhang Lifeng Sang Anish Arora.
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.
Architectures and Applications for Wireless Sensor Networks ( ) Localization Chaiporn Jaikaeo Department of Computer Engineering.
Patch Based Mobile Sink Movement By Salman Saeed Khan Omar Oreifej.
1 Multicast Algorithms for Multi- Channel Wireless Mesh Networks Guokai Zeng, Bo Wang, Yong Ding, Li Xiao, Matt Mutka Michigan State University ICNP 2007.
On Optimizing the Backoff Interval for Random Access Scheme Zygmunt J. Hass and Jing Deng IEEE Transactions on Communications, Dec 2003.
ENERGY-EFFICIENT FORWARDING STRATEGIES FOR GEOGRAPHIC ROUTING in LOSSY WIRELESS SENSOR NETWORKS Presented by Prasad D. Karnik.
Salah A. Aly,Moustafa Youssef, Hager S. Darwish,Mahmoud Zidan Distributed Flooding-based Storage Algorithms for Large-Scale Wireless Sensor Networks Communications,
Cross-layer Packet Size Optimization for Wireless Terrestrial, Underwater, and Underground Sensor Networks IEEE INFOCOM 2008 Mehmet C. Vuran and Ian F.
An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks Seema Bandyopadhyay and Edward J. Coyle Presented by Yu Wang.
REECH ME: Regional Energy Efficient Cluster Heads based on Maximum Energy Routing Protocol Prepared by: Arslan Haider. 1.
Power Control in Wireless Ad Hoc Networks Background An ad hoc network is a group of self configuring wireless nodes that lack infrastructure. Motivation—Power.
Doc.: IEEE /0553r1 Submission May 2009 Alexander Maltsev, Intel Corp.Slide 1 Path Loss Model Development for TGad Channel Models Date:
A Distributed Relay-Assignment Algorithm for Cooperative Communications in Wireless Networks ICC 2006 Ahmed K. Sadek, Zhu Han, and K. J. Ray Liu Department.
Probabilistic Coverage in Wireless Sensor Networks Authors : Nadeem Ahmed, Salil S. Kanhere, Sanjay Jha Presenter : Hyeon, Seung-Il.
4 Introduction Semi-Structure Routing Framework System Model Performance Analytical Framework Simulation 6 Conclusion.
A Power Assignment Method for Multi-Sink WSN with Outage Probability Constraints Marcelo E. Pellenz*, Edgard Jamhour*, Manoel C. Penna*, Richard D. Souza.
SenProbe: Path Capacity Estimation in Wireless Sensor Networks Tony Sun, Ling-Jyh Chen, Guang Yang M. Y. Sanadidi, Mario Gerla.
Dr. Sudharman K. Jayaweera and Amila Kariyapperuma ECE Department University of New Mexico Ankur Sharma Department of ECE Indian Institute of Technology,
CS3502: Data and Computer Networks Local Area Networks - 1 introduction and early broadcast protocols.
Background of Ad hoc Wireless Networks Student Presentations Wireless Communication Technology and Research Ad hoc Routing and Mobile IP and Mobility Wireless.
1 POWMAC: A Single-Channel Power-Control Protocol for Throughput Enhancement in Wireless Ad Hoc Network Alaa Muqattash and Marwan Krunz The University.
Performance of Adaptive Beam Nulling in Multihop Ad Hoc Networks Under Jamming Suman Bhunia, Vahid Behzadan, Paulo Alexandre Regis, Shamik Sengupta.
Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,
Energy-Efficient Wake-Up Scheduling for Data Collection and Aggregation Yanwei Wu, Member, IEEE, Xiang-Yang Li, Senior Member, IEEE, YunHao Liu, Senior.
CS3502: Data and Computer Networks Local Area Networks - 1 introduction and early broadcast protocols.
Background of Ad hoc Wireless Networks Student Presentations Wireless Communication Technology and Research Ad hoc Routing and Mobile IP and Mobility Wireless.
SERENA: SchEduling RoutEr Nodes Activity in wireless ad hoc and sensor networks Pascale Minet and Saoucene Mahfoudh INRIA, Rocquencourt Le Chesnay.
1 A Power Control MAC Protocol for Ad Hoc Networks EUN-SUN JUNG, NITIN H. VAIDYA, Wireless Networks 11, 55–66, Speaker: Han-Tien Chang.
Cascading : An Overview of the Strategy Yujie Zhu and Raghupathy Sivakumar GNAN Research Group, Georgia Tech Energy-Efficient Communication Strategy for.
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks Zhao, J.; Cao, G. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 鄭宇辰
A Power Control MAC Protocol for Ad Hoc Networks
Lecture 28 Mobile Ad hoc Network Dr. Ghalib A. Shah
Communication through Silence in Wireless Sensor Networks
SENSYS Presented by Cheolki Lee
He Xiaoben Further study of multi-hop communications - modeling the hidden terminal problem He Xiaoben
Wireless Mesh Networks
Wireless Sensor Networks and Internet of Things
<month year> <doc.: IEEE doc> January 2013
<month year> <doc.: IEEE doc> January 2013
Information Sciences and Systems Lab
Presentation transcript:

Effect of Power Control in Forwarding Strategies for Wireless Ad-Hoc Networks Supervisor:- Prof. Swades De Presented By:- Aditya Kawatra 2004EE10313 Pratik Pareek 2004EE10336

Problem Statement To model the power consumption and effective interference for forwarding strategies like NFP, LRD, and Random Transmission in wireless ad-hoc networks Using the above, evaluate total power consumption for a unit forward distance, and the no. of retransmissions required. Also, to verify in the light of above analysis the best forwarding strategy, which is NFP as of now (based on one- hop Transmission Probability, Interference Factor and Throughput [1])

Introduction In previous work, Interference Zone (IZ) effects have not been taken into account. In this zone, nodes can sense the carrier signal from transmitting nodes, but cannot decode the data. Usually R I =2R T The solid circle is the transmission zone (of radius R T ) and the dotted circle is the interference zone boundary (of radius R I )

Introduction (contd.) But if particular intended receiving node (Y) receives simultaneous signals from its interfering nodes  probability of decoding error (~BER) increases Thus, the aim is to predict a probabilistic interference at Y (in terms of SIR) Some basic assumptions are –  The transmission protocol followed is a simple CSMA (Carrier Sense Multiple Access) instead of the usual slotted ALOHA [2] and a Poisson process node distribution  Initially, no power control is assumed, i.e. all T x s occur at full power. Later pdf of a receiving node [1] will be factored in along with other complexities

Introduction (contd…)  Time lag between data transmission and reception at any node is assumed negligible. So with CSMA, all IZ nodes will instantaneously sense T x carrier and keep quiet  Nodes in IZ will also keep quiet if nodes from outside transmit, i.e. they can fall in the interference zone of some external transmitting node. This possibility is ignored as we want to conduct a worst-case analysis.

Analysis Where, is the probability of there being total ‘i’ nodes in the total shaded area. is the probabilistic interference considering that only j nodes are exclusive interferers (j<=i), given that there are total n nodes in the shaded region The expression for the expected value of interference will be –

Analysis (Contd..)

Interference due to One Effective Transmitting Node A p (in Green) is the area common to the Interference region of N1 and the total shaded area. A n (in Pink) is the compliment area to A p in the total shaded region region. Pr(r,α) k is the probability of k nodes present in the A p region Pr c (r,α) 1-k is the probability of (1-k) nodes present in the A n region

Interference due to two effective transmitting nodes

Interference due to three effective transmitting nodes

General Result So the general result of interference due to j nodes, when n nodes are present in the crescent is given by :- Here, I nj is the Interference due to j nodes, when there are a total of n nodes in the shaded region. Pr (r,α) k is the probability of k nodes present in the A p region Pr c (r,α) 1-k is the probability of (1-k) nodes present in the A n region

As the probability of occurrence of nodes in the region is governed by the Poisson process, the graph of the total interference peaks at the average value, ie. λA. Similarly, I n3 and I n2 also peak at the same value. But, I n1 shows a unique characteristic. It peaks at a value less than the average value,(λA). This is because, the no. of effective one node interference cases decreases as the total no. of nodes increase. This decrease shifts the peak of I n1 towards left. Simulation Results and Plots

“Brute force” algorithm To simulate the Poisson distribution of nodes a large square area (dimensions >> R I ) was taken and the average number of nodes (= λ*square area) were randomly positioned. A list is created of all the nodes located in the total shaded region (= n) and a transmitting nodes only sub-list is randomly assigned based on probability of transmission. Then a random order within the transmitting nodes is selected and finally after isolating the nodes which are exclusive of each others’ interference zones, the final effective interfering nodes are determined (= j). The approriate I nj is updated and finally each of these is divided by the total number of iterations.

Comparison between Analysis and Brute Force Results Results obtained from Brute Force simulation andAnalysis show a significant match. This match increases on increasing the no. of iterations in the Brute Force Simulation. The shape of the two results are also consistent, i.e they peak at the same value. This value is very close to the average no. of nodes in the shaded region i.e. λA.

The value of I2 and I3 increases as d/R is increased, while I1 decreases for the same. As d/R increases the total no. of nodes in the total shaded region (possible interferers) increases thus decreasing the probability of one effective interfering node Other Simulation Results and Plots I vs d/R

The Interference value increases as the receiver moves away (i.e. d/R increases). This can be explained by the increased number of nodes in the shaded region, when d/R is increased. This graph suggests that by varying λ, we do not see a significant change in total interference. I vs d/R for 2 values of λ

The signal to interference ratio (SIR) decreases as d/R is increased. When d/R is very small, the power received is large and also the interference is low. So, the SIR value is very high. As Interference also monotonically increases with d/R, the SIR curve continues to show a decrease with increasing d/R. SIR vs d/R

Future Work  Incorporate the Power Control Strategy (i.e. NFP, LRD and the Random Txn) in the analysis and the simulations for calculating the excepted Interference.  Use these results to obtain for each strategy,the  Energy per unit forward progress (single hop).  Average no. of retransmissions  The equation derived as of now is :-

References [1] Ting-Chao Hou and Victor O.K. Li, “Transmission Range Control in Multihop Packet Radio Networks”, in IEEE Trans. Commun., vol. COM-34, January 1986 [2] Eun-Sun Jung and Nitin H. Vaidya, “A Power Control MAC Protocol for Ad Hoc Networks”, in MOBICOM’02, September Swades De, Chunming Qiao, Dimitri A. Pados, Mainak Chatterjee and Sumesh J. Philip, “An Integrated Cross-Layer Study of Wireless CDMA Sensor Networks”, in IEEE Journal on Selected Areas in Communications, Vol. 22, No.7, September 2004