Localized Broadcast Incremental Power Protocol for Wireless Ad Hoc Networks.

As broadcasting is widely used for miscellaneous maintenance operations in wireless ad hoc networks, where energy is a scarce resource, an efficient broadcasting protocol is of prime importance. One of the best known algorithm, named BIP (Broadcast Incremental Power), constructs a spanning tree rooted at a given node. This protocol offers very good results in terms of energy savings, but its computation is unfortunately centralized, as the source node needs to know the entire topology of the network to compute the tree. Many localized protocols have since been proposed, but none of them has ever reached the performances of BIP. Even distributed versions of the latter have been proposed, but they require a huge transmission overhead for information exchange and thus waste energy savings obtained thanks to the efficiency of the tree. In this paper, we propose and analyze a localized version of this protocol. In our method, each node is aware of the position of all the hosts in the set of its 2-hop neighborhood and compute the BIP tree on this set, based on information provided by the node from which it got the packet. That is, a tree is incrementally built thanks to information passed from node to node in the broadcast packet. Only the source node computes an initially empty tree to initiate the process. We also provide experimental results showing that this new protocol has performances very close to other good ones for low densities, and is very energy-efficient for higher densities with performances that equal the ones of BIP

The abstract MAC layer

A diversity of possible communication assumptions complicates the study of algorithms and lower bounds for radio networks. We address this problem by defining an Abstract MAC Layer. This service provides reliable local broadcast communication, with timing guarantees stated in terms of a collection of abstract delay functions applied to the relevant contention. Algorithm designers can analyze their algorithms in terms of these functions, independently of specific channel behavior. Concrete implementations of the Abstract MAC Layer over basic radio network models generate concrete definitions for these delay functions, automatically adapting bounds proven for the abstract service to bounds for the specific radio network under consideration. To illustrate this approach, we use the Abstract MAC Layer to study the new problem of Multi-Message Broadcast, a generalization of standard single-message broadcast, in which any number of messages arrive at any processes at any times. We present and analyze two algorithms for Multi-Message Broadcast in static networks: a simple greedy algorithm and one that uses regional leaders. We then indicate how these results can be extended to mobile networks.Cisco Systems, Inc.Lehman Brothers (1993-2008)CUNY (A New MAC-Layer Paradigm for Mobile Ad-Hoc Networks)National Science Foundation (U.S.) (NSF Award Number CCF-0726514)National Science Foundation (U.S.) (NSF Award Number CNS-0715397

Energy-Optimal Scheduling in Low Duty Cycle Sensor Networks

Energy consumption of a wireless sensor node mainly depends on the amount of time the node spends in each of the high power active (e.g., transmit, receive) and low power sleep modes. It has been well established that in order to prolong node's lifetime the duty-cycle of the node should be low. However, low power sleep modes usually have low current draw but high energy cost while switching to the active mode with a higher current draw. In this work, we investigate a MaxWeightlike opportunistic sleep-active scheduling algorithm that takes into account time- varying channel and traffic conditions. We show that our algorithm is energy optimal in the sense that the proposed ESS algorithm can achieve an energy consumption which is arbitrarily close to the global minimum solution. Simulation studies are provided to confirm the theoretical results

Implementation of Efficient Cooperative Message Authentication for Vehicular Ad-Hoc Networks

Vehicular Ad-Hoc Network(VANET) is a potential area in research field to bestow Intelligent Transportation System (ITS) services to the end users. It is a exigent topic for its high mobility and frequent network distraction. Lately researchers are carrying out task on many specific issues related to VANET like routing, broadcasting, Quality of Service (QoS), security, architectures, applications, protocols, etc. The augment in vehicles in today’s life has lead to brutal road accidents and traffic jam in urban areas. One of the solution to this problem could be a means of communication between the vehicles for safety. Safety measures lack these days in VANET as malicious drivers in the network disrupt the system routine. In this paper , a new location Based Secure Routing Protocol( PBSRP) which is a hybrid of Most Forward within Radius and Border Node based Most Forward within Radius (B-MFR) routing protocols. A module for security is implemented in this protocol using station to station key agreement protocol for preventing system from several attacks. The module goes through three phases: initialization phase, optimal node selection phase and secure data delivery phase. The outcome of Simulation imparts that PBSRP has better performance than MFR in terms of end to end delay and packet delivery ratio when malicious drivers are included in the network

Data and resource management in wireless networks via data compression, GPS-free dissemination, and learning

“This research proposes several innovative approaches to collect data efficiently from large scale WSNs. First, a Z-compression algorithm has been proposed which exploits the temporal locality of the multi-dimensional sensing data and adapts the Z-order encoding algorithm to map multi-dimensional data to a one-dimensional data stream. The extended version of Z-compression adapts itself to working in low power WSNs running under low power listening (LPL) mode, and comprehensively analyzes its performance compressing both real-world and synthetic datasets. Second, it proposed an efficient geospatial based data collection scheme for IoTs that reduces redundant rebroadcast of up to 95% by only collecting the data of interest. As most of the low-cost wireless sensors won’t be equipped with a GPS module, the virtual coordinates are used to estimate the locations. The proposed work utilizes the anchor-based virtual coordinate system and DV-Hop (Distance vector of hops to anchors) to estimate the relative location of nodes to anchors. Also, it uses circle and hyperbola constraints to encode the position of interest (POI) and any user-defined trajectory into a data request message which allows only the sensors in the POI and routing trajectory to collect and route. It also provides location anonymity by avoiding using and transmitting GPS location information. This has been extended also for heterogeneous WSNs and refined the encoding algorithm by replacing the circle constraints with the ellipse constraints. Last, it proposes a framework that predicts the trajectory of the moving object using a Sequence-to-Sequence learning (Seq2Seq) model and only wakes-up the sensors that fall within the predicted trajectory of the moving object with a specially designed control packet. It reduces the computation time of encoding geospatial trajectory by more than 90% and preserves the location anonymity for the local edge servers”--Abstract, page iv

Novel Medium Access Control (MAC) Protocols for Wireless Sensor and Ad Hoc Networks (WSANs) and Vehicular Ad Hoc Networks (VANETs)

Efficient medium access control (MAC) is a key part of any wireless network communication architecture. MAC protocols are needed for nodes to access the shared wireless medium efficiently. Providing high throughput is one of the primary goals of the MAC protocols designed for wireless networks. MAC protocols for Wireless Sensor and Ad hoc networks (WSANs) must also conserve energy as sensor nodes have limited battery power. On the other hand, MAC protocols for Vehicular Ad hoc networks (VANETs) must also adapt to the highly dynamic nature of the network. As communication link failure is very common in VANETs because of the fast movement of vehicles so quick reservation of packet transmission slots by vehicles is important. In this thesis we propose two new distributed MAC algorithms. One is for WSANs and the other one is for VANETs. We demonstrate using simulations that our algorithms outperform the state-of-the-art algorithms

Distributed local broadcasting algorithms in the physical interference model

Given a set of sensor nodes V where each node wants to broadcast a message to all its neighbors that are within a certain broadcasting range, the local broadcasting problem is to schedule all these requests in as few timeslots as possible. In this paper, assuming the more realistic physical interference model and no knowledge of the topology, we present three distributed local broadcasting algorithms where the first one is for the asynchronized model and the other two are for the synchronized model. Under the asynchronized model, nodes may join the execution of the protocol at any time and do not have access to a global clock, for which we give a distributed randomized algorithm with approximation ratio O(log n).published_or_final_versionThe 2011 International Conference on Distributed Computing in Sensor Systems and Workshops (DCOSS), Barcelona, Spain, 27-29 June 2011. In Proceedings of DCOSS, 2011, p. 1-

Energy efficient clustered chain based power aware routing protocol for wireless sensor networks

WSNs has emerged as am important computing platform in the recent few years. Wireless Sensor Networks consists of a large number of sensor nodes, which are operated by a small battery. Sensor nodes can be deployed in the harsh environment. Once they are deployed, it becomes impossible to replace or recharge its battery. So the battery power of sensor node should be used efficiently. Many routing protocols has been proposed so far but they has not taken consideration of critical data. So we propose EECCPAR protocol which considers time critical data by using MAX threshold concept. Our protocol is better than PEGASIS protocol, this has been shown by simulation results

SAI: safety application identifier algorithm at MAC layer for vehicular safety message dissemination over LTE VANET networks

Vehicular safety applications have much significance in preventing road accidents and fatalities. Among others, cellular networks have been under investigation for the procurement of these applications subject to stringent requirements for latency, transmission parameters, and successful delivery of messages. Earlier contributions have studied utilization of Long-Term Evolution (LTE) under single cell, Friis radio, or simplified higher layer. In this paper, we study the utilization of LTE under multicell and multipath fading environment and introduce the use of adaptive awareness range. Then, we propose an algorithm that uses the concept of quality of service (QoS) class identifiers (QCIs) along with dynamic adaptive awareness range. Furthermore, we investigate the impact of background traffic on the proposed algorithm. Finally, we utilize medium access control (MAC) layer elements in order to fulfill vehicular application requirements through extensive system-level simulations. The results show that, by using an awareness range of up to 250 m, the LTE system is capable of fulfilling the safety application requirements for up to 10 beacons/s with 150 vehicles in an area of 2 × 2 km2. The urban vehicular radio environment has a significant impact and decreases the probability for end-to-end delay to be ≤100 ms from 93%–97% to 76%–78% compared to the Friis radio environment. The proposed algorithm reduces the amount of vehicular application traffic from 21 Mbps to 13 Mbps, while improving the probability of end-to-end delay being ≤100 ms by 20%. Lastly, use of MAC layer control elements brings the processing of messages towards the edge of network increasing capacity of the system by about 50%