Unified clustering and communication protocol for wireless sensor networks

In this paper we present an energy-efficient cross layer protocol for providing application specific reservations in wireless senor networks called the “Unified Clustering and Communication Protocol ” (UCCP). Our modular cross layered framework satisfies three wireless sensor network requirements, namely, the QoS requirement of heterogeneous applications, energy aware clustering and data forwarding by relay sensor nodes. Our unified design approach is motivated by providing an integrated and viable solution for self organization and end-to-end communication is wireless sensor networks. Dynamic QoS based reservation guarantees are provided using a reservation-based TDMA approach. Our novel energy-efficient clustering approach employs a multi-objective optimization technique based on OR (operations research) practices. We adopt a simple hierarchy in which relay nodes forward data messages from cluster head to the sink, thus eliminating the overheads needed to maintain a routing protocol. Simulation results demonstrate that UCCP provides an energy-efficient and scalable solution to meet the application specific QoS demands in resource constrained sensor nodes. Index Terms — wireless sensor networks, unified communication, optimization, clustering and quality of service

Dynamic, Latency-Optimal vNF Placement at the Network Edge

Future networks are expected to support low-latency, context-aware and user-specific services in a highly flexible and efficient manner. One approach to support emerging use cases such as, e.g., virtual reality and in-network image processing is to introduce virtualized network functions (vNF)s at the edge of the network, placed in close proximity to the end users to reduce end-to-end latency, time-to-response, and unnecessary utilisation in the core network. While placement of vNFs has been studied before, it has so far mostly focused on reducing the utilisation of server resources (i.e., minimising the number of servers required in the network to run a specific set of vNFs), and not taking network conditions into consideration such as, e.g., end-to-end latency, the constantly changing network dynamics, or user mobility patterns. In this paper, we formulate the Edge vNF placement problem to allocate vNFs to a distributed edge infrastructure, minimising end-to-end latency from all users to their associated vNFs. We present a way to dynamically re-schedule the optimal placement of vNFs based on temporal network-wide latency fluctuations using optimal stopping theory. We then evaluate our dynamic scheduler over a simulated nation-wide backbone network using real-world ISP latency characteristics. We show that our proposed dynamic placement scheduler minimises vNF migrations compared to other schedulers (e.g., periodic and always-on scheduling of a new placement), and offers Quality of Service guarantees by not exceeding a maximum number of latency violations that can be tolerated by certain applications

Transportation Capital Programming in Massachusetts

Recommends implementing an explicit, policy-driven framework and criteria for prioritizing transportation capital spending at the Massachusetts Highway Department and the Massachusetts Bay Transportation Authority. Outlines benchmarks and key elements

Consumer choice in competitive location models: Formulations and heuristics

A new direction of research in Competitive Location theory incorporates theories of Consumer Choice Behavior in its models. Following this direction, this paper studies the importance of consumer behavior with respect to distance or transportation costs in the optimality of locations obtained by traditional Competitive Location models. To do this, it considers different ways of defining a key parameter in the basic Maximum Capture model (MAXCAP). This parameter will reflect various ways of taking into account distance based on several Consumer Choice Behavior theories. The optimal locations and the deviation in demand captured when the optimal locations of the other models are used instead of the true ones, are computed for each model. A metaheuristic based on GRASP and Tabu search procedure is presented to solve all the models. Computational experience and an application to 55-node network are also presented.Distance, competitive location models, consumer choice behavior, GRASP, tabu

Alternative Formulas for Allocating LOST Revenue to Counties and Municipalities

The focus of our research is on the allocation of the LOST revenues between the county and municipal governments. This research reviewed various aspects of the LOST allocation and considered several alternative methods of distributing LOST revenues between the county and sub-county units. This is a complex problem with high stakes. Because the allocation is a zero-sum game, any change in the allocation is almost guaranteed to make one party worse off than under the current allocation. The real gains lie in both sides being freed from negotiations that are oftimes long and costly in terms of staff time and outside consultants. Report #9