Topology Control (TC) is one of the most important techniques used in wireless ad hoc and sensor networks to reduce energy consumption (which is essential to extend the network operational time) and ...radio interference (with a positive effect on the network traffic carrying capacity). The goal of this technique is to control the topology of the graph representing the communication links between network nodes with the purpose of maintaining some global graph property (e.g., connectivity), while reducing energy consumption and/or interference that are strictly related to the nodes' transmitting range. In this article, we state several problems related to topology control in wireless ad hoc and sensor networks, and we survey state-of-the-art solutions which have been proposed to tackle them. We also outline several directions for further research which we hope will motivate researchers to undertake additional studies in this field.
In last two decades, various monitoring systems have been designed and deployed in urban environments, toward the realization of the so called smart cities. Such systems are based on both dedicated ...sensor nodes, and ubiquitous but not dedicated devices such as smart phones and vehicles' sensors. When we design sensor network monitoring systems for smart cities, we have two essential problems: node deployment and sensing management. These design problems are challenging, due to large urban areas to monitor, constrained locations for deployments, and heterogeneous type of sensing devices. There is a vast body of literature from different disciplines that have addressed these challenges. However, we do not have yet a comprehensive understanding and sound design guidelines. This paper addresses such a research gap and provides an overview of the theoretical problems we face, and what possible approaches we may use to solve these problems. Specifically, this paper focuses on the problems on both the deployment of the devices (which is the system design/configuration part) and the sensing management of the devices (which is the system running part). We also discuss how to choose the existing algorithms in different type of monitoring applications in smart cities, such as structural health monitoring, water pipeline networks, traffic monitoring. We finally discuss future research opportunities and open challenges for smart city monitoring.
Significance Recent advances in information technologies have increased our participation in “sharing economies,” where applications that allow networked, real-time data exchange facilitate the ...sharing of living spaces, equipment, or vehicles with others. However, the impact of large-scale sharing on sustainability is not clear, and a framework to assess its benefits quantitatively is missing. For this purpose, we propose the method of shareability networks, which translates spatio-temporal sharing problems into a graph-theoretic framework that provides efficient solutions. Applying this method to a dataset of 150 million taxi trips in New York City, our simulations reveal the vast potential of a new taxi system in which trips are routinely shareable while keeping passenger discomfort low in terms of prolonged travel time.
Since their appearance at the end of the 19th century, traffic lights have been the primary mode of granting access to road intersections. Today, this centuries-old technology is challenged by ...advances in intelligent transportation, which are opening the way to new solutions built upon slot-based systems similar to those commonly used in aerial traffic: what we call Slot-based Intersections (SIs). Despite simulation-based evidence of the potential benefits of SIs, a comprehensive, analytical framework to compare their relative performance with traffic lights is still lacking. Here, we develop such a framework. We approach the problem in a novel way, by generalizing classical queuing theory. Having defined safety conditions, we characterize capacity and delay of SIs. In the 2-road crossing configuration, we provide a capacity-optimal SI management system. For arbitrary intersection configurations, near-optimal solutions are developed. Results theoretically show that transitioning from a traffic light system to SI has the potential of doubling capacity and significantly reducing delays. This suggests a reduction of non-linear dynamics induced by intersection bottlenecks, with positive impact on the road network. Such findings can provide transportation engineers and planners with crucial insights as they prepare to manage the transition towards a more intelligent transportation infrastructure in cities.
With the recent advances in battery technology and the resulting decrease in the charging times, public charging stations are becoming a viable option for Electric Vehicle (EV) drivers. Concurrently, ...emergence and the wide-spread use of location-tracking devices in mobile phones and wearable devices has paved the way to track individual-level human movements to an unprecedented spatial and temporal grain. Motivated by these developments, we propose a novel methodology to perform data-driven optimization of EV charging station locations. We formulate the problem as a discrete optimization problem on a geographical grid, with the objective of covering the entire demand region while minimizing a measure of drivers’ total excess driving distance to reach charging stations, the related energy overhead, and the number of charging stations. Since optimally solving the problem is computationally infeasible, we present computationally efficient solutions based on the genetic algorithm. We then apply the proposed methodology to optimize EV charging stations layout in the city of Boston, starting from Call Detail Records (CDR) of one million users over the span of 4 months. The results show that the genetic algorithm provides solutions that significantly reduce drivers’ excess driving distance to charging stations, energy overhead, and the number of charging stations required compared to both a locally-optimized feasible solution and the current charging station deployment in the Boston metro area. We further investigate the robustness of the proposed methodology and show that building upon well-known regularity of aggregate human mobility patterns, the layout computed for demands based on the single day movements preserves its advantage also in later days and months. When collectively considered, the results presented in this paper indicate the potential of data-driven approaches for optimally placing public charging facilities at urban scale.
Rooftop photovoltaics (RPVs) are crucial in achieving energy transition and climate goals, especially in cities with high building density and substantial energy consumption. Estimating RPV carbon ...mitigation potential at the city level of an entire large country is challenging given difficulties in assessing rooftop area. Here, using multi-source heterogeneous geospatial data and machine learning regression, we identify a total of 65,962 km
rooftop area in 2020 for 354 Chinese cities, which represents 4 billion tons of carbon mitigation under ideal assumptions. Considering urban land expansion and power mix transformation, the potential remains at 3-4 billion tons in 2030, when China plans to reach its carbon peak. However, most cities have exploited less than 1% of their potential. We provide analysis of geographical endowment to better support future practice. Our study provides critical insights for targeted RPV development in China and can serve as a foundation for similar work in other countries.
•The EV acceptability in ride-hailing drivers is quantified.•Ride-hailing drivers is less favored electric vehicles.•The power load profile generated by ride-hailing EVs has a diurnal pattern.•The ...payback time for the ride-hailing adoption of BEVs and PHEVs is 4.3–12.8 years.
The acceptability, energy consumption, and environmental benefits of electric vehicles are highly dependent on travel patterns. With increasing ride-hailing popularity in mega-cities, urban mobility patterns are greatly changing; therefore, an investigation of the extent to which electric vehicles would satisfy the needs of ride-hailing drivers becomes important to support sustainable urban growth. A first step in this direction is reported here. GPS-trajectories of 144,867 drivers over 104 million km in Beijing were used to quantify the potential acceptability, energy consumption, and costs of ride-hailing electric vehicle fleets. Average daily travel distance and travel time for ride-hailing drivers was determined to be 129.4 km and 5.7 h; these values are substantially larger than those for household drivers (40.0 km and 1.5 h). Assuming slow level-1 (1.8 KW) or moderate level-2 (7.2 KW) charging is available at all home parking locations, battery electric vehicles with 200 km all electric range (BEV200) could be used by up to 47% or 78% of ride-hailing drivers and electrify up to 20% or 55% of total distance driven by the ride-hailing fleet. With level-2 charging available at home, work, and public parking, the acceptance ceiling increases to up to 91% of drivers and 80% of distance. Our study suggests that long range BEVs and widespread level-2 charging infrastructure are needed for large-scale electrification of ride-hailing mobility in Beijing. The marginal benefits of increased all electric range, effects on charging infrastructure distribution, and payback times are also presented and discussed. Given the observed heterogeneity of ride-hailing vehicle travel, our study outlines the importance of individual-level analysis to understand the electrification potential and future benefits of electric vehicles in the era of shared smart transportation.
Social-Aware Stateless Routingin Pocket Switched Networks Mei, Alessandro; Morabito, Giacomo; Santi, Paolo ...
IEEE transactions on parallel and distributed systems,
2015-Jan., 2015-1-00, 20150101, Letnik:
26, Številka:
1
Journal Article
Recenzirano
Existing social-aware routing protocols for packet switched networks make use of the information about the social structure of the network deduced by state information of nodes (e.g., history of past ...encounters) to optimize routing. Although these approaches are shown to have superior performance to social-oblivious, stateless routing protocols (BinarySW, Epidemic), the improvement comes at the cost of considerable storage overhead required on the nodes. In this paper we present SANE, the first routing mechanism that combines the advantages of both social-aware and stateless approaches. SANE is based on the observation - that we validate on a real-world trace - that individuals with similar interests tend to meet more often. In SANE, individuals (network members) are characterized by their interest profile, a compact representation of their interests. By implementing a simple routing rule based on interest profile similarity, SANE is free of network state information, thus overcoming the storage capacity problem with existing social-aware approaches. Through thorough experiments, we show the superiority of SANE over existing approaches, both stateful, social-aware and stateless, social-oblivious. We discuss the statelessness of our approach in the supplementary file, which can be found on the Computer Society Digital Library at http://doi.ieeecomputersociety.org/10.1109/TPDS.2014.2307857, of this manuscript. Our interest-based approach easily enables innovative networking services, such as interest-casting. An interest-casting protocol is also introduced in this paper, and evaluated through experiments based on both real-world and synthetic mobility traces.
Academic research is increasingly cross-disciplinary and collaborative, between and within institutions. In this context, what is the role and relevance of an individual's spatial position on a ...campus? We examine the collaboration patterns of faculty at the Massachusetts Institute of Technology, through their academic output (papers and patents), and their organizational structures (institutional affiliation and spatial configuration) over a 10-year time span. An initial comparison of output types reveals: 1. diverging trends in the composition of collaborative teams over time (size, faculty versus non-faculty, etc.); and 2. substantively different patterns of cross-building and cross-disciplinary collaboration. We then construct a multi-layered network of authors, and find two significant features of collaboration on campus: 1. a network topology and community structure that reveals spatial versus institutional collaboration bias; and 2. a persistent relationship between proximity and collaboration, well fit with an exponential decay model. This relationship is consistent for both papers and patents, and present also in exclusively cross-disciplinary work. These insights contribute an architectural dimension to the field of scientometrics, and take a first step toward empirical space-planning policy that supports collaboration within institutions.
PDF
