SOGRID – Electricity Grid For Tomorrow

@inproceedings{Toubaline2015,

title = {Observing the State of a Smart Grid Using Bilevel Programming},

author = {Sonia Toubaline and Pierre-Louis Poirion and Claudia D’Ambrosio and Leo Liberti},

url = {https://epizeuxis.net/site/wp-content/uploads/2016/01/cocoa15a.pdf},

year  = {2015},

date = {2015-12-18},

booktitle = {In Proceeding of the 9th Annual International Conference on Combinatorial Optimization and Applications (COCOA'15),},

publisher = {LNCS 9486, 364-376},

abstract = {Monitoring an electrical network is an important and chal- lenging task. Phasor measurement units are measurement devices that can be used for a state estimation of this network. In this paper we consider a PMU placement problem without conventional measurements and with zero injection nodes for a full observability of the network. We propose two new approaches to model this problem, which take into ac- count a propagation rule based on Ohm’s and Kirchoff’s law. The natural binary linear programming description models an iterative observability process. We remove the iteration by reformulating its fixed point con- ditions to a bilevel program, which we then further reformulate to a single-level mixed-integer linear program. We also present a bilevel al- gorithm to solve directly the proposed bilevel model. We implemented and tested our models and algorithm: the results show that the bilevel algorithm is better in terms of running time and size of instances which can be solved.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{LIX-NET-conference-153,

title = {Depth First Forwarding for Low Power and Lossy Networks: Application and Extension},

author = {Jiazi Yi and Thomas Clausen and Ulrich Herberg},

url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2014-IEEE-WF-IoT-Depth-First-Forwarding-for-Low-Power-and-Lossy-Networks-Application-and-Extension.pdf},

doi = {10.1109/WF-IoT.2014.6803211},

year  = {2014},

date = {2014-03-01},

publisher = {Proceedings of IEEE World Forum on Internet of Things WF-IoT 2014},

abstract = {Data delivery across a multi-hop low-power and lossy networks (LLNs) is a challenging task: devices participating in such a network have strictly limited computational power and storage, and the communication channels are of low capacity, time-varying and with high loss rates. Consequently, routing protocols finding paths through such a network must be frugal in their control traffic and state requirements, as well as in algorithmic complexity – and even once paths have been found, these may be usable only intermittently, or for a very short time due to changes on the channel. Routing protocols exist for such networks, balancing reactivity to topology and channel variation with frugality in resource requirements. Complementary compo- nent to routing protocols for such LLNs exist, intended not to manage global topology, but to react rapidly to local data delivery failures and (attempt to) successfully deliver data while giving a routing protocol time to recover globally from such a failure. Specifically, this paper studies the “Depth-First Forwarding (DFF) in Unreliable Networks” protocol, standardised within the IETF in June 2013. Moreover, this paper proposes optimisations to that protocol, denoted DFF++, for improved performance and reactivity whilst remaining fully interoperable with DFF as standardised, and incurring neither additional data sets nor protocol signals to be generated.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Clausen2013,

title = {A Depth First Forwarding (DFF) Extension for the LOADng Routing Protocol},

author = {Thomas Clausen and Jiazi Yi and Antonin Bas and Ulrich Herberg},

url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2013-ASON-A-Depth-First-Forwarding-DFF-Extension-for-the-LOADng-Routing-Protocol.pdf},

doi = {10.1109/CANDAR.2013.72},

year  = {2013},

date = {2013-12-01},

publisher = {ASON 2013 Sixth International Workshop on Autonomous Self-Organizing Networks},

abstract = {This paper explores the cooperation between the new standards for “Low Power and Lossy Networks” (LLNs): IETF RFC 6971, denoted “Depth-First Forwarding in Unreliable Networks” (DFF) and the ITU-T standardised routing protocol “LOADng” (Lightweight On-demand ad hoc Distance-vector Routing - next generation). DFF is a data-forwarding mechanism for increasing reliability of data delivery in networks with dynamic topology and lossy links, using a mechanism similar to a “depth-first search” for the destination of a packet. LOADng is a reactive on-demand routing protocol used in LLNs. The purpose of this study is to evaluate the benefit of using DFF conjointly with a routing protocol. To this end, the paper compares the performance of LOADng and LOADng+DFF using Ns2 simulations, showing a 20% end-to-end data delivery ratio increase at expense of expected longer path lengths.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Clausen2013a,

title = {Evaluation of Routing Protocol for Low Power and Lossy Networks: LOADng and RPL},

author = {Jiazi Yi and Thomas Clausen and Yuichi Igarashi},

url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2013-ICWiSE-Evaluation-of-Routing-Protocol-for-Low-Power-and-Lossy-Networks-LOADng-and-RPL.pdf},

doi = {10.1109/ICWISE.2013.6728773},

year  = {2013},

date = {2013-12-01},

publisher = {2013 IEEE Conference on Wireless Sensors},

abstract = {Routing protocol is a critical component of Low- power and Lossy Networks for Smart Grid. The protocols are used for data forwarding, which includes data acquisition, information dissemination, etc. This paper evaluates two main routing protocols used for Low-power and Lossy Networks: RPL and LOADng, to understand their strengths and limitations. Observations are provided based on analysis of specification and experimental experience, regarding the protocol’s routing overhead, traffic pattern, resource requirement, fragmentation, etc. Simulations are further launched to study the performance in different traffic patterns, which include sensor-to-sensor traffic, sensor-to-root traffic and root-to-sensor bidirectional traffic. By evaluating those protocols, the readers could have better under- standing of the protocol applicability, and choose the appropriate protocol for desired applications.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Clausen2013g,

title = {Jitter Considerations in On-demand Route Discovery for Mobile Ad Hoc Networks},

author = {Jiazi Yi and Juan Antonio Cordero and Thomas Clausen},

url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2013-NBIS-Jitter-Considerations-in-On-demand-Route-Discovery-for-Mobile-Ad-Hoc-Networks.pdf},

doi = {10.1109/NBiS.2013.28},

year  = {2013},

date = {2013-09-01},

publisher = {The 16th International Conference on Network-Based Information Systems (NBiS-2013)},

abstract = {Jittering (a small, random variation in timing of control message emission) is widely used in protocols for wireless communication, in order to avoid simultaneous packet transmis- sions over the same channel by adjacent nodes in the network. Used for both regularly scheduled packets, for event-triggered packets, and for scheduled resets in the network, jittering is a particularly important mechanism when a network event may cause multiple adjacent nodes to react concurrently. Introduced in the proactive MANET routing protocol OLSR, the “LLN On-demand Ad hoc Distance-vector Routing Protocol - Next Generation” (LOADng), a derivative of AODV, is specified so as to also use jitter for flooding Route Request (RREQ) messages during route discovery. This use of jitter in RREQ flooding is, however, not without drawbacks, which are identified and addressed in this paper within the framework of a more general study of jitter mechanisms used for route discovery in reactive routing protocols. The paper studies the behavior of route discovery when using “naive” jitter (simply, delaying RREQ retransmission by a small uniformly distributed random delay), in order to identify and analyze the problems hereof, mostly related to route sub-optimality and excessive control traffic overhead. A Window Jitter mechanism is then proposed to address these issues – with the performance hereof, when compared to “naive” jitter being evaluated by way of modeling, theoretical analysis and experiments. The paper shows that the use of Window Jitter improves indeed the efficiency of route discovery in AODV and overcome the drawbacks identified for “naive” jitter.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}