Research Article
Energy-Efficient Broadcast Scheduling Algorithm in Duty-Cycled Multihop Wireless Networks
| Notation | Description |
| | a duty-cycled WSN | | the number of nodes in the network | | a working cycle | | node ’s working plan | | node ’s transmitting schedule | | the set of node ’s children which can be reached at time | | the set of all child nodes of node | | all the transmitting schedules of node | | the broadcast tree of | | the broadcast schedules of | | the auxiliary graph of | | the -th schedule node of | | the schedule node ’s primary node | | the schedule node ’s transmitting time slot | | the set of primary nodes which can be reached by | | the set of schedule nodes for the MSNC problem | | the set of all primary nodes of whose schedule node in | | the level of node | | the subtree rooted at node | | the set of node ’s neighbors | | the average number of neighbors in | | the maximum node degree of |
|
|