Connectionless probabilistic (CoP) routing: an efficient protocol for mobile wireless ad-hoc sensor networks

In this paper, we propose a cooperative routing in mobile ad-hoc wireless sensor networks with Rayleigh fading environments. The main features and contributions of the proposed cooperative routing are as follows. First, the construction of stable routing route by using entropy concepts in the view points of mobility of nodes. Second, the cooperative-aided transmission using the stable relay which can be selected by using entropy concepts. Third, we present a theoretical analysis model for the proposed cooperative routing with the outage probability of the end-to-end performance. Fourth, we consider a realistic approach based on mobile nodes as well as fixed nodes in the points of view of the mobile ad-hoc wireless sensor networks. The performance evaluation of our protocol is implemented via simulation and analysis.

This paper proposes a mathematical framework to model and analyze the energy consumption of routing protocols in multihop wireless networks such Mobile Ad Hoc Networks (MANETs) or Sensor Networks (WSNs) by taking into account the protocol parameters, the traffic pattern and the network characteristics defined by the medium channel properties, the dynamic topology behavior, the network diameter and the nodes density. Moreover, our framework allows to classify routing protocols by exploring the relationship between application requirements and wireless network features. To the best of our knowledge, there is no such proposed framework that provides in-depth an analytical investigation of above relationship. We apply this model to a Beacon-less routing protocol Pizza-Forwarding (PF) compared to well known routing protocols such as Optimized Link State Routing, Ad Hoc On Demand Distance Vector Routing, Greedy Perimeter Stateless Routing and a Simple Random Walk Routing in order to underline their behavior according to the network features and application requirements. Finally, we show that Beacon-less routing protocol should be a best candidate to save energy in WSNs.

The overall support and trustworthiness among nodes in wireless environment to relay each other's packets expose them to a wide range of security attacks. Wireless sensor networks (WSNs) introduce a new standard of ambient supervision with many potential applications. The environment of wireless sensor networks and Mobile Ad-hoc networks make them very attractive to the challengers and they become vulnerable to some types of intruders since they are arranged in open and unsecured atmosphere and are comprised of low-priced small devices. This paper introduces an algorithm to design a Mobile Ad-hoc network (MANET) or Wireless Sensor Network (WSN) and compares the effect of different network and physical layer attacks (wormhole, black hole, jamming, byzantine) based on some Quality of service parameters in presence of AODV routing protocol. We simulate various attacks using the network simulator OPNET 14.5 and then analyze them in the basis of some quality of service parameters under AODV routing protocol.

The emergence of wireless ad-hoc networks is considered extremely attractive in terms of new applications' enabler. The integration of reliable sensors in nodes of wireless ad-hoc networks has posed various interesting challenges to the community of researchers and engineers. We focus in this paper on two fundamental issues: supporting high mobility of sensors and guaranteeing continuity of sensing, while providing for the correlation of collected data. We propose an efficient scheme for the management of data, sensor mobility, and sensing security

The development of practical, localization algorithms is probably the most needed and most challenging task in wireless ad-hoc sensor networks (WASNs). Localized algorithms are a special type of distributed algorithms where only a subset of nodes in the WASN participate in sensing, communication, and computation. We have developed a generic localized algorithm for solving optimization problems in wireless ad-hoc networks that has five components: (i) data acquisition mechanism, (ii) optimization mechanism, (iii) search expansion rules, (iv) bounding conditions and (v) termination rules. the main idea is to request and process data only locally and only from nodes who are likely to contribute to rapid formation of the final solution. The approach enables two types of optimization: The first, guarantees the fraction of nodes that are contacted while optimizing for solution quality. The second, provides guarantees on solution qualities while minimizing the number of nodes that are contacted and/or amount of communication. The localized optimization approach is applied to two fundamental problems in sensor networks: location discovery and exposure-based coverage. We demonstrate its effective-ness on a number of examples

In wireless, every device can moves anywhere without any infrastructure also the information can be maintained constantly for routing the traffic. The open issues of wireless Adhoc network the attacks which are chosen the forwarding attack that is dropped by malicious node to corrupt the network performance then the information integrity exposure. Aim of the problem that existing methods in Adhoc network for malicious node detection which cannot assure the traceability of the node as well as the fairness of node detection. In this paper, the proposed heterogeneous cluster based secure routing scheme provides trust based secure network for detection of attacks such as wormhole and black hole caused by malicious nodes presence in wireless Adhoc network. The simulation result shows that the proposed model is detect the malicious nodes effectively in wireless Adhoc networks. The malicious node detection efficiency can be achieved 96% also energy consumption also 10% better than existing method.

