Class Of Wireless Networks Research Articles

Mobility Aware Energy Efficient Cluster Based Secure Routing Protocol for Mobile Adhoc Networks

Mobile ad-hoc network (MANET) is an evolving technology which derives under the class of wireless networks. Due to the inherent characteristics of nodes in MANET, energy efficiency and security still remains a major design issue. This paper intends to develop a multi-objective optimization (MOO) model for effective load distribution and security in the network. The presented MOO technique operates on two main stages namely clustering and secure routing. In the first stage, fuzzy logic technique with multiple input parameters namely energy, distance, link duration, latency, and trust are used for effective cluster construction. In the next stage, Lion Whale optimization (LWO) algorithm is introduced for secure routing. Using the determined MOO variables, a fitness function is derived to select the optimal routes for secure routing in MANET. The effective performance of the presented FLWO model is tested using a set of validation parameters and the proposed model attains maximum performance over other methods in a considerable way.

Reliability-based dynamic multicast group formation provisioning local adjustment ensuring quality of service globally in MANETs

Mobile Ad hoc Networks (MANETs) is an infrastructure less and random mobility-based class of wireless networks with seamless possibilities of ‘on the fly’ communication through self-coordination among autonomous mobile nodes while being in the transmission range of each other. This low cost, easy to deploy, simplicity, and self-organisation of MANET altogether revolutionised wired networks and could connect otherwise unreachable terrains/sites. To handle the severity of colossal issues like dynamic topology, scarce resources and frequent rupturing of established routes in MANETs, conservation of energy becomes inevitable to administer contemporary applications. After an extensive literature survey for provisioning reliability and multicast routing in MANETs, researchers concluded the conservation of mobile nodes energy embrace a very consequential role in extending network life. The PLA (Proposed Local Adjustment) model is based on eliminating flooding, preserving nodes battery life by selectively choosing forwarder node at each hop level, and handling route failures locally, eventually makes the network more robust and resilient. The PLA model when simulated on NS2.35 against AODV on various parameters like control overhead generated, packet delivery ratio, energy conserved index, produced quite convincing and promising results, to be offered to remote and rescue-based applications in the vicinity of infrastructure less regions.

Distributed SINR Fusion Estimation for a Class of Wireless Networks

This brief studies the fusion estimation problem of signal to interference and noise ratio (SINR) for a class of wireless networks. Based on the SINR state-space model with unknown covariances and unknown but bounded congestion control function, each local SINR estimator is designed such that an upper bound of the ${H_{2}}$ estimation performance is minimal. To improve the estimation performance, a convex optimization problem on the design of an optimal distributed fusion criterion is established in terms of linear matrix inequalities, which can be easily solved by standard software packages. Simulations are given to show the effectiveness of the proposed methods.

Polynomial Complexity Minimum-Time Scheduling in a Class of Wireless Networks

We consider a wireless network with a set of transmitter-receiver pairs, or links, that share a common channel, and address the problem of emptying finite traffic volume from the transmitters in minimum time. This, so-called, minimum-time scheduling problem has proven to be NP-hard in general. In this paper, we study a class of minimum-time scheduling problems in which the link rates have a particular structure. We show that global optimality can be reached in polynomial time and derive optimality conditions. Then, we consider a more general case in which we apply the same approach and obtain an approximation as well as lower and upper bounds to the optimal solution. Simulation results confirm and validate our approach.

Data dissemination with rateless coding in a grid vehicular topology

Abstract Vehicular ad hoc networks are an important new class of wireless networks with applications ranging from safety and crash avoidance to Internet access and multimedia distribution. In this article, an efficient method of message dissemination using rateless coding is proposed. Both vehicle-to-vehicle and vehicle-to-infrastructure data transfer are allowed. By employing rateless coding at road side units and using vehicles as data carriers, messages can be propagated efficiently. To limit the buffer capacity required in vehicles, buffer management is employed. The network considered has a grid topology. The effects of vehicle speed, number of lanes, broadcast interval, and decoding distance on the performance are examined.

Delay Analysis for Wireless Networks With Single Hop Traffic and General Interference Constraints

We consider a class of wireless networks with general interference constraints on the set of links that can be served simultaneously at any given time. We restrict the traffic to be single-hop, but allow for simultaneous transmissions as long as they satisfy the underlying interference constraints. We begin by proving a lower bound on the delay performance of any scheduling scheme for this system. We then analyze a large class of throughput optimal policies which have been studied extensively in the literature. The delay analysis of these systems has been limited to asymptotic behavior in the heavy traffic regime and order results. We obtain a tighter upper bound on the delay performance for these systems. We use the insights gained by the upper and lower bound analysis to develop an estimate for the expected delay of wireless networks with mutually independent arrival streams operating under the well-known maximum weighted matching (MWM) scheduling policy. We show via simulations that the delay performance of the MWM policy is often close to the lower bound, which means that it is not only throughput optimal, but also provides excellent delay performance.

A Routing Scheme for the IEEE-802.15.4-Enabled Wireless Sensor Networks

A wireless sensor network (WSN) has features that fit into several classes of wireless networks (e.g., mesh, <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ad hoc</i> , and mobile ad hoc networks) and, at the same time, features that are unique to it. These exceptional characteristics place many demands on the WSN routing protocol. For instance, the routing protocol must assure uniform dissipation of energy across the network, quickly converge irrespective of the network node density, and be flexible in terms of the routing framework and the route computation metric. All of the aforementioned conditions must be accomplished in an energy-efficient manner. Although several routing protocols have been proposed for WSNs, most approaches are usually focused on energy-efficient operations. The validity of this case is undeniable; however, one crucial element is generally assumed or ignored i.e., how one can prevent routing loops in the network. In addition to achieving the aforementioned routing objectives, in this paper, we go one step further by expressly defining and thoroughly evaluating mechanisms for loop prevention and minimization. Our proposed routing scheme leverages the services that were offered by the IEEE 802.15.4 specification to satisfy the requirements of a WSN routing protocol.