NPART - Node Placement Algorithm for Realistic Topologies in Wireless Multihop Network Simulation

Despite a considerable number of topology generation algorithms for simulation of wireless multihop networks it is difficult to find one with output similar to real networks [13]. In this paper, we propose NPART { a Node Placement Algorithm for Realistic Topologies whose created topologies resemble networks encountered in reality. The algorithm is flexible since it is sufficient to provide it with different input data to obtain different topologies. To demonstrate its quality and adaptivity, we compare topologies created by PART algorithm with topology samples from open wireless multihop networks in Berlin and Leipzig. Compared with real topologies, the generated topologies have almost identical node degree distribution, similar number of cut edges and vertices, and distribution of component sizes after bridge removal. The importance of node placement algorithm is demonstrated by comparing ns-2 simulation results for grid and uniform node placement with NPART generated topologies. Simulation results show that quality of node placement model plays as important role in simulation outcome as the accuracy of wireless signal propagation model. To our best knowledge, this is the first node placement algorithm for wireless multihop networks capable of creating topologies that have properties observed in user initiated networks

Poster: TrueNets, a Topology Generator for Realistic Network Analysis

The availability of realistic topology generators is a key component in the study of network performance. This work describes a new approach for realistic generation of topologies, named TrueNets, that uses open data provided by public administrations and crowd-sensing efforts for populated areas, maps, altitude of land and buildings; TrueNets estimates link performance with classical propagation models and produces annotated topologies of networks that can actually exist in the selected areas, thus providing not only an abstract tool for performance evaluation, but also a design tool for planning. We use TrueNets to model distributed mesh networks and we show that the generated topologies differ substantially from state-of-the-art synthetic generators

On IPv6 Experimentation in Wireless Mobile Ad Hoc Networks, Journal of Telecommunications and Information Technology, 2014, nr 3

With the growing interest towards the Internet of Things IPv6-based mobile ad hoc networks (MANETs) become a key enabling technology offering the possibility of automated, unsupervised network configuration and operation. Such a functionality calls for an accurate and reliable testing of the newly proposed solutions, which is challenging due to the dynamic, decentralized and ad hoc nature of MANETs. In this work selected topics are presented on performing IPv6 protocols experimentation in wireless, IPv6-only mobile ad hoc networks – including both simulation – and testbed-based evaluation. Based on the authors experience with the evaluation of the extended IPv6 Neighbor Discovery protocol (ND++) proposed during the course of research, the selection of an opensource simulation environment is presented and a comparison between simulation and emulation experimentation methods is provided. Benefits and drawbacks of both these methodologies for testing IPv6 solutions are depicted. Moreover, the important aspects of topology and mobility considerations are considered. Finally the authors propose a testing approach that would allow for a detailed and accurate evaluation by means of open-source, easily accessible and low-cost methodologies

COMVIVOR: An Evolutionary Communication Framework Based on Survivors’ Devices Reuse

International audienceMobile devices currently available on the market have a plethoraof features and enough computing power to make them, at the same time,information consumers, forwarders and producers. Since they are also providedwith a set of sensors and usually battery operating, they are perfect candidatesto devise a network infrastructure tailored to function during disruptive events.When everything else fails, they could autonomously reorganize and provide tothe civilians and rescue teams valuable services and information. In this paperwe adapt and enhance a previous designed framework, capable to epidemicallydiuse the proper software updates to its nodes, in order to deploy any kind ofservice as a prompt response to the needs raised in emergency situations. Wefurther propose and integrate a new smart positioning strategy, to speed up thediusion of software updates by also keeping under control the overall networkoverhead. The achieved results show the feasibility of our proposal and howthe dynamics of diusion are enhanced by the smart positioning algorithm

Towards scalable Community Networks topologies

Community Networks (CNs) are grassroots bottom-up initiatives that build local infrastructures, normally using Wi-Fi technology, to bring broadband networking in areas with inadequate offer of traditional infrastructures such as ADSL, FTTx or wide-band cellular (LTE, 5G). Albeit they normally operate as access networks to the Internet, CNs are ad-hoc networks that evolve based on local requirements and constraints, often including additional local services on top of Internet access. These networks grow in highly decentralized manner that radically deviates from the top-down network planning practiced in commercial mobile networks, depending, on the one hand, on the willingness of people to participate, and, on the other hand, on the feasibility of wireless links connecting the houses of potential participants with each other. In this paper, we present a novel methodology and its implementation into an automated tool, which enables the exercise of (light) centralized control to the dynamic and otherwise spontaneous CN growth process. The goal of the methodology is influencing the choices to connect a new node to the CN so that it can grow with more balance and to a larger size. Input to our methodology are open source resources about the physical terrain of the CN deployment area, such as Open Street Map and very detailed (less than 1 m resolution) LIDAR-based data about buildings layout and height, as well as technical descriptions and pricing data about off-the-shelf networking devices that are made available by manufacturers. Data related to demographics can be easily added to refine the environment description. With these data at hand, the tool can estimate the technical and economic feasibility of adding new nodes to the CN and actively assist new CN users in selecting proper equipment and CN node(s) to connect with to improve the CN scalability. We test our methodology in four different areas representing standard territorial characterization categories: urban, suburban, intermediate, and rural. In all four cases our tool shows that CNs scale to much larger size using the assisted, network-aware methodology when compared with de facto practices. Results also show that the CNs deployed with the assisted methodology are more balanced and have a lower per-node cost for the same per-node guaranteed bandwidth. Moreover, this is achieved with fewer devices per node, which means that the network is cheaper to build and easier to maintain.Peer ReviewedPostprint (author's final draft

Performance Optimization of Network Protocols for IEEE 802.11s-based Smart Grid Communications

The transformation of the legacy electric grid to Smart Grid (SG) poses numerous challenges in the design and development of an efficient SG communications network. While there has been an increasing interest in identifying the SG communications network and possible SG applications, specific research challenges at the network protocol have not been elaborated yet. This dissertation revisited each layer of a TCP/IP protocol stack which basically was designed for a wired network and optimized their performance in IEEE 802.11s-based Advanced Metering Infrastructure (AMI) communications network against the following challenges: security and privacy, AMI data explosion, periodic simultaneous data reporting scheduling, poor Transport Control Protocol (TCP) performance, Address Resolution Protocol (ARP) broadcast, and network interoperability. To address these challenges, layered and/or cross-layered protocol improvements were proposed for each layer of TCP/IP protocol stack. At the application layer, a tree-based periodic time schedule and a time division multiple access-based scheduling were proposed to reduce high contention when smart meters simultaneously send their reading. Homomorphic encryption performance was investigated to handle AMI data explosion while providing security and privacy. At the transport layer, a tree-based fixed Retransmission Timeout (RTO) setting and a path-error aware RTO that exploits rich information of IEEE 802.11s data-link layer path selection were proposed to address higher delay due to TCP mechanisms. At the network layer, ARP requests create broadcast storm problems in IEEE 802.11s due to the use of MAC addresses for routing. A secure piggybacking-based ARP was proposed to eliminate this issue. The tunneling mechanisms in the LTE network cause a downlink traffic problem to IEEE 802.11s. For the network interoperability, at the network layer of EPC network, a novel UE access list was proposed to address this issue. At the data-link layer, to handle QoS mismatch between IEEE 802.11s and LTE network, Dual Queues approach was proposed for the Enhanced Distributed Channel Access. The effectiveness of all proposed approaches was validated through extensive simulation experiments using a network simulator. The simulation results showed that the proposed approaches outperformed the traditional TCP/IP protocols in terms of end to end delay, packet delivery ratio, throughput, and collection time

A survey of flooding, gossip routing, and related schemes for wireless multi- hop networks

Flooding is an essential and critical service in computer networks that is used by many routing protocols to send packets from a source to all nodes in the network. As the packets are forwarded once by each receiving node, many copies of the same packet traverse the network which leads to high redundancy and unnecessary usage of the sparse capacity of the transmission medium. Gossip routing is a well-known approach to improve the flooding in wireless multi-hop networks. Each node has a forwarding probability p that is either statically per-configured or determined by information that is available at runtime, e.g, the node degree. When a packet is received, the node selects a random number r. If the number r is below p, the packet is forwarded and otherwise, in the most simple gossip routing protocol, dropped. With this approach the redundancy can be reduced while at the same time the reachability is preserved if the value of the parameter p (and others) is chosen with consideration of the network topology. This technical report gives an overview of the relevant publications in the research domain of gossip routing and gives an insight in the improvements that can be achieved. We discuss the simulation setups and results of gossip routing protocols as well as further improved flooding schemes. The three most important metrics in this application domain are elaborated: reachability, redundancy, and management overhead. The published studies used simulation environments for their research and thus the assumptions, models, and parameters of the simulations are discussed and the feasibility of an application for real world wireless networks are highlighted. Wireless mesh networks based on IEEE 802.11 are the focus of this survey but publications about other network types and technologies are also included. As percolation theory, epidemiological models, and delay tolerant networks are often referred as foundation, inspiration, or application of gossip routing in wireless networks, a brief introduction to each research domain is included and the applicability of the particular models for the gossip routing is discussed

eHDDP: Enhanced Hybrid Domain Discovery Protocol for network topologies with both wired/wireless and SDN/non-SDN devices

Handling efficiently both wired and/or wireless devices in SDN networks is still an open issue. eHDDP comes as an enhanced version of the Hybrid Domain Discovery Protocol (HDDP) that allows the SDN control plane to discover and manage hybrid topologies composed by both SDN and non-SDN devices with wired and/or wireless interfaces, thus opening a path for the integration of IoT and SDN networks. Moreover, the proposal is also able to detect both unidirectional and bidirectional links between wireless devices. eHDDP has been thoroughly evaluated in different scenarios and exhibits good scalability properties since the number of required messages is proportional to the number of existing links in the network topology. Moreover, the obtained discovery and processing times give the opportunity to support scenarios with low mobility devices since the discovery times are in the range of hundreds of milliseconds.Comunidad de MadridJunta de Comunidades de Castilla-La Manch

Journal of Telecommunications and Information Technology, 2014, nr 3

kwartalni