No abstract

No abstract

The purpose of this paper is to expose students to a simple and efficient load flow algorithm for a radial distribution system (RDS). The basic structure and properties of the RDS are discussed, followed by an illustrative description of the load flow algorithm. The proposed load flow algorithm exploits the tree-type structure of the RDS and uses data structures efficiently. The flowchart and pseudo-codes of the algorithm have been included to help the students in writing their own program. The time and space complexity of the algorithm have also been discussed. The treatment and analysis will be useful for students' understanding of RDS, use of data structures in programming, and approximate complexity analysis of algorithms. The instructors can effectively use the contents of the paper for a basic lecture on RDS (PDF files of the Microsoft PowerPoint slides and C language program code can be downloaded from the website http://www1.mmu.edu.my/∼nirod/).

The overall performance and thus the achievable efficiency of wireless sensor networks (WSNs) rely on the type of protocols deployed to support particular application in hand. In WSN, network's lifetime depends upon the residual energy of individual nodes. In this paper; a brief survey comprises of various reported methodologies that make uses of geographical location attributes for routing in WSN is presented. To assist the routing algorithm on location aspect of the source and destination as well as other intermediate nodes; a location index is formulated based on binary encoded spatial frames. The merit of proposed spatial encoding scheme is its supportiveness on scalability aspects, so it can be easily tailored to accommodate hierarchy based network architectures. Further, the schemeincorporates an effective mechanism to select cluster heads for each cluster in such a way so as to avoid the localization of hot spot effects right from cluster level to network level.

No abstract