Abstract: A wireless sensor network (WSN) includes a sensor node cluster having a plurality of sensor nodes positioned along a section of a pipeline; a base station; a designated cluster head for the sensor node cluster, the designated cluster head configured to forward sensor data packets towards the base station; and a server having circuitry. The circuitry is configured to determine when the designated cluster head has a battery energy level below a predetermined level, elect a replacement cluster head for the designated cluster head when the battery energy level is below the predetermined level, and forward an energy status of the designated cluster head to the replacement cluster head.

Abstract: A wireless sensor network (WSN) includes a sensor node cluster having a plurality of sensor nodes positioned along a section of a pipeline; a base station; a designated cluster head for the sensor node cluster, the designated cluster head configured to forward sensor data packets towards the base station; and a server having circuitry. The circuitry is configured to determine when the designated cluster head has a battery energy level below a predetermined level, elect a replacement cluster head for the designated cluster head when the battery energy level is below the predetermined level, and forward an energy status of the designated cluster head to the replacement cluster head.

Abstract: The present disclosure relates to a clustering approach for sensor nodes of a wireless sensor network. This clustering approach, equal distance different members, balances the power burden amongst sensor nodes by deriving an optimal number of sensor nodes at each segment of a length. To this end, the present disclosure describes a linear wireless sensor network wherein the distance between adjacent cluster heads is equal while the number of and distance between sensor nodes in each cluster is different. A power consumption model is derived to aid in the determination of the optimal number of sensor nodes within each cluster. Following evaluation of the cluster approach in comparison with previously described approaches, the present disclosure is observed to improve network longevity and reduce power consumption by deliberately increasing the density of sensor nodes nearest a base station.

Abstract: The present disclosure relates to a clustering approach for sensor nodes of a wireless sensor network. This clustering approach, equal distance different members, balances the power burden amongst sensor nodes by deriving an optimal number of sensor nodes at each segment of a length. To this end, the present disclosure describes a linear wireless sensor network wherein the distance between adjacent cluster heads is equal while the number of and distance between sensor nodes in each cluster is different. A power consumption model is derived to aid in the determination of the optimal number of sensor nodes within each cluster. Following evaluation of the cluster approach in comparison with previously described approaches, the present disclosure is observed to improve network longevity and reduce power consumption by deliberately increasing the density of sensor nodes nearest a base station.

Abstract: A dynamic multi-objective task allocation system within robotic networks that assigns tasks in real-time as they are detected, the system including a sensing device that detects a trigger event, the trigger event being associated with a task to be performed, and transmits a broadcast signal to a designated robotic network, the robotic network including one or more robots, the broadcast signal including information associated with the task to be performed, the trigger event, the task to be performed, and a location where the task is to be performed; and a distribution robot that receives broadcast signal from the sensing device, assigns itself a self-score associated with performing the task, transmits, to one or more receiving robots within the robotic network, a request for submission of an assessment score of each one of the one or more robots, and determines which robot is assigned to perform the task.

Abstract: Aspects of the disclosure provide a method for selecting a relay node at a first node for transmitting a packet from the first node to a destination node in a wireless sensor network that includes a plurality of nodes. The method can include establishing a transmission angle within which the relay node is preferentially selected, wherein a bounding box surrounding the destination node is between a first side and a second side of the transmission angle, and selecting a second node having a highest remaining energy level among energy levels of neighbor nodes of the first node within the transmission angle to be the relay node. In one example, the candidate nodes for selecting the second node have a remaining energy level above a threshold.

Abstract: A Two-hop Cooperative Virtual Force Robot Deployment (Two-hop COVER) technique is described. An improved Virtual force VF approach considers the mission requirements such as the number of required robots in each locality. The Two-hop COVER expedites the deployment process by establishing a cooperative relation between robots and neighboring landmarks. Two-hop cooperation is utilized as well to reduce the time and distance needed to satisfy mission requirements. In order to reduce randomness and guide remaining robots throughout the area till they find an unsatisfied landmark, each robot utilizes its history to visit only the locations that it has not visited before. Moreover, each robot will communicate with its neighboring robots and landmarks to use their current positions and history to guide its movements.

