Abstract. In this paper, we consider wireless sensor networks where nodes have random and changeable mobility patterns. We study the problem where a particular node, called the base station, collects the data generated by the sensors/nodes. The nodes deliver the data to the base station at the time when they are close enough to the base station to ensure a direct transmission. While the nodes are too far to transmit to the base station, they store the data in a limited capacity internal FIFO queue. In the case where the queue is full, the new generated data are inserted in the queue and the oldest data are lost. In order to ensure, with a high probability, that the base station receives the generated data, the nodes disseminate the generated data in the network. The dissemination process consists in transmitting the data to others mobile nodes which are close enough to ensure a direct transmission. The nodes must control the dissemination process. Indeed, if the nodes send systematically the data to the neighbouring nodes then, the FIFO queues are going to be quickly saturated and the data lost (the dissemination process duplicate the generated data). On the other hand if the nodes do not disseminate the data, the data queued first are prone to be systematically lost if the capacity of the queue is too limited. We propose a protocol based on the estimate of the delivery probabilities of the data. Each node estimates the delivery probabilities of all the queued data. These probabilities depend on the position of the data in the queue and, on the dissemination process. The lower is the delivery probability the more the nodes disseminate the data to increase the delivery guarantee to the base station. In that way, all the messages get a high probability to be delivered to the base station (higher that some predefined threshold). Experimental validations of the protocol show that the protocol performs well and outperforms an existing protocol.

No abstract

1   is the minimum signal straight necessary on receiver node for successfully receiving a message.

Quantitative characterization of randomly roving agents in Agent Based Intrusion Detection Environment (ABIDE) is studied. Formula simplifications regarding known results and publications are given. Extended Agent Based Intrusion Detection Environment (EABIDE) is introduced and quantitative characterization of roving agents in EABIDE is studies.

Abstract-Quantitative characterization of randomly roving agents in wireless sensor networks (WSN) is studied. Below the formula simplifications, regarding the known results and publications. It is shown that the basic agent model is probabilistically equivalent to a similar simpler model and then a formula for frequencies is achieved in terms of Stirling numbers of the second kind. Stirling numbers are well studied and different estimates are known for them letting to justify the roving agents quantitative characteristics.Index Terms-Intrusion detection system, wireless sensor network, roving agents.