Cross-Layer Design Approach for Power Control in Mobile Ad Hoc Networks

Web services are the internet enabled applications for performing business needs, considered as the platform-independent and loosely coupled. Web service compositions build new services by organizing a set of existing services by providing reusability and interoperability. The research problem in web service composition is to obtain best effective services with the composition of services based on maximum quality of services (QoS) and satisfy the user's requirements. This study reveals various challenges in the QoS parameter for Web service composition because it is difficult to recognize. We have illustrated the related technology by analyzing QoS parameters based on existing algorithms with composition patterns and compared the results.

Appraisal and analysis on various web service composition approaches based on QoS factors

Mobile ad-hoc networks (MANETs) comprise a large number of mobile wireless nodes that can move in a random fashion with the capability to join or leave the network anytime. Due to the rapid growth of devices on the Internet of Things (IoT), a large number of messages are transmitted during information exchange in dense areas. It can cause congestion that results in increasing transmission delay and packet loss. This problem is more severe in larger networks with more network traffic and high mobility that enforces dynamic topology. To resolve these issues, we present a bandwidth aware routing scheme (BARS) that can avoid congestion by monitoring residual bandwidth capacity in network paths and available space in queues to cache the information. The amount of available and consumed bandwidth along with residual cache must be worked out before transmitting messages. The BARS utilizes the feedback mechanism to intimate the traffic source for adjusting the data rate according to the availability of bandwidth and queue in the routing path. We have performed extensive simulations using NS 2.35 on Ubuntu where TCL is used for node configuration, deployment, mobility and message initiation, and C language is used for modifying the functionality of AODV. The results are extracted from trace files using Perl scripts to prove the dominance of the BARS over preliminaries in terms of packet delivery ratio, throughput and end-to-end delay, and the probability of congested node for static and dynamic topologies.

/pdf/congestion-avoidance-for-smart-devices-by-caching-ariwjfi8kk.pdf

Congestion Avoidance for Smart Devices by Caching Information in MANETS and IoT

Exponential Reliability Coefficient based Reputation Mechanism for isolating selfish nodes in MANETs

In mobile ad hoc networks connectivity is always an issue of concern. Due to dynamism in the behavior of mobile nodes, efficiency shall be achieved only with the assumption of good network infrastructure. Presence of critical links results in deterioration which should be detected in advance to retain the prevailing communication setup. This paper discusses a short survey on the specialized algorithms and protocols related to energy efficient load balancing for critical link detection in the recent literature. This paper also suggests a machine learning based hybrid power-aware approach for handling critical nodes via load balancing.

/pdf/a-survey-on-investigating-the-need-for-intelligent-power-18ha1qe6nf.pdf

A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs

In mobile ad hoc networks (MANETs), congestion can occur in any intermediate node, often due to limitation in resources, when data packets are being transmitted from the source to the destination. Congestion will lead to high packet loss, long delay and waste of resource utilization time. The primary objective of congestion control is to best utilize the available network resources and keep the load below the capacity. The congestion control techniques to deal with TCP have been found inadequate to handle congestion in ad hoc networks, because ad hoc networks involve special challenges like high mobility of nodes and frequent changes of topology. This paper proposes a method for dynamic congestion detection and control routing (DCDR) in ad hoc networks based on the estimations of the average queue length at the node level. Using the average queue length, a node detects the present congestion level and sends a warning message to its neighbors. The neighbors then attempt to locate a congestion-free alternative path to the destination. This dynamic congestion estimate mechanism supporting congestion control in ad hoc networks ensures reliable communication within the MANET. According to our simulation results, the DCDR showed better performance than the EDOCR, EDCSCAODV, EDAODV and AODV routing protocols.

T. Senthilkumaran

Papers

Original Article: Dynamic congestion detection and control routing in ad hoc networks