Open Access Open Access  Restricted Access Subscription Access

To Perform Scheduling in Least Interference Effect Algorithm Based On Manet

R.Prem Kumar

Abstract


Scheduling enables concurrent reception and cancellation of interference, which minimizes the computational complexity. The scheduling avoids traffic demands for the receiver. We proposing heuristic algorithm for rectify the traffic demands and path loss. The algorithm based on the Interference Effect of the link. We use Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA)   for   avoid   collision while transmission between multiple transmitter and single receiver.  We simulate the algorithm in Wireless Mobile Ad-hoc Network with lower computational complexity. Index terms - MANET, scheduling, Interference effect, CSMA/CA.


Full Text:

PDF

References


P. Gupta and P. Kumar, “The capacity of wireless networks,” IEEE Trans. Inf. Theory, 2000; 46 (2): pp. 388–404.

N. I. Miridakis and D. D. Vergados, “A survey on the successive interference cancellation performance for single-antenna and multipleantenna OFDM systems,” IEEE Commun. Surveys Tuts., 2013; 15(1): pp. 312–335.

M. Kontik and S. C. Ergen, “Scheduling in single-hop multiple access wireless networks with successive interference cancellation,” IEEE Wireless Commun. Lett., 2014; 3(2): 197–200.

M. Yazdanpanah, S. Sebbah, C. Assi, and Y. Shayan, “Impact of successive interference cancellation on the capacity of wireless networks: Joint optimal link scheduling and power control,” in Proc. IEEE ICC, Jun. 2013, pp. 1582–1587.

S. Lv, W. Zhuang, X. Wang, and X. Zhou, “Link scheduling in wireless networks with successive interference cancellation,” Comput. Netws., 2011; 55(13): 2929–2941.

S. Lv, W. Zhuang, X. Wang, C. Liu, and X. Zhou, “Maximizing capacity in the SINR model in wireless networks with successive interference cancellation,” in Proc. IEEE ICC, Jun. 2011, pp. 1–6.

R. Bruno, M. Conti, and E. Gregori, “Mesh networks: Commodity multihop ad hoc networks,” IEEE Commun. Mag., 2005;43 (3): 123–131.

S. Kompella, J. Wieselthier, A. Ephremides, H. Sherali, and G. Nguyen, “On optimal SINR-based scheduling in multihop wireless networks,” IEEE/ACM Trans. Netw., 2010; 18(6): 1713–1724.

Y. Sadi and S. C. Ergen, “Minimum length scheduling with packet traffic demands in wireless networks,” IEEE Trans. Wireless Commun., 2014; 13(7): 3738–3751.

S. Weber, J. Andrews, X. Yang, and G. de Veciana, “Transmission capacity of wireless ad hoc networks with successive interference cancellation,” IEEE Trans. Inf. Theory, 2007; 53(8): 2799–2814.


Refbacks

  • There are currently no refbacks.