1 / 16

Associativity Tick Averaged Associativity based Routing for Real Time Mobile Networks

Associativity Tick Averaged Associativity based Routing for Real Time Mobile Networks. Barbaros Preveze Electronic s and Communications Engineering, Ç ankaya University Ankara, Turkey Aysel Şafak Electrical and Electronic s Engineering, Ba Ş kent University, Ankara, Turkey.

pabla
Download Presentation

Associativity Tick Averaged Associativity based Routing for Real Time Mobile Networks

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. Associativity Tick Averaged Associativity based Routing for Real Time Mobile Networks BarbarosPrevezeElectronics and Communications Engineering, Çankaya University Ankara, Turkey AyselŞafakElectrical and Electronics Engineering, BaŞkent University, Ankara, Turkey ELECO 2009 - BURSA

  2. Associativity Tick Averaged Associativity based Routing for Real Time Mobile Networks Associativity Based Routing (ABR), is one of the best long lived Routing methods known , where associativity based means keeping the number of signals( ticks) that a node receives from each of other nodes. The main purpose of ABR is maximising the life time of the routes in a mobile network while minimising the outage times of the links in comparision with other relay selection algorithms which are; Miminum distance Path, Minmax distance path and Power Threshold Relay selection algorithms. ELECO 2009 - BURSA

  3. Associativity Tick Averaged Associativity based Routing for Real Time Mobile Networks The work we have done is, proving that ABR has really better results than other relay selection algorithms and improving the performance of ABR in terms of life time and outage times without any modification on protocol or frame structure of ABR. Here we propose a new algorithm that will give better results than ABR and will still be usefull in real time applications . ELECO 2009 - BURSA

  4. UNDERSTANDING RELAY SELECTION ALGORITHMS Minimum Distance Path This algorithm selects the relay through which our packets travel through the minimum distance for each possible route S from Tx to Rx ELECO 2009 - BURSA

  5. UNDERSTANDING RELAY SELECTION ALGORITHMS Minmax Distance Path This algorithm selects the path from a set of paths for which the maximum distance between any 2 linked nodes of the path, is lower than all other path’s corresponding values, by this way enough signal power level received by any node,is tried to be provided. ELECO 2009 - BURSA

  6. UNDERSTANDING RELAY SELECTION ALGORITHMS Relay Selection Using Power Threshold (PT) This algorithm selectsthe relay for which the Tx receives the signalwith the power level greater than Power threshold and other relays power levels. ELECO 2009 - BURSA

  7. UNDERSTANDING ABR Availability : Indicates whether the node is avaiable or not Number of AT’s : Indicates the duration that the corresponding node is available. AT Thresholds : The calculated threshold value which will be used by the owner of the table (R1 here) in deciding to choose the path. ELECO 2009 - BURSA

  8. UNDERSTANDING ABR For the given example table above ; R1 can communicate with R2 (3 < 16/6) R3 (2 >= 12/6) R4 (4 > 14/6) Rx (7 > 15/6) Tx (0 < 5/6) ELECO 2009 - BURSA

  9. UNDERSTANDING ABR

  10. *UNDERSTANDING ATAABR If 3 paths are selected as a result of ATAABR (such that AT > AT Threshold for all partial links), the path Tx -3 -2 -4 Rx will be eliminated since it has more hop counts than available minimum hop counts in other paths. Theninstead of selecting one of them randomly one of the paths from the selected ones which has three hops (minimum hop count) will be selected according to ; . ELECO 2009 - BURSA

  11. RESULTS for RELAY SELECTION ALGORITHMS ELECO 2009 - BURSA

  12. RESULTS for MULTIHOP RELAY SELECTION ALGORITHMS ELECO 2009 - BURSA

  13. RESULTS for MULTIHOP RELAY SELECTION ALGORITHMS ELECO 2009 - BURSA

  14. CONCLUSION • An extension of associativity Based Routing algorithm is developed and compared with ABR (associativity Based Routing ) in terms of number of RRC’s and outage times. it’s seen from the output of the simulation that, ATAABR (associativity tick averaged associativity Based Routing) provides better performance for number of RCC’s and number of outage counts than ABR. • it is also observed that ATAABR has much more better performance than ABR and other well known single hop relay selection algorithms such as minimum distance path, minmax path and path according to power threshold, • The improvement of these factors will give huge advantages in real time applications such as video or voice conversations, for which calculation time for RRC and having a reliable connection is extremely important than other applications. ELECO 2009 - BURSA

  15. References [1] Toh C. K. , “Associativity-Based Routing for Ad-Hoc Mobile Networks”, Kluwer Academic Publishers. University of Cambridge, Computer Laboratory, Cambridge CB2 3QG, United Kingdom Wireless Personal Communications 4: 103–139, 1997.c,1997 [2] Meier A, “Cooperative Diversity in Wireless Networks”, Erasmus Project at theUniversity of Edinburgh [3] Kim D, Toh C.K and Choi Y. “Location-aware long liferoute selection in wireless ad-hoc networks” , Electronic Letters Vol:36, No 18. 31st August 2000 [4] Wikipedia , “http://en.wikipedia.org/wiki/Free-space_path_loss” [5] Sreng V., Yanikomeroglu H., and Falconer D. D, “Relayer Selection Strategies in Cellular Networks with Peer-to-Peer Relaying”, Vehicular Technology Conference, 2003. VTC 2003-Fall. 2003 IEEE 58th, page(s): 1949- 1953 Vol.3 , Oct. 2003 [6] Chul S. , Woo M. and Singh S. “Longest Life Routing Protool (LLRP) for Ad Hoc Networks with Highly Mobile Nodes”, IEEE Xplore. [7] Shaar S., Fawaz A.., Murad A. M., M. Ayman, Al-Shalabi R. and Kanaan G. “Analysis of Enhanced Associativity Based Routing Protocol” , Journal of Computer Science 2 (I2): 853-858,2006 ELECO 2009 - BURSA

  16. Questions ? ELECO 2009 - BURSA

More Related