Tahir Riaz

Smart Waste Collection System Based on Location Intelligence

Abstract Cities around the world are on the run to become smarter. Some of these have seen an opportunity on deploying dedicated municipal access networks to support all types of city management and maintenance services requiring a data connection. This paper practically demonstrates how Internet of Things (IoT) integration with data access networks, Geographic Information Systems (GIS), combinatorial optimization, and electronic engineering can contribute to improve cities’ management systems. We present a waste collection solution based on providing intelligence to trashcans, by using an IoT prototype embedded with sensors, which can read, collect, and transmit trash volume data over the Internet. This data put into a spatio-temporal context and processed by graph theory optimization algorithms can be used to dynamically and efficiently manage waste collection strategies. Experiments are carried out to investigate the benefits of such a system, in comparison to a traditional sectorial waste collection approaches, also including economic factors. A realistic scenario is set up by using Open Data from the city of Copenhagen, highlighting the opportunities created by this type of initiatives for third parties to contribute and develop Smart city solutions.

Energy Greedy Protocol Suite for Smart Grid Communication Systems Based on Short Range Devices

In this paper, we present new communication protocol, named energy greedy quasi-flooding protocol. This protocol is independent from a communication media types and is mainly intended for PLC, UHF wireless and even IrDA transmission techniques. Presented solutions can be applied to EMSs based on the inexpensive SRDs, they are also suite for smart grid technologies based on hybrid networks e. g. PLC together with the wireless.

Analysis of Degree 5 Chordal Rings for Network Topologies

This paper presents an analysis of degree 5 chordal rings, from a network topology point of view. The chordal rings are mainly evaluated with respect to average distance and diameter. We derive approximation expressions for the related ideal graphs, and show that these matches the real chordal rings fairly well. Moreover, the results are compared to that of a reference graph which presents a lower bound for average distance and diameter among all regular graphs of degree 5. It turns out that this reference graph has significantly lower distances than the degree 5 chordal rings. Based on that, we suggest that future research could deal with either finding degree 5 topologies with average distance and diameter closer to these of the reference graph, or to develop more realistic bounds than those presented by these reference graphs.

SQoS based planning using 4-regular grid for optical fiber networks

The recent research on structural quality of service (SQoS) devised many useful properties that can enhance the network performance. Three different structures have been introduced, i.e. 4-regular grid, N2R, and honeycomb. These structures are now well described and proposed for the next generation optical fiber based network infrastructures. In the first step of SQoS based planning, this paper describes how 4-regular grid structures can be implemented in the physical level of optical fiber network infrastructures. A systematic approach for implementing the grid structure is presented. We used a case study of Hals (a small town in the north of Denmark) to apply the implementation procedure. The results are quite promising for the structural based network planning. Conclusion and discussion are presented, and further research is proposed

Upgradeability and predictability analysis for mesh topologies in optical distribution networks

The new tendencies for network planning methods are evolving to more mechanized and automated systems that can determine the best way to deploy networks. In the case of fiber optic networks, aspects such as the length of the physical links are critical due to the high cost and high availability requirements of this kind of networks. Regarding the planning of optical networks, FTTH methods are reasonably advanced, but in the case of core or distribution networks there is still room for many improvements. In this paper, two mesh topologies have been studied in order to be deployed as optical networks, Honeycomb and Grid. In order to contribute to the improvement of distribution network design, the benefits of a preventive planning (upgradeability properties) are depicted along the document. In addition, to simplify the process of topology decision, approximations are defined to avoid some costly parameters calculations. For the validity of the results it is important to mention that Genetic algorithms are used in order to decide the interconnection of the networks under study.

Traffic load on interconnection lines of generalized double ring network structures

Generalized double ring (N2R) network structures possess a number of good properties, but being not planar they are hard to physically embed in communication networks. However, if some of the lines, the interconnection lines, are implemented by wireless technologies, the remaining structure consists of two planar rings, which are easily embedded by fiber or other wired solutions. It is shown that for large N2R structures, the interconnection lines carry notably lower loads than the other lines if shortest-path routing is used, and the effects of two other routing schemes are explored, leading to lower load on interconnection lines at the price of larger efficient average distance and diameter

Single and Dual physical link failures stability effect on degree three WDM networks

This paper studies the effects of Single and Dual physical link failures to the stability of WDM networks when deployed as regular 3-degree structures. The failure impact on the source-destination pair connections is evaluated for the different topology scenarios. In this way it is possible to provide an overview of the failure effects and their relation to network metrics such as availability or cost. The results quantify how much the different network interconnection designs are affected by Single and Dual Physical link failures. The case study treats a realistic scenario, the interconnection of the NSFNET topology nodes. The main conclusions show that, when networks are designed under the same conditions, there is a linear relation between average downtime and ratio of connections affected by failures. Moreover, the most expensive optimized topologies to deploy provide higher availability.

A survey on environmental backbone design and implementation

Communication networks are becoming more essential for our daily life and critically important for industry and governments. The intense growth in the backbone traffic implies an increment on the power demands of the network equipment. This power usage has a significant negative effect on the environment. In this paper, some ideas are exposed and discussed in order to make backbone communication network more environmentally friendly. In addition the scheme of a potential model is introduced to be able to evaluate the emissions of a network during its life time.

A Comparison of Network Planning Strategies

In this paper we explore different strategies for planning and expanding networks based on chordal rings. For chordal rings of different sizes (10,30 and 50 nodes), and with two different traffic distributions (random and uniform) we study how average distance and diameter change as the chords are added. In the first strategy chords are added one by one, so that the distances are reduced in each step. In the second strategy a constraint is added, so that nodes can only have degree 3 or 4. In the last strategy chords are added gradually so that they fit into an initially calculated best, regular chordal ring of degree 3 or 4. The first strategy results in the best distances. The constrained node degrees comes next, whereas the regular rings have slightly larger distances through all steps.

Five Novel Selection Policies for N2R Network Structures

This paper shows how 5 new selection policies can be applied to N2R structures. For each number of nodes, a selection policy determines which topology is chosen. Compared to approaches taken previously, the policies proposed in this paper allow us to choose structures which are significantly easier to implement, while having only slightly longer distances. The 5 policies reflect different trade-offs between distances and ease of implementation, and two of them explore the potentials of using N2R(p; q; r) instead of N2R(p; q) structures