The week's pick
Reseach Article
Dynamic Source quick Route Rebuilding Algorithm for Random-access OFDMA Adhoc Network
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 37 - Number 9 |
| Year of Publication: 2012 |
| Authors: Sunil Jacob, Dr. R. Dhanasekaran |
10.5120/4640-6360
|
Sunil Jacob, Dr. R. Dhanasekaran . Dynamic Source quick Route Rebuilding Algorithm for Random-access OFDMA Adhoc Network. International Journal of Computer Applications. 37, 9 ( January 2012), 42-48. DOI=10.5120/4640-6360
Abstract
This paper focusses on maintaining message continuity in a mobile Adhoc network. The dynamic source quick route rebuilding algorithm (DSQRRA) provides continuity in packet routing to reach the next possible neighboring node in order to avoid resending the packet from the source. DSQRRA calls for mobility management and scalable design. Mobility management is done through information exchanges between moving hosts in the Adhoc wireless network. The DSQRRA uses cooperative protocols to coordinate with the Adhoc on demand Distance Vector routine (AODV) protocol for shortest route rebuilding in Random Access OFDMA network. The algorithm gives next alternative route immediately once there is a break in the link. Simulations have been performed to analyze the performance of AODV with and without DSQRRA. The AODV with DSQRRA reduced memory occupation and route broadcasting. It has minimized packet looping. Simulations also show that DSQRRA provides quick delivery of packet from source to destination.
References
- S. Serbetli and A Yener, “Optimal power allocation for relay assisted F/TDMA adhoc networks”, in proceedings of international conference on Wireless Networks, Communications and Mobile computing, 2005, Vol. 2,2005.
- M. Chen, S. Sebetli and A Yener, “Distributed power allocation for parallel relay networks”, in proceedings of Globecom 2005, 2005.
- K Lee and A Yener, “Iterative power allocation algorithms for amplify/estimate/compress and forward multi-band relay”, in proceedings of conference on information sciences and systems, 2006, 2006.
- I Maric and R D Yates, “Bandwidth and power allocation for cooperative strategies in Gaussian relay networks” in conference record of the Thirty- Eight Asilomar Conference on Signals, Systems and Computers, 2004, Vol 2, 2004.
- Martin Toeltsch, Andreas Molisch, Efficient OFDM transmission without cyclic prefix over Frequency-Selectivve channels, IEEE 11th International symposium on Personal, Indoor and Mobile Radio communications, September 18-21, 2000, London (UK).
- M. Haenggi. Analysis and design of diversity schemes for ad hoc wireless networks. IEEE Journal on Selected Areas in Communications , 23(1):19-27, January 2005.
- O. Leveque and I. E. Telatar. Information-theoretic upper bounds on the capacity of large extended ad hoc wireless networks. IEEE transactions on information Theory, 51(3):858-865, March 2005.
- A. Sendonaris.E. Erkip and B.Aazhan analysis User cooperation diversity . part 1 : System description, part II; Implementation, aspects and performance analysis. IEEE Transaction on Communications, 51(11):1927-1938, Novemeber 2003.
- D R Brown III. Resource allocation for cooperative transmission in wireless networks. In 38th Asilomar conference on Signals, Systems and Computers, November 2004.
- P Gupta and P R Kumar. Towards an information theory of large networks: an achievable rate region. IEEE Transactions on Information Theory, 49(8):1877-1894, August 2003.
- S Serbetli, A Yener, “Optimum power allocation for Relay assisted F/TDMA Adhoc Networks”, Wireless communication, 2005.
- E. van der Meulen. A survey of multi-way channels in information theory: 1961-1976. IEEE Transactions on Information theory, 23(1):1-37, January 1977.
- J N Laneman, D N C Tse and G W Wornell. Cooperative diversity in wireless networks: Efficient protocols and outage behavior. IEEE ransactions on Information Theory, 50(12):3062-3080, December 2004.
- J Laneman, G Wornell and D Tse, “An efficient protocol for realizing cooperative diversity in wireless networks” in proceedings of the IEEE. International Symposium on Information Theory (ISIT) (Washington D C) p 294, June 24-29, 2001.
- A Host-Madsen and J Zhang. Capacity bounds and power allocation in wireless relay channel. IEEE transactions on Information Theory, 51(6):2020-2040, June 2005
- R Pabst et al, Relay-based deployment concepts for wireless and mobile broadbane radio IEEE comm. Magazine, 42(9): 80-89, Sept 2004.
- A Catovic, S Tekinay and T Otsu, “Reducing transmit power and extending network lifetime via user cooperation in the next generation wireless multihop networks”. Journal on communications and networks, Vol. 4, No. 4, pg 351-362, Dec 2002.
- P Gupta and P R Kumar, “Critical power for asymptotic connectivity in wireless networks”, Stochastic Analysis for control optimization and applications: A volume in honour of W H Fleming, 1998.
Index Terms
Keywords