International Journal of Scientific & Engineering Research Volume 2, Issue 6, June-2011 1

ISSN 2229-5518

A Mechanism for Booster Approach in Mobile

Ad Hoc Network

Ahamd Anzar, Husain Shanawaz, Dr S.C Gupta

AbstractIn 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 sys- tem/approach which can handle such types of situation and prevent frequent link failure. To overcome this Link failure we intro-

duced 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 pow- er (Threshold level- minimum power require for communication between nodes), Distance between Tx and Rx, which are mak- ing an important role in Booster approach mechanism and Prevent link break during Nodes mobility at data transaction time.

Index Terms— MANET, Mechanism, Node, CHG,Booster, Tx/Rx Power.

—————————— • ——————————

1 INTRODUCTION

dhoc Network is self organizing, Multi-Hop based future technology, But in MANET we have some various challenges like Battery Back up, Node Mo-

bility, Bandwidth constraint, Routing Protocols & Security problems. As we know MANET is used where no infra- structure is available for communication, such like disas- trous area, military application. A mobile Transaction is structured as a Distributed transaction [2, 3]. In which the transaction is completed by the help of mobile nodes, providing different services. The mobile environment produces the significant challenges to transaction process- ing. The wireless network provides limited bandwidth so network bandwidth is a scarce resource. Battery power drains with data transmission and transaction processing. Due to the Dynamic mobility of nodes it affect to the communication link which should be maintain properly during mobility. Here we are trying to prevent data loss during node mobility. For this we develop a Booster Technique. Booster is a kind of Device and Algo’s combi- nation attached within the equipment as

————————————————

Anzar Ahamd is currently pursuing Phd in Mobile Ad Hoc Network in Graphic Era University, India, PH-09634321293. E-mail: anz.hmd@gmail.com

Shahnawaz Husain is currently pursuing Phd in Mobile AdHoc Net- work in Graphic Era University, India, PH-097585804269. E-mail: shahnawaz.husain@gmail.com

laptop, mobile etc. and as per the requirement Booster operate automatically need not require manually. Before operate 1st it will check the device parameters which are

require for operating this like (Tx power, Rx power- Threshold level, Distance between Tx and Rx). Once Booster activated the mobile node can cover to each other without any difficulty. Primary applications of MANET are military tactical application, oceanography and the situation where a human being is unable to go and we have the condition to access the information about the climate and environment of that location. Various ap- proaches have been given to manage a MANET. The Booster Approach is Newest and Latest in this direction which can be helpful for Mobile Ad hoc Network.

2 Related Work

In this model assuming that each node in MANET is booster enabled, a threshold value is used to activate and deactivate the booster. The threshold power level (TMIN) value is related to strength of signal. All the nodes in the cluster send the performance table to the cluster head (CH). According to efficiency of the node CH maintains a Performance table. On the basis of efficiency the CH as- sign the task to the nodes in the cluster. If any node goes out from the cluster and receiving a low signal (equiva- lent to link failed), then outgoing node checks the value of signal strength, if signal strength is less than threshold power level (TMIN) then booster becomes active, the boost- er amplifies the signal, the node which is somehow con- nected to outgoing node also activate its booster when it realize the equivalence of link failure.

Here, The provided approach showing that the clus- ter head always try to tie up with the efficient node with-

IJSER © 2011 http://www.ijser.org

International Journal of Scientific & Engineering Research Volume 2, Issue 6, June-2011 2

ISSN 2229-5518

in its cluster, through the use of signal booster technology.

. Using this technique we can increase strength to the var- ious QoS models in MANET, & designing of low weighted and less battery consumption enabled boosters.

3 Proposed Model

In MANET we can not restrict over the speed of node i.e they are free to move any where. So provided approach showing that the cluster Head(CH) always to tie up with the efficient node within its cluster, through the use of signal booster Technology. So in the proposed model we developed a mechanism for booster RF approach..
In proposed mechanism we are taking three major points into consideration.. [7]
• Tx Power level.
• Rx Power level (Threshold level- minimum pow- er level require for communication between nodes).
• Distance between Tx and Rx.
node N-A so as per the formula if distance increases Rx power level will decreases. After a certain time of period if node N-1 has Rx power level will reach the Threshold power level its Booster will activated automatically and at the same time node N-1 send MEP packets to node N- A. Informing its Rx power level to node N-A.
As node N-A get this MEP packet its Booster will be automatically activated and both the nodes try to recon- nect in order to enhance the power level and make proper Communication.
Before doing all these things we have to consider some points-
1. Tx power of mobile.
2. Rx power of mobile. (i.e. Threshold Power level)
3. Distance between Tx and Rx.
4. Formula

