Sorry, I have not much time to go into the details but I encourage you to do the next:
Rather than just reading the tutorials try to follow them and make the examples. Then design a simple network of 2 nodes in which each node has a finite state machine, and it changes state depending on its own state and the signal coming from the other node. It should be straightforward once you have implemented the examples in the tutorials. After these two steps, then redesign the network, now for 3 nodes, and design a fsm for neighbor discovery. This step should not be too difficult, at least from the TinyOS point of view. Finally you will have enough experience to get into the graph algorithms. I am sorry not to be more explicit. But I really think that the tutorials are a great starting point. They do not take too much time and you will learn all the basics to start with your own problem. Good luck! Cheers!!! Sergio On Fri, Feb 3, 2012 at 8:18 PM, Ali Daylamani <[email protected]>wrote: > I have started reading the tutorials,and I know some basical things,but I > have no idea about how can I write this program. > I have to simulate 50 nodes whith tossim.. can u help me? > > *From:* Sergio Valcarcel <[email protected]> > *To:* Ali Daylamani <[email protected]> > *Cc:* "[email protected]" < > [email protected]> > *Sent:* Friday, February 3, 2012 1:13 PM > *Subject:* Re: [Tinyos-help] tiny os project > > Hi, > > You may start reviewing the tutorials to understand how to make a state > machine in the motes, using timers, communications and so on. > > Cheers! > Sergio > > > On Wed, Feb 1, 2012 at 12:11 AM, Ali Daylamani <[email protected]>wrote: > > dear friends****** > can any body help me to write this application?**** > I have to write a programm in nesc that will be run on some nodes and > create a MIS (Maximal Independent set )**** > To formally define the rules the following predicates defined for each > node v are needed**** > * * > *inNeighbor**(v)*≡∃*w *∈ *N(v)*: *w.**state *= IN.**** > *waitNeighborWithLowerId**(v)*≡∃*w *∈ *N(v)*:**** > *w.state*= WAIT ∧ *w.**id * <http://w.id>*<v.**id*.**** > *inNeighborWithLowerId**(v)*≡∃*w *∈ *N(v)*:**** > *w.state*= IN ∧ *w.**id **<v.**id*.**** > > > > **** > The self-stabilizing algorithm *A*MIS uses the following four rules:**** > 1. **** > *state *= OUT∧・ﾊ*inNeighbor**(v)*→*state *:= WAIT.**** > 2. **** > *state *= WAIT ∧ *inNeighbor**(v)*→*state *:= OUT.**** > 3. **** > *state *= WAIT ∧ ・ﾊ*inNeighbor**(v) *∧**** > ¬ wait*NeighborWithLowerId**(v)*→*state *:= IN.**** > 4. **** > *state *= IN ∧ *inNeighbor**(v)*→*state *:= OUT.**** > > _______________________________________________ > Tinyos-help mailing list > [email protected] > https://www.millennium.berkeley.edu/cgi-bin/mailman/listinfo/tinyos-help > > > > >
_______________________________________________ Tinyos-help mailing list [email protected] https://www.millennium.berkeley.edu/cgi-bin/mailman/listinfo/tinyos-help
