Search

Pipelines are often used for transmission of oil, gas, water and other resources to neighboring countries. These pipelines often pose risk and sometimes intervene with national security. Hence, to safeguard the pipeline, various technological usage is often encouraged. Unlike traditional non-linear structure, pipeline systems demand linear structure. Pipeline systems are often setup for greater transmission distance, for maximum utilization. Linear communication in wireless sensor network is always a time-consuming aspect due to variability in the coordinator node selection. To cater the surveillance needs of such transmission pipeline systems, we propose a cost-efficient optimization scheme which enables the network for greater communication efficiency through which maximum coverage can be achieved. The proposed scheme uses a hybrid optimization approach which encompasses ACO-PSO-GA-LOA to address the routing challenges. The proposed hybrid scheme is evaluated against traditional optimization algorithm using metrics such as communication end-to end delay, network throughput and normalized lifetime. The simulation results establish the effectiveness of the proposed scheme.

Monitoring of pipelines carrying oil, gas and water is necessary to avoid the wastage of these natural resources. Linear Wireless Sensor Network (LWSN) is one of the best ways to monitor these pipelines efficiently. In LWSN, the positioning of nodes and the routing scheme can be used to avoid the losses occur during transportation of these resources to their corresponding destinations. This paper modifies the Lion Optimization Algorithm by using the lightning procedure of cloud for defining the position of sensor nodes while for routing jump and redirect routing scheme is used. In this algorithm, the lions travel from one location to the other as the light moves from cloud towards the ground. The algorithm proves its significance by showing significant improvement while comparing its performance with four existing algorithms including Lion Optimization Algorithm, Genetic Algorithm, Ant Colony Optimization and without optimization. The performance parameters considered during simulation are delay, throughput and lifetime.

The Local Mutual Exclusion (LME) problem is a variant of classical Mutual Exclusion (ME) problem and can be considered as an extension of dining philosopher problem. In LME, no two neighboring nodes can enter the critical section (CS) simultaneously, whereas two non-neighboring nodes can be in their CS simultaneously. The resource allocation problem in Flying Ad hoc Networks (FANETs), is relatively an unexplored area despite having several potential applications. The present paper proposes LME problem for FANETs and provides a leader-based algorithm named as Request Collector Local Mutual Exclusion (RCLME) for the same. To the best of our information, LME problem is introduced first time in Flying Ad hoc Networks. The striking feature of the proposed algorithm is the introduction of a fuzzy logic-based leader election that considers the node speed, node direction, link quality, and the distance from the resource. The correctness proof of the RCLME algorithm has been presented. The simulation results show that RCLME algorithm significantly outperforms other related algorithms available in the literature; specially, when the number of nodes is large. The use of fuzzy logic and request collector improves the efficiency, fault tolerating capacity and ability to handle volatility.

Mutual exclusion (ME) is a highly researched problem in distributed computing systems. In the mutual exclusion problem, no two nodes can use critical resource simultaneously. Numerous protocols have been proposed for various types of static as well as mobile distributed systems, namely, Mobile Ad Hoc Networks (MANET), Vehicular Ad Hoc Networks (VANET) and cellular networks. The flying ad hoc networks (FANET) is an interesting variant of distributed systems and, to the best of our knowledge, no protocol exists in the literature for mutual exclusion in FANETs. In FANETs, the critical resource is mounted on an unmanned aerial vehicle (UAV) and user nodes are assumed in the transmission range of the UAV. Ours is the first algorithm to ensure ME in FANETs. The algorithm is token-based and we name it Mobile Resource Mutual Exclusion (MRME) algorithm. Unlike other ad hoc networks, due to swift mobility of nodes as well as resource, the FANETs topology is highly dynamic and fault prone. The MRME algorithm handles it successfully. Further, we present the correctness proof, complexity analysis and simulation results. The worst-case complexity of MRME is O(n) and synchronization delay is T, where T is message propagation delay.

