E-MAC: an evolutionary solution for collision avoidance in wireless ad hoc networks
| aut.relation.endpage | 11 | |
| aut.relation.issue | 1 | en_NZ |
| aut.relation.pages | 11 | |
| aut.relation.startpage | 1 | |
| aut.relation.volume | 65 | en_NZ |
| aut.researcher | Sarkar, Nurul | |
| dc.contributor.author | Zhao, H | en_NZ |
| dc.contributor.author | Wei, J | en_NZ |
| dc.contributor.author | Sarkar, NI | en_NZ |
| dc.contributor.author | Huang, S | en_NZ |
| dc.date.accessioned | 2016-03-16T21:28:50Z | |
| dc.date.available | 2016-03-16T21:28:50Z | |
| dc.date.copyright | 2016-03-03 | en_NZ |
| dc.date.issued | 2016-03-03 | en_NZ |
| dc.description.abstract | Transmission collision is a main cause of throughput degradation and non-deterministic latency in wireless networks. Existing collision-avoidance mechanisms for distributed wireless networks are mostly based on the random backoff strategy, which cannot guarantee collision-free accesses. In this paper, we design a simple collision-avoidance MAC (E-MAC) for distributed wireless networks that can iteratively achieve collision-free access. In E-MAC, each transmitter will adjust its next transmission time according to which part of its packets suffering from the collision. And the iteration of this adjustment will quickly lead group of nodes converging to a collision-free network. E-MAC does not require any central coordination or global time synchronization. It is scalable to new entrants to the network and variable packet lengths. And it is also robust to system errors, such as inaccurate timing. | en_NZ |
| dc.description.abstract | Transmission collision is a main cause of throughput degradation and non-deterministic latency in wireless networks. Existing collision-avoidance mechanisms for distributed wireless networks are mostly based on the random backoff strategy, which cannot guarantee collision-free accesses. In this paper, we design a simple collision-avoidance MAC (E-MAC) for distributed wireless networks that can iteratively achieve collision-free access. In E-MAC, each transmitter will adjust its next transmission time according to which part of its packets suffering from the collision. And the iteration of this adjustment will quickly lead group of nodes converging to a collision-free network. E-MAC does not require any central coordination or global time synchronization. It is scalable to new entrants to the network and variable packet lengths. And it is also robust to system errors, such as inaccurate timing. | |
| dc.identifier.citation | Journal of Network and Computer Applications, vol.65(1), pp.1 - 11 (11) | en_NZ |
| dc.identifier.doi | 10.1016/j.jnca.2016.02.010 | en_NZ |
| dc.identifier.issn | 1084-8045 | en_NZ |
| dc.identifier.uri | https://hdl.handle.net/10292/9624 | |
| dc.language | English | en_NZ |
| dc.publisher | Elsevier | en_NZ |
| dc.relation.uri | http://dx.doi.org/10.1016/j.jnca.2016.02.010 | |
| dc.rights | Copyright © 2016 Elsevier Ltd. All rights reserved. This is the author’s version of a work that was accepted for publication in (see Citation). Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. The definitive version was published in (see Citation). The original publication is available at (see Publisher's Version). | |
| dc.rights.accessrights | OpenAccess | en_NZ |
| dc.subject | Wireless networks; Collision avoidance; MAC; Distributed algorithm | |
| dc.title | E-MAC: an evolutionary solution for collision avoidance in wireless ad hoc networks | en_NZ |
| dc.type | Journal Article | |
| pubs.elements-id | 200132 | |
| pubs.organisational-data | /AUT | |
| pubs.organisational-data | /AUT/Design & Creative Technologies |