This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Estimating Metrical Change in Fully Connected Mobile Networks-A Least Upper Bound on the Worst Case
September 1988 (vol. 37 no. 9)
pp. 1156-1162
ASCII Text
x 
 
Y.I. Gold, S. Moran, "Estimating Metrical Change in Fully Connected Mobile Networks-A Least Upper Bound on the Worst Case," IEEE Transactions on Computers, vol. 37, no. 9, pp. 1156-1162, September, 1988.
 
 
BibTex
x
 
@article{ 10.1109/12.2272,
author = {Y.I. Gold and S. Moran},
title = {Estimating Metrical Change in Fully Connected Mobile Networks-A Least Upper Bound on the Worst Case},
journal ={IEEE Transactions on Computers},
volume = {37},
number = {9},
issn = {0018-9340},
year = {1988},
pages = {1156-1162},
doi = {http://doi.ieeecomputersociety.org/10.1109/12.2272},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - Estimating Metrical Change in Fully Connected Mobile Networks-A Least Upper Bound on the Worst Case
IS - 9
SN - 0018-9340
SP1156
EP1162
EPD - 1156-1162
A1 - Y.I. Gold,
A1 - S. Moran,
PY - 1988
KW - metrical change; mobile networks; least upper bound; virtual token passing; collision-free access control; VTP networks; local area networks; mobile radio systems; multi-access systems; protocols; time division multiplexing.
VL - 37
JA - IEEE Transactions on Computers
ER -
 
A least upper bound is derived on the amount of adjustment of virtual token passing (VTP) time needed to assure collision-free access control in VTP networks (i.e. networks that use 'time-out' or scheduling function-based access protocols) and in which nodes change their spatial configuration due to motion (although always stay within range and in line-of-sight of each other). Since the new bou

[1] I. Chlamtac, W. R. Franta, and D. Levin, "BRAM: The broadcast recognizing access method,"IEEE Trans. Commun., vol. COM-27, no. 8, Aug. 1979.
[2] M. Fine and F. A. Tobagi, "Demand assignment multiple access schemes in broadcast bus local area networks,"IEEE Trans. Comput., vol. C-33, Dec. 1984.
[3] Y. I. Gold and W. R. Franta, "An efficient collision-free protocol for prioritized access-control of cable or radio channels,"Comput. Networks, vol. 7, pp. 83-98, Apr. 1983.
[4] Y. I. Gold, W. R. Franta, and S. Moran, "A distributed channel access protocol for fully connected networks with mobile nodes,"IEEE Trans. Comput., vol. C-32, pp. 133-147, Feb. 1983.
[5] Y. I. Gold and S. Moran, "Distributed algorithms for constructing a minimum-weight spanning tree in a broadcast network,"Distributed Comput., vol. 2, pp. 139-148, 1987.
[6] T. Liu, L. Li, and W. R. Franta, "A decentralized conflict-free protocol, GBRAM for large scale local networks," inProc. NBS Comput. Networking Symp., Dec. 1981, pp. 39-54.
[7] S. Moran, "An optimization problem in geometry with applications in communication networks with mobile nodes," Comput. Sci. Dep. Tech. Rep., Technion, IIT, Haifa, Oct. 1981.
[8] F. A. Tobagi and L. Kleinrock, "Packet switching in radio channels: Part III-Polling and (dynamic) split channel reservation multiple-access,"IEEE Trans. Commun., vol. COM-24, Aug. 1976.

Index Terms:
metrical change; mobile networks; least upper bound; virtual token passing; collision-free access control; VTP networks; local area networks; mobile radio systems; multi-access systems; protocols; time division multiplexing.
Citation:
Y.I. Gold, S. Moran, "Estimating Metrical Change in Fully Connected Mobile Networks-A Least Upper Bound on the Worst Case," IEEE Transactions on Computers, vol. 37, no. 9, pp. 1156-1162, Sept. 1988, doi:10.1109/12.2272
Usage of this product signifies your acceptance of the Terms of Use.