IJSER Home >> Journal >> IJSER
International Journal of Scientific and Engineering Research
ISSN Online 2229-5518
ISSN Print: 2229-5518 6    
Website: http://www.ijser.org
scirp IJSER >> Volume 2, Issue 6, June 2011 Edition
A Mechanism For Booster Approach in Mobile Ad Hoc Network
Full Text(PDF, 3000)  PP.  
Ahamd Anzar, Husain Shanawaz,Dr S.C Gupta
MANET, Mechanism, Node, CHG,Booster, Tx/Rx Power.
In Mobile Adhoc network Nodes are highly mobile. They move around the Network. Due to this network topology and number of neighboring nodes in each node frequently change. Movement of nodes from one to another network also affect to the communication between them. As we know if nodes are within the range of each other they will work properly. But any of one node is not in the range of other node communication will Break. So we have to Design and develop that kind of system/approach which can handle such types of situation and prevent frequent link failure. To overcome this Link failure we introduced Booster Approach. In this Approach, we are dealing with the Power levels at both the ends (Tx as well as Rx) in order to make healthy communication between nodes in Adhoc Network. Suppose if our one node is moving away from the source node the moving node will measure its Rx power with respect to the distance and after a time duration when its current power level reaches the Threshold level (mini. Power level require for communication between nodes) it "ON its Booster" and at the same time it send one packet message MEP (Member Packet) to source node which contains (Received power level of moving node) due to this source node also "ON its Booster" enhance the Power level and trying to connect together to prevent the data lost during node mobility. In this paper we proposed a mechanism based on the Mathematical parameters . like Tx power, Rx power (Threshold level- minimum power require for communication between nodes), Distance between Tx and Rx, which are making an important role in Booster approach mechanism and Prevent link break during Nodes mobility at data transaction time.
1. Husain, Shahnawaz, Ahmad, Anzaar, Chand, Mukesh ”A Fair Load Distribution Using Greedy Booster Approach in MANET ” 3rd International Conference on Data Mining (ICDM 2010), jointly organized by University of Saskatchewan Canada, IMT Gaziabad, Nanyang Technological University, Singapore.11-12 March 2010, India.

2. W. Navidi and T. Camp. “Stationary distributions for the random waypoint mobility model”, IEEE Transactions on Mobile Computing, pages 99–108, 2004.

3. Leslie D. Fife, Le Gruenwald , “Research Issues for Data Communication in Mobile Ad-Hoc Network Database Systems”, SIGMOD Record, Vol. 32, No. 2, June 2003.

4. Dunham, M. H, Helal, A., & Balakrishnan, S. “A mobile transaction that captures both data and movement behavior”, In ACMBaltzer journal on Mobile Networks and Application, VOL. 2 (1997). pp 149-162.

5. Gruenwald, L., Javed, M., and Gu, M. “Energy- Efficient Data Broadcasting in Mobile Ad-Hoc Networks”, In Proc. International Database Engineering and Applications Symposium (IDEAS '02), July, 2002.

6. G. Pei, M. Gerla, X. Hong, and C. Chiang. “A wireless hierarchical routing protocol with group mobility”, In Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC), pp 1538-1542, 1999.

7. Pitoura, E., & Bhargava, B., “Revising Transaction concept for mobile computing”, In first IEEE workshop on mobile computing systems and applications. (June 1995). pp 164-168.

8. Pitoura E.,and Bhargava B., “maintaining consistency of data in mobile distributed environments”, 15th International Conference of distributed computing system (1996), pp 404-413.

9. Walborn G., & Chrysanthis P, “Supporting semantics based transaction processing in mobile database application”, 14th IEEE symposium on reliable distributed system (1995), pp 31-40.

10. Yeo L. & Zaslavksy A. “submission of transaction from workstation in a cooperative multidatabase processing environment”, 14th ICDCS-1994.

11. P. Spentzouris, J. Amundson, “FNAL Booster Experiment and Modeling”, proc. of the 2003 particle accelerator conference, IEEE computer society.

12. CHRYSANTHIS, P. Transaction Processing in Mobile Computing Environments in IEEE Workshop on Advances in Parallel and Distributed Systems (1993).

13. Mohan, C., Harderle, D., Lindsat, B., Pirahesh, H., Schwarz, P. “Aries: A Transaction Recovery Method supporting fine granularity locking and partial rollback using write ahead logging”, In ACM Transactions on Database Systems, VOL. 17 No. 1 (March 1992). pp 94-162.

14. Arup Acharya, B. R. Badrinath, and T. Imielinski. Checkpointing Distributed Applications on Mobile Computing. In Proceedings of the Third International Conference on Parallel and Distributed Information Systems, September 1994.

15. Evaggelia Pitoura and Bharat Bhargava. Maintaining Consistency of Data in Mobile Distributed Environments. Technical Report TR-94-025, Purdue University, Dept. of Comp. Sciences,1994.

16. M.Q.Rafiq, M.Chauhan, S.Kumar, S.Husain “Mathematical simulation of Cochannel Interference Ratio for the Omni Directional Antenna in Mobile Computing” NCAICT, CSI Allahabad chapter, India,15 -16 March,2008.

17. NFS Wireless & Mobile Communications Workshop, Northern Virgenia,March 1997.

18. Dharma Prakash Agrawal and Qing- An Zeng,” Introduction to Wireless and Mobile System” University of Cincinnati.

19. P.Krishna, M.Chatterjee, N.H Vaidya,& D.K Pardhan,” A Cluster based Approach for routing in adhoc networks”, Proceeding of 2nd USENIX Symposium on Mobile and Location Independent Computing.P.1 1995

20. B.Das,V Bhargavan,”Routing in adhoc network using a spine”, IEEE International Conference on computer & communication network (ICC’97),1997.

21. Vincent D. Park and M. Scott Corson, “A performance comparison of the Temporally-Ordered Routing Algorithm and Ideal Link-state routing”. In Proceedings of IEEE Symposium on Computers and Communication ’98 , June 1998.

22. David B. Johnson and David A.Maltz, “Dynamic source routing in adhoc wireless networks”. In MobileComputing , edited by Tomasz Imielinski and Hank Korth, chapter 5, pages 153-181. Kluwer Academic Publishers.

23. Charles E. Perkins, “Ad Hoc On Demand Distance Vector (AODV) Routing”. Internet draft, draft-ietf-manet-aodv-01.txt, August 1998.

24. Charles E. Perkins, “Ad Hoc On Demand Distance Vector (AODV).

Untitled Page