Essay On A Wsn-Driven Service Discovery Techniques

Geographic Adaptive Fidelity (GAF): Geographic Adaptive Fidelity is an energy-aware location based routing algorithm planned for mobile ad-hoc networks but has been used to WSNs. Geographic Adaptive Fidelity conserving energy by switching off redundant sensors nodes. In this routing protocol, the entire network is classified into number of static zones and a virtual grid is made for the covered region. Every node utilizes its GPS-indicated location to link itself with a point in the virtual grid. Nodes linked to the same point on the grid are assumed equivalent with respect to packet routing costs. Nodes within a zone cooperate by choosing one node to show the zone for a period of time whereas the rest of the nodes sleep. A sample situation is considered from

Ad hoc networks are suited for use in situations where infrastructure is either not available

A WSN is a type of wireless networks that consists of collection sensor nodes which are tiny devices. Each sensor node of the network has different processing capability. It may contain multiple types of memory (program, data and flash memories), have a RF transceiver, have a power source (e.g., batteries and solar cells), and accommodate various sensors and actuators. The nodes communicate wirelessly and often self-organize after being deployed in an ad hoc fashion [13, 14]. Optimum need of each sensor node is to maximize its own utility function. Also the whole network requires resource assignments balance to perform in a useful and efficient way. This chapter presents a brief survey on WSNs showing its types, characterizing features, protocols and applications.

MANETs (Mobile ad-hoc network) is defined as autonomous collection of wireless mobile nodes that are self-configure to construct a network that can communicate over relatively bandwidth constrained wireless links.

After electing CHs, every CH announces all sensor nodes in the network that it is the new CH. When each node receives the announcement, it chooses its desired cluster to join based on the signal strength of the announcement from the CHs to it. So, the sensor nodes inform their appropriate CH to join it. Afterwards, the CHs based on a TDMA approach assign the time slot to each node so that a member can send its data to its CH in this period. The sensor nodes can initiate sensing and transmitting data to the CHs during the steady state phase. The CHs also aggregate data received from the nodes in their cluster before sending these data to the BS via a single hop fashion. D. Hybrid Energy Efficient Distributed Clustering [HEED] Younis and Fahmy proposed an iterative clustering protocol, named HEED. HEED is different from LEACH in the way CHs are elected. Both, electing the CHs and joining to the clusters, are done based on the combination of two parameters. The primary parameter depends on the nodes residual energy. The alternative parameter is the intra cluster “communication cost”. Each node computes a communication cost depending on whether variable power levels, applied for intra cluster communication, are permissible or not. If the power level is fixed for all of the nodes, then the communication cost can be proportional to (i) node

CNBD analyzed the aggregated data to the sink by the transfer time from end to end to obtain a higher battery power of each node [83]. Guo and et. al. have suggested a Faulty Node Detection (FIND) to WSN. FIND is a method for nodes with data errors capturing a centralized approach, without specific recognition model taking into account. It is measured to measure the signal attenuation distance [84]. Saihi and et al. used to create a centralized error detection method based on clustering approach, the exchange of messages heartbeat actively scalable and balanced applications for WSN [85]. In April 2016, Tahir and et al. evaluated a nominal power consumption in wireless sensor networks through a system through which a small number of high energy nodes collect both location information and the residual power state of the read nodes, then they are transmitted to the base station (BS). The authors suggested an algorithm in which a minor proportion of the high energy nodes are used to transmit each node’s information to Base Station (BS) [86].

Power efficiency is the first factor that directly affects the performance of the nodes and hence of the overall sensor network. For better and desired performance, the nodes of a WSN must be efficient in terms of power which in simple words means that the duty cycle of the nodes must be made small [5]. The design considerations must take into account the sleeping mode of the nodes when there is no activity thereby reducing power consumption and contributing to performance enhancement. However, the sleep mode of nodes has the main disadvantage that if any of the nodes remains in the sleep mode for a significant chunk of time, it is likely that communication with neighbors nodes may come to a halt. Also, a reduced duty cycle for the network nodes leads to threatening the network reliability. The data as well as the control packets that maintain the routing and communication among the nodes of the sensor network will also have a delayed reception.

Ehsan Mostajerani [2] proposed I-AODV. On-Demand Distance Vector (AODV) is one of the ad hoc routing protocols utilized in MANET and VANET. Ad hoc routing protocols are categorized into Table-driven and On-demand. On-Demand routing protocols find their destinations based on the process of flooding a request to neighbors searching for their destinations. Neighbors of nodes are detected based on the neighbor discovery method, which periodically broadcasts HELLO messages to detect available neighbors at time. Generating routing packets and neighbor discovery messages produce high overhead in the On-Demand routing protocol, such as AODV. In order to overcome overhead issues, a novel scheme in Ad hoc networks based on

Thus, all wireless links between sensors and the M-collector at the candidate polling points are bidirectionally tested. In addition, each sensor can also discover its one-hop neighbors by broadcasting the “Hello” messages during the neighbor discovering phase. After the sensor reports the IDs of its one-hop neighbors to the M-collector by including the information into the “ACK” message, the position of the sensor can also become a candidate polling point. In Fig. 1, we illustrate the definition of polling points, neighbor set, and candidate polling point set by an example, where there are four sensors s1, s2, s3, and s4 deployed at positions l1, l2, l3, and l4, respectively. During the exploration phase, the M-collector discovers the neighbor sets of l5 and l6 by broadcasting “Hello” messages at these points. Thus, l5 and l6 can be added into the candidate polling point set. Since sensors s1, s2, s3, and s4 also report their one-hop neighbors to the M-collector by sending “ACK” to the M-collector, l1, l2, l3, and l4 also become candi-date polling points. In Fig. 1, if there is a wireless link between sensor si and position lj , we say that si belongs to the neighbor set of lj , where si ∈ {s1, s2, s3, s4} and lj ∈ {l1, l2, . . . , l6}. Thus, candidate polling point set L = {l1, l2, . . . , l6}; neighbor sets of

Thus, the Bloom filter becomes the name of the node. DINAS addresses the problem of binding between a name and its IPv6 address, so that the nodes can analyze a name to obtain the address. The results show that DINAS outperforms the centralized solution.

The approach of dividing the networks into small controllable units is called as clustering. The clustering technique advances the scalability of network through ease of implementation and results energy efficient routing within the sensor networks. The clustering approach has some other advantages also like conserving communication bandwidth, avoiding redundant message transfer, localizing energy efficient route setup etc. LEACH, HEED, DECA, etc. are the energy efficient routing protocols based on clustering technique.

Connectivity and topology control: Some approaches tried to improve the system reliability by carefully designing the connectivity or topology of wireless networks. Paper [50] addresses the problem of fault tolerant deployment of wireless ad-hoc networks. Based on the pre-assumed transmission range, the authors propose a scheme to calculate the probability that a given network is k-connected. Based on the intensive deployment, the redundant sensor nodes are used to cope the random working nodes failure. Following the similar idea, a distributed algorithm is proposed in [52]. By deploying calculated necessary number of extra nodes in the given network, the objective of fault-tolerant topology control can be achieved. However, due to the limited space and cost constraint, adding redundant nodes to a deployed WSN may not always be an acceptable solution. Another fault-tolerant topology control algorithm is presented by Li and Hou in [53], in which a spanning subgraph is computed by each node. If a pair of vertices is not k-connected, an extra edge will be added between these two vertices. The authors further prove that the resultant global network is k-connected. In [54], by considering the mobility of nodes, the author shows the mobility resilient topology control protocols. The author classifies the topology control protocols into two types. 1) In this case, the topology is built and maintained by each node based on its own knowledge about its neighbors. According to its own

Many different protocols have been proposed to support Quality of service in MANETs, each based on different intuitions & assumptions. Current proposals in the literature have attempted to provide Quality of

For this reason, MANETs are also called infrastructure less or non-infrastructure wireless networks. The term ad hoc implies that this network is a network established for a special, often extemporaneous service customized to specific applications. MANETs enable wireless networking in environments where there is no wired or cellular infrastructure; or, if there is an infrastructure, it is not adequate or cost effective. The absence of a central coordinator and base stations makes operations in MANETs more complex than their counterparts in other types of wireless networks such as cellular networks or wireless local area networks (WiFi networks).

Abstract— An Ad-hoc mobile network is an assembly of wireless transportable nodes devotedly creating a short-lived network lacking the use of any core-existing centralized administration or network infrastructure. MANET have restrictions owed to mobility, infrastructure and capabilities of mobile nodes or due to network system as an entire. Limitations due to system or infrastructure,