PRIB-CDS: An Energy Efficient Low Duty Cycle Broadcasting Scheme for Wireless Sensor Network

Low duty cycling is a widely adapted technique to conserve energy in the most used Medium Access Control (MAC) protocols in Wireless Sensor Networks (WSN). But such low duty cycle-based MAC protocols perform poorly under broadcast traffic as they suffer from redundant retransmission and maximization of relay nodes problems. Addressing these issues is critical, as the advent of IoT and ubiquitous computing applications has increased the demand for broadcast support. Our previous work, Preamble based Receiver Initiated Broadcasting MAC (PRIB-MAC) performed well in most parameters under broadcast traffic, but it had scope for improvement in reducing the number of transmissions. In this paper, we propose the PRIB-Connected Dominating Set (PRIB-CDS), built on top of PRIB-MAC with the addition of dynamic forwarding technique by forming a forwarding set with the help of Greedy algorithm. The simulation results of our proposed PRIB-CDS algorithm shows that it has reduced the number of transmissions significantly as it reduces forwarding nodes and balances the energy between the nodes to avoid re-broadcasting the data.

Productivity and Cost Models for the First Commercial Thinning of a Scots Pine Stand Using an Excavator with an Arbro 400S Harvester Head and a Farm Tractor Coupled to a Logging Trailer

The objective of the present work was to determine the productivity and costs of timber harvesting and skidding during the first commercial thinning of a Scots pine stand. The analyzed harvesting set consisted of a mini-excavator (34 kW) with an stroke harvester head (gripping range: 4–30 cm), and a farm tractor coupled to an logging trailer with a hydraulic crane. Merchantable timber (roundwood with a minimum diameter of 5 cm inside bark) was harvested from a 25-year old planted Scots pine stand growing on a grid of 1.4×1.8 m. The study showed the productivity of the mini-harvester range from 3.09 to 3.47 m3∙PMH15 -1, and that of the forwarding set to be 4.07 m3∙PMH15 -1. The analyzed model of productivity as a function of individual tree volume and thinning intensity was statistically significant, but the intensity parameter was significant only on plots located along wide access trails (3.7 m) and insignificant on plots located along the narrow access trial (2.5m). The intertree distance was not found to be significant. The calculated net machine costs for the forwarding set and mini-harvester were 36.12 Euro∙PMH 1 and 52.47 Euro∙PMH-1, respectively. An increase in the utilization rate of the harvesting set to 80% would reduce the timber harvesting and skidding costs to 22.07 Euro∙m-3.

A Dynamic Routing Path Reduction Protocol in Underwater Wireless Sensor Network

Recently, underwater wireless sensor networks (UWSNs) have emerged as a promising networking technique for various underwater applications. An energy efficient routing protocol plays a vital role in data transmission and practical applications. However, due to the specific characteristics of UWSNs, such as dynamic structure, narrow bandwidth, rapid energy consumption, and high latency, it is difficult to build routing protocols for UWSNs. In this paper, We propose a location aware opportunistic routing algorithm for under water communication. We analyse three main problems in under water communication; forwarding set selection forwarding set ranking to handle FSR problem, void handling method to handle the communication void (CV) and overhear and suppression procedure to deal with duplicate forwarding suppression (DFS) problems. The importance of the work is that it will provide an energy efficient pressure based opportunistic routing algorithm for wireless sensor network (UWSN). The routing protocol has been implemented in the ns2-AqaSim simulator and testbed for measurement of the performance metrics of the UASN. The simulation results showed that the novel routing method throughput has increased by 16%, 33%, and 55% when compared with SUN, VBF and DF method. It can effectively improve the throughput of nodes, balance positioning performance as well as energy use efficiency, and optimize the positioning result of UWASN.

Deterministic Directed Flooding Scheme (D2FS) for Inter-Cluster Flooding in Mobile Adhoc Networks

Mobile Ad hoc Networks (MANET) comprises a collection of numerous mobile nodes that communicates with one other with no dependence on any predefined infrastructure in the network. The characteristics of MANET such as independent, wireless, and self-configuration of MANETs allows the suitability of various application scenarios. Cluster based Flooding is an important issue in the design of MANET where it is an order to manage data traffic as it utilizes a set of chosen nodes to transmit data between two nodes. MANET networks frequently structured with mobile devices for enabling data transmission. An essential process of selecting forwarding set in the inter-cluster flooding. The routing protocol employ in the network often defines the energy efficiency and network performance in ad hoc networks. This paper presents a new deterministic directed flooding scheme (D2FS) for effectively choose the forwarding set for effective inter-cluster flooding. In addition, a Cluster Based Flooding utilizing Fuzzy Logic Scheme (CBF2S) to effectively transmit data is also presented. The devised D2FS model is tested using NS2 tool with respect to the existence of diverse hop counts. An extensive experimentation takes place to prove the superiority of the D2FS with respect to overhead, communication overhead, traffic load, packet delivery ratio and end to end delay.

MINIMUM LOCAL DISK COVER SETS FOR BROADCASTING IN HETEROGENEOUS MULTIHOP WIRELESS NETWORKS

The concept of forwarding sets is widely adopted in many broadcast protocols for wireless multihop networks to alleviate the broadcast storm problem. In these protocols, after receiving a broadcast message, each node that is requested to relay the message instructs a subset of its 1-hop neighbors, a.k.a. the forwarding set, to further relay it. In this paper, we propose to use the Minimum Local Disk Cover Set (MLDCS) as the forwarding set in heterogeneous multihop wireless networks, where nodes may have different transmission ranges.We show that the minimum local disk cover set of a node in heterogeneous networks is equivalent to its skyline set, and then we propose a divide-and-conquer algorithm with the optimal time complexity to compute the skyline set locally and statelessly. Moreover, unlike other forwarding heuristics, the proposed algorithm requires only 1-hop neighbor information. This helps to reduce the forwarding set formation latency and thus will be more suitable for environments with a frequently changed network topology, such as vehicular ad hoc networks.