Installing A Realistic Wireless Sensor Network Setting

maximization of network lifetime [8]. This protocol is also divided into two phase: 1. Clustering and 2. Routing of aggregated data. In clustering phase, a fixed topological arrangement is done by sensor nodes. In the data aggregation phase, heuristic is proposed. The advantage is that it provides energy efficiency and network lifetime also be increased.

In this section, we present the details of proposed protocol. Our protocol implements the idea of probabilities for cluster heads selection based on initial energy and residual energy of sensor nodes as well as the average energy of the sensor network.

A group of wireless sensor nodes (devices) dynamically constructs a temporary network without the exercise of any pre-existing network infrastructure or centralized administration. The main goal of ad-hoc networking is multihop broadcasting in which packets are transferred from source node to destination node through the intermediate nodes (hops). The main function of multi hop WSN is to enable communication between two terminal devices through a bit of middle nodes, which are transferring information from one level to another level. On the foundation of network connectivity, it dynamically gets to determine that which nodes should get included in routing, each node involved in routing transmit the data to further

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.

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

Stalin Babu G, Santosh Raju D “A Survey on Cluster Head Selection Routing Protocols in WSN” International Journal of Computer Applications (0975 – 8887) Volume 115 – No. 16, April 2015.

Abstract: Security is always a main task to be performed in any network. Wireless Sensor Network are different from other networks.Hierarchical Routing Protocol are the best energy saving and efficient rout wireless sensor networks. Our Objective is to Provide End to End Confidentiality in LEACH and Performance measurement of leach protocol for various homomorphic encryptions. Leach is a very secure Protocol as cluster head changes in each round but sometimes data needs to be very confidential of some nodes to Base station. So the best technique used for providing this is Homomorphic Encryption.Our Objective is to apply Multiplicative Homomorphic Encryption in LEACH.So that need of decrypting data at cluster head is removed.

The goal of this algorithm is to search for sensor network layouts that maximize both the coverage and lifetime of the network.

heterogeneous scheme in which all sensor nodes have a different amount of energy as each node is assigned with various task [20] such as SEP[21], DEEC[22]. In this paper, we propose and analyze a novel cluster head selection scheme based on the deployment of nodes in different regions for heterogeneous wireless sensor networks (HWSNs) which is named as RBETSSEP.

Hence, WSN technology has very broad application prospects, which can be used in military, industrial and agricultural control, urban management, biomedical, environmental testing, disaster relief and other fields. However, in many of these applications, the environment could be hostile and manual placement of sensor nodes might not be possible. In these situations, the nodes are expected to be deployed randomly or be sprinkled from airplanes and will remain unattended for weeks or months without any battery replenishment [4]. Therefore, energy conservation is a key issue in the design of systems based on WSNs. Due to the limited energy resource in each sensor node, we need to utilize the WSN in an

Abstract -- The efficiency of sensor networks depends on the coverage of the target area. Although, in general, a sufficient number of sensors are used to ensure a certain degree of redundancy in coverage, a good sensor deployment method is still necessary to balance the workload of sensors in target area. In a sensor network sensors can move around to self-deploy. The deployment deals with moving sensors from an initial unbalanced state to balanced state. Therefore, several optimization problems can be defined to minimize different parameters such as total moving distance, number of moves, communication cost. There is a unique problem called communication holes in sensor networks, areas not covered by any node.

Multiple autonomous, tiny, low-cost and low-power sensor nodes comprise a wireless sensors network (WSN). The sensors nodes are equipped with various types of sensors such as thermal , acoustic, chemical, pressure, weather and optical sensors which gather information from various nodes and collaborate to forward sensed data to base stations for further processing. WSNs designers have to address common issues related to data aggregation, data reliability,

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

T. Gui in 2016 [39] studied the mechanism of SMO in the field of WSNs in the paper “A Novel Cluster-based Routing Protocol Wireless Sensor Networks using Spider Monkey Optimization.” The study additionally showed the change in traditional routing protocols in term of low-energy consumption and system quality of the network. SMO-C protocol suggested in the paper worked for Wireless sensor networks to minimize global energy consumption.

Development in Wireless Communication and networking has led to development of many applications like Bluetooth, Near Field Communications and Wireless Sensor Networks. A wireless sensor network is essentially a network of nodes which consist of a power supply, sensors which usually sense the ambient conditions and processors for storing and processing information collected and a transceiver unit which is used to transmit and receive information from other nodes. In addition it might have a GPS system which provides location based services. This Wireless Sensor network is divided into 3 main parts: Bottom nodes, cluster heads and network coordinators. The data collected by a node is transmitted to its cluster head, in turn, the data collected by the cluster head is sent to the network coordinator and data at the network coordinator can be sent to nearby clusters using a router and internet.