Paper
4 January 2006 FODA: a novel efficient multiple access protocol for highly dynamic self-organizing networks
Hantao Li, Kai Liu, Jun Zhang
Author Affiliations +
Proceedings Volume 5985, International Conference on Space Information Technology; 59850Q (2006) https://doi.org/10.1117/12.655820
Event: International Conference on Space information Technology, 2005, Wuhan, China
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.
© (2006) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Hantao Li, Kai Liu, and Jun Zhang "FODA: a novel efficient multiple access protocol for highly dynamic self-organizing networks", Proc. SPIE 5985, International Conference on Space Information Technology, 59850Q (4 January 2006); https://doi.org/10.1117/12.655820
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Binary data

Network architectures

Aerospace engineering

Collision avoidance

Computer simulations

Relays

Switches

RELATED CONTENT

A novel dynamic p-cycle algorithm in ASON
Proceedings of SPIE (September 28 2006)
A deeper study on shared segment protection in mesh WDM...
Proceedings of SPIE (December 05 2005)
A novel integrated online routing algorithm in IP over WDM...
Proceedings of SPIE (December 05 2005)
Capacity fairness of WDM networks with grooming capabilities
Proceedings of SPIE (September 22 2000)

Back to Top