In this paper,a probabilistic scheme is presented for directed data transmission without maintaining route tables.In the model,each message is required to reach the base station(BS)successfully with a certain probabil...In this paper,a probabilistic scheme is presented for directed data transmission without maintaining route tables.In the model,each message is required to reach the base station(BS)successfully with a certain probability.We analyze the relationship between the number of the intermediate nodes,link reliability and relay probability.We obtain the condition for relay probability which can guarantee the performance of the networks.This scheme is robust and adaptable to the change of topology of the sensor networks.Simulation with Ns-2 helps to illustrate the main results of the analysis.展开更多
文摘In this paper,a probabilistic scheme is presented for directed data transmission without maintaining route tables.In the model,each message is required to reach the base station(BS)successfully with a certain probability.We analyze the relationship between the number of the intermediate nodes,link reliability and relay probability.We obtain the condition for relay probability which can guarantee the performance of the networks.This scheme is robust and adaptable to the change of topology of the sensor networks.Simulation with Ns-2 helps to illustrate the main results of the analysis.
