103,795 research outputs found

    A survey on network simulators in three-dimensional wireless ad hoc and sensor networks

    Get PDF
    © 2016 The Author(s). As steady research in wireless ad hoc and sensor networks is going on, performance evaluation through relevant network simulator becomes indispensable procedure to demonstrate superiority to comparative schemes and suitability in most literatures. Thus, it is very important to establish credibility of simulation results by investigating merits and limitations of each simulator prior to selection. Based on this motivation, in this article, we present a comprehensive survey on current network simulators for new emerging research area, three-dimensional wireless ad hoc and sensor networks which is represented by airborne ad hoc networks and underwater sensor networks by reviewing major existing simulators as well as presenting their main features in several aspects. In addition, we address the outstanding mobility models which are main components in simulation study for self-organizing ad hoc networks. Finally, open research issues and research challenges are discussed and presented

    Distributed Algorithms for Improving Wireless Sensor Network Lifetime with Adjustable Sensing Range

    Get PDF
    Wireless sensor networks are made up of a large number of sensors deployed randomly in an ad-hoc manner in the area/target to be monitored. Due to their weight and size limitations, the energy conservation is the most critical issue. Energy saving in a wireless sensor network can be achieved by scheduling a subset of sensor nodes to activate and allowing others to go into low power sleep mode, or adjusting the transmission or sensing range of wireless sensor nodes. In this thesis, we focus on improving the lifetime of wireless sensor networks using both smart scheduling and adjusting sensing ranges. Firstly, we conduct a survey on existing works in literature and then we define the sensor network lifetime problem with range assignment. We then propose two completely localized and distributed scheduling algorithms with adjustable sensing range. These algorithms are the enhancement of distributed algorithms for fixed sensing range proposed in the literature. The simulation results show that there is almost 20 percent improvement of network lifetime when compare with the previous approaches

    Outlier Identification in Sensor Network Clock Synchronization

    Get PDF
    We first present a survey of clock synchronization research that describes the problem and various challenges to implementing an efficient protocol for clock synchronization in sensor networks. We then present several changes to an existing protocol that we believe will enhance the accuracy. These changes are implemented in a software simulation and a large experiment is conducted that involves several runs of the simulation using various parameters for error bounds and outlier detection. We present our results and show that modifying the outlier detection range used by many existing algorithms can improve network clock accuracy and provide a stabilized average error

    Initialization algorithms for wireless ad-hoc networks

    Get PDF
    The aim of this master thesis is the implementation of simulation models and the simulation of energy-efficient network initialization algorithms. First of all, it is presented a survey of state-of-the-art strategies for network initialization and exploration in wireless ad-hoc networks. Among the routing approaches presented in the survey it has been chosen the clustering-based approach due to it is the most suitable for ad-hoc sensor networks. Following are explained the features and properties of the clustering-based routing algorithms that have been selected for their implementation on this work. These implemented routing protocols are LEACH, LEACH-C, the solaraware extensions of both, HEED and a protocol based on direct transmission just as a reference in the comparison among the rest of them. On the other hand, all these routing protocols have been implemented and simulated using the OMNeT++ 4.0, which is a freeware discrete simulation environment. Subsequently, all the protocols have been simulated with different parameters and conditions to prove their functionality and to find out their behaviour in different sorts of sensor networks. Next, the simulations of the algorithms are compared among each other especially in terms of communication and energy efficiency. There are presented different comparisons such as LEACH and LEACH-C with their respective solar-aware extensions of both, a comparison between HEED with optimized parameters and non-optimized parameters, and finally a general comparison among One-hop, LEACH, LEACH-C and HEED. To sum up, some conclusions are drawn about the performance of the different protocols and some key points are given for future work. Furthermore, it is presented a brief study of the environmental impact this work may have

    Big Data Model Simulation on a Graph Database for Surveillance in Wireless Multimedia Sensor Networks

    Full text link
    Sensors are present in various forms all around the world such as mobile phones, surveillance cameras, smart televisions, intelligent refrigerators and blood pressure monitors. Usually, most of the sensors are a part of some other system with similar sensors that compose a network. One of such networks is composed of millions of sensors connect to the Internet which is called Internet of things (IoT). With the advances in wireless communication technologies, multimedia sensors and their networks are expected to be major components in IoT. Many studies have already been done on wireless multimedia sensor networks in diverse domains like fire detection, city surveillance, early warning systems, etc. All those applications position sensor nodes and collect their data for a long time period with real-time data flow, which is considered as big data. Big data may be structured or unstructured and needs to be stored for further processing and analyzing. Analyzing multimedia big data is a challenging task requiring a high-level modeling to efficiently extract valuable information/knowledge from data. In this study, we propose a big database model based on graph database model for handling data generated by wireless multimedia sensor networks. We introduce a simulator to generate synthetic data and store and query big data using graph model as a big database. For this purpose, we evaluate the well-known graph-based NoSQL databases, Neo4j and OrientDB, and a relational database, MySQL.We have run a number of query experiments on our implemented simulator to show that which database system(s) for surveillance in wireless multimedia sensor networks is efficient and scalable

    Multihop clustering algorithm for load balancing in wireless sensor networks

    Get PDF
    The paper presents a new cluster based routing algorithm that exploits the redundancy properties of the sensor networks in order to address the traditional problem of load balancing and energy efficiency in the WSNs.The algorithm makes use of the nodes in a sensor network of which area coverage is covered by the neighbours of the nodes and mark them as temporary cluster heads. The algorithm then forms two layers of multi hop communication. The bottom layer which involves intra cluster communication and the top layer which involves inter cluster communication involving the temporary cluster heads. Performance studies indicate that the proposed algorithm solves effectively the problem of load balancing and is also more efficient in terms of energy consumption from Leach and the enhanced version of Leach
    corecore