?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.relation=http%3A%2F%2Fmiis.maths.ox.ac.uk%2Fmiis%2F587%2F&rft.title=Node+counting+in+wireless+ad-hoc+networks&rft.creator=Evers%2C+J&rft.creator=Kiss%2C+D&rft.creator=Kowalczyk%2C+W&rft.subject=Discrete&rft.subject=Information+and+communication+technology&rft.description=We+study+wireless+ad-hoc+networks+consisting+of+small+microprocessors+with%0D%0Alimited+memory%2C+where+the+wireless+communication+between+the+processors+can+be+highly+unreliable.+For+this+setting%2C+we+propose+a+number+of+algorithms+to+estimate+the+number+of+nodes+in+the+network%2C+and+the+number+of+direct+neighbors+of+each+node.+The+algorithms+are+simulated%2C+allowing+comparison+of+their+performance.&rft.date=2011&rft.type=Study+Group+Report&rft.type=NonPeerReviewed&rft.format=application%2Fpdf&rft.language=en&rft.identifier=http%3A%2F%2Fmiis.maths.ox.ac.uk%2Fmiis%2F587%2F1%2FAmst112.pdf&rft.identifier=++Evers%2C+J+and+Kiss%2C+D+and+Kowalczyk%2C+W++(2011)+Node+counting+in+wireless+ad-hoc+networks.++%5BStudy+Group+Report%5D+++++