Early detection of a forest fire can save our flora and fauna. Ad Hoc Wireless Sensor Networks (WSN) plays an important role in detecting forest fire. This article proposes a model for early detection of forest fire through predictive analytics. In this approach, the forest area is divided into different zones. Status of a zone, i.e., High Active (HA), Medium Active (MA), and Low Active (LA), is predicted by applying the semi-supervised classification technique. Each zone has static sensors, mobile sensors, and an Initiator node. Initiator nodes of LA and MA zone transfer their mobile nodes (MN) to the nearer HA zone for the quick prediction of forest fire by using the Random trajectory generation (RTG) technique. This technique generates the intermediate points between LA/MA to HA zone to create the movement path of MN. Compressed sensing based Gradient descent (GD) localization technique is used to track the movement of MN by the anchor nodes. This technique reduces the energy consumption of MN that causes an increase in network lifetime. The analysis of the localization error of MN during its traveling towards the HA zone increases the accuracy of its path detection. Thus the increase of sensor nodes in the HA zone results in transferring a huge amount of data from HA zone to base station for quick prediction of a forest fire.

In wireless mobile ad-hoc networks, data packets have to be relayed hop by hop from a given source node to a destination node. This means that some or all of the mobile nodes must accept to forward information for the benefit of other nodes. It has been shown by F. Nait-Abdesselam, et al., (2003) that this ability of forwarding packets leads to a new unfairness problem in wireless ad-hoc networks, where a node which is forwarding other node's packets gets less bandwidth, for its own use, than a node which is not participating to the routing service. The proposed RAMAC scheme by F. Nait-Abdesselam, et al., (2003), has shown all its effectiveness to cope with this unfairness problem. However, an extra bandwidth is sometimes allowed to the routing node's own traffic comparing to other nonrouting node's own traffics, and the routing node's routed traffic gets much less bandwidth. This is explained by the fact that at the upper layer (for instance the IP layer) does not differentiate between the routing and the own traffics, and that the multiplicative factor used to compute the new contention window is too aggressive. In this paper, an enhanced RAMAC scheme is proposed, by taking into account the differentiation on top of the MAC layer, between the and routed traffics within a routing node, and by smoothing the multiplicative factor used to compute the new contention window. The simulation results obtained showed a good improvement of the original RAMAC scheme, leading to better approximate equal bandwidth share among all the mobile nodes in the wireless ad-hoc network.

Recent development has a tremendous growth in the ad-hoc wireless networks. Ad-hoc wireless networks are dynamic topology networks organized by a collection of mobile nodes that utilize multi-hop radio relaying and are capable of operating without the support of any fixed infrastructure. Ad-hoc wireless networks are very useful in emergency operations, collaborative and distributed computing and military applications. Multicasting plays an important role in the ad-hoc wireless networks, where nodes form groups to carry out certain tasks that require point-to-multipoint and multipoint-to-multipoint voice and data communication. The biggest challenge in the ad-hoc wireless networks is to find an optimized path between the two nodes. In this paper, we present an ant colony based metaheuristic multicast routing protocol for ad-hoc wireless networks, in that we analyzed the performance of dynamic core based multicast routing protocol (DCMP). This approach maps the solution capability of swarm intelligence to mathematical and engineering problems. The DCMP is highly adaptive, efficient and scalable. The performance of these protocols has been examined under realistic scenarios using NS 2, the network simulator tool. Performance has been analyzed for the metrics packet delivery ratio and control overheads with the multicast routing protocol. The proposed ant colony based routing protocol reduce the overheads in routing.

