995 research outputs found

    M-GEAR: Gateway-Based Energy-Aware Multi-Hop Routing Protocol for WSNs

    Full text link
    In this research work, we advise gateway based energy-efficient routing protocol (M-GEAR) for Wireless Sensor Networks (WSNs). We divide the sensor nodes into four logical regions on the basis of their location in the sensing field. We install Base Station (BS) out of the sensing area and a gateway node at the centre of the sensing area. If the distance of a sensor node from BS or gateway is less than predefined distance threshold, the node uses direct communication. We divide the rest of nodes into two equal regions whose distance is beyond the threshold distance. We select cluster heads (CHs)in each region which are independent of the other region. These CHs are selected on the basis of a probability. We compare performance of our protocol with LEACH (Low Energy Adaptive Clustering Hierarchy). Performance analysis and compared statistic results show that our proposed protocol perform well in terms of energy consumption and network lifetime.Comment: IEEE 8th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA'13), Compiegne, Franc

    Energy Consumption Rate based Stable Election Protocol (ECRSEP) for WSNs

    Get PDF
    In recent few yearsWireless Sensor Networks (WSNs) have seen an increased interest in various applications like border field security, disaster management and medical applications. So large number of sensor nodes are deployed for such applications, which can work autonomously. Due to small power batteries in WSNs, efficient utilization of battery power is an important factor. Clustering is an efficient technique to extend life time of sensor networks by reducing the energy consumption. In this paper, we propose a new protocol; Energy Consumption Rate based Stable Election Protocol (ECRSEP). Our CH selection scheme is based on the weighted election probabilities of each node according to the Energy Consumption Rate (ECR) of each node. We compare results of our proposed protocol with Low Energy Adaptive Clustering Hierarchy (LEACH), Distributed Energy Efficient Clustering (DEEC), Stable Election Protocol (SEP), and Enhanced SEP(ESEP). Our simulation results show that our proposed protocol, ECRSEP outperforms all these protocols in terms of network stability and network lifetime

    HEER: Hybrid Energy Efficient Reactive Protocol for Wireless Sensor Networks

    Full text link
    Wireless Sensor Networks (WSNs) consist of numerous sensors which send sensed data to base station. Energy conservation is an important issue for sensor nodes as they have limited power.Many routing protocols have been proposed earlier for energy efficiency of both homogeneous and heterogeneous environments. We can prolong our stability and network lifetime by reducing our energy consumption. In this research paper, we propose a protocol designed for the characteristics of a reactive homogeneous WSNs, HEER (Hybrid Energy Efficient Reactive) protocol. In HEER, Cluster Head(CH) selection is based on the ratio of residual energy of node and average energy of network. Moreover, to conserve more energy, we introduce Hard Threshold (HT) and Soft Threshold (ST). Finally, simulations show that our protocol has not only prolonged the network lifetime but also significantly increased stability period.Comment: 2nd IEEE Saudi International Electronics, Communications and Photonics Conference (SIECPC 13), 2013, Riyadh, Saudi Arabi

    On Modeling Geometric Joint Sink Mobility with Delay-Tolerant Cluster-less Wireless Sensor Networks

    Full text link
    Moving Sink (MS) in Wireless Sensor Networks (WSNs) has appeared as a blessing because it collects data directly from the nodes where the concept of relay nodes is becomes obsolete. There are, however, a few challenges to be taken care of, like data delay tolerance and trajectory of MS which is NP-hard. In our proposed scheme, we divide the square field in small squares. Middle point of the partitioned area is the sojourn location of the sink, and nodes around MS are in its transmission range, which send directly the sensed data in a delay-tolerant fashion. Two sinks are moving simultaneously; one inside and having four sojourn locations and other in outer trajectory having twelve sojourn locations. Introduction of the joint mobility enhances network life and ultimately throughput. As the MS comes under the NP-hard problem, we convert it into a geometric problem and define it as, Geometric Sink Movement (GSM). A set of linear programming equations has also been given in support of GSM which prolongs network life time

    EMEEDP: Enhanced Multi-hop Energy Efficient Distributed Protocol for Heterogeneous Wireless Sensor Network

    Full text link
    In WSN (Wireless Sensor Network) every sensor node sensed the data and transmit it to the CH (Cluster head) or BS (Base Station). Sensors are randomly deployed in unreachable areas, where battery replacement or battery charge is not possible. For this reason, Energy conservation is the important design goal while developing a routing and distributed protocol to increase the lifetime of WSN. In this paper, an enhanced energy efficient distributed protocol for heterogeneous WSN have been reported. EMEEDP is proposed for heterogeneous WSN to increase the lifetime of the network. An efficient algorithm is proposed in the form of flowchart and based on various clustering equation proved that the proposed work accomplishes longer lifetime with improved QOS parameters parallel to MEEP. A WSN implemented and tested using Raspberry Pi devices as a base station, temperature sensors as a node and xively.com as a cloud. Users use data for decision purpose or business purposes from xively.com using internet.Comment: 6 pages, 4 figures. arXiv admin note: substantial text overlap with arXiv:1409.1412 by other author

    Improved Fair-Zone technique using Mobility Prediction in WSN

    Full text link
    The self-organizational ability of ad-hoc Wireless Sensor Networks (WSNs) has led them to be the most popular choice in ubiquitous computing. Clustering sensor nodes organizing them hierarchically have proven to be an effective method to provide better data aggregation and scalability for the sensor network while conserving limited energy. It has some limitation in energy and mobility of nodes. In this paper we propose a mobility prediction technique which tries overcoming above mentioned problems and improves the life time of the network. The technique used here is Exponential Moving Average for online updates of nodal contact probability in cluster based network.Comment: 10 pages, 7 figures, Published in International Journal Of Advanced Smart Sensor Network Systems (IJASSN
    • …
    corecore