Networking and Communication Engineering

S. Prabhu ¹, V. Kandasamy ², R. Murgan ³

Affiliations
1 Department of Computer Science and Engineering, Kalaivani College of Technology, Coimbatore, Tamil Nadu, IN
2 Department of Information Technology, Loyola Institute of Technology, Chennai-600123, IN
3 Department of Electronics Communication Engineering, Kalaivani College of Technology, Coimbatore, Tamil Nadu, IN

Abstract

Underwater Aural Networks (UAN’s) are very unique and can be organized for commercial and military applications. Underwater Networks consists of an erratic number of sensors and vehicles that are organized to perform collaborative monitoring tasks over a given area. One of the main issues in wireless sensor network is developing an energy-efficient routing protocol. Since the sensor nodes have limited available power, energy preservation is a critical issue in under water sensor network for nodes and network life. Most of the existing routing protocols for sensor networks don’t turn off the radio frequency completely. They speed up the energy consumption. Acoustic signal is the only feasible tool that works in under water environment. They extract signals in the presence of noise and uncertainty. In this work, we propose a MECH (Maximum Energy Cluster Head) routing protocol. It has self-configuration and hierarchical tree routing properties. A contaminated Gaussian (CG) noise model is proposed to characterize the impulsive, non-Gaussian nature of acoustic background noise observed in some real-world WSNs.

Keywords

Underwater Acoustic Networks, Maximum Energy Cluster Head.

Full Text

     

R. Vediyappan ¹, S. Prabhu ², M. Gowthaman ², C. S. Dhanabalan ², Senthil Murugan ³

Affiliations
1 VelTech Dr. RR & Dr. SR Technical University, Chennai, Tamilnadu, IN
2 Dr.M.G.R.Educational and Research Institute University, Chennai, Tamilnadu, IN
3 Dept. of CSE, VelTech Dr. RR & Dr. SR Technical University, Chennai, Tamilnadu, IN

Abstract

We analyze the delay performance of a multi-hop wireless network in which the routes between source-destination pairs are fixed. We develop a new queue grouping technique to handle the complex correlations of the service process resulting from the multi-hop nature of the flows and their mutual sharing of the wireless medium. A general set based interference model is assumed that imposes constraints on links that can be served simultaneously at any given time. These interference constraints are used to obtain a fundamental lower bound on the delay performance of any scheduling policy for the system. We present a systematic methodology to derive such lower bounds. For a special wireless system, namely the clique, we design a policy that is sample path delay optimal. For the tandem queue network, where the delay optimal policy is known, the expected delay of the optimal policy numerically coincides with the lower bound. The lower bound analysis provides useful insights into the design and analysis of optimal or nearly optimal scheduling policies.

Full Text