This study investigated the mediating role of institutional trust and affective commitment on the relationship between organizational justice and organizational citizenship behaviors. The study participants were 315 faculty members at 67 public/private universities of technology and vocational colleges in Taiwan. Structural equation modeling was used to analyze the relationships between the variables and assess the goodness of fit of the overall model. Organizational justice was positively related to institutional trust and there was an indirect effect of organizational justice on affective commitment through institutional trust. In addition, the relation between institutional trust and affective commitment was positive and affective commitment was shown to have a positive relation to organizational citizenship behaviors. Institutional trust was found to indirectly affect organizational citizenship behaviors through affective commitment. Most importantly, this study suggested a mediating effect of institutional trust and affective commitment on the relation between organizational justice and organizational citizenship behaviors. Implications, limitations, and future research were also discussed.

Key revocation plays an essential role in ensuring the confidentiality of wireless sensor networks following the compromise of one or more of the network nodes. The distributed key revocation protocol presented by Chan et al. has a rapid reaction time and avoids the single‐point failure problem inherent in centralized schemes. However, the scheme is computationally complex, requires a large storage space, and incurs high communication overheads. Accordingly, this paper proposes a novel distributed, scalable, and cost‐effective key revocation scheme based on Blom's t‐secure property. In the proposed approach, any node identified as having a malicious behavior by t or more sensor nodes is categorized as a compromised node, and its keys are immediately revoked from the entire network. The proposed scheme not only satisfies the rigorous definition of a distributed key revocation protocol but also yields a significant improvement over Chan's revocation scheme in terms of a lower storage space requirement, a reduced communication overhead, and a lower computational cost. Copyright © 2013 John Wiley & Sons, Ltd.

No abstract

SUMMARYCore-stateless mechanisms, such as core-stateless fair queuing (CSFQ), reduce the complexity of fair queuing, which usually need to maintain states, manage buffers, and perform flow scheduling on a per-flow basis. However, they require executing label rewriting and dropping decision on a per-packet basis, thus preventing them from being widely deployed. In this paper, we propose a novel architecture based on CSFQ without per-packet labelling. Similarly, we distinguish between edge routers and core routers. Edge routers maintain the per-flow state by employing a fair queuing mechanism to allocate each flow a fair bandwidth share locally and a token bucket mechanism to regulate those flows with feedback packets sent from egress edge routers. Core routers do not maintain per-flow state; they use FIFO packet scheduling extended by a fare rate alarm mechanism by estimating the arrival rate and the number of flows using a matching-mismatching algorithm. The novel scheme is called core-stateless fair rate estimation fair queuing (CSFREFQ). CSFREFQ is proven to be capable of achieving max-min fairness. Furthermore, we present and discuss simulations and experiments on the performance under different traffic scenarios.

No abstract