Vehicular ad hoc networks (VANETs) are a popular subclass of mobile ad hoc networks (MANETs). These kinds of networks do not have a centralized authority to control the network infrastructure. The data routing is one of the most significant challenges in VANETs due to its special characteristics. In this paper, an effective cluster-based routing algorithm for VANETs has been proposed. Unlike other clustering approaches, RSUs have been considered as a fixed node in VANETs and treated as cluster heads in this approach. Due to static clusters, the overhead to create and to maintain clusters has been reduced. Multiple clusters in large network headed by RSUs make routing more efficient and reliable. Three levels of routing mentioned with this approach. At first level routing, the source vehicle itself is capable to send data to the destination node. Second level routing needs RSU’s intervention in routing and RSU finds the path from source to destination vehicle. At third level, RSU broadcasts the message to other connected RSU to spread messages in a broader way. The proposed approach is suitable for urban VANETs because of the availability of the dense network with multiple RSUs. Some applications where the approach may be useful are emergency help, broadcasting information, reporting to authority or vehicles for any observation, and to collect nearby traffic-related information from RSU of the respective cluster. The static analysis of the proposed approach shows that the proposed approach is efficient, scalable, and able to reduce network overhead in large and dense urban VANETs.

Over the past few years, there has been significant research interest in field of vehicular ad hoc networks (VANETs). Wireless communication over VANETs supports vehicle-to-vehicle (V2V), vehicle-to-infrastructure (V2I) communication. Such innovation in wireless communication has improved our daily lives through road safety, comfort driving, traffic efficiency. As special version of MANETs, VANETs bring several new challenges including routing and security challenges in data communication due to characteristics of high mobility, dynamic topology. Therefore, academia and the auto mobile industry are taking interest in several ongoing research projects to establish VANETs. The work presented here focuses on communication in VANETs with their routing and security challenges along with major application of VANETs in several areas.

The low cost and better processing power and energy efficiency makes it possible to use large numbers of sensors in a wide variety of applications including environmental monitoring, military, ecology, agriculture, inventory control, robotics health care and various types of pipelines. In monitoring the pipelines, a special class of sensor defined as Linear Wireless Sensor Networks (LSNs) is required having its special characteristics as far as routing is concerned. In this paper a three layered architecture has been proposed for monitoring, and protection of over-ground oil, gas, and water pipelines using wireless sensor networks. The three layers include on the ground, on the pipeline and underground layer. This paper also proposes a architecture a Leach Based Hierarchical Routing Protocol for linear structure wireless sensor networks (LBHRP) for the above mentioned architecture.

In VANETs, the vehicles communicate with each other either directly or using some infrastructure. Due to high mobility behavior of nodes in VANETs, communication among vehicles faces several challenges. Additionally, there are other factors also which effect routing performance in VANETs such as vehicular density, link stability, and vehicle speed etc. Several efficient routing protocols have been designed to route messages between nodes. Moreover, different routing approaches can be used based on the application scenario and network situation. Therefore, selection of appropriate routing strategy is an important issue in VANETs. The present paper discusses the most recent routing protocols proposed for VANETs in last five years. The discussed protocols have been divided in to three categories namely, geographical or position based, topology based and cluster based routing. The protocols have been analyzed for their advantages, disadvantages and applicability in various scenarios.

Mutual exclusion is one of the fundamental problems in mobile ad hoc networks (MANETs). The solutions to the mutual exclusion problem ensure exclusive access to a shared resource(s). In MANETs, one of the variants of mutual exclusion problem is local mutual exclusion (LME) problem. In LME problem, the non-neighboring nodes may enter CS simultaneously. Whereas, the group local mutual exclusion (GLME) problem in MANETs is the generalization of LME problem, where, unlike LME problem, the processes requesting same group (resource) may be in a critical section (CS) simultaneously. In the presented exposition, an extension of GLME problem, named h-group local mutual exclusion (h-GLME), has been proposed. The h-GLME problem, where the number of active groups can be h (h ≥ 1) and the processes requesting any of h groups may be in their respective CS simultaneously. It is applicable to MANETs. To the best of our knowledge, h-GLME is the first wireless extension of the GLME problem.

The article presents a generalization of the group mutual exclusion (GME) problem, called group local mutual exclusion (GLME), henceforth. In GLME, the activities of neighboring nodes need to be synchronized; however, no such synchronization is required between non-neighbors. The neighborhood is defined based on the location of the shared resources. A token-based solution to the GLME problem has also been proposed. The solution satisfies the correctness criteria for group mutual exclusion, i.e., safety, starvation freedom, and concurrent occupancy. The illustration includes simulation extensive results to estimate message overhead, latency, concurrency, and session switch complexity. The simulation results prove that the proposed algorithm demonstrates better performance when compared with the closest work in the literature. The token loss problem has also been handled. To the best of our knowledge, the algorithm presented in the paper is the first token-based algorithm to solve the GLME problem in MANETs.

Mutual Exclusion (ME) problem involves a group of processes, each of which intermittently requires access to the only resource present in the environment. Handling ME problem becomes difficult due to the dynamic nature of the ad hoc environment. This paper presents a token-based solution to ME problem in the mobile ad hoc environment. The proposed token based algorithm is sensitive to link forming and link breaking and thus is suitable for MANET. The algorithm uses the concept of dynamic request set (DRS). As the request set is dynamically updated, the average size of request set is reduced resulting in less number of messages exchanged per critical section. The algorithm satisfies mutual exclusion, starvation freedom, and freedom from deadlock. The present algorithm has been compared with DRS based ME algorithms for static distributed systems. The results show that the concept of DRS in MANETs can be successfully used. Token loss problem has also been handled separately in the present exposition.

The Group mutual exclusion problem (GME) is a resource allocation problem which allows concurrency along with mutual exclusion. The concept of GME can be applied to various fields having varying quality of service (QoS) requirements. The present paper presents a self adaptive general scheme to solve GME problem using token-based approach. The striking feature of the scheme is that it considers QoS requirements, checks the QoS requirements time to time and adapts its parameters if there are deviations from the expected behavior. The dynamic analysis of the scheme has also been presented in the present exposition.

Efficient power use is the fundamental to think about tried and true operation of wireless or remote sensor frameworks. This applies correspondingly to direct or linear sensor masterminds as they create when sensors are sent along linear frameworks such as pipelines. In this work, a innovative approach to manage imperativeness capable controlling to a dual base station or control center in a straight or linear wireless sensor topology and on the basis of different attributes and calamities appears near pipelines, different sensor node senses these stimuli and immediately responds to base station presents at both the ends within certain range. Our informative show that a jump approach saves gigantic battery power in relation to MTE, MERR and other standard traditional systems and has close perfect execution.

In the present paper, we propose a hierarchical algorithm to solve the group mutual exclusion (GME) problem in clusterbased systems. We consider a two-level hierarchy in which the nodes are divided in to clusters and a node in each cluster is designated as coordinator which is essentially the cluster head. The number of global messages per critical section entry in our algorithm depends upon the number of clusters in the system unlike most of the existing GME algorithms where it depends upon the total number of nodes in the system. Performance of the algorithm directly depends on the coherent behavior of nodes inside clusters. The results have been substantiated with extensive simulation. A fault tolerant extension of the algorithm has also been proposed in the present exposition.

Within Mobile Ad-Hoc Network(MANETs) unusual categories of routing protocols have been determined. It is a group of wireless system. MANET is other susceptible to a variety of attack than wired system. Black hole attack is further meticulous intimidation to MANETs. The routing protocols of MANET is less protected and therefore consequenced the system with malicious node. There are various routing protocols being used for MANETs. All routing protocols have been briefly discussed, however, Zone Routing Protocol (ZRP) is discussed in detail. Black hole is a major security threat for MANETs. Hence, in this paper, the various techniques used for detection and avoidance of Black hole attack in MANETs using ZRP routing protocol have been discussed.

