Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Bücher
Zeitschriften
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
ATZ-Fachkongress

Chassis.tech plus 2024


4 Kongresse in einer Veranstaltung

Treffen Sie in München die Fachleute von Chassis, Lenkung, Bremsen sowie Reifen/Räder.
Erweiterte Suche
Anmelden
nach oben

2016 | Buch

High-Performance Wideband SDR Channelizers Kapitel lesen Erstes Kapitel lesen

Wired/Wireless Internet Communications

14th IFIP WG 6.2 International Conference, WWIC 2016, Thessaloniki, Greece, May 25-27, 2016, Proceedings

herausgegeben von: Lefteris Mamatas, Ibrahim Matta, Panagiotis Papadimitriou, Yevgeni Koucheryavy

Verlag: Springer International Publishing

Buchreihe : Lecture Notes in Computer Science

Enthalten in: Springer Professional "Wirtschaft+Technik" , Springer Professional "Technik" , Springer Professional "Wirtschaft"

Einloggen, um Zugang zu erhalten
insite
SUCHEN

Über dieses Buch

This book constitutes the refereed proceedings of the 14th IFIP WG 6.2 International Conference on Wired/Wireless Internet Communications, WWIC 2016, held in Thessaloniki, Greece, in May 2016.
The 27 papers presented in this volume were carefully reviewed and selected from 54 submissions. The topics addressed are: wireless technologies and systems, middleboxes and addressing, energy efficiency, network applications and tools, network protocols, network modeling, wireless sensor networks, and resource management and optimization.

Inhaltsverzeichnis

Frontmatter

Wireless Technologies and Systems

Frontmatter
High-Performance Wideband SDR Channelizers
Abstract
The essential process to analyze signals from multicarrier communication systems is to isolate independent communication channels using a channelizer. To implement a channelizer in software-defined radio systems, the Polyphase Filterbank (PFB) is commonly used. For real-time applications, the PFB has to process the digitized signal faster or equal to its sampling rate. Depending on the underlying hardware, PFB can run on a CPU, a Graphical Processing Unit (GPU), or even a Field-Programmable Gate Arrays (FPGA). CPUs and GPUs are more reconfigurable and scalable platforms than FPGAs. In this paper, we optimize an existing implementation of a CPU-based channelizer and implement a novel GPU-based channelizer. Our proposed solutions deliver an overall improvement of 30 % for the CPU optimization on Intel Core i7-4790 @ 3.60 GHz, and a 3.2-fold improvement for the GPU implementation on AMD R9 290, when compared to the original CPU-based implementation.
Islam Alyafawi, Arnaud Durand, Torsten Braun
Location Based Transmission Using a Neighbour Aware-Cross Layer MAC for Ad Hoc Networks
Abstract
In a typical Ad Hoc network, mobile nodes have scarce shared bandwidth and limited battery life resources, so optimizing the resource and enhancing the overall network performance is the ultimate aim in such network. This paper proposes anew cross layer MAC algorithm called Location Based Transmission using a Neighbour Aware – Cross Layer MAC (LBT-NA Cross Layer MAC) that aims to reduce the transmission power when communicating with the intended receiver by exchanging location information between nodes in one hand and on the other hand the MAC uses a new random backoff values, which is based on the number of active neighbour nodes, unlike the standard IEEE 802.11 series where a random backoff value is chosen from a fixed range of 0–31. The validation test demonstrates that the proposed algorithm increases battery life, increases spatial reuse and enhances the network performance.
Jims Marchang, Bogdan Ghita, David Lancaster
Message Transmission Scheduling on Tandem Multi-hop Lossy Wireless Links
Abstract
This paper proposes a framework for message transmission scheduling on a simple tandem multi-hop transmission model with lossy unreliable wireless links, where each of N nodes periodically generates a message every T time-slots. Such a model is of practical importance, e.g., in low-cost serially-arranged sensor networks in the wild. Each message can be transmitted to an adjacent in a single time-slot, and should be relayed in a store-wait-and-forward manner from its source node to one of gateways at the edges of the tandem within T time-slots. Our framework consists of: (i) a static global time-slot assignment over all links analytically derived by a central server; and (ii) a local message selection for transmission with a simple XOR network coding-based proactive recovery over assigned time-slots on each link. Simulation results show the probability that all messages are successfully delivered to the server (via gateways) by the proposed framework is comparable to or even better than that by ACK-based reactive recovery schemes.
Agussalim, Masato Tsuru
Influence of Backoff Period in Slotted CSMA/CA of IEEE 802.15.4
Abstract
Low rate wireless applications are under attraction since last decade. For such applications, IEEE designed a standard known as IEEE 802.15.4. The standard operates at 868, 915 and 2400 MHz with or without using super frame structure. Most of the low rate Wireless PAN applications follow superframe structure. A superframe structure comprises of contention based and contention free periods by offering slotted CSMA/CA and TDMA like operation respectively. This paper analyzes the performance of slotted CSMA/CA algorithm. CSMA/CA algorithm highly depends upon backoff period that is why its impact is analyzed in this work. The performance analysis is based on probability determined by using discrete markov chain model. The performance analysis comprises of nodes waiting time before transmission, channel busy probability and ultimately throughput and reliability is calculated. Results show that network reliability along with throughput of a wireless network increases gradually with the increase in backoff period at the cost of increase in average wait time of nodes.
Ahmed Naseem Alvi, Safdar Hussain Bouk, Syed Hassan Ahmed, Muhammad Azfar Yaqub

