Congestion Minimization through Collision Detection in TDMA and CSMA/CA Scheme in Wireless Mobile Ad-Hoc Network

Mobile ad-hoc network is collection of temporary nodes that are capable of dynamic forming temporary network, self organize, and infrastructure less with nodes contains routing capability. That case we can’t predict where the heavy traffic load comes and collision comes and drop actual data packet by the receiver’s and intermediate nodes, because all nodes are self governing and self controllable. In this paper, we identify several network aspects, some of which are unique to mobile ad-hoc networks, that affect congestion, as for example: data rate; data drop causes (via bandwidth, collision) number of MAC retransmissions, Minimum Contention Window etc. before that we study and analyze the result in case of medium access control as ( 802.11 and TDMA) and we found that 802.11 case collision comes because that approach cannot use RTS/CTS method after that TDMA time we found time division multiple access but packet delivery ratio less as compare to 802.11 after that we apply our CSMA/CA (carrier sense multiple access with collision avoidance mechanism) and we get collision free transmission and enhanced performance as compare to 802.11 and TDMA. In our approach we use RTS/CTS method for collision avoidance and also apply and enhance CSMA/CA via congestion control through contention window overshooting scheme and jam control technique and analyze our result on the bases of throughput, end-to-end delay, routing overhead, packet delivery ratio etc. Here we use NS-2.31 simulator for simulation of MANET and take comparative analysis between 802.11, TDMA and CSMA/CA mechanism.

[1]  Larry L. Peterson,et al.  Reasoning about naming systems , 1993, TOPL.

[2]  George Forman,et al.  An Extensive Empirical Study of Feature Selection Metrics for Text Classification , 2003, J. Mach. Learn. Res..

[3]  Yuen-Tak Yu,et al.  A comparison of MC/DC, MUMCUT and several other coverage criteria for logical decisions , 2006, J. Syst. Softw..

[4]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[5]  M. C. Vuran,et al.  On the Interdependence of Congestion and Contention in Wireless Sensor Networks , 2005 .

[6]  Michael Sannella,et al.  Constraint satisfaction and debugging for interactive user interfaces , 1994 .

[7]  A. Z. Spector,et al.  Achieving application requirements , 1990 .

[8]  T. J. Shepard,et al.  TCP/IP performance over satellite links , 1997, IEEE Netw..

[9]  Klara Nahrstedt,et al.  Understanding bandwidth-delay product in mobile ad hoc networks , 2004, Comput. Commun..

[10]  Gary Marchionini,et al.  A study on video browsing strategies , 1997 .

[11]  A. Girotra,et al.  Performance Analysis of the IEEE 802 . 11 Distributed Coordination Function , 2005 .

[12]  Ruzena Bajcsy,et al.  Congestion control and fairness for many-to-one routing in sensor networks , 2004, SenSys '04.

[13]  Hong Hua,et al.  A widget framework for augmented interaction in SCAPE , 2003, UIST '03.

[14]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[15]  Philip Tavel,et al.  Modeling and Simulation Design , 2011 .

[16]  Bernd Fröhlich,et al.  The cubic mouse: a new device for three-dimensional input , 2000, CHI.

[17]  Raj Jain,et al.  Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks , 1989, Comput. Networks.