Pr=Pt*Gt*Gr/(4rrr/A)2

1 Step – Tx Power level—
In this step we are dealing with the Tx power of nodes in
Adhoc network. As we know more Tx power covers more area and increase vicinity and the data loss chances be- come less.

TABLE 1
Transmission power level and its corresponding transmission range of a node

Fig-1 Nodes mobility in single network.

As we can see in the fig.1 we are focusing on Node N-A and node N-1. Here node N-A wants to communicate to node N-1 But both nodes are far from each other due to this communication link can be Break and the data can be lost. To prevent this we have to increase the Power (Strength) level of our signal. To increase the Power level we are introducing “Booster Mechanism”.
In this Mechanism, 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 N/w.
Before Booster activated. 1st Both of the node (N-A & N-1) should know the Rx power level of each other. Here we introduce MEP packets (Message packet). MEP pack- ets are responsible for Exchanging of data including Rx power level between nodes in Adhoc network.
Once both the nodes know the Rx power level of each other they compare it with Threshold power level (mini. Power level require for communication between nodes) and if current Rx power level reaches the Thre- shold level they will activate their Booster respectively. Suppose in the given fig.1 node N-1 is moving far from
After analyzing these results we can say our net- work support up to 250 m. single hop communication (Maxi. Communication distance between one node to another node directly) without facing any difficulty and for 1 m distance we require approximate 0.1 db Tx power in Ad hoc network.
As per given formula we can say as distance in- crease Tx power level increase while Rx power level de- crease.
2 & 3 Step- Rx Power level with respect to distance—

IJSER © 2011 http://www.ijser.org

International Journal of Scientific & Engineering Research Volume 2, Issue 6, June-2011 3

ISSN 2229-5518


Figure-Received power Vs Distance

TABLE 2

Receive power level and its corresponding Receive range of a node

Level

Receive Power (Threshold

Level) (dbm)

Distance

(m)

4

-199

250

3

-192

200

2

-185

150

1

-178

100

So, here as distance increases Rx power level decreases. With the help of given curve Rx power level vs. distance we can say our Threshold Rx power level is = -199 dbm. At 250 m. (for ad-hoc wireless network).
Where Tx power = 26.82 db.
Rx power level (Maxi. Threshold level) approximate = -
199 dbm.
Distance between Tx and Rx = 250m.

4 CONCLUSION

Mobile Adhoc Network is the future technology; we have provided the mechanism for Booster approach .By the proposed mechanism we can save the efficient node in the cluster which may be responsible to maintain com- munication in our cluster.By measuring Tx power level, Rx power level (Threshold level) and Maximum. Dis tances between nodes. This paper has proposed the ap- proach in which cluster head always try to tie up with the efficient node within its cluster through the use of Booster Technology. Using this this approach we can increase network efficiency and also increase the QOS of network.

REFRENCES

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), joint-

ly organized by University of Saskatchewan Canada, IMT Ga- ziabad, Nanyang Technological University, Singapore.11-12

March 2010, India.

2. W. Navidi and T. Camp. “Stationary distributions for the ran-

dom waypoint mobility model”, IEEE Transactions on Mobile

Computing, pages 99–108, 2004.

3. Leslie D. Fife, Le Gruenwald , “Research Issues for Data Com-

munication 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 transac- tion that captures both data and movement behavior”, In ACM- Baltzer 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. Internation- al Database Engineering and Applications Symposium (IDEAS

'02), July, 2002.

6. G. Pei, M. Gerla, X. Hong, and C. Chiang. “A wireless hierar- chical 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 compu- ting 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 worksta-

tion 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 Compu-

ting 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 granu- larity 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 Consisten-

cy of Data in Mobile Distributed Environments. Technical Re-

port TR-94-025, Purdue University, Dept. of Comp. Sciences,1994.

16. M.Q.Rafiq, M.Chauhan, S.Kumar, S.Husain “Mathematical si- mulation of Cochannel Interference Ratio for the Omni Direc- tional 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 Clus-

ter based Approach for routing in adhoc networks”, Proceeding

IJSER © 2011 http://www.ijser.org

International Journal of Scientific & Engineering Research Volume 2, Issue 6, June-2011 4

ISSN 2229-5518

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 & communica- tion network (ICC’97),1997.

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

22. David B. Johnson and David A.Maltz, “Dynamic source routing in adhoc wireless networks”. In MobileComputing , edited by To- masz 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).

IJSER © 2011 http://www.ijser.org