Show simple item record

dc.contributor.authorZhao, Hen_NZ
dc.contributor.authorWei, Jen_NZ
dc.contributor.authorSarkar, NIen_NZ
dc.contributor.authorHuang, Sen_NZ
dc.date.accessioned2016-03-16T21:28:50Z
dc.date.available2016-03-16T21:28:50Z
dc.date.copyright2016-03-03en_NZ
dc.identifier.citationJournal of Network and Computer Applications, vol.65(1), pp.1 - 11 (11)en_NZ
dc.identifier.issn1084-8045en_NZ
dc.identifier.urihttp://hdl.handle.net/10292/9624
dc.description.abstractTransmission 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.abstractTransmission 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.languageEnglishen_NZ
dc.publisherElsevieren_NZ
dc.relation.urihttp://dx.doi.org/10.1016/j.jnca.2016.02.010
dc.rightsCopyright © 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.subjectWireless networks; Collision avoidance; MAC; Distributed algorithm
dc.titleE-MAC: an evolutionary solution for collision avoidance in wireless ad hoc networksen_NZ
dc.typeJournal Article
dc.rights.accessrightsOpenAccessen_NZ
dc.identifier.doi10.1016/j.jnca.2016.02.010en_NZ
aut.relation.endpage11
aut.relation.issue1en_NZ
aut.relation.pages11
aut.relation.startpage1
aut.relation.volume65en_NZ
pubs.elements-id200132


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record