MODLEACH: A Variant of LEACH for WSNs

Wireless sensor networks are appearing as an emerging need for mankind. Though, Such networks are still in research phase however, they have high potential to be applied in almost every field of life. Lots of research is done and a lot more is awaiting to be standardized. In this work, cluster based routing in wireless sensor networks is studied precisely. Further, we modify one of the most prominent wireless sensor network's routing protocol "LEACH" as modified LEACH (MODLEACH) by introducing \emph{efficient cluster head replacement scheme} and \emph{dual transmitting power levels}. Our modified LEACH, in comparison with LEACH out performs it using metrics of cluster head formation, through put and network life. Afterwards, hard and soft thresholds are implemented on modified LEACH (MODLEACH) that boast the performance even more. Finally a brief performance analysis of LEACH, Modified LEACH (MODLEACH), MODLEACH with hard threshold (MODLEACHHT) and MODLEACH with soft threshold (MODLEACHST) is undertaken considering metrics of throughput, network life and cluster head replacements.Comment: IEEE 8th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA'13), Compiegne, Franc

On The Modeling of OpenFlow-based SDNs: The Single Node Case

OpenFlow is one of the most commonly used protocols for communication between the controller and the forwarding element in a software defined network (SDN). A model based on M/M/1 queues is proposed in [1] to capture the communication between the forwarding element and the controller. Albeit the model provides useful insight, it is accurate only for the case when the probability of expecting a new flow is small. Secondly, it is not straight forward to extend the model in [1] to more than one forwarding element in the data plane. In this work we propose a model which addresses both these challenges. The model is based on Jackson assumption but with corrections tailored to the OpenFlow based SDN network. Performance analysis using the proposed model indicates that the model is accurate even for the case when the probability of new flow is quite large. Further we show by a toy example that the model can be extended to more than one node in the data plane.Comment: Published in Proceedings of CS & IT for NeCOM 201

Swarm Intelligence Based Multi-phase OPF For Peak Power Loss Reduction In A Smart Grid

Recently there has been increasing interest in improving smart grids efficiency using computational intelligence. A key challenge in future smart grid is designing Optimal Power Flow tool to solve important planning problems including optimal DG capacities. Although, a number of OPF tools exists for balanced networks there is a lack of research for unbalanced multi-phase distribution networks. In this paper, a new OPF technique has been proposed for the DG capacity planning of a smart grid. During the formulation of the proposed algorithm, multi-phase power distribution system is considered which has unbalanced loadings, voltage control and reactive power compensation devices. The proposed algorithm is built upon a co-simulation framework that optimizes the objective by adapting a constriction factor Particle Swarm optimization. The proposed multi-phase OPF technique is validated using IEEE 8500-node benchmark distribution system.Comment: IEEE PES GM 2014, Washington DC, US

Scheduling Policies in Time and Frequency Domains for LTE Downlink Channel: A Performance Comparison

A key feature of the Long-Term Evolution (LTE) system is that the packet scheduler can make use of the channel quality information (CQI), which is periodically reported by user equipment either in an aggregate form for the whole downlink channel or distinguished for each available subchannel. This mechanism allows for wide discretion in resource allocation, thus promoting the flourishing of several scheduling algorithms, with different purposes. It is therefore of great interest to compare the performance of such algorithms under different scenarios. Here, we carry out a thorough performance analysis of different scheduling algorithms for saturated User Datagram Protocol (UDP) and Transmission Control Protocol (TCP) traffic sources, as well as consider both the time- and frequency-domain versions of the schedulers and for both flat and frequency-selective channels. The analysis makes it possible to appreciate the difference among the scheduling algorithms and to assess the performance gain, in terms of cell capacity, users' fairness, and packet service time, obtained by exploiting the richer, but heavier, information carried by subchannel CQI. An important part of this analysis is a throughput guarantee scheduler, which we propose in this paper. The analysis reveals that the proposed scheduler provides a good tradeoff between cell capacity and fairness both for TCP and UDP traffic sources

On acid sulfate soils of the coastal aquaculture ponds of Bangladesh

With the stimulus of the very high international market value of penaeid shrimp, new pond areas for shrimp farming are rapidly being added in Bangladesh. Unfortunately, this expansion is occurring with the loss of some natural mangrove forests and with soils and sediments that are far from ideal for aquaculture. In this study, two representative shrimp farming areas were surveyed and pH, in profile depth, was recorded. It was found that the shrimp farming areas of the Chakaria Sundarban are more acidic than those of the Khulna-Satkhira region due to the acid sulfate soils