Multihop clustering algorithm for load balancing in wireless sensor networks

The paper presents a new cluster based routing algorithm that exploits the redundancy properties of the sensor networks in order to address the traditional problem of load balancing and energy efficiency in the WSNs.The algorithm makes use of the nodes in a sensor network of which area coverage is covered by the neighbours of the nodes and mark them as temporary cluster heads. The algorithm then forms two layers of multi hop communication. The bottom layer which involves intra cluster communication and the top layer which involves inter cluster communication involving the temporary cluster heads. Performance studies indicate that the proposed algorithm solves effectively the problem of load balancing and is also more efficient in terms of energy consumption from Leach and the enhanced version of Leach

Relationships Between Higher Education Leaders and Subordinates in Pakistan: A Path-Goal Approach

This article is based on a quantitative research to examine the leadership behaviour of degree college principals, selected personal and organizational characteristics, acceptance of leadership, faculty job satisfaction and job expectancies. Leadership style was defined in four dimensions – directive, supportive, participative, and achievement-oriented. The measuring instrument comprised 120 items and was administered to the randomly selected sample of 854 lecturers and 138 principals. Twenty-six hypotheses were tested in educational setting. MANCOVA and ANCOVA were used to discover the moderating affect of situational variables on the relationship of leadership style and subordinates’ outcomes, controlling the effect of role ambiguity and stress of the principals. The moderators tested in three-way interactions included need for autonomy, need for achievement, perception about ability, locus of control, task structure and stress. Findings indicated that the support for House’s path-goal theory was limited. Only 16 of the 26 three-way interactions accorded with the predictions of theory

On Secure Transmission over Parallel Relay Eavesdropper Channel

We study a four terminal parallel relay-eavesdropper channel which consists of multiple independent relay-eavesdropper channels as subchannels. For the discrete memoryless case, we establish inner and outer bounds on the rate-equivocation region. For each subchannel, secure transmission is obtained through one of the two coding schemes at the relay: decoding-and-forwarding the source message or confusing the eavesdropper through noise injection. The inner bound allows relay mode selection. For the Gaussian model we establish lower and upper bounds on the perfect secrecy rate. We show that the bounds meet in some special cases, including when the relay does not hear the source. We illustrate the analytical results through some numerical examples.Comment: 8 pages, Presented at the Forty-Eighth Annual Allerton Conference on Communication, Control, and Computing, September 29 - October 1, 2010, Monticello, IL, US