Middleboxes and Addressing

Frontmatter
Multipath TCP Proxy: Unshackling Network Nodes from Today’s End-to-End Connection Principle
Abstract
Nowadays, mobile devices are equipped with multiple radio interfaces, data centers provide redundant routing paths, and multihoming is the new tendency in existing, extensive server farms. Meanwhile, the unending growth rate of Internet traffic generation raises difficulties in meeting end user demands regarding bandwidth availability and Quality of Service standards, while TCP itself persists as a single-path transport protocol. Multipath TCP, as a set of extensions to legacy TCP, permits the simultaneous utilization of the available interfaces on a multihomed host, while preserving the standard TCP socket API. Consequently, smart terminals possess the distinct capability of leveraging path diversity in order to provide robust data transfers and enhance the overall connection performance. However, the implementation of Multipath TCP is still at a premature state. Ergo, we propose and evaluate a Multipath TCP Proxy as a mechanism towards the incremental adaptation of the extended protocol by service delivery platforms. Particularly, we examine the use of an HTTP Proxy as a protocol converter that will allow MPTCP-enabled clients to benefit from Multipath TCP even when communicating with legacy servers.
Christos Pollalis, Paris Charalampou, Efstathios Sykas
SDN-Based Source Routing for Scalable Service Chaining in Datacenters
Abstract
The migration of network functions (NFs) to datacenters, as promoted by Network Function Virtualization (NFV), raises the need for service chaining (i.e., steering traffic through a sequence of NFs). Service chaining is typically performed by installing forwarding entries in switches within datacenters (DCs). However, as the number of service chains in DCs grows, switches will be required to maintain a large amount of forwarding state. This will raise a dataplane scalability issue, due to the relatively small flow table size of switches. To mitigate this problem, we present a software-defined network (SDN) based source routing architecture for scalable service chaining, at which the NF-path is encoded into the packet header obviating the need for any forwarding state and lookup in the switches. We assess the feasibility and efficiency of our architecture using a prototype implementation.
Ahmed Abujoda, Hadi Razzaghi Kouchaksaraei, Panagiotis Papadimitriou
An Efficient Geographical Addressing Scheme for the Internet
Abstract
Geocast is a scheme which allows packets to be sent to a destination area instead of an address. This allows the addressing of any device in a specific region without further knowledge. In this paper we present an addressing mechanism that allows efficient referral to areas of arbitrary size. The binary representation of our addressing mechanism fits in an IPv6 address and can be used for route lookup with simple exclusive-or operations. We show that our addressing mechanism can be used to address areas accurately enough to be used as a mechanism to route packets close to their destination.
Bernd Meijerink, Mitra Baratchi, Geert Heijenk

Energy Efficiency

