Sink-oriented Dynamic Location Service Protocol for Mobile Sinks with an Energy Efficient Grid-Based Approach

In wireless sensor networks (WSNs), sensor nodes near static sink will have more traffic load to forward and the network lifetime will get largely reduced. This problem is referred to as the hotspot problem. Recently, adopting sink mobility has been considered as a good strategy to overcome the hotspot problem. Despite its many advantages, due to the dynamic network topology caused by sink mobility, data transmission to the mobile sink is a challenging task. To achieve efficient data dissemination, nodes need to reconstruct their routes toward the latest location of the mobile sink, which weakens the energy conservation aim. In this paper, we proposed an energy-efficient cluster-based dynamic routes adjustment approach (EECDRA) which aims to minimize the routes reconstruction cost of the sensor nodes while maintaining nearly optimal routes to the latest location of the mobile sinks. The network is divided into several equal clusters and cluster heads are selected within each cluster. We also set some communication rules that manage routes reconstruction process accordingly requiring only a limited number of nodes to readjust their data delivery routes toward the mobile sinks. Simulation results show that the mobile sinks for reducing reconstruction of route have improved the energy efficiency and prolonged lifetime of wireless sensor network.

Achieving efficient data dissemination to a mobile sink moving is one of the main challenges in wireless sensor networks. In this paper, we describe DHA, a data Dissemination protocol based on Home agent and Access node. DHA introduces the home agent and access node concepts to represent the mobile sink in sensor networks. The movement of the mobile sink affects only the access nodes and home agent, and the sensor nodes can transfer data to the fixed home agent without knowing the position of mobile sink. All the sensor nodes except the home agent and access node don't need to be updated in the direction of forwarding future data. DHA provides reliable and efficient data delivery to a mobile sink with minimum overheads. Our result shows that DHA increases the reliability of data delivery to the mobile sink and reduces the number of broadcast packets, thereby increasing the lifetime of sensor networks.

Wireless sensor networks (WSNs) are considered the backbone of the Internet of Things (IoT), which enables sensor nodes (SNs) to achieve applications similarly to human intelligence. However, integrating a WSN with the IoT is challenging and causes issues that require careful exploration. Prolonging the lifetime of a network through appropriately utilising energy consumption is among the essential challenges due to the limited resources of SNs. Thus, recent research has examined mobile sinks (MSs), which have been introduced to improve the overall efficiency of WSNs. MSs bear the burden of data collection instead of consuming energy at the routeing by SNs. In a network, some areas generate more data through SNs that contain frequent, urgent messages. These messages carry sensitive data that must be delivered immediately to user applications. Collecting such messages via MSs, especially on a large scale, increases delays, which are not tolerable in some real applications. This issue has not been studied much. Thus, the present study utilises the advantages of the priority parameter to concentrate on these areas and proposes a new model named ‘energy efficient path planning of MS-based area priority’ (EEPP-BAP). This method involves non-urgent and urgent messages. It is comprised of four procedures. Initially, after SNs are distributed randomly in a wide monitoring field, the monitoring field is partitioned into equal zones according to priority, either differently or equally. Next is clustering based on the cluster head (CH) selected to perform the particle swarm optimisation algorithm (PSO). Then, the MS moves first to the zones with higher priority and less distance to perform the brain storm optimisation algorithm. Finally, for urgent messages from the other zones at which the MS continues, the proposed approach establishes a routeing technique using multi-hop communication based on the MS position and using PSO. The proposed solution is aimed at delivering urgent messages to MSs free of latency and with minimal packet loss. The simulation results proved that the EEPP-BAP method can improve network performance compared with other models based on different parameters that have been used to construct the controlled movement of MSs in large-scale environments involving urgent messages. The proposed method increased the average lifetime of SNs to 206.6% on average, reduced the average end-to-end delay to 7.1%, and increased the average packet delivery ratio to 36.9%.

Recent studies have shown that utilizing a mobile sink to harvest and carry data from wireless sensor network (WSN) can enhance network operations and balance the network energy consumption. Because of the sink mobility, the paths between the sensor nodes and the sink change frequently, and have profound influence on the lifetime of WSN. To find an efficient protocol that can maintain the routes between the mobile sink and nodes with few network resources are important. We propose a swarm intelligent algorithm based route maintaining protocol in this paper to resolve this issue. The protocol utilizes the concentric ring mechanism to guide the route researching direction, and the optimal routing selection to maintain the data delivery route. Using the immune based artificial bee colony (IABC) algorithm to optimize the forwarding path, the protocol could find an alternative path efficiently when sink moves. The results of our experiments demonstrate that the protocol could balance the network traffic load.

In Wireless sensor Network, the sensor nodes transmit critical information over the network; therefore, security services, such as, authentication and pair wise key establishment between sensor nodes and mobile sinks, are important. However, the problem of authentication and pair wise key establishment in sensor networks with MSs is still not solved in the face of mobile sink replication attacks. For the basic probabilistic and q-composite key pre distribution schemes, an attacker can easily obtain a large number of keys by capturing a small fraction of the network sensor nodes, making it possible for the attacker to take control of the entire network by deploying a replicated mobile sink, preloaded with some compromised keys to authenticate and then initiate data communication with any sensor node. To solve this problem, we have developed a general framework that permits the use of any pair wise key pre distribution scheme as its basic component, to provide authentication and pair wise key establishment between sensor nodes and MSs. The new framework requires two separate key pools, one for the mobile sink to access the network, and one for pair wise key establishment between the sensors.

Geographic convergecast using mobile sink in wireless sensor networks

Wireless sensor networks (WSNs) include small sensor nodes with battery and processing power and limited memory units then improving power consumption is a major design challenge for any sensor network. In this paper, a new algorithm for routing in the wireless sensor network is proposed using the ultra-innovative algorithm for bacterial Foraging and mobile sink, which leads to energy efficiency. In the proposed method, the number of sensor nodes is determined according to two criteria: the amount of energy on the battery surface and the distance to the sink ahead, which leads to the formation of regular clusters in the network. Nodes adopt a multi-step routing scheme within the network to communicate with the sink. also, the mobile sink is used to balance the load and help consume uniform energy throughout the network. The simulation results show better performance of the proposed method in terms of energy consumption by 17.99%, throughput rate by 30.04%, end-to-end delay by 46.04%, signal-to-noise ratio by 32.81%, delivery rate successfully Data to the sink is 0.80 times higher than the AFSRP (Artificial Fish Swarm Routing Protocol).

The advantages of deploying mobile sinks (MSs) in wireless sensor networks (WSNs) have attracted tremendous attention recently, because mobility of a sink provides an efficient method to improve data gathering performance in WSNs. However, in such kind of WSN, the efficiency of data dissemination is obviously affected by the trajectory of the MS. Therefore, optimal moving schemes of the MS have been studied in many researches. Nevertheless, in many cases, the trajectory of the MS is not able to change ideally as previous studies assumed but depending on the environmental conditions. In this paper, we focus on the efficiency of data gathering in WSN with a MS whose trajectory cannot change ideally and propose a new data diffusion scheme - implementing a new Pre-Diffusion Algorithm (PDA) in a hierarchical WSN aimed at improving data gathering efficiency. This hierarchical WSN is composed of several clusters, and datatransmission is done by higher powered cluster head (CH) node. Our scheme predetermines the cluster area where the MS is going to arrive in most probability in next period of time. MS fulfills data converging in the cluster head (CH)whose distance to the MS may the smallest compared with other CHs when data gathering starts. Thus more data can be collected with less trajectory length of MS. Simulation results show that our proposed scheme improves data gathering efficiency as compared to conventional scheme.

In a wireless sensor network, reducing the energy consumption of sensor nodes and increasing energy conservation can be considered as two significant factors to prolong the network longevity. In this scheme, we proposed an energy-efferent data dissemination algorithm for the sensor nodes by making a virtual hexagonal cell-based infrastructure and multi-mobile sink to create a balance in energy consumption and to mitigate the energy-hole problem. The basic idea of the algorithm is to provide the ability for some of the sensing nodes that are elected by the virtual hexagonal backbone to inform other sensing nodes about the latest location of the nearest mobile sinks to decrease the overhead of updating the mobile sink location for the sensing nodes. Moreover, the sensor nodes can benefit considerably from these specified nodes as a relay node in the multi-hop routing process to send the data to the closest mobile sink based on the latest sink position information, which in turn leads to high energy conservation and low communication overhead between the sensing nodes and the mobile sinks in the network. According to the simulation results, the performance of the proposed scheme is better than the existing data transmission approaches in terms of total energy consumption, delay, and network longevity.

