TY - GEN
T1 - A reliable peer-to-peer protocol for mobile ad-hoc wireless networks
AU - Al-Mouhamed, M. A.
AU - Khan, I. A.
AU - Firdous, S. N.
PY - 2011
Y1 - 2011
N2 - Reliable, fast, and power aware communication is needed for Ad-Hoc wireless networks. Current techniques based on client-server and Publish/Subscribe communication models are not suitable in multi-robot systems and generally for mobile applications. For this we propose a reliable peer-to-peer protocol based on a UDP Broadcast and Token Passing (UBTP). The protocol is implemented on a WLAN using the Stargate embedded system. For this, a customized UDP protocol with an imperative Poll-based communication is proposed. The protocol is implemented using (1) a communication thread (TC) and (2) a processing thread (TP). A test bed system which allows modules to run TC and TP, in addition to the generation of broadcast request is presented. We used symmetric code in each node. Evaluation reports the distribution of auction completion times for peer-to-peer operations. The evaluation reveals: (1) response times are comparable to UBTP operated at head node, (2) improved degree of reliability as at most 2 steps are sufficient for auctioning seven nodes, (3) proved fairness, and (4) comparable power consumption to simple UBTP.
AB - Reliable, fast, and power aware communication is needed for Ad-Hoc wireless networks. Current techniques based on client-server and Publish/Subscribe communication models are not suitable in multi-robot systems and generally for mobile applications. For this we propose a reliable peer-to-peer protocol based on a UDP Broadcast and Token Passing (UBTP). The protocol is implemented on a WLAN using the Stargate embedded system. For this, a customized UDP protocol with an imperative Poll-based communication is proposed. The protocol is implemented using (1) a communication thread (TC) and (2) a processing thread (TP). A test bed system which allows modules to run TC and TP, in addition to the generation of broadcast request is presented. We used symmetric code in each node. Evaluation reports the distribution of auction completion times for peer-to-peer operations. The evaluation reveals: (1) response times are comparable to UBTP operated at head node, (2) improved degree of reliability as at most 2 steps are sufficient for auctioning seven nodes, (3) proved fairness, and (4) comparable power consumption to simple UBTP.
KW - mobile ad-hoc networks
KW - mobile robotics
KW - peer-to-peer protocols
KW - performance evaluation
KW - wireless networks
UR - https://www.scopus.com/pages/publications/84857695164
U2 - 10.1109/AICCSA.2011.6126585
DO - 10.1109/AICCSA.2011.6126585
M3 - Conference contribution
AN - SCOPUS:84857695164
SN - 9781457704741
T3 - Proceedings of IEEE/ACS International Conference on Computer Systems and Applications, AICCSA
SP - 32
EP - 37
BT - Proceedings of the 2011 9th IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2011
ER -