Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A Cooperative MAC Protocol with Rapid Relay Selection for Wireless Ad hoc Networks
School of Electronics and Information Engineering, Beihang University, Beijing.
School of Electronics and Information Engineering, Beihang University, Beijing.
School of Electronics and Information Engineering, Beihang University, Beijing.
Shanghai Key Lab of Intelligent Information Processing, School of Computer Science, Fudan University.
Show others and affiliations
2015 (English)In: Computer Networks, ISSN 1389-1286, E-ISSN 1872-7069, Vol. 91, p. 262-282Article in journal (Refereed) Published
Abstract [en]

We propose a cooperative MAC protocol with rapid relay selection (RRS-CMAC) to improve the cooperation efficiency and multiple access performance in wireless ad hoc networks. In this protocol, if the data rate between a sender and its recipient is low, an optimal relay is selected by a rate differentiation phase (RDP), priority differentiation phase (PDP), and contention resolution phase (CRP) for relays with the same priority. In the RDP, each contending relay determines its data rate level based on the data rate from the sender to itself and that from itself to the recipient, and then broadcasts busy tones to its neighbor nodes or senses the channel according to the values of its binary digits, which are determined by its data rate level. Relays with the highest data rate levels win and continue to the next phase. In PDP, these winning relays send busy tones or sense the channel according to their own priority values, with the highest priority relays winning in this phase. Then CRP is performed using k-round contention resolution (k-CR) to select a unique optimal relay. Relays sending busy tones earliest and for the longest duration proceed to the next round, while others, sensing a busy tone, subsequently withdraw from contention. A packet piggyback mechanism is adopted to allow data packet transmission without reservation if the winning relay has a packet to send, and the direct transmission rate to its recipient is high. This reduces reservation overhead and improves channel utilization. Both theoretical analysis and simulation results show that the throughput of the proposed protocol is better than those of the CoopMACA and 2rcMAC protocols.

Place, publisher, year, edition, pages
2015. Vol. 91, p. 262-282
National Category
Media and Communication Technology
Research subject
Mobile and Pervasive Computing
Identifiers
URN: urn:nbn:se:ltu:diva-5270DOI: 10.1016/j.comnet.2015.08.020ISI: 000364436900017Scopus ID: 2-s2.0-84942104063Local ID: 354597dc-fe87-4f59-bb26-a9b800d6b071OAI: oai:DiVA.org:ltu-5270DiVA, id: diva2:978144
Note
Validerad; 2015; Nivå 2; 20150907 (andbra)Available from: 2016-09-29 Created: 2016-09-29 Last updated: 2018-07-10Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Vasilakos, Athanasios

Search in DiVA

By author/editor
Vasilakos, Athanasios
By organisation
Computer Science
In the same journal
Computer Networks
Media and Communication Technology

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 33 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf