968 research outputs found

    An Adaptive Algorithm to Optimize the Dynamics of IEEE 802.15.4 Networks

    Get PDF
    Presentado en ICST 2013IEEE 802.15.4 standard is becoming one of the most popular technologies for the deployment of low rate Wireless Personal Area Networks with strong power constraints. In order to reduce the energy consumption, beacon-enabled networks with long network inactive periods can be employed. However, the duration of these inactivity periods, as some other configuration parameters, are conventionally set to default values and remain fixed during the whole network operation. This implies that if they are misconfigured the network will not adapt to changes in the conditions of the environment, particularly to the most determining one, i.e. the traffic load. This paper proposes a simple procedure for the dynamic adaptation of several key parameters of IEEE 802.15.4 networks. Under this procedure, the 802.15.4 parameters are modified as a function of the existing traffic conditions.Spanish National Project No.TEC2009-13763-C02-01

    Minimizing End-to-End Delay and Maximizing Reliability using Multilayer Neural Network-based Hamming Back Propagation for Efficient Communication in WSN

    Get PDF
    Wireless sensor network (WSN) comprises number of spatially distributed sensor nodes for monitoring the physical environment conditions and arranging the gathered data at central location. WSN gained large attention in medical field, industry, military, etc. However, congestion control mechanism for communication between sensor nodes failed to consider the end-to-end delay features. In addition, it failed to handle reliability and not achieved the data concurrency. In order to address the above mentioned problems, Multilayer Neural Network-based Hamming Back Propagation (MNN-HBP) technique is introduced for efficient communication in WSN. In MNN-HBP technique, Amorphous View Point Algorithm is introduced for sensor node initialization for efficient communication in WSN. Amorphous View Point Algorithm used time of arrival to measure the time distance between the sender node and receiver node. After that Hamming Back Propagation Algorithm is used to identify the current location of the sensor nodes for minimizing the end-to end delay and improving the reliability. Each sensor node compares their distance with the neighbouring sensor nodes distance to identify the associated error. When the distance is higher, the associated error is higher and propagates error back to other sensor nodes in the previous layers. The process gets repeated until the communication established between source sensor and lower associated error nodes. By this way, efficient communication is carried out with higher reliability and minimum end-to end delay. Extensive simulation are conducted to illustrate the efficiency of proposed technique as well as the impacts of network parameters on end-to-end delay, reliability and data packets successful rate with respect to data packet size and number of data packets

    Efficient Data Collection in Multimedia Vehicular Sensing Platforms

    Full text link
    Vehicles provide an ideal platform for urban sensing applications, as they can be equipped with all kinds of sensing devices that can continuously monitor the environment around the travelling vehicle. In this work we are particularly concerned with the use of vehicles as building blocks of a multimedia mobile sensor system able to capture camera snapshots of the streets to support traffic monitoring and urban surveillance tasks. However, cameras are high data-rate sensors while wireless infrastructures used for vehicular communications may face performance constraints. Thus, data redundancy mitigation is of paramount importance in such systems. To address this issue in this paper we exploit sub-modular optimisation techniques to design efficient and robust data collection schemes for multimedia vehicular sensor networks. We also explore an alternative approach for data collection that operates on longer time scales and relies only on localised decisions rather than centralised computations. We use network simulations with realistic vehicular mobility patterns to verify the performance gains of our proposed schemes compared to a baseline solution that ignores data redundancy. Simulation results show that our data collection techniques can ensure a more accurate coverage of the road network while significantly reducing the amount of transferred data

    Flow Allocation for Maximum Throughput and Bounded Delay on Multiple Disjoint Paths for Random Access Wireless Multihop Networks

    Full text link
    In this paper, we consider random access, wireless, multi-hop networks, with multi-packet reception capabilities, where multiple flows are forwarded to the gateways through node disjoint paths. We explore the issue of allocating flow on multiple paths, exhibiting both intra- and inter-path interference, in order to maximize average aggregate flow throughput (AAT) and also provide bounded packet delay. A distributed flow allocation scheme is proposed where allocation of flow on paths is formulated as an optimization problem. Through an illustrative topology it is shown that the corresponding problem is non-convex. Furthermore, a simple, but accurate model is employed for the average aggregate throughput achieved by all flows, that captures both intra- and inter-path interference through the SINR model. The proposed scheme is evaluated through Ns2 simulations of several random wireless scenarios. Simulation results reveal that, the model employed, accurately captures the AAT observed in the simulated scenarios, even when the assumption of saturated queues is removed. Simulation results also show that the proposed scheme achieves significantly higher AAT, for the vast majority of the wireless scenarios explored, than the following flow allocation schemes: one that assigns flows on paths on a round-robin fashion, one that optimally utilizes the best path only, and another one that assigns the maximum possible flow on each path. Finally, a variant of the proposed scheme is explored, where interference for each link is approximated by considering its dominant interfering nodes only.Comment: IEEE Transactions on Vehicular Technolog

    Elastic hybrid MAC protocol for wireless sensor networks

    Get PDF
    The future is moving towards offering multiples services based on the same technology. Then, billions of sensors will be needed to satisfy the diversity of these services. Such considerable amount of connected devices must insure efficient data transmission for diverse applications. Wireless sensor network (WSN) represents the most preferred technology for the majority of applications. Researches in medium access control (MAC) mechanism have been of significant impact to the application growth because the MAC layer plays a major role in resource allocation in WSNs. We propose to enhance a MAC protocol of WSN to overcome traffic changes constraints. To achieve focused goal, we use elastic hybrid MAC scheme. The main interest of the developed MAC protocol is to design a medium access scheme that respect different quality of services (QoS) parameters needed by various established traffic. Simulation results show good improvement in measured parameters compared to typical protocol
    • …
    corecore