Share Email Print
cover

Proceedings Paper

FODA: a novel efficient multiple access protocol for highly dynamic self-organizing networks
Author(s): Hantao Li; Kai Liu; Jun Zhang
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Based on the concept of contention reservation for polling transmission and collision prevention strategy for collision resolution, a fair on-demand access (FODA) protocol for supporting node mobility and multihop architecture in highly dynamic self-organizing networks is proposed. In the protocol, a distributed clustering network architecture formed by self-organizing algorithm and a main idea of reserving channel resources to get polling service are adopted, so that the hidden terminal (HT) and exposed terminal (ET) problems existed in traffic transmission due to multihop architecture and wireless transmission can be eliminated completely. In addition, an improved collision prevention scheme based on binary countdown algorithm (BCA), called fair collision prevention (FCP) algorithm, is proposed to greatly eliminate unfair phenomena existed in contention access of newly active ordinary nodes and completely resolve access collisions. Finally, the performance comparison of the FODA protocol with carrier sense multiple access with collision avoidance (CSMA/CA) and polling protocols by OPNET simulation are presented. Simulation results show that the FODA protocol can overcome the disadvantages of CSMA/CA and polling protocols, and achieve higher throughput, lower average message delay and less average message dropping rate.

Paper Details

Date Published: 5 January 2006
PDF: 5 pages
Proc. SPIE 5985, International Conference on Space Information Technology, 59850Q (5 January 2006); doi: 10.1117/12.655820
Show Author Affiliations
Hantao Li, Beihang Univ. (China)
Kai Liu, Beihang Univ. (China)
Jun Zhang, Beihang Univ. (China)


Published in SPIE Proceedings Vol. 5985:
International Conference on Space Information Technology

© SPIE. Terms of Use
Back to Top