The authors present an efficient update procedure for stations inna multihop S-ALOHA packet radio network. Implicit acknowledgementsn(ACK/NAK) will be provided for point-to-point and broadcastncommunications. The simulation results show the mean delay of packets tonstations in a 1-, 2- or 3-hop environment. The results indicate thenadmissible ratio of the generation probability q (packets/slot)nto the transmission probability p (packets/slot) of own and relaynpackets, respectively. Furthermore, the frequency of topological changesnand the mean distance from a station, having gained/lost contact to somenneighboring station, to other stations needing update of their localndata base are investigated through simulation. It is concluded that, duento the quite local influence of topological changes on multihop routes,na completely decentral routing of packets should work well. Further, annovel asynchronous algorithm to update the routing tables of stations isndefined and evaluated, which has a considerably small demand on channelncapacity
展开▼