The group mutual exclusion (GME) problem is a generalization of the mutual exclusion problem. In group mutual exclusion, a process requests a session before entering its critical section (CS). Processes requesting the same session are allowed to be in their CS simultaneously, however, processes requesting different sessions must execute their CS in mutually exclusive way. The paper presents a token-based distributed algorithm for the GME problem in asynchronous message passing systems. The algorithm uses the concept of dynamic request sets. The algorithm does not use any message to be exchanged in the best case and uses n+1 messages in the worst case, where n is the number of processes in the system. The maximum concurrency of the algorithm is n and synchronization delay under heavy load (worst case) is 2T, where T is the maximum message propagation delay. The algorithm uses first come first serve approach in selecting the next session type and satisfies the concurrent occupancy property. The static performance analysis and correctness proof is also included in the present exposition.

The recent advancements in the field of Wireless Sensor Networks (WSN) make the sensors smaller, cheaper and more energy efficient. These innovations made it attractive to use sensor networks in new applications like Border monitoring, Railway track monitoring, Oil and Gas pipeline monitoring etc. In the above mentioned applications, a common characteristic is their linear topology. Since last few years, a new subclass of sensor networks known as linear sensor networks (LSN) is emerging as a major focus area of research. Due to the special topology of LSNs, the issues and solutions required for LSNs are significantly different from ordinary sensor network. In the present exposition, the applications of LSN, major issues related to LSN, and the major research trends in this area have been summarized.

In this paper, a generalization of the group mutual exclusion problem based upon the concept of neighborhood has been proposed and named as group local mutual exclusion (GLME). The neighborhood is defined based upon the location of shared resources and no synchronization is required between nodes in two different neighborhoods. A token-based solution of the GLME has also been proposed. The algorithm satisfies safety, starvation freedom, and concurrent occupancy properties. The proof of correctness has also been included in the present paper. To the best of our knowledge, it is the first token-based algorithm to solve GLME problem in MANETs.

Recent advancements in information and communication technologies have resulted into improvements in wireless sensor networks. Since the human civilization is heading towards being “WIRELESS”, so as the field of communication and networking needs to be speeded in similar fashion. Detailed research at broad ends has been done on terrestrial networks. However, marine sensor networks have received limited attention. This paper focuses on understanding and analyzing the basic architecture of underwater sensor networks along with the types of marine sensors. We further explore their nature when subjected to marine environments. The paper also discusses the features, applications and challenges involved with marine sensor networks.

The group mutual exclusion deals with two contradictory issues of mutual exclusion and concurrency. Nevertheless, the concurrency can be increased by giving a higher priority to a group for which more requests are pending and/or by applying a liberal entry policy. However, this increased concurrency comes at the cost of fairness. In the present paper, we propose a general scheme to solve the group mutual exclusion problem. The major constituents of the scheme are a token-based mutual exclusion algorithm, an entry policy and a group selection policy. The most striking feature of the scheme is its easy convertibility into a self adaptive one. The scheme allows an application to go for an entry policy as well as a group selection policy of its choice to meet its pre specified goals.

Due to the mobility of hosts, limited battery power and processing power of mobile hosts, and the low bandwidth of wireless channels, the existing distributed algorithms designed for the static distributed systems required to be restructured before these can be used in the cellular wireless networks. The group mutual exclusion (GME) problem is an interesting generalization of the classical mutual exclusion problem which deals with two contradictory issues of mutual exclusion and concurrency. In the present paper, we propose a hierarchical token-based algorithm to solve the GME problem in cellular wireless networks. To the best of our knowledge the proposed algorithm is the first GME algorithm for cellular networks. In the proposed algorithm, a resource starved mobile host requires very little data structure and the bulk of the computation is performed at the resource rich base station level.