1 / 18

Xiaohua (Edward) Li and Juite Hwu Department of Electrical and Computer Engineering

An Efficient Method For Hop Selection And Capacity Enhancement In Multi-Hop Wireless AD-Hoc Networks. Xiaohua (Edward) Li and Juite Hwu Department of Electrical and Computer Engineering State University of New York at Binghamton xli@binghamton.edu. 1.Introduction. Multi-hop transmission

haig
Download Presentation

Xiaohua (Edward) Li and Juite Hwu Department of Electrical and Computer Engineering

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. An Efficient Method For Hop Selection And Capacity Enhancement In Multi-Hop Wireless AD-Hoc Networks Xiaohua (Edward) Li and Juite Hwu Department of Electrical and Computer Engineering State University of New York at Binghamton xli@binghamton.edu

  2. 1.Introduction • Multi-hop transmission • Benefit: • Make network flexible, • Create larger network • Save the energy of source node. • Deficit: • Increase the complex of system • Interference from other nodes

  3. 1.Introduction(cont' ) • Our objective for this paper • Deal with mutual interference • Derive the SINR of each node • Locate the best path which provides the maximum capacity under mild conditions.

  4. 2.System Model • Consider a H-hop wireless network with J+1 nodes in a LхL meters square (H≤J) • Let each node have a transmission power p • Node i receives signal power pdij-αnode j dij: distance between node i and j α： path-loss exponent

  5. 2.System Model: slotted transmission protocol

  6. 2.System Model: received signal of node i dij: distance between node i and j α： path-lossexponent u: signal of packet k v: noise N: power of noise

  7. 3. SINR Analysis and Optimization Signal known by Node j Simplify the received signal

  8. 3. SINR Analysis and Optimization (cont’) • SINR of node j at time slot k • SINR of node j at time slot k-1 Notice: here we track the same packet u(k-j+1)

  9. 3. SINR Analysis and Optimization (cont’) • For the detection of u(k-j+1) • Apply maximal ratio combing (MRC) to find the maximum SINR of yj(k)

  10. 3. SINR Analysis and Optimization (cont’) • Calculate the overall SINR with MRC Notice: This SINR is for a node j in an H-hop when detecting packets

  11. 3. SINR Analysis and Optimization (cont’) • Calculate the Capacity Like a water pipe, the capacity is limited by the minimum tunnel • Find the max one, we can get the best transmission hopping path

  12. 4. Hop optimization and node selection • First term of sj is the dominating one (when l=0) • Formulate the problem to a max-min scheme

  13. 4. Hop optimization and node selection (cont’) • Apply previous method and locate the points • M nodes are closed to these points • We have MH-1 possible paths

  14. 5. Simulations • Numerical optimization and Monte-Carlo simulations • L=100 meters • Exhaustive: locate the best one from MH-1 possible paths

  15. 5. Simulations (cont’) • Numerical optimization and Monte-Carlo simulations • Same parameters • Capacity raises with the increasing of H • H increase analysis performance is better than proposed method

  16. 5. Simulations (cont’) • Numerical optimization and Monte-Carlo simulations • Maximum capacity we may gain

  17. 6. Conclusion • Advantage of our method • More efficient in large networks • Feasible to approximate the optimal path by numerical evaluation • Disadvantage • Results becomes more suboptimal in larger networks • We need a good initial condition

  18. Thank you and Any question?

More Related