Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2015, Vol. 38 ›› Issue (3): 103-107.doi: 10.13190/j.jbupt.2015.03.017

• Papers • Previous Articles     Next Articles

A New Transmission-Group Scheduling Mechanism for Multi-Source and Multi-Destination in Ad-Hoc Networks

GE Wei-min, WANG Qi-fei, YANG Kang, LIU Yang   

  1. School of Computer Science and Technology, Tianjin University, Tianjin 300072, China
  • Received:2014-08-12 Online:2015-06-28 Published:2015-07-03

Abstract:

Communication conflicts caused by the existing transmission group scheduling mechanism result in reducing network capacity and increasing delay under the multi-source and multi-destination scenario in Ad-Hoc network. To solve the problem, the probability of two events named F and F'k(k=2,3,4) was analyzed. And then, a new transmission-group scheduling mechanism was proposed based on two-hop relay algorithm with f-cast to suit for the multi-source and multi-destination scenario. The proposed transmission mechanism adjusts the probability of turning the internal cell in the transmission-group into the communication cell by means of the probability of two kind of events mentioned above. Analysis and simulation show that the transmission group communication scheduling mechanism proposed can effectively reduce the probability of communication conflict under multi-source and multi-destinations, and is beneficial to improve the network capacity.

Key words: Ad-Hoc, multi-source to multi-destination, transmission-group scheduling mechanism, communication conflict

CLC Number: