Towards Optimal Distributed Node Scheduling in a Multihop Wireless Network through Local Voting

In a multihop wireless network, it is crucial but challenging to schedule transmissions in an efficient and fair manner. In this paper, a novel distributed node scheduling algorithm, called Local Voting, is proposed. This algorithm tries to semi-equalize the load (defined as the ratio of the queue length over the number of allocated slots) through slot reallocation based on local information exchange. The algorithm stems from the finding that the shortest delivery time or delay is obtained when the load is semi-equalized throughout the network. In addition, we prove that, with Local Voting, the network system converges asymptotically towards the optimal scheduling. Moreover, through extensive simulations, the performance of Local Voting is further investigated in comparison with several representative scheduling algorithms from the literature. Simulation results show that the proposed algorithm achieves better performance than the other distributed algorithms in terms of average delay, maximum delay, and fairness. Despite being distributed, the performance of Local Voting is also found to be very close to a centralized algorithm that is deemed to have the optimal performance

Bi-directional coordination of plug-in electric vehicles with economic model predictive control

© 2017 by the authors. Licensee MDPI, Basel, Switzerland. The emergence of plug-in electric vehicles (PEVs) is unveiling new opportunities to de-carbonise the vehicle parcs and promote sustainability in different parts of the globe. As battery technologies and PEV efficiency continue to improve, the use of electric cars as distributed energy resources is fast becoming a reality. While the distribution network operators (DNOs) strive to ensure grid balancing and reliability, the PEV owners primarily aim at maximising their economic benefits. However, given that the PEV batteries have limited capacities and the distribution network is constrained, smart techniques are required to coordinate the charging/discharging of the PEVs. Using the economic model predictive control (EMPC) technique, this paper proposes a decentralised optimisation algorithm for PEVs during the grid-To-vehicle (G2V) and vehicle-To-grid (V2G) operations. To capture the operational dynamics of the batteries, it considers the state-of-charge (SoC) at a given time as a discrete state space and investigates PEVs performance in V2G and G2V operations. In particular, this study exploits the variability in the energy tariff across different periods of the day to schedule V2G/G2V cycles using real data from the university's PEV infrastructure. The results show that by charging/discharging the vehicles during optimal time partitions, prosumers can take advantage of the price elasticity of supply to achieve net savings of about 63%

BATSEN: Modifying the BATMAN Routing Protocol for Wireless Sensor Networks

The proliferation of autonomous Wireless Sensor Networks (WSN) has spawned research seeking power efficient communications to improve the lifetime of sensor motes. WSNs are characterized by their power limitations, wireless transceivers, and the converge-cast communications techniques. WSN motes use low-power, lossy radio systems deployed in dense, random topologies, working sympathetically to sense and notify a sink node of the detectable information. In an effort to extend the life of battery powered motes, and hence the life of the network, various routing protocols have been suggested in an effort to optimize converge-cast delivery of sensor data. It is well known that reducing the overhead required to perform converge-cast routing and communications reduces the effects of the primary power drain in the mote, the transceiver. Furthermore, WSNs are not well protected; network security costs energy both in computation and in RF transmission. This paper investigates the use of a Mobile Ad-hoc Networking (MANET) routing protocol known as B.A.T.M.A.N. in WSN. This thesis proposes that the features of B.A.T.M.A.N. in the MANET realm may prove beneficial to the WSN routing domain; and that slight modifications to the routing technique may prove beneficial beyond current protocol technologies. The B.A.T.M.A.N. variant will be compared against the contemporary LEACH WSN routing protocol to discern any potential energy savings

Elastic Business Process Management: State of the Art and Open Challenges for BPM in the Cloud

With the advent of cloud computing, organizations are nowadays able to react rapidly to changing demands for computational resources. Not only individual applications can be hosted on virtual cloud infrastructures, but also complete business processes. This allows the realization of so-called elastic processes, i.e., processes which are carried out using elastic cloud resources. Despite the manifold benefits of elastic processes, there is still a lack of solutions supporting them. In this paper, we identify the state of the art of elastic Business Process Management with a focus on infrastructural challenges. We conceptualize an architecture for an elastic Business Process Management System and discuss existing work on scheduling, resource allocation, monitoring, decentralized coordination, and state management for elastic processes. Furthermore, we present two representative elastic Business Process Management Systems which are intended to counter these challenges. Based on our findings, we identify open issues and outline possible research directions for the realization of elastic processes and elastic Business Process Management.Comment: Please cite as: S. Schulte, C. Janiesch, S. Venugopal, I. Weber, and P. Hoenisch (2015). Elastic Business Process Management: State of the Art and Open Challenges for BPM in the Cloud. Future Generation Computer Systems, Volume NN, Number N, NN-NN., http://dx.doi.org/10.1016/j.future.2014.09.00

Online traffic signal control through sample-based constrained optimization

Ministry of Education, Singapore under its Academic Research Funding Tier