A testbed for MANETs: Implementation, experiences and learned lessons

In this paper, we present the implementation, experiences and lessons learned of our tesbed for Ad-hoc networks and Mobile Ad hoc Networks (MANETs). We used OLSR protocol for real experimental evaluation. We investigate the effect of mobility and topology changing in the throughput of a MANET. We study the impact of best-effort traffic for Mesh Topology and Linear Topology. In this work, we consider eight experimental models and we assess the performance of our testbed in terms of throughput, round trip time and packet loss. We found that some of the OLSR's problems can be solved, for instance the routing loop, but this protocol still has the self-interference problem. Also, there is an intricate interdependence between MAC layer and routing layer. We carried out the experiments considering stationary nodes of an Ad-hoc network and the node mobility of MANETs. We found that throughput of TCP was improved by reducing Link Quality Window Size (LQWS). For TCP data flow, we got better results when the LQWS value was 10. Moreover, we found that the node join and leave operations increase the packet loss. The OLSR protocol has a good performance when the source node is moving. However, the performance is not good when the relay nodes are moving.Peer ReviewedPostprint (published version

Architectural aspects of QoS-aware personal networks

Personal Networks (PN) are future communication systems that combine wireless and infracuture based networks to provide users a variety of services anywhere and anytime. PNs introduce new design challenges due to the heterogeneity of the involved technologies, the need for self-organization, the dynamics of the system composition, the application-driven nature, the co-operation with infrastructure-based networks, and the security hazards. This paper discusses the challenges of security and QoS provisioning in designing self-organized personal networks and combines them all into an integrated architectural framework

A Survey on Energy-Efficient Strategies in Static Wireless Sensor Networks

A comprehensive analysis on the energy-efficient strategy in static Wireless Sensor Networks (WSNs) that are not equipped with any energy harvesting modules is conducted in this article. First, a novel generic mathematical definition of Energy Efficiency (EE) is proposed, which takes the acquisition rate of valid data, the total energy consumption, and the network lifetime of WSNs into consideration simultaneously. To the best of our knowledge, this is the first time that the EE of WSNs is mathematically defined. The energy consumption characteristics of each individual sensor node and the whole network are expounded at length. Accordingly, the concepts concerning EE, namely the Energy-Efficient Means, the Energy-Efficient Tier, and the Energy-Efficient Perspective, are proposed. Subsequently, the relevant energy-efficient strategies proposed from 2002 to 2019 are tracked and reviewed. Specifically, they respectively are classified into five categories: the Energy-Efficient Media Access Control protocol, the Mobile Node Assistance Scheme, the Energy-Efficient Clustering Scheme, the Energy-Efficient Routing Scheme, and the Compressive Sensing--based Scheme. A detailed elaboration on both of the basic principle and the evolution of them is made. Finally, further analysis on the categories is made and the related conclusion is drawn. To be specific, the interdependence among them, the relationships between each of them, and the Energy-Efficient Means, the Energy-Efficient Tier, and the Energy-Efficient Perspective are analyzed in detail. In addition, the specific applicable scenarios for each of them and the relevant statistical analysis are detailed. The proportion and the number of citations for each category are illustrated by the statistical chart. In addition, the existing opportunities and challenges facing WSNs in the context of the new computing paradigm and the feasible direction concerning EE in the future are pointed out

Simulation study of routing protocols in wireless sensor networks

