Hi, This (http://doi.acm.org/10.1145/1644038.1644040) paper has all the answers of your questions in detail.
Please also try writing your application using CTP in Java (using TakaTuka JVM) instead of NesC. See the tutorial at http://sourceforge.net/apps/mediawiki/takatuka/index.php?title=Collection_Tree_Protocol. regards, Faisal Xiaohui Liu wrote: > Hi all, > > What is a "client" in CTP? Is it possible that more than one clients > reside on a single mote? > > In "CtpP.nc", the size of the queue of packets to send is defined as: > QUEUE_SIZE = CLIENT_COUNT + FORWARD_COUNT, > > and in "CtpForwardingEngineP.nc" > command error_t Send.send[uint8_t client](message_t* msg, uint8_t len) { > ...... > qe = clientPtrs[client]; > qe->msg = msg; > qe->client = client; > qe->retries = MAX_RETRIES; > dbg("Forwarder", "%s: queue entry for %hhu is %hhu deep\n", > __FUNCTION__, client, call SendQueue.size()); > if (call SendQueue.enqueue(qe) == SUCCESS) { > if (radioOn && !call RetxmitTimer.isRunning()) { > post sendTask(); > } > clientPtrs[client] = NULL; > return SUCCESS; > } > ....... > > both of which mean there is at most one packet from a client pending > to be sent in the sending queue. Why isn't it possible that more than > one packets, say two, from the same client are waiting in the queue > and eventually transmitted in FIFO order? Thanks. > > -- > -Xiaohui Liu > ------------------------------------------------------------------------ > > _______________________________________________ > Tinyos-help mailing list > [email protected] > https://www.millennium.berkeley.edu/cgi-bin/mailman/listinfo/tinyos-help -- Faisal Aslam University of Freiburg http://cone.informatik.uni-freiburg.de/people/aslam/ _______________________________________________ Tinyos-help mailing list [email protected] https://www.millennium.berkeley.edu/cgi-bin/mailman/listinfo/tinyos-help
