The topology of a remote sensor system changes as a few sensors come up short on force, fall flat or Join the system; which might bring about loss of information or the velocity of exchange of information backs off. This issue is solved using Greedy Algorithm and the Hop Count Reduction (HCR) plan is used as a short-listening so as to slice procedure to decrease the steering bounces to the neig...

A wireless sensor network (WSN) consists of sensor nodes (SNs) with wireless communication capabilities for specific sensing tasks. Each SN maintains connectivity and exchanges messages between the decentralized nodes in the multi-hop manners. A source node can communicate with its destination via a certain number of relaying nodes, which consequently enlarges the wireless coverage of the sourc...

Smart scheduling can be used to reduce infrastructure-to-vehicle energy costs in delay tolerant vehicular networks (Hammad et al., 2010). In this thesis we show that by combining this with vehicle-to-vehicle (V2V) forwarding, energy efficiency can be increased beyond that possible in the single hop case. This is accomplished by having the roadside infrastructure forward packets through vehicles...

The use of efficient signal processing tools (SPTs) to extract proper indices for the fault detection in induction motors (IMs) is the essential part of any fault recognition procedure. The 2nd part of this two-part paper is, in turn, divided into two parts. Part two covers the signal processing techniques which can be applied to non-stationary conditions. In this paper, all utilized SPTs for n...

In asynchronous duty-cycled wireless sensor networks, it is desirable that the data forwarding scheme is adaptive to the dynamics caused by the uncertainty of sensor nodes’ working schedules. Contentionbased forwarding is designed to adapt to the dynamic environments. In this work, we are interested in the contention-based geographic forwarding (CGF) for two asynchronous duty-cycling (ADC) mode...

A greedy drawing is a straight-line drawing that contains a distance-decreasing path for every pair of nodes. A path (v0, v1, . . . , vm) is distance-decreasing if d(vi, vm) < d(vi−1, vm), for i = 1, . . . ,m. Greedy drawings easily support geographic greedy routing. Hence, a natural and practical problem is the one of constructing greedy drawings in the plane, using few bits for representing v...

Geographic routing has received an increasing attention in the context of Wireless Sensor Networks since it frees the network from the energy-demanding task of building and maintaining a structure. It requires however each node to know its position, which may be a prohibitive assumption for many applications. To this end, some prior work has focused on inferring a node’s location from a set of ...

Cluster interactions are imperative in Mobile Ad hoc Networks (MANET). Multicast is an proficient technique for implementing cluster connections. However, it is exigent to execute competent and scalable multicast in MANET due to the intricacy in faction association supervision and multicast packet forwarding over a dynamic topology. We intend a novel Efficient Geographic Multicast Protocol (EGM...

Geographic networks use physical location as destination addresses, and forward packets topographically. These networks enable geographic and proximity-sensitive applications, unlike the current Internet naming and routing architecture. Geographic routing applied to a native network generally suffers from routing inconsistencies and inefficiencies. A geographic overlay can be incrementally depl...

Epidemic forwarding has been proposed as a forwarding technique to achieve opportunistic communication in Delay Tolerant Networks (DTNs). Even if this technique is well known and widely referred, one has to address several practical problems before using it. Unfortunately, while the literature on DTNs is full of new techniques, very little has been done in comparing them. In particular, while B...