Wireless Sensor Networks (WSNs) are formed with multiple sensor nodes that use the IEEE 802.15.4 protocol. The WSN can operate in 16 different channels in the unlicensed Industrial, Scientific and Manufacturing (ISM) 2.4 GHz spectrum. The WLAN or IEEE 802.11g/n protocol also operates in the same spectrum. Additional problems arise when the WSN is mobile. Mobile WSN's are more efficient in scenarios where mobility is needed to collect data from remote target areas. Moving nodes may encounter overlapping frequencies from WLAN coexistence in its journey. Therefore, WSN channels have to be allocated intelligently to avoid channels overlapping with the WLAN. However with mobile WSN the WLAN networks encountered may have random spectrum allocation depending on the WLAN technology in place. A good resource allocation approach is needed for the sensor nodes to dynamically change their working channel to avoid the overlapping channels which cause interference to the network (either WSN or WLAN) which impacts the service delivery. This paper focuses on the interference when the mobile WSN and WLAN both exist in the same building. The analysis presented is based on the percentage of packets dropped and percentage of packet re-transmitted for each sensor node in the experiments. The outcome of this research will be valuable to research and development of WSN applications in terms of reliable service delivery.

In wireless sensor networks (WSNs) localization systems are required to provide position information of sensor nodes. Position information of sensor nodes with unknown physical positions is acquired with the help of beacons or anchors. Beacon placement is one of the prominent factors that shape the localization performance in sensor networks. Placing more beacons in a network is generally not a cost-effective idea. However, a carefully designed technique can increase the accuracy by placing a limited number of beacons. This paper presents a requirement based beacon placement algorithm to optimize number of beacons to cover the entire WSN. A novel algorithm for routing towards the mobile sink is also proposed, which utilizes the beacon nodes more than sensor nodes to route data towards a mobile sink. This strategy helps to reduce the energy consumption of the WSN and increase the network lifetime. Simulation result shows that the proposed beacon placement scheme is effective in a sensor network with high node density and also evaluates the proposed routing algorithm.

Numerous service parameters are impacted by the high node power in Mobile Wireless Sensor Networks (MWSN). There is a loss of energy due to the fact that the sensor nodes were constructed with a certain quantity of power and must expend some of that power with each data transmission. However, the nodes are able to complete any data transmission through cooperative communication. Although there are a variety of routing strategies that can be applied to mobile wireless sensor networks, cluster-based routing has been shown to have the most effect on meeting performance goals. If a node in a network group wants to communicate with a node that isn't part of the group directly, it uses a gateway to do so. New methods for optimizing bee colonies are utilised to help mobile wireless sensor networks adopt optimal routing. Clustering mobile sink nodes, which collect data from the network's sensor nodes, have been taken into account for wireless sensor networks. The sensor nodes provide their most current status updates and can be found in close proximity to one another. After that, a fuzzy logic-based inter-cluster routing mechanism is created so that cluster participants can send and receive messages.

In this paper we present a data collection scheme using mobile sink in wireless sensor and actor networks (WSAN). In order to improve the performance of WSAN, mobile sink is introduced. The mobile sink is able to move through the monitoring area, collect the sensed data from the sensor nodes in the radio transmission range. Once the data from all sensors are collected, the mobile sink returns to the base station, and unloads the collected data. In our proposed method, Firstly, a number of collection points are selected according to the sensor distribution. Secondly, the optimal path across the points for the mobile sink is performed by using a quantum genetic algorithm. The sink will travel along this path periodically, and collect data at each point. Simulation results show that the scheme has better performance and collects more data.

Sensor nodes located in the vicinity of a static sink drain rapidly their batteries since they have to carry more traffic burden. This situation results in network partition, holes as well as data losses. To mitigate this issue, many research proposed the use of mobile sink in data collection as a potential solution. However, due to its speed, the mobile sink has very short communication time to pick up all data from the sensor nodes within the network, therefore the sink is forced to return back to gather the remaining data. In this paper, we propose a new data collection scheme that aims to decrease the latency and enlarge the staying time between the mobile sink and the meeting points that buffer data originated from the other sensor nodes. We have also handled the case of urgent data so that they can be delivered without any delay. Our proposed scheme is validated via extensive simulations using NS2 simulator. Our approach significantly decreases the latency and prolongs the contact time between the mobile sink and sensor nodes.

Group mobility in wireless sensor network (WSN) is of particular importance in many practical application scenarios. In this paper, the group mobility management in IPv6 over Low power Wireless Personal Area Networks (6LoWPAN) based WSN is considered and the application of network mobility (NEMO) protocol to support group mobility in WSN is discussed. A new network architecture supporting the integration of NEMO and 6LoWPAN-based WSN is proposed, the group mobility management mechanism and the corresponding signaling flow are discussed. Simulation results demonstrate that comparing to MIPv6, the application of NEMO protocol in 6LoWPAN reduces both the handoff latency and the energy consumption of sensor node.