Message Complexity Analysis of TDMA Ad-hoc Network MAC Protocols 


Vol. 34,  No. 8, pp. 768-776, Aug.  2009


PDF Full-Text
  Abstract

This paper analyses the message complexity of TDMA ad hoc MAC protocols. Since the network resource of ad hoc networks is limited due to the multiple interferences and the contention-based wireless channel, the scalability issue is one of the main research topics in developing ad hoc algorithms. Simulation demonstrates that SMACS protocol has the lowest message complexity, whereas TMMAC has the highest. In addition, it is found that since the effect of unicast dominates in the message complexity compared to other factors with an increasing number of nodes, Z-MAC tends to have the property of linearity, whereas BMA and TMMAC show exponential increases in their complexities.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

S. Kim, "Message Complexity Analysis of TDMA Ad-hoc Network MAC Protocols," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 8, pp. 768-776, 2009. DOI: .

[ACM Style]

Sang-Chul Kim. 2009. Message Complexity Analysis of TDMA Ad-hoc Network MAC Protocols. The Journal of Korean Institute of Communications and Information Sciences, 34, 8, (2009), 768-776. DOI: .

[KICS Style]

Sang-Chul Kim, "Message Complexity Analysis of TDMA Ad-hoc Network MAC Protocols," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 8, pp. 768-776, 8. 2009.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880