摘要 |
During each node's awake period, each node multicasts the relative time or slot of their next awake period (beaconing interval) to all neighboring nodes. This enables each node to intelligently and independently schedule the time slot of its next transmission based on the beaconing intervals of the nodes it has heard from. During each active (awake) interval, a node builds statistics of the future transmission/receive times of its neighbors and uses them to determine its next transmission time. In one proposed implementation, at the end of an active interval, a node picks the time slot with the highest counter for its next transmission. In another proposed implementation, at the end of an active interval, a node picks one of the slots with a weighted probability; the weight of each slot is proportional with the value of the counter associated with the slot. |
申请人 |
MOTOROLA, INC.;CARBUNAR, BOGDAN, O.,;MOHAPATRA, SHIVAJIT,;PEARCE, MICHAEL, D.,;RITTLE, LOREN, J.,;VASUDEVAN, VENUGOPAL, |
发明人 |
CARBUNAR, BOGDAN, O.,;MOHAPATRA, SHIVAJIT,;PEARCE, MICHAEL, D.,;RITTLE, LOREN, J.,;VASUDEVAN, VENUGOPAL, |