Wireless sensor networks, a distributed network of sensor nodes perform critical tasks in many application areas such as target tracking in military applications, detection of catastrophic events, environment monitoring, health applications etc. The routing protocols developed for these distributed sensor networks need to be energy efficient and scalable. To create a better understanding of the performance of various routing protocols proposed it is very important to perform a detailed analysis of them. Network simulators enable us to study the performance and behavior of these protocols on various network topologies. Many Sensor Network frameworks were developed to explore both the networking issues and the distributed computing aspects of wireless sensor networks. The current work of simulation study of routing protocols is done on SensorSimulator, a discrete event simulation framework developed at Sensor Networks Research Laboratory, LSU and on a popular event driven network simulator ns2 developed at UC Berkeley. SensorSimulator is a discrete event simulation framework for sensor networks built over OMNeT++ (Objective Modular Network Test-bed in C++). This framework allows the user to debug and test software for distributed sensor networks. SensorSimulator allows developers and researchers in the area of Sensor Networks to investigate topological, phenomenological, networking, robustness and scaling issues, to explore arbitrary algorithms for distributed sensors, and to defeat those algorithms through simulated failure. The framework has modules for all the layers of a Sensor Network Protocol stack. This thesis is focused on the simulation and performance evaluation of various routing protocols on SensorSimulator and ns2. The performance of the simulator is validated with a comparative study of Directed Diffusion Routing Protocol on both ns2 and SensorSimulator. Then the simulations are done to evaluate the performance of Optimized Broadcast Protocols for Sensor Networks, Efficient Coordination Protocol for Wireless Sensor Networks on SensorSimulator. Also a performance study of Random Asynchronous Wakeup protocol for Sensor Networks is done on ns2

A COMMUNICATION FRAMEWORK FOR MULTIHOP WIRELESS ACCESS AND SENSOR NETWORKS: ANYCAST ROUTING & SIMULATION TOOLS

The reliance on wireless networks has grown tremendously within a number of varied application domains, prompting an evolution towards the use of heterogeneous multihop network architectures. We propose and analyze two communication frameworks for such networks. A first framework is designed for communications within multihop wireless access networks. The framework supports dynamic algorithms for locating access points using anycast routing with multiple metrics and balancing network load. The evaluation shows significant performance improvement over traditional solutions. A second framework is designed for communication within sensor networks and includes lightweight versions of our algorithms to fit the limitations of sensor networks. Analysis shows that this stripped down version can work almost equally well if tailored to the needs of a sensor network. We have also developed an extensive simulation environment using NS-2 to test realistic situations for the evaluations of our work. Our tools support analysis of realistic scenarios including the spreading of a forest fire within an area, and can easily be ported to other simulation software. Lastly, we us our algorithms and simulation environment to investigate sink movements optimization within sensor networks. Based on these results, we propose strategies, to be addressed in follow-on work, for building topology maps and finding optimal data collection points. Altogether, the communication framework and realistic simulation tools provide a complete communication and evaluation solution for access and sensor networks

Exploiting vehicular social networks and dynamic clustering to enhance urban mobility management

Transport authorities are employing advanced traffic management system (ATMS) to improve vehicular traffic management efficiency. ATMS currently uses intelligent traffic lights and sensors distributed along the roads to achieve its goals. Furthermore, there are other promising technologies that can be applied more efficiently in place of the abovementioned ones, such as vehicular networks and 5G. In ATMS, the centralized approach to detect congestion and calculate alternative routes is one of the most adopted because of the difficulty of selecting the most appropriate vehicles in highly dynamic networks. The advantage of this approach is that it takes into consideration the scenario to its full extent at every execution. On the other hand, the distributed solution needs to previously segment the entire scenario to select the vehicles. Additionally, such solutions suggest alternative routes in a selfish fashion, which can lead to secondary congestions. These open issues have inspired the proposal of a distributed system of urban mobility management based on a collaborative approach in vehicular social networks (VSNs), named SOPHIA. The VSN paradigm has emerged from the integration of mobile communication devices and their social relationships in the vehicular environment. Therefore, social network analysis (SNA) and social network concepts (SNC) are two approaches that can be explored in VSNs. Our proposed solution adopts both SNA and SNC approaches for alternative route-planning in a collaborative way. Additionally, we used dynamic clustering to select the most appropriate vehicles in a distributed manner. Simulation results confirmed that the combined use of SNA, SNC, and dynamic clustering, in the vehicular environment, have great potential in increasing system scalability as well as improving urban mobility management efficiency1916CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO - CNPQCOORDENAÇÃO DE APERFEIÇOAMENTO DE PESSOAL DE NÍVEL SUPERIOR - CAPESFUNDAÇÃO DE AMPARO À PESQUISA DO ESTADO DE SÃO PAULO - FAPESP401802/2016-7; 2015/25588-6; 2016/24454-9; 2018/02204-6; 465446/2014-088887.136422/2017-002014/50937-