Ali Maqousi

Towards an open architecture for Smart Grid communications: Possible pointers from multiservice network research

This paper addresses the challenge of developing communications architecture for the Smart Grid. It considers the similarity between the QoS requirements for Smart Grid communication and those addressed by previous work into multiservice networks and QoS Architectures. It discusses this previous work within the context of Smart Grid requirements and identifies the contribution it could make to the development of Smart Grid communications architecture.

Analyzing the Effect of Node Density on the Performance of the LAR-1P Algorithm

The location-aided routing scheme 1 (LAR-1) and probabilistic algorithms are combined together into a new algorithm for route discovery in mobile ad hoc networks (MANETs) called LAR-1P. Simulation results demonstrated that the LAR-1P algorithm reduces the number of retransmissions as compared to LAR-1 without sacrificing network reachability. Furthermore, on a sub-network (zone) scale, the algorithm provides an excellent performance in high-density zones, while in low-density zones; it preserves the performance of LAR-1. This paper provides a detailed analysis of the performance of the LAR-1P algorithm through various simulations, where the actual numerical values for the number of retransmissions and reachability in high- and low-density zones were computed to demonstrate the effectiveness and significance of the algorithm and how it provides better performance than LAR-1 in high-density zones. In addition, the effect of the total number of nodes on the average network performance is also investigated.

Network level Quality of Service (QoS) challenges for smart grid measurement and control systems

This paper focuses on the firm real-time requirements of Time-Critical Wide Area Measurement and Control systems, that are expected to play a major role in future Smart Grids. It analyses the operation of these systems and identifies their communication traffic characteristics. It shows that these characteristics are significantly different to those of the current near real-time Wide Area Measurement applications that provide visualization to support manual grid control. It then discusses the performance evaluation of these time critical systems and presents the second stage in an ongoing body of work aimed at developing models and techniques to carry out the performance evaluation process. It presents some preliminary results and outlines the direction for future work.

A control framework to develop smart grid communications: possible pointers from multiservice network research

This paper addresses the challenge of developing an architecture for the smart grid with the particular focus to support smart grid communication. It considers the smart grid system in general to identify the relationship between the power distribution and communication networks, and then focuses mainly on smart grid communication requirements. It observes the similarity between the quality of service (QoS) requirements for smart grid communications and those identified in multiservice networking. It reviews the principles of open communication and introduces architectures for open communication that have been enhanced to meet the requirements of multiservice. It discusses previous research into multiservice with a review into recent work focused on meeting the multiservice requirements of smart grid communications. Based on these, the paper presents key specific pointers toward defining a contextual control framework for the data transport system of the smart grid.

EVALUATING THE PERFORMANCE OF THE LOCATION-AIDED ROUTING-1P ROUTE DISCOVERY ALGORITHM

Dynamic Routing Protocols (DRPs) are widely-used for routing information among mobile nodes in Mobile Ad Hoc Network (MANET) and establish and maintain connectivity within the network. A DRP comprises two main phases: route discovery and route maintenance. The route discovery phase involves transmission of large number of redundant control packets consuming significant portion of the nodes power and increase communication overheads. Recently, a new efficient and effective route discovery algorithm has been developed, namely, the LAR-1P algorithm, which combines two well-known routing protocols; these are: the Location-Aided Routing scheme 1 (LAR-1) and probabilistic algorithms. This study evaluates and compared the performance of the LAR-1P algorithm against the performance of a number of route discovery algorithms through simulation. For each simulation, the number of retransmissions and reachability are estimated and compared. The simulations results demonstrated that LAR-1P provides better performance than all other algorithms it is compared with, as it significantly reduces communication overheads while maintaining almost the same network connectivity.

On the effect of nodes desnity on the performance of the LAR-1P route discovery algorithm

The location-aided routing scheme 1 (LAR-1) and probabilistic algorithms are combined together into a new algorithm for route discovery in mobile ad hoc networks (MANETs) called (LAR-1P) [1]. Simulation results in [1] demonstrated that, on network scale, for a uniform random node distribution and for a specific simulation setup; the LAR-1P algorithm reduces the number of retransmissions as compared to LAR-1 without sacrificing network reachability. Furthermore, on zone scale, the algorithm provides an excellent performance in high-density zones, while in low-density zones; it preserves the performance of LAR-1. This paper provides a detail analysis of the performance of the LAR-1P algorithm through various simulations, where the actual numerical values for the number of retransmissions and reachability in high- and low-density zones were estimated to demonstrate the effectiveness and significance of the algorithm and how it provides better performance than LAR-1 in high-density zones. In addition, the effect of the total number of nodes on the average network performance is also investigated.