Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleFebruary 2023
Performance analysis of distance-1 distributed algorithms for admission control under the 2-hop interference model
AbstractIf each node in a wireless network has information about only its 1-hop neighborhood, then what are the limits to performance? This problem is considered for wireless networks where each communication link has a minimum bandwidth ...
- research-articleFebruary 2023
Trajectory optimization of laser-charged UAV to minimize the average age of information for wireless rechargeable sensor network
AbstractThis paper considers the laser-charged Unmanned Aerial Vehicle (UAV) assisted Wireless Rechargeable Sensor Network (WRSN), where rechargeable sensors are deployed in surveillance environment to monitor information, a UAV is not only used as ...
- research-articleJanuary 2023
Evacuating from ℓ p unit disks in the wireless model
AbstractThe search-type problem of evacuating 2 robots in the wireless model from the (Euclidean) unit disk was first introduced and studied by Czyzowicz et al. (2014) [13]. Since then, the problem has seen a long list of follow-up results ...
Highlights
- First study of a search type problem with mobile agents in ℓ p metric spaces.
- ...
- research-articleJanuary 2023
Approximation algorithm for MinSum linear barrier coverage with sink-based mobile sensors on the plane
Theoretical Computer Science (TCSC), Volume 941, Issue CPages 121–130https://doi.org/10.1016/j.tcs.2022.10.046AbstractEmerging wireless and mobile applications, such as border intrusion detection with station-based drones, brought a new barrier coverage problem of using sink-based mobile sensors to cover a given line barrier with minimum energy ...
Highlights- The algorithm consumes a runtime O ( k 2 log k r ε ) and produces a solution with at most ε more movement than that of an optimum solution.
- research-articleJanuary 2023
A trusted effective approach for forecasting the failure of data link and intrusion in wireless sensor networks
Theoretical Computer Science (TCSC), Volume 941, Issue CPages 1–13https://doi.org/10.1016/j.tcs.2022.08.004AbstractWireless sensor network (WSN) is often utilised in many different industries for a variety of purposes. The improved network access area and quick network setup make it an excellent technology. However, certain eradicating problems ...
Highlights- It is a promising technology due to its higher range of the network connectivity and the fast set up of the network.
-
- research-articleSeptember 2022
Gaussian downlink user selection subject to access limit, power budget, and rate demands
Theoretical Computer Science (TCSC), Volume 931, Issue CPages 78–92https://doi.org/10.1016/j.tcs.2022.07.032AbstractConsider a Gaussian downlink between an access point with power budget P > 0, and a set of users specified by their effective noises and rate demands. In order to control the decoding complexity and error propagation, an integer-valued ...
Highlights- The Gaussian downlink user selection problem studied in this paper is an NP-hard maximization problem.
- research-articleSeptember 2022
A Secure Energy Aware Meta-Heuristic Routing Protocol (SEAMHR) for sustainable IoT-Wireless Sensor Network (WSN)
Theoretical Computer Science (TCSC), Volume 930, Issue CPages 63–76https://doi.org/10.1016/j.tcs.2022.07.011AbstractWSNs (Wireless Sensor Networks) have attracted interest because of ease of maintenance, scalability, and self-configurations. WSNs encompass many tiny SNs (sensor nodes) or sensors that are capable of participating in IoTs (Internet of ...
Highlights- WSNs (Wireless Sensor Networks) have attracted interest because of ease in maintenance, scalability, and self-configurations.
- research-articleSeptember 2022
An analysis of architecture, framework, security and challenging aspects for data aggregation and routing techniques in IoT WSNs
Theoretical Computer Science (TCSC), Volume 929, Issue CPages 95–113https://doi.org/10.1016/j.tcs.2022.06.032AbstractInternet has evolved into a promising technology after going through various transitional phases in the past decades. It was invented in the early nineties, with the web being static, public and shared. The final transitional phase is ...
Highlights- The transitional phase is the internet of services, where the content, web services, and commerce tools were created.
- research-articleSeptember 2022
Time sensitive sweep coverage with minimum UAVs
Theoretical Computer Science (TCSC), Volume 928, Issue CPages 197–209https://doi.org/10.1016/j.tcs.2022.06.025Highlights- Proposed a new and practical problem named Time Sensitive Sweep Coverage with Minimum UAVs (TSCM).
The sweep coverage of UAVs can provide emergency communication support and conduct disaster surveys in emergency disaster relief. These rescue operations are extremely time sensitive. If the UAVs cannot arrive on time, the best rescue ...
- research-articleSeptember 2022
Efficient scheduling strategy for mobile chargers in task-based wireless sensor networks
Theoretical Computer Science (TCSC), Volume 928, Issue CPages 82–93https://doi.org/10.1016/j.tcs.2022.06.015Highlights- We study the task utility maximization problem by scheduling mobile chargers and prove the NP-hardness of the problem.
Replenishing energy to wireless sensor networks is always a crucial problem as the energy capacity of sensor nodes is very limited. Scheduling mobile chargers to charge sensor nodes has been widely studied due to its efficiency and ...
- research-articleSeptember 2022
Progressive-encoding-based transmission for DNN-enabled edge intelligence in unreliable network
Theoretical Computer Science (TCSC), Volume 928, Issue CPages 71–81https://doi.org/10.1016/j.tcs.2022.06.014AbstractEdge intelligence is getting in the spotlight to enable time-critical applications with the support of next-generation mobile networks. In edge intelligence, real-time image classification and object detection services powered by deep ...
Highlights- Digging inner connection between image compression and DNN.
- Proposing a ...
- research-articleJune 2022
Self-stabilizing spanner topology control solutions in wireless ad hoc networks
Theoretical Computer Science (TCSC), Volume 922, Issue CPages 395–409https://doi.org/10.1016/j.tcs.2022.04.041Highlights- We study the Self-stabilizing dIrected t-Spanner for Autonomous nodes problem (SISA) in both 2D and 3D space.
Large-scale, self-organizing wireless ad hoc network deployments are being driven by recent developments of the Internet of Things (IoT) to collect information from a vast area or harsh environment efficiently. How to ensure fast ...
- research-articleJune 2022
Energy efficiency optimization for multiple chargers in Wireless Rechargeable Sensor Networks
Theoretical Computer Science (TCSC), Volume 922, Issue CPages 193–205https://doi.org/10.1016/j.tcs.2022.04.024AbstractTo guarantee the continuous coverage of the rechargeable sensors, Wireless Rechargeable Sensor Networks (WRSNs) has emerged with the advantages of high charging efficiency and reliable charging timeliness. Charging planning is an ...
Highlights- We propose a multiple-charger charging planning problem for WRSNs to maximize the charging energy efficiency of the charging process.
- research-articleJune 2022
Survivability development of wireless sensor networks using neuro fuzzy-clonal selection optimization
Theoretical Computer Science (TCSC), Volume 922, Issue CPages 25–36https://doi.org/10.1016/j.tcs.2022.04.008Highlights- Improve the WSN has the ability to function as network host for transmission and reception of data.
Wireless Sensor Networks (WSN) are a kind of wireless network, transmitting data utilizing the multi-hop radio relaying technique, and with no fixed infrastructure. WSN has the ability to function as network host for transmission and ...
- research-articleJanuary 2022
Information dissemination in wireless ad-hoc networks under the weighted-TIM framework
Theoretical Computer Science (TCSC), Volume 901, Issue CPages 19–34https://doi.org/10.1016/j.tcs.2021.11.022AbstractWe study communication from layer to layer of a network modeling it as a bipartite graph of transmitters and receivers. We seek to minimize the time needed for all receivers to get a message held by all transmitters. We study this ...
- research-articleOctober 2021
Minimizing total interference in asymmetric sensor networks
Theoretical Computer Science (TCSC), Volume 889, Issue CPages 171–181https://doi.org/10.1016/j.tcs.2021.08.003AbstractThe problem of computing a connected network with minimum interference is a fundamental problem in wireless sensor networks. Several models of interference have been studied in the literature. The most common one is the receiver-...
- research-articleApril 2020
Token traversal in ad hoc wireless networks via implicit carrier sensing
Theoretical Computer Science (TCSC), Volume 811, Issue CPages 3–20https://doi.org/10.1016/j.tcs.2019.09.016AbstractCommunication problems in ad hoc wireless networks have been already widely studied under the SINR model, but a vast majority of results concern networks with constraints on connectivity, so called strongly-connected networks. In such ...
- research-articleJanuary 2020
Range assignment of base-stations maximizing coverage area without interference
Theoretical Computer Science (TCSC), Volume 804, Issue CPages 81–97https://doi.org/10.1016/j.tcs.2019.10.044AbstractWe study the problem of assigning non-overlapping geometric objects centered at a given set of points such that the sum of area covered by them is maximized. The problem remains open since 2002, as mentioned in a lecture slide of David Eppstein. ...
- research-articleJune 2019
DOAMI: A distributed on-line algorithm to minimize interference for routing in wireless sensor networks
Theoretical Computer Science (TCSC), Volume 774, Issue CPages 1–13https://doi.org/10.1016/j.tcs.2016.05.043AbstractThis paper investigates the Minimizing-Interference-for-Multiple-Paths (MIMP) problem for routing with minimum interference in wireless sensor networks, which is defined as: Given k routing requests { s 1 , t 1 } , … , { s k , t k }, ...
- research-articleSeptember 2017
Adaptive packet scheduling over a wireless channel under constrained jamming
Theoretical Computer Science (TCSC), Volume 692, Issue CPages 72–89https://doi.org/10.1016/j.tcs.2017.06.020In this work we consider the communication over a wireless link, between a sender and a receiver, being disrupted by a jammer. The objective of the sender is to transmit as much data as possible to the receiver in the most efficient way. The data is ...