Abstract: A dynamic multi-objective task allocation system within robotic networks that assigns tasks in real-time as they are detected, the system including a sensing device that detects a trigger event, the trigger event being associated with a task to be performed, and transmits a broadcast signal to a designated robotic network, the robotic network including one or more robots, the broadcast signal including information associated with the task to be performed, the trigger event, the task to be performed, and a location where the task is to be performed; and a distribution robot that receives broadcast signal from the sensing device, assigns itself a self-score associated with performing the task, transmits, to one or more receiving robots within the robotic network, a request for submission of an assessment score of each one of the one or more robots, and determines which robot is assigned to perform the task.

Abstract: A dynamic multi-objective task allocation system within robotic networks that assigns tasks in real-time as they are detected, the system including a sensing device that detects a trigger event, the trigger event being associated with a task to be performed, and transmits a broadcast signal to a designated robotic network, the robotic network including one or more robots, the broadcast signal including information associated with the task to be performed, the trigger event, the task to be performed, and a location where the task is to be performed; and a distribution robot that receives broadcast signal from the sensing device, assigns itself a self-score associated with performing the task, transmits, to one or more receiving robots within the robotic network, a request for submission of an assessment score of each one of the one or more robots, and determines which robot is assigned to perform the task.

Abstract: A dynamic multi-objective task allocation system within robotic networks that assigns tasks in real-time as they are detected, the system including a sensing device that detects a trigger event, the trigger event being associated with a task to be performed, and transmits a broadcast signal to a designated robotic network, the robotic network including one or more robots, the broadcast signal including information associated with the task to be performed, the trigger event, the task to be performed, and a location where the task is to be performed; and a distribution robot that receives broadcast signal from the sensing device, assigns itself a self-score associated with performing the task, transmits, to one or more receiving robots within the robotic network, a request for submission of an assessment score of each one of the one or more robots, and determines which robot is assigned to perform the task.

Abstract: Method and system for controlling a vehicle that includes using velocity vectors of obstacles in the vehicle's environment to determining boundaries of the one or more obstacles and thereby generate a velocity space that may include velocity vectors for the vehicle and which are represented as collision cones. The using an identified velocity vector in combination with the velocity vectors of the one or more obstacles to produce a maximum motion in of the vehicle towards a target location while avoiding all determined collision cones.

Abstract: A Wireless Sensor Network for providing Base Station anonymity is described. The network comprises sensor nodes, cluster heads, fake base stations and a base station arranged in a grid configuration. The location of the base station is obscured by managing the traffic in the network by a coverage-aware technique. The coverage aware technique achieves Base Station anonymity by using data aggregation and fake packet injection without affecting coverage of the sensor nodes.

Abstract: The present disclosure relates to a clustering approach for sensor nodes of a wireless sensor network. This clustering approach, equal distance different members, balances the power burden amongst sensor nodes by deriving an optimal number of sensor nodes at each segment of a length. To this end, the present disclosure describes a linear wireless sensor network wherein the distance between adjacent cluster heads is equal while the number of and distance between sensor nodes in each cluster is different. A power consumption model is derived to aid in the determination of the optimal number of sensor nodes within each cluster. Following evaluation of the cluster approach in comparison with previously described approaches, the present disclosure is observed to improve network longevity and reduce power consumption by deliberately increasing the density of sensor nodes nearest a base station.

Abstract: The present disclosure relates to a clustering approach for sensor nodes of a wireless sensor network. This clustering approach, equal distance different members, balances the power burden amongst sensor nodes by deriving an optimal number of sensor nodes at each segment of a length. To this end, the present disclosure describes a linear wireless sensor network wherein the distance between adjacent cluster heads is equal while the number of and distance between sensor nodes in each cluster is different. A power consumption model is derived to aid in the determination of the optimal number of sensor nodes within each cluster. Following evaluation of the cluster approach in comparison with previously described approaches, the present disclosure is observed to improve network longevity and reduce power consumption by deliberately increasing the density of sensor nodes nearest a base station.

Abstract: A dynamic multi-objective task allocation system within robotic networks that assigns tasks in real-time as they are detected, the system including a sensing device that detects a trigger event, the trigger event being associated with a task to be performed, and transmits a broadcast signal to a designated robotic network, the robotic network including one or more robots, the broadcast signal including information associated with the task to be performed, the trigger event, the task to be performed, and a location where the task is to be performed; and a distribution robot that receives broadcast signal from the sensing device, assigns itself a self-score associated with performing the task, transmits, to one or more receiving robots within the robotic network, a request for submission of an assessment score of each one of the one or more robots, and determines which robot is assigned to perform the task.

Abstract: A system and method of determining a data collection routing protocol include the steps of perceiving a broadcast beacon message from an i-th sensor node located at an i-th sensor level by one or MOW sensor nodes at one or more other sensor levels of a divided WSN, wherein the i-th sensor level does not include a first sensor level of a sink sensor node; resetting the respective sensor level of the one or more sensor nodes to an (i+1)th sensor level; attempting to connect the i-th sensor node at the i-th sensor level to another sensor node located at an (i?1)th sensor level; and connecting the i-th sensor node to a parent sensor node at the i-th sensor level when certain conditions are met. These conditions are determined and analyzed locally at each sensor node.

Abstract: A system and method of determining a data collection routing protocol include the steps of perceiving a broadcast beacon message from an i-th sensor node located at an i-th sensor level by one or more sensor nodes at one or more other sensor levels of a divided WSN, wherein the i-th sensor level does not include a first sensor level of a sink sensor node; resetting the respective sensor level of the one or more sensor nodes to an (i+1)th sensor level; attempting to connect the i-th sensor node at the i-th sensor level to another sensor node located at an (i?1)th sensor level; and connecting the i-th sensor node to a parent sensor node at the i-th sensor level when certain conditions are met. These conditions are determined and analyzed locally at each sensor node.

Abstract: The present disclosure relates to a clustering approach for sensor nodes of a wireless sensor network. This clustering approach, equal distance different members, balances the power burden amongst sensor nodes by deriving an optimal number of sensor nodes at each segment of a length. To this end, the present disclosure describes a linear wireless sensor network wherein the distance between adjacent cluster heads is equal while the number of and distance between sensor nodes in each cluster is different. A power consumption model is derived to aid in the determination of the optimal number of sensor nodes within each cluster. Following evaluation of the cluster approach in comparison with previously described approaches, the present disclosure is observed to improve network longevity and reduce power consumption by deliberately increasing the density of sensor nodes nearest a base station.

Abstract: The present disclosure relates to a clustering approach for sensor nodes of a wireless sensor network. This clustering approach, equal distance different members, balances the power burden amongst sensor nodes by deriving an optimal number of sensor nodes at each segment of a length. To this end, the present disclosure describes a linear wireless sensor network wherein the distance between adjacent cluster heads is equal while the number of and distance between sensor nodes in each cluster is different. A power consumption model is derived to aid in the determination of the optimal number of sensor nodes within each cluster. Following evaluation of the cluster approach in comparison with previously described approaches, the present disclosure is observed to improve network longevity and reduce power consumption by deliberately increasing the density of sensor nodes nearest a base station.

Abstract: A method for evaluating performance of a sensor network. The method includes selecting, a sensor distribution pattern for a geographical region and determining a location for a base station. A plurality of sensor clusters are generated, each sensor cluster being formed by one of a first and second grouping mechanism. Further, the method allocates, for each sensor a time-slot within a time-frame to transmit a data packet from the sensor to the base station, and evaluates the performance of the first grouping mechanism and the second grouping mechanism for the selected sensor distribution pattern and base station location, by computing at least a ratio of delivered data packets to the base station to a total energy consumption, and a first delay and a second delay incurred by each data packet.