In the emerging context of wireless (mobile) ad-hoc networks, cross-layer design has been proposed in recent years to pursue joint optimization at various layers. Modifications to the OSI reference model have been envisaged in order to allow description of cross-layer solutions. Nevertheless, it can be also observed that a sound and reference methodology does not yet exist to support optimization, and this might severely restrict effective adoption and deployment of cross-layer solutions [1]. In this work we propose some conjectures about exploitation of OSI-like layered approach to model and design cross-layer solutions. Specifically, we apply our method to the modelling and analysis of a particular class of cross-layer solutions, namely energy-aware routing protocols. We analyze two proposals available in the literature according to a layered structure. The applied method drives the definition of a novel energy-aware solution that, compared to the previous ones, shows better performance and provides interesting and clear insights on the role that each layer does play in the overall optimization process.

Geographic routing protocols establish scalable and robust routes for multi-hop trsdansmission in wireless mobile ad-hoc networks, where accurate location information of the mobile nodes is needed. Aiming to alleviate the influence of location errors, existing works focus on modifying routing protocols through modeling the error sources and mobility prediction. In this paper, we propose a cooperative cluster based geographic routing (CCGR) protocol, which views the cooperative cluster as one virtual relay node, and lessens the impact of location errors through opportunistic receiving and cooperative radio range extension. Opportunistic receiving achieves the link diversity and radio range extension enlarges the transmission distance of one hop. The performance of CCGR is analyzed under scenarios of both static and mobility location errors in terms of reliability index, which is defined to represent the link stability. Further more, numerical results demonstrate that our proposed transmission scheme CCGR outperforms non-cooperative routing schemes in terms of link error probability with location errors.

Topology control is an important problem in wireless ad-hoc sensor networks. The aim of the topology control is to maintain desired properties of the network topology to improve the performance of networking algorithms (e.g. routing). In this paper, we present a distributed algorithm for assigning minimum possible power to all the nodes in the wireless sensor networks, such that the network is K-connected. Extensive simulation has been performed to prove the optimality of the algorithm

Wireless ad-hoc sensor networks will provide one of the missing connections between the Internet and the physical world. One of the fundamental problems in sensor networks is the calculation of coverage. Exposure is directly related to coverage in that it is a measure of how well an object, moving on an arbitrary path, can be observed by the sensor network over a period of time.In addition to the informal definition, we formally define exposure and study its properties. We have developed an efficient and effective algorithm for exposure calculation in sensor networks, specifically for finding minimal exposure paths. The minimal exposure path provides valuable information about the worst case exposure-based coverage in sensor networks. The algorithm works for any given distribution of sensors, sensor and intensity models, and characteristics of the network. It provides an unbounded level of accuracy as a function of run time and storage. We provide an extensive collection of experimental results and study the scaling behavior of exposure and the proposed algorithm for its calculation.

Ad Hoc network is one of the popular wireless multi-hop networks. Nodes or Users in Ad Hoc network can move randomly and freely to maintain communication without the control of the fixed infrastructure. Due to the limited transmission power and wireless coverage of the terminal, if two terminals that are beyond their respective transmission radius need communicate, they must use other intermediate or relay nodes for packet forwarding, so that a wireless Ad Hoc network is formed among these nodes. In this paper, the current state-of-the-art multipath routing protocols for Ad Hoc networks are reviewed. Particularly, the pros and cons of them are analyzed. Finally, they are summarized and compared.

Mobile Ad-hoc Network (MANET) has emerged as the self organized wire less interconnection for the various applications in random topology. As most of the multimedia applications require strict QoS guarantee during the communication between a single source and multiple destinations. How ever, achieving reliable multicast transmission in MANET is crucial due to the dynamic network topology caused by the node mobility. This gives rise to the need for an efficient multicast routing strategy. This paper proposes a novel scheme PBMRP-BR (position-based Multicast Routing Protocol for Ad-hoc Network Using Backpressure Restoration) for efficient transmission of multimedia applications in Ad-hoc Network, which provides priorities for routing based on Distance of path, Load at the node (ie, traffic) and queue length at the node(ie, bandwidth). It also keeps the path information including bandwidth resources of each node for routing decisions. The problem of the link failure in the channel during the call in progress thus lead in the degradation of the QoS (Quality of Service).To deal this we are using a Backpressure Technique The simulation results shows that the proposed algorithm is able to find a better solution, fast convergence speed and high reliability. The simulation results shows the proposed PBMRP-BR protocol achieve the above objectives and gives the batter results than previous schemes like DSR for the maintenance of overheads and the path reliability. Our proposed scheme will improve the bandwidth utilization by reducing the congestion in the Adhoc wireless network.