Frontmatter
On the Energy Inefficiency of MPTCP for Mobile Computing
Abstract
Mobile devices have embraced Multi-Path TCP (MPTCP) for leveraging the path diversity. MPTCP is a double-edged sword since mobile phones are suffering excessively from short battery life span. In order to find energy efficiency of MPTCP, the signal quality and the transferred file size have been taken into account. We formulate the above problem as a Markovian Decision Process (MDP) for symmetric and asymmetric network traffic. Numerical and simulation results surprisingly show that MPTCP is not efficient in any selected scenarios and the proposed scheme can save 56 % of energy compared to the conventional MPTCP.
Mohammad Javad Shamani, Weiping Zhu, Saeid Rezaie
Buffering… Energy for Mobile Devices: A “Store and Rendezvous” Approach
Abstract
We exploit the traffic shaping potential of network storage and improve energy efficiency for mobile devices through the creation of idle communication intervals. We model the activity patterns between the WIRED/wireless gateway and the wireless battery-powered receiver, and employ a rendezvous mechanism that utilizes periods of inactivity created by the traffic shaping function of the network. In case multiple receivers are simultaneously active, a scheduling algorithm limits overlaps of buffer flushes. Our scenarios are based on the DTN paradigm, however, our approach is not DTN-specific. The presented simulation study involves three main types of Internet traffic (i.e. file transfer, streaming and web browsing) and demonstrates that our proposed scheme achieves significant energy conservation for mobile receivers involving, under most circumstances, only mild performance cost.
Dimitris Vardalis, Christos-Alexandros Sarros, Vassilis Tsaoussidis
Data Aware Communication for Energy Harvesting Sensor Networks
Abstract
We propose a Data Aware Communication Technique (DACT) that reduces energy consumption in Energy Harvesting Wireless Sensor Networks (EH-WSN). DACT takes advantage of the data correlation present in household EH-WSN applications to reduce communication overhead. It adapts its functionality according to correlations in data communicated over the EH-WSN and operates independently from spatial and temporal correlations without requiring location information. Our results show that DACT improves communication efficiency of sensor nodes and can help reduce idle energy consumption in an average-size home by up to 90 % as compared to spatial/temporal correlation-based communication techniques.
Mohamed S. Hefeida, Fahad Saeed

Network Applications and Tools

Frontmatter
Scalability of Passive and Active Solutions for Time-Based Ranging in IEEE 802.11 Networks
Abstract
Wireless positioning systems have become popular in recent years. Outdoor positioning has been addressed successfully, but location indoors still presents some open issues. One of them is related with the scalability of time-based ranging algorithms. The aim of this study is to develop a simulation framework in order to evaluate the scalability and stability of two time-based ranging positioning algorithms in IEEE 802.11 networks: 2-Way Time of Flight (TOF) and passive TDOA. Details about this simulation model are provided and both algorithms are compared in a proof-of-concept scenario. Results show that Passive TDOA provides a better scalability and more stable measurements than the solutions based on pure 2-Way TOF algorithms.
Israel Martin-Escalona, Marta Malpartida, Enrica Zola, Francisco Barcelo-Arroyo
A Collaborative Video Download Application Based on Wi-Fi Direct
Abstract
We developed a collaborative video download application, which allows several users to form a local group via peer-to-peer (P2P) links and collaboratively help one user in the group to download a high quality video. Cellular interface and P2P interface are simultaneously utilised in the application to guarantee quality of experience (QoE) when the cellular connection is disrupted. The application is based on Wi-Fi Direct technology and it exploits the service discovery function of the Wi-Fi Direct framework.
Apart from the implementation itself, we also model collaborative video streaming over the cellular network under periodic cellular disconnections (e.g., the commuters experience poor Internet services when trains travel through tunnels). Our purpose is to exploit the gains of the collaborative download between users in the context of periodic disconnections and limited cellular downlink rate. We simulate several scenarios to find the requirements of the application that guarantee seamless and undisrupted playback.
Haotian Sha, Argyrios G. Tasiopoulos, Ioannis Psaras, George Pavlou
Human-in-the-loop Connectivity Management in Smartphones
Abstract
Cyber-Physical Systems which detect and use human psychological and physiological states as feedback to their control-loop are known as Human-in-the-Loop (HITL). The current understanding of the general requirements and theory behind this new class of systems is, however, still limited. This paper attempts to contribute towards their development by presenting a conceptual model that integrates some of the major ideas spread throughout the literature. In addition, it also discusses how the acquisition of a human’s state requires reliable networking. In this respect, an architecture for HITL management of networking configurations is presented. This architecture is implemented in an experimental scenario where a smartphone system attempts to positively impact mood by dynamically adapting privacy settings and networking interfaces to the user’s emotions. In this scenario, good hand-off performance is crucial for improving Quality of Experience and reliability. Several experiments regarding emotional classification and mobile handoff are also presented and discussed.
David Nunes, Jorge Sá Silva, Carlos Herrera, Fernando Boavida
Hardware MIMO Channel Simulator for Cooperative and Heterogeneous 5G Networks with VLC Signals
Abstract
This paper presents the design of an 8 × 8 Multiple-Input Multiple-Output (MIMO) hardware simulator for cooperative time-varying propagation channels (based on relays) using heterogeneous systems (LTE-A and 802.11ac) with Visible Light Communications (VLC) signals. The simulator reproduces a desired radio channel scenario and makes it possible to test “on table” different systems. It uses different impulse responses to cover many types of channels by merging TGn models, 3GPP-LTE models, outdoor-to-indoor measurements results and VLC models. An algorithm is introduced to convert the measured impulse responses from 200 MHz sample frequency to 50 MHz to be compatible with LTE-A signals. A specific architecture of the simulator digital block is presented to characterize 5G scenarios. The architecture is designed on a Xilinx Virtex-VII XC7VX690T Field Programmable Gate Array (FPGA). Its accuracy and FPGA occupation are analyzed.
Bachir Habib, Badih Baz

Network Protocols

Frontmatter
Improving Spatial Indexing and Searching for Location-Based DNS Queries
Abstract
In the domain of vehicular networking, it is of significant relevance to be able to address vehicles based on their geographical position rather than the network address. The integration of geocasting (i.e. the dissemination of messages to all nodes within a specific geographical region) into the existing addressing scheme of the Internet is challenging, due to its logical hierarchy. One solution to Internet-based geographical addressing is eDNS, an extension to the DNS protocol. It adds support for querying geographical locations as a supplement to logical domain names. In this work, eDNS is extended with nearest neighbor resolution support, and further, a prototype server is developed that uses bounding box propagation between servers for delegation. Our experiments confirm that distributing location records over multiple servers improves performance.
Daniel Moscoviter, Mozhdeh Gholibeigi, Bernd Meijerink, Ruben Kooijman, Paul Krijger, Geert Heijenk
QoS Multi-tree Based Routing Protocol for Inter-mesh Infrastructure Communications
Abstract
Quality of service (QoS) in wireless mesh networks (WMN) is an active area of research, which is driven by the increasing demand for real-time and multimedia applications, such as VoIP (Voice over IP) and VoD (Video on Demand). In this paper, we propose a QoS multi-tree based routing protocol for wireless mesh environments, named Inter-Mesh Infrastructure Proactive Routing (IMPR). It is a proactive multi-tree routing protocol enabling QoS guarantee for communications from/towards the Internet network through the Mesh Gateway (MG) of the mesh infrastructure. We describe and analyze the simulation results of different scenarios conducted on the network simulator ns-3 to demonstrate the effectiveness of our IMPR routing protocol in forwarding real-time applications with QoS guarantee.
Hajer Bargaoui, Nader Mbarek, Olivier Togni, Mounir Frikha
A Variable-Length Network Encoding Protocol for Big Genomic Data
Abstract
Modern genomic studies utilize high-throughput instruments which can produce data at an astonishing rate. These big genomic datasets produced using next generation sequencing (NGS) machines can easily reach peta-scale level creating storage, analytic and transmission problems for large-scale system biology studies. Traditional networking protocols are oblivious to the data that is being transmitted and are designed for general purpose data transfer. In this paper we present a novel data-aware network transfer protocol to efficiently transfer big genomic data. Our protocol exploits the limited alphabet of DNA nucleotide and is developed over the hypertext transfer protocol (HTTP) framework. Our results show that proposed technique improves transmission up to 84 times when compared to normal HTTP encoding schemes. We also show that the performance of the resultant protocol (called VTTP) using a single machine is comparable to BitTorrent protocol used on 10 machines.
Mohammed Aledhari, Mohamed S. Hefeida, Fahad Saeed

Network Modeling

Frontmatter
On the Evolution of Complex Network Topology Under Network Churn
Abstract
The future Internet is becoming more diverse, incorporating heterogeneous access networks. The latter are characterized by numerous devices that join/leave the network dynamically, creating intense churn patterns. New approaches to analyze and quantify churn-induced network evolution are required. In this paper, we address such need by introducing a new analysis framework that maps network evolution into trajectories in multi-dimensional vector spaces. Each network instance is characterized by a feature vector, indicating network properties of interest. To demonstrate the potentials of this approach, we exemplify and study the effect of edge churn on various complex topologies, frequently emerging in various communications environments. We investigate via simulation the impact of network evolution, by quantifying its effect on key network analysis metrics, such as the clustering coefficient and the plethora of centrality metrics, employed at large for analyzing topologies and designing applications. The proposed framework aspires to establish more holistic and efficient complex network control.
Vasileios Karyotis, Eleni Stai, Symeon Papavassiliou
A Reputation-Based Coalition Game to Prevent Smart Insider Jamming Attacks in MANETs
Abstract
Mobile Adhoc Networks (MANET) are susceptible to jamming attacks which can inhibit data transmissions. There has been considerable work done in the detection of external jamming attacks. However, detection of insider jamming attack in MANET has not received enough attention. The presence of an insider node that has constantly monitored the network and is privy to the network secrets can acquire sufficient information to cause irreparable damage. In this paper we propose a framework for a novel reputation-based coalition game between multiple players in a MANET to prevent internal attacks caused by an erstwhile legitimate node. A grand coalition is formed which will make a strategic security defense decision by depending on the stored transmission rate and reputation for each individual node in the coalition. Our results show that the simulation of the reputation-based coalition game would help improve the network’s defense strategy while also reducing false positives that results from the incorrect classification of unfortunate legitimate nodes as insider jammers.
Taiwo Oyedare, Ashraf Al Sharah, Sachin Shetty
A Goodness Based Vertical Handoff Algorithm for Heterogeneous Networks
Abstract
While moving across heterogeneous networks with strict rate requirement, the possibility of getting the required rate from the target network, depends on the QoS-awareness of the network selection strategy of the concerned vertical handoff (VHO) algorithm. Inclusion of MAC layer scheduling information in the design of different VHO algorithms has previously been very limited though it is important as both user and system performance depend on it. In this paper, we introduce the notion of goodness of an access network and based on it propose a goodness based VHO (GVHO) algorithm. The notion of goodness explicitly considers the MAC layer scheduling along with current load and interference of the candidate networks. The GVHO algorithm accounts the goodness values of the candidate networks to select the target network. Simulation results confirm that GVHO algorithm improves both user and system performance compared to RSS and SINR based VHO algorithms.
Shankar K. Ghosh, Sasthi C. Ghosh

Wireless Sensor Networks

Frontmatter
Routing-Aware Time Slot Allocation Heuristics in Contention-Free Sensor Networks
Abstract
Traditionally, in Wireless Sensor Networks, protocols are designed independently in the layered protocol stack, and metrics involved in several layers can be affected. Communication latency is one metric example, impacted by both the routing protocol in the network layer and the MAC protocol in the data link layer. Better performances can be obtained using cross-layer approaches.
In this paper, we address latency optimizations for communications in sensor networks, based on cross-layer decisions. More particularly, we propose new time slot scheduling methods correlated to routing decisions. Slot allocation for nodes follows particular routing tree traversals, trying to reduce the gap between the slot of a child and that of its parent.
Simulations show that latency performance of our contributions improves similar cross-layer approaches from 33 % up to 54 %. Duty cycle of obtained schedules are also improved from 7 % up to 11 %.
Lemia Louail, Violeta Felea
System Design and Analysis of UAV-Assisted BLE Wireless Sensor Systems
Abstract
Inefficiency of wireless sensor networks (WSN) in terms of the network lifetime is one of the major reasons preventing their widespread use. To alleviate this problem different data collection approaches have been proposed. One of the promising techniques is to use unmanned aerial vehicle (UAV). In spite of several papers advocating this approach, there have been no system designs and associated performance evaluation proposed to date. In this paper, we address this issue by proposing a new WSN design, where UAV serves as a sink while Bluetooth low energy (BLE) is used as a communication technology. We analyze the proposed design in terms of the network lifetime and area coverage comparing it with routed WSNs. Our results reveal that the lifetime of the proposed design is approximately two orders of magnitude longer than that of the routed WSNs. Using the tools of integral geometry we show that the density of nodes to cover a certain area is approximately two times more for routed WSNs compared to our design.
Mikhail Komarov, Dmitri Moltchanov
Implementing a Broadcast Storm Attack on a Mission-Critical Wireless Sensor Network
Abstract
In this work, we emphasize the practical importance of mission-critical wireless sensor networks (WSNs) for structural health monitoring of industrial constructions. Due to its isolated and ad hoc nature, this type of WSN deployments is susceptible to a variety of malicious attacks that may disrupt the underlying crucial systems. Along these lines, we review and implement one such attack, named a broadcast storm, where an attacker is attempting to flood the network by sending numerous broadcast packets. Accordingly, we assemble a live prototype of said scenario with real-world WSN equipment, as well as measure the key operational parameters of the WSN under attack, including packet transmission delays and the corresponding loss ratios. We further develop a simple supportive mathematical model based on widely-adopted methods of queuing theory. It allows for accurate performance assessment as well as for predicting the expected system performance, which has been verified with statistical methods.
Irina Krivtsova, Ilya Lebedev, Mikhail Sukhoparov, Nurzhan Bazhayev, Igor Zikratov, Aleksandr Ometov, Sergey Andreev, Pavel Masek, Radek Fujdiak, Jiri Hosek
Critical Sensor Density for Event-Driven Data-Gathering in Delay and Lifetime Constrained WSN
Abstract
In rare-event detection wireless sensor network (WSN) applications maximizing lifetime and minimizing end-to-end delay (e-delay) are important factors in designing a cost-efficient network, which can be achieved using asynchronous sleep/wake (s/w) scheduling techniques and anycasting data-forwarding strategies, respectively. In this paper, we address the problem of finding an optimal cost WSN that satisfies given delay constraint and lifetime requirement, assuming random uniform deployment of nodes in a circular-shaped Field-of-Interest (FoI) and estimate the maximum of minimum expected e-delay in an anycasting forwarding technique for a given sensor density. We use this analysis to find the critical expected sensor density that satisfies given e-delay constraint, and lifetime requirement. We also validate our analysis.
Debanjan Sadhukhan, Seela Veerabhadreswara Rao

Resource Management and Optimization

Frontmatter
Effective Capacity in Broadcast Channels with Arbitrary Inputs
Abstract
We consider a broadcast scenario where one transmitter communicates with two receivers under quality-of-service constraints. The transmitter initially employs superposition coding strategies with arbitrarily distributed signals and sends data to both receivers. Regarding the channel state conditions, the receivers perform successive interference cancellation to decode their own data. We express the effective capacity region that provides the maximum allowable sustainable data arrival rate region at the transmitter buffer or buffers. Given an average transmission power limit, we provide a two-step approach to obtain the optimal power allocation policies that maximize the effective capacity region. Then, we characterize the optimal decoding regions at the receivers in the space spanned by the channel fading power values. We finally substantiate our results with numerical presentations.
Marwan Hammouda, Sami Akin, Jürgen Peissig
Throughput Improvement Using Partially Overlapping Channels in WLAN with Heterogeneous Clients
Abstract
We consider a realistic wireless local area network (WLAN) consisting of a number of access points (APs) and a number of clients of heterogeneous types (IEEE 802.11 b/g/n). Although, activating APs using only non-overlapping channels (NOCs), which is very limited, can help us achieve interference-free environment, but the achievable throughput may not be optimized. So, partially overlapping channels (POCs) may be used along with NOCs in the most optimized manner, in order to improve the achievable throughput up to certain extent while satisfying the interference criteria. We present an effective greedy algorithm that makes the most desirable configuration by appropriately selecting a subset of APs for activation using NOCs as well as POCs and associating the clients with the selected APs in the most optimized way. Our simulation results show a significant improvement of the aggregate throughput obtained by using NOCs as well as POCs, over using NOCs only.
Sreetama Mukherjee, Sasthi C. Ghosh
Optimal Link Deployment for Minimizing Average Path Length in Chain Networks
Abstract
This study considers chain-topology networks, which has certain inherent limitations, and presents an optimization model that augments the network by the addition of a new link, with the objective of minimizing Average Path Length (APL).
We built up a mathematical model for APL, and formulated our problem as Integer Programming. Then, we solved the problem experimentally by brute-force, trying all possible topologies, and found the optimal solutions that minimize APL for certain network sizes up to 1000 nodes. Later on, we derived analytical solution of the problem by applying Linear Regression method on the experimental results obtained.
We showed that APL on a chain-topology network is decreased by the proposed optimization model, at a gradually increasing rate from 24.81 % to asymptotic value of 41.4 % as network grows. Additionally, we found that normalized length of the optimal solutions decreases logarithmically from 100 % to 58.6048 % as network size gets larger.
Zeki Bilgin, Murat Gunestas, Omer Demir, Sahin Buyrukbilen
Backmatter
Metadaten
Titel
Wired/Wireless Internet Communications
herausgegeben von
Lefteris Mamatas
Ibrahim Matta
Panagiotis Papadimitriou
Yevgeni Koucheryavy
Copyright-Jahr
2016
Electronic ISBN
978-3-319-33936-8
Print ISBN
978-3-319-33935-1
DOI
https://doi.org/10.1007/978-3-319-33936-8

Premium Partner

    Bildnachweise