C. Florens and M. Franceschetti, "Data distribution strategies for sensor networks," manuscript in preparation.  Home/Search   Document Not in Database   Summary   Related Articles

....algorithm is optimal when the number of data packets at distance 0 and 1 from the BS is zero. If it is not the case, the algorithm needs to be refined, in particular estimates ties should not be broken randomly in general. This as well as a general case proof will appear in a forthcoming paper [14]. In this proof we assumed that relay sensor nodes can only perform simple receive and forward type operations in which a data packet is to be forwarded in the TS following its arrival at a relay node. Note that time performance may be further improved, if we assume that nodes have the ability to ....

....illustrated in the following example (Fig. 3: if the simplest relay nodes are being used the completion time is 10TS, whereas it may be as low as 9TS when the smarter nodes are used. However in the directional antenna case the time performance is 9TS either way. This issue is further explored in [14]. 4 3 1 3 5 7 1 3 5 7 9 10 Fig. 3. Optimal distribution schedules of a 2 line sensor network. The completion time are respectively 10 TS (dumb sensor node hypothesis) and 9 TS (smart sensor hypothesis) C. Tree networks, case where degree of base station is 1 Throughout this ....

[Article contains additional citation context not shown here]

C. Florens and M. Franceschetti, "Data distribution strategies for sensor networks," manuscript in preparation.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC