Benefits of the use of impairment constraint routing in optical networks

In transparent optical networks, the optical signal accumulates the effects of all physical impairments present along the path it traverses. The conventional selection of signal paths based on e.g. shortest path routing without considering the signal quality and its association with the physical impairments does not always provide the optimum solution in terms of network performance such as blocking and resource utilization. This paper proposes an impairment constraint based routing algorithm to achieve an optimal combination of physical and networking performance taking into account all physical linear impairments including noise, chromatic and polarization mode dispersion, crosstalk and filter concatenation effects in an integrated approach. The performance of a typical metropolitan area network is examined and the improvement achieved when using the proposed approach compared to the conventional shortest path routing is demonstrated.     

Maximum Lifetime Routing Problem in Duty-Cycling Sensor Networks

In order to extend the lifetime of a wireless sensor network, the energy consumption of individual sensor nodes need to be minimized. This can be achieved by minimizing the idle listening time with duty cycling mechanism and/or minimizing the number of communications per node. The nodes will have different relay loads for different routing strategies: therefore, the routing problem is important factor in minimization of the number of communications per node. In this paper, we investigate achievable network lifetime with a routing mechanism on top of an existing duty-cycling scheme. To this end, we formulated the routing problem for duty-cycling sensor network as a linear programming problem with the objective of maximizing the network lifetime. Using the developed linear programming formulation, we investigate the relationship between network lifetime and duty-cycling parameter for different data generation rates and determine the minimum duty-cycling parameter that meets the application requirements. To the best of our knowledge, this is the first mathematical programming formulation which addresses the maximum lifetime routing problem in duty-cycling sensor network. In order to illustrate the application of the analytical model, we solved the problem for different parameter settings.     

Firework inspired load balancing approach for wireless sensor networks

Wireless Networks - In Wireless Sensor Networks (WSNs), where power consumption is a huge concern, the improvement of the network’s lifetime is an area of constant study and innovation. The...     

An Efficient Data Delivery Scheme in WBAN to Deal with Shadow Effect due to Postural Mobility

The body movement and change in posture exhibit high mobility in sensor nodes which causes shadowing in the Wireless Body Area Network (WBAN). Due to this, the connectivity between the nodes in WBAN is affected which further causes failure in data delivery. This article presents a MAC protocol in WBAN to deal with the problem of data delivery due to body movement and postural mobility. It uses an Improved Initial Centroid K-means clustering technique for classification of various human body postures followed by back propagation neural network as a classifier to recognize human body posture. This article proposes a posture aware dynamic data delivery (PA-DDD) protocol to deliver data dynamically. The PA-DDD protocol can be used under varying speed walking scenario. The simulation results show that it prolongs the network lifetime and is energy efficient.

     

B-GWO based multi-UAV deployment and power allocation in NOMA assisted wireless networks

Wireless Networks - Unmanned Aerial Vehicles (UAVs) deployed as flying base stations is a promising technology for enhancing the quality of service (QoS) and quick recovery from unexpected damages...     

Green biomass active electronic diode

For the first time, a biomass electronic junction functioning as a conventional electronic diode inside green leaves of Vinka-rosa and Plumeria rubra mass structure has been experimentally predicted and studied. The experimental diode demonstrated appropriate conventional electronic diode characteristics. The predicted diode junctions were operated for forward and reverse dc voltage biases in the range of ±1 to 10 and 1 to 30?V respectively. The studies revealed a strong functional dependence on the water content of the green leaf. These studies are sequential to the very recently reported research work of Kosta et al. on bioelectronics and soilelectronics. The study speculatively forecasts the beginning of a new revolutionary era of green biomass electronic circuitry.     

BECPA: Bandwidth Efficient Cluster Based Packet Aggregation in Wireless Sensor Network

In recent years, energy consumption and data gathering is a foremost concern in many applications of wireless sensor networks (WSNs). The major issue in WSNs is effective utilization of the resource as energy and bandwidth with a large gathering of data from the monitoring and control applications. This paper proposes novel Bandwidth Efficient Cluster based Packet Aggregation algorithm for heterogeneous WSNs. It combines the idea of variable packet generation rate of each node with random data. The nodes are randomly distributed with different energy level and are equal in numbers. It uses the perfectly compressible aggregation function at cluster head based on the correlation of packets and data generated by each node. Compare to state-of-the-art solutions, the algorithm shows 4.43 % energy savings with reduced packet delivery ratio (62.62 %) at the sink. It shows better bandwidth utilization in packet aggregation than data aggregation.     

Generation of vertex connected subgraphs for multi-input multi-output reliability networks

In this paper, the problem of evaluation of reliability (probability of success) of a network consisting of several inputs and outputs is studied. Edges are assumed to be perfect and vertices are assigned the probabilities of success. A new concept called “vertex connected subgraph” is introduced for this purpose. This concept is useful even for dense graphs because they are of the order of 2^(v-k-1) which is independent of e, where ν(e) is the number of vertices (edges) and k is the number of outputs of a graph.     

Microwave circuit analysis and design by a massively distributedcomputing network

The advances in microelectronic engineering have rendered massively distributed computing networks practical and affordable. This paper describes one application of this distributed computing paradigm to the analysis and design of microwave circuits. A distributed computing network, constructed in the form of a neural network, is developed to automate the operations typically performed on a normalized Smith chart. Examples showing the use of this computing network for impedance matching and stabilizing are provided     

Evaluation of the suitability of troposcatter prediction techniques over Northern India

The design of any radio communication system requires a suitable prediction technique for calculating the received signal levels. The optimum prediction method helps to reduce the interference problems, and improves reliability of links. In the present study the path loss values deduced from various prediction techniques are compared against observed path loss values over two troposcatter links situated in northern India. The results show that April and May are the worst months and the present space and frequency diversity configuration is not able to effectively overcome the link outages. A comparison of different path loss prediction techniques showed that Yeh’s prediction method and itu-r’s method I comes close to the observed values. The predicted path loss values for worst month using itu-r’s method deviated considerably from the observed values. The present study provides valuable inputs to the itu-r study group from the tropical countries by evaluating the itu-r prediction methods against the experimental data.