Patent ID: 8705407

Claim:
A method of routing messages on a wireless sensor network (WSN) having a plurality of sensor nodes, the method comprising: identifying trigger nodes of the sensor nodes of the WSN, wherein identifying trigger nodes of the sensor nodes of the WSN comprises: determining disjoint interference-free testing teams of sensor nodes of the WSN, dividing members of each disjoint interference-free testing team into multiple groups; and testing each group of the multiple groups on different channels; assigning an identified trigger node to be a receiver during a time when victim nodes of the sensor nodes of the WSN in the vicinity of the identified trigger node are assigned as transmitters; and stopping transmission from the victim nodes when assigning the identified trigger node as a transmitter, wherein determining the disjoint interference-free testing teams of sensor nodes of the WSN comprises: finding a set of maximum number of vertex-disjoint maximal cliques of the sensor nodes of the WSN; and identifying interferences between the vertex-disjoint maximal cliques to determine sensor nodes belonging to each interference-free testing team of the disjoint interference-free testing teams, wherein finding the set of vertex-disjoint maximal cliques of the sensor nodes of the WSN comprises: inducing a unit disk graph (UDG) subgraph G′=(W,E′), where W is a set of victim nodes in the WSN and E′ is a set of edges between victim nodes within a range effected by a jammer; ordering edges in the set of edges E′ in decreasing order of length: consecutively, in the decreasing order of length, finding all maximal cliques with each edge as the longest edge; and removing every maximal clique from the all maximal cliques that intersects with a clique C of the all maximal cliques, where the clique C is a clique of the all maximal cliques which intersects with a minimum number of other cliques in the all maximal cliques, whereby after the removing of every maximal clique from the all maximal cliques that intersects with the clique C, remaining maximal cliques of the all maximal cliques provide the set of maximum number of vertex-disjoint maximal cliques.