3,250 results
Search Results
2. CALL FOR PAPERS: Intelligent Healthcare Systems - FREE OF CHARGES
- Author
-
Vania V. Estrela, Nikolaos Andreopoulos, Ricardo Tadeu Lopes, Joaquim Teixeira de Assis, Andrey Terziev, Robert Sroufer, Vania Vieira Estrela, V. V. Estrela, Albany E. Herrmann, Edwiges G. H. Grata, Maria Aparecida de Jesus, and Monica Vianna
- Subjects
Health informatics ,IoT ,Ad hoc networks ,Public health ,Sensors ,Wearables ,Healthcare ,Smart drugs ,Health 4.0 ,Cyber-physical system ,Telemedicine ,Blockchain ,Artificial Intelligence ,AI ,Cloud computing ,Fog computing ,Implants ,ICT for Healthcare ,Wireless networks ,Biomedical engineering ,Actuators - Abstract
CALL FOR BOOK CHAPTERS INTELLIGENT HEALTHCARE SYSTEMS Scopus-indexed, Free of charges, published by CRC Press/Taylor & Francis Keywords: Health 4.0, Internet of Medical Things, Public Health, Disaster Mitigation, Vehicular Communications, Wireless Networks, Wearables, Artificial Intelligence in Healthcare, Cyber-Physical Systems, Smart Designs, Blockchain, Digital Twins, Telemedicine, 5G, Medical Imaging, Cloud Computing. Editor: Vania V. Estrela vania.estrela.phd@ieee.org Federal Fluminense University, RJ, Brazil Book Content Description Information is paramount to the healthcare sector, entailing intense data, medical epidemiologic sets, Internet browsing records, surveys, complex engineering models, and so on via the Cloud. This quest for knowledge prompts the data dimensionality, which calls for more sophisticated and efficient information strategies. Health science and biology are very complex fields fully embedded in information technology, but the associated processes are much too intricate to be faithfully modeled. It is not easy to extract knowledge starting from raw data, and it is also expensive. Artificial intelligence (AI) in healthcare (AIH) has been the primary concern to develop expert systems aimed for diagnostic and decision-making in knowledge acquisition, representation, reasoning, and explanation. Many healthcare facilities (HFs) have data acquisition, monitoring, and storage systems integrated into larger-scale information systems. This vast amount of information and databases stemming from medical applications cause hinder analysis and decision making. Hence, there is a need to develop better tools for accessing/storing/analyzing knowledge while effectively using multimodal data. These necessities become essential in the healthcare realm as decision-making relies on knowledge from multidisciplinary areas. This book intends to provide computational methods for intelligent health data analysis to narrow the gap between data gathering and data comprehension with applications in medicine, health care, biology, pharmacology, and related areas. Intelligent Data Analysis (IDA) expedites healthcare analyses and applications. IDA employs specialized statistical, pattern recognition, machine learning (ML), data abstraction, and visualization tools for analysis of data and discovery of mechanisms that created them. Healthcare data typically involve many records/variables, subtle interactions between entities, or a combination of all factors. Engineering, computing science, and ML empower data analysis tasks. The IDA extracts knowledge from too much data, with a vast amount of variables, data that represents very complex, nonlinear, real-life problems. IDA can help raw data analysis, coping with prediction tasks without knowing the theoretical description of the underlying process, classification tasks of new events, or modeling unknown processes. Classification, prediction, and modeling are the cornerstones brought in by IDA. This book focuses on AIH methods and tools to bridge data gathering and data comprehension. Emphasis will also be given to problem solving within HFs to handle patient records, data warehousing, intelligent alarming, competent monitoring, etc. In medicine, overcoming this gap is particularly crucial since medical decision-making needs comprehension of healthcare data regularities and trends. This book tackles different IDA approaches. Submission Schedule One-page abstract submission: May 20, 2021 Structured Abstract Template in Word Manuscript submission due: May 31, 2021 Manuscript Template in Word Manuscript Template in pdf Review notification with acceptance/rejection: June 30, 2021 Revised paper submission: July 31, 2021 Camera-Ready Submission: August 31, 2021  
- Published
- 2022
- Full Text
- View/download PDF
3. Machine Learning for Networking: first international conference, MLN 2018, Paris, France, November 27-29, 2018, revised selected papers
- Author
-
Paul Muhlethaler, Selma Boumerdassi, Eric Renault, Réseaux, Systèmes, Services, Sécurité (R3S-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Département Réseaux et Services Multimédia Mobiles (RS2M), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Centre National de la Recherche Scientifique (CNRS), Wireless Networking for Evolving & Adaptive Applications (EVA), Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), CEDRIC. Réseaux et Objets Connectés (CEDRIC - ROC), Centre d'études et de recherche en informatique et communications (CEDRIC), Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise (ENSIIE)-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise (ENSIIE)-Conservatoire National des Arts et Métiers [CNAM] (CNAM), Département Réseaux et Services Multimédia Mobiles (TSP - RS2M), Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise (ENSIIE)-Conservatoire National des Arts et Métiers [CNAM] (CNAM), HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise (ENSIIE)-Conservatoire National des Arts et Métiers [CNAM] (CNAM), and HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)
- Subjects
User interfaces ,Sensor networks ,Ad hoc networks ,Artificial intelligence ,Human-Computer Interaction (HCI) ,Computer science ,02 engineering and technology ,Learning algorithms ,Machine learning ,computer.software_genre ,[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI] ,Bandwidth ,0203 mechanical engineering ,0202 electrical engineering, electronic engineering, information engineering ,Reinforcement learning ,Wireless telecommunication systems ,[INFO]Computer Science [cs] ,Data security ,Wireless networks ,Computer networks ,Internet ,Artificial neural network ,Routers ,business.industry ,Sensors ,Telecommunication networks ,020206 networking & telecommunications ,020302 automobile design & engineering ,Wireless sensor networks ,Telecommunication traffic ,Mobile telecommunication systems ,business ,computer ,Wireless sensor network ,Neural networks - Abstract
International audience; This book constitutes the thoroughly refereed proceedings of the First International Conference on Machine Learning for Networking, MLN 2018, held in Paris, France, in November 2018. The 22 revised full papers included in the volume were carefully reviewed and selected from 48 submissions. They present new trends in the following topics: Deep and reinforcement learning; Pattern recognition and classification for networks; Machine learning for network slicing optimization, 5G system, user behavior prediction, multimedia, IoT, security and protection; Optimization and new innovative machine learning methods; Performance analysis of machine learning algorithms; Experimental evaluations of machine learning; Data mining in heterogeneous networks; Distributed and decentralized machine learning algorithms; Intelligent cloud-support communications, resource allocation, energy-aware/green communications, software defined networks, cooperative networks, positioning and navigation systems, wireless communications, wireless sensor networks, underwater sensor networks.
- Published
- 2019
4. Clustered DTN routing based on sensing node relationship strength.
- Author
-
Chen, Hongsheng and Wu, Chunhui
- Subjects
DELAY-tolerant networks ,AD hoc computer networks ,INTERSTELLAR communication ,TELECOMMUNICATION systems ,NETWORK performance ,WIRELESS sensor networks - Abstract
Delay tolerant networks (DTNs) is a network evolved from mobile networks. Differing from the traditional network, which has a stable end‐to‐end transmission path, DTNs are sparse and intermittently connected mobile ad hoc network, which are widely used in harsh environments, such as battlefields, seabed, space communication networks, and so on. In DTNs, intermittent connectivity, partitioned network, long delays and node mobility characteristics make the network fail to communicate frequently, therefore, how to successfully forward the message is of extreme importance. Up to now, almost all the traditional models in DTNs use the store‐carry‐forward method. This paper proposes a novel clustered DTN routing model based on sensing node relationship strength. The routing mechanism takes advantage of the number of other nodes encountered by the nodes in the process of movement and the changes in the number of nodes to calculate the strength of the relationship between nodes, and clusters DTN routing according to the strength of the relationship between nodes. Moreover, the relationship between nodes in a cluster and other clusters is used to transmit messages between clusters, and messages are transmitted within clusters according to the strength of the relationship between nodes. Simulation results show that the routing mechanism not only increases the success rate of message transmission, but also reduces the transmission delay of messages and improves network performance. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
5. Distributed MA‐IDDPG‐OLSR based stable routing protocol for unmanned aerial vehicle ad‐hoc network.
- Author
-
Zeng, Youjun, Zhou, Jie, Liu, Youjiang, Cao, Tao, Yang, Dalong, Liu, Yu, and Shi, Xianhua
- Subjects
NETWORK routing protocols ,DEEP learning ,END-to-end delay ,REINFORCEMENT learning ,WIRELESS mesh networks - Abstract
In unmanned aerial vehicle ad‐hoc network (UANET), the node speed of unmanned aerial vehicles (UAVs) may reach up to 400 km/h. The fast or slow movement of UAV nodes leads to different speeds of topology change of the nodes. Traditional optimized link state routing (OLSR) protocol cannot adaptively adjust the routing update period when the network topology changes, which may lead to the nodes calculating incorrect routing tables. This increases the average end‐to‐end delay and packet loss rate for packet transmission. To enhance the adaptability of OLSR routing protocol to network topology changes, this paper proposes a multi‐agent independent deep deterministic policy gradient‐OLSR (MA‐IDDPG‐OLSR) routing protocol based on distributed multi‐agent reinforcement learning. The protocol deploys DDPG algorithm on each UAV node, and each UAV node adaptively adjusts the Hello and TC message sending intervals, according to the one‐hop neighbouring nodes as well as its own state. Simulation results show that the proposed protocol is able to improve the throughput and reduce the packet loss rate as compared to traditional AODV, GRP, OLSR, and distributed multiple‐agent independent proximal policy optimization‐OLSR (MA‐IPPO‐OLSR), distributed multiple‐agent independent twin delayed deep deterministic policy gradient‐OLSR (MA‐ITD3‐OLSR) routing protocols. Since MA‐IDDPG‐OLSR relies only on local information, there is a minor performance degradation in MA‐IDDPG‐OLSR compared to centralized single‐agent DQN‐OLSR routing protocol. But it is more suitable to a completely distributed UAV network without a centralized node. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
6. When network coding and dirty paper coding meet in a cooperative ad hoc network.
- Author
-
Fawaz, N., Gesbert, D., and Debbah, M.
- Abstract
We develop and analyze new cooperative strategies for ad hoc networks that are more spectrally efficient than classical decode & forward (DF) protocols. Using analog network coding, our strategies preserve the practical half-duplex assumption but relax the orthogonality constraint. The introduction of interference due to non-orthogonality is mitigated thanks to precoding, in particular dirty paper coding. Combined with smart power allocation, our cooperation strategies allow to save time and lead to a more efficient use of the bandwidth and to improved network throughput with respect to classical repetition-DF and parallel-DF. [ABSTRACT FROM PUBLISHER]
- Published
- 2008
- Full Text
- View/download PDF
7. Bluetooth 5 performance analysis for inter-vehicular communications
- Author
-
David Melendi, Andrea Aza, Laura Pozueco, Roberto García, Victor Corcoba, and Xabiel G. Pañeda
- Subjects
Flexibility (engineering) ,Original Paper ,Ad hoc networks ,Vehicular ad hoc network ,Computer Networks and Communications ,business.industry ,Computer science ,Wireless ad hoc network ,ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS ,Communications performance ,Internet of Things ,Throughput ,Field (computer science) ,Bluetooth 5 ,law.invention ,Bluetooth ,Connectionless communication ,Set (abstract data type) ,law ,Electrical and Electronic Engineering ,business ,Vehicular networks ,Information Systems ,Computer network - Abstract
Previous work has demonstrated the feasibility of Bluetooth Low Energy (BLE) as an alternative technology for data transfers in inter-vehicular communication (IVC) scenarios. Bluetooth 5.x core specifications enhance the trade-off between energy requirements, communication range and flexibility. In this paper, we aim to analyse the potential of Bluetooth 5 features for VANET applications, proposing a connectionless communication system. By means of field experiments, we evaluate long range and 2 × speed features, defining a set of communication scenarios. This allows us to test both Bluetooth 5.x range and application throughput. The evaluation includes experiments of V2I communications carried out under real highway traffic conditions. The experiments conducted demonstrate that communication ranges up to 300 m may be achieved depending on the communications scenario. The results also show how throughput degrades as the distance between devices increases. The results obtained are used to discuss future work, aimed at deeper analysing Bluetooth 5 features for VANET applications, completing the development of our prototype and evaluating VANET connectionless communications with the features included in the latest Bluetooth 5.2 specification.
- Published
- 2022
8. Robust position-based routing in wireless ad hoc networks with irregular transmission ranges<FNR></FNR><FN>A preliminary version of this paper appeared in the proceedings of the 5th Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM), July 2001. </FN>
- Author
-
Barrièe, Lali, Fraigniaud, Pierre, Narayanan, Lata, and Opatrny, Jaroslav
- Subjects
WIRELESS communications ,DATA transmission systems ,COMPUTER network protocols ,BANDWIDTHS ,TELECOMMUNICATION systems - Abstract
Several papers considered the problem of routing in ad hoc wireless networks using the positions of the mobile hosts. Perimeter routing
1 2 gives an algorithm that guarantees delivery of messages in such networks without the use of flooding of control packets. However, this protocol is likely to fail if the transmission ranges of the mobile hosts vary because of natural or man-made obstacles. It may fail because either some connections are not considered, which effectively results in a disconnection of the network, or because some crossing connections are used, which could misdirect the message. In this paper, we describe a robust routing protocol, a variant of perimeter routing, which tolerates up to 40% of variation in the transmission ranges of the mobile hosts. More precisely, our protocol guarantees message delivery in a connected ad hoc wireless network without the use of message flooding whenever the ratio of the maximum transmission range to the minimum transmission range is at most √2. Copyright © 2003 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]- Published
- 2003
- Full Text
- View/download PDF
9. Label Routing Protocol: A New Cross‐Layer Protocol for Multi‐Hop Ad Hoc Wireless Networks
- Author
-
Wang, Yu and Wu, Jie
- Published
- 2007
- Full Text
- View/download PDF
10. Queries allocation in WSNs with fuzzy control system.
- Author
-
Abbassi, Kamel and Ezzedine, Tahar
- Subjects
WIRELESS sensor networks ,SENSOR networks ,FUZZY logic ,DATABASES ,MARKOV processes - Abstract
Processing queries in wireless sensor networks causes quality of service challenges such as data latency and validity. In fact, this paper is going to shed light on identifying the right trade‐off between latency and the freshness of the data. For this purpose, a fuzzy logic‐based decision‐making system that assigns incoming queries either to the sensor network, where the queries are waiting to be processed into a queue, or a central database which provides stored and potentially stale data or to a cache server which in turn provides acceptable latency and recent data, is provided. Thus, a new rule‐based system decision is introduced, that minimizes the request latency and returns the most recent data. In addition, a comparison between the approach and other work that is restricted to the database server and sensor network with no focus on the caching server is provided. This paper is going to carry on with the theory of Markov Chain which is more complicated compared to the fuzzy logic system. This approach is confirmed in the basis of an experience is developed with python. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
11. Hybrid defense mechanism against malicious packet dropping attack for MANET using game theory.
- Author
-
Vijayalakshmi, S., Bose, S., Logeswari, G., and Anitha, T.
- Subjects
GAME theory ,MULTICASTING (Computer networks) ,AD hoc computer networks ,WIRELESS communications - Abstract
Ad hoc networks are a new perspective of wireless communication for versatile hosts. Security is a colossal worry for ad hoc networks, especially for those security-touchy applications. The huge highlights of ad hoc networks cause both difficulties and openings in accomplishing security objectives. One such aim is to consider the assaults from within the system by compromised nodes correspondingly as to consider harmful assaults propelled from outside the system. Designing an Intrusion Detection System (IDS) that suits the security needs and characteristics of ad hoc networks for viable and proficient performance against intrusions is one potential solution to vanquish vulnerabilities. This paper examines a genuine and hurtful attack called, "Malicious Packet Dropping Attack" in the network layer. To secure against this attack, a novel methodology utilizing game theory is proposed. The proposed system monitors the conduct of the neighbor nodes and conquers the demerits such as false positives present in traditional IDS, thereby providing secure correspondence between nodes that communicate with one another to course the traffic from source to destination. With the existence of malicious nodes, the proposed system has accomplished a 42% increase in the packet delivery ratio. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
12. Scalable Deep Reinforcement Learning for Routing and Spectrum Access in Physical Layer.
- Author
-
Cui, Wei and Yu, Wei
- Subjects
AD hoc computer networks ,REINFORCEMENT learning ,DEEP learning ,MONTE Carlo method ,SPECTRUM allocation - Abstract
This paper proposes a novel scalable reinforcement learning approach for simultaneous routing and spectrum access in wireless ad-hoc networks. In most previous works on reinforcement learning for network optimization, the network topology is assumed to be fixed, and a different agent is trained for each transmission node—this limits scalability and generalizability. Further, routing and spectrum access are typically treated as separate tasks. Moreover, the optimization objective is usually a cumulative metric along the route, e.g., number of hops or delay. In this paper, we account for the physical-layer signal-to-interference-plus-noise ratio (SINR) in a wireless network and further show that bottleneck objective such as the minimum SINR along the route can also be optimized effectively using reinforcement learning. Specifically, we propose a scalable approach in which a single agent is associated with each flow and makes routing and spectrum access decisions as it moves along the frontier nodes. The agent is trained according to the physical-layer characteristics of the environment using a novel rewarding scheme based on the Monte Carlo estimation of the future bottleneck SINR. It learns to avoid interference by intelligently making joint routing and spectrum allocation decisions based on the geographical location information of the neighbouring nodes. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
13. An improved AODV routing algorithm based on energy consumption for Ad Hoc networks.
- Author
-
Cai, Zengyu, Chen, Xi, Wang, Zhikun, and Zhang, Jianwei
- Subjects
ENERGY consumption ,AD hoc computer networks ,ROUTING algorithms ,NETWORK performance ,PROBLEM solving - Abstract
The Ad Hoc networks solves the problem of quickly establishing a temporary Ad Hoc network without the need for fixed facilities. However, problems such as network performance degradation, delay increase, and link interruption are endless. Aiming at the problem of shortening the survival time of Ad Hoc networks nodes, this paper proposes an improved AODV routing algorithm EC-MAODV (Energy Consumption-Modification AODV) based on energy consumption. EC-MAODV takes energy as the starting point, determines the time extension based on the residual energy of the current node, balance the power consumption of each node, and extends the networks lifetime. The effectiveness of EC-MAODV routing algorithm is proved by network simulator NS-3. The simulation results show that compared with the AODV routing protocol, the algorithm in this paper has more than 7% improvement and 19% increase in average delay and node lifetime. It can effectively prolong the life of the network, reduce the number of dead nodes, effectively solve the energy consumption problem of the wireless Ad Hoc network, and improve the overall performance of the network. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
14. Mobile RFID System in the Presence of Denial-of-Service Attacking Signals.
- Author
-
Sarker, Jahangir H. and Nahhas, Ahmed M.
- Subjects
RADIO frequency identification systems ,DENIAL of service attacks ,SIGNAL processing ,MOBILE communication systems ,RADIO interference - Abstract
In a mobile radio-frequency identification (RFID) system, tagged items enter and leave the reader’s field at a constant speed. The possibility of tags leaving the reader’s interrogation zone without being identified is known as tag loss. Minimizing the tag loss ratio in the presence of random denial-of-service (DoS) attacking signals by optimizing the number of frames is investigated in this paper. The results show that the number of frame control is not needed to reduce the tag loss ratio if the tag entering rate is below a critical limit. The number of frames has to abruptly reduce to keep the tag loss ratio lower if the tag entering rate exceeds that critical limit. This critical limit of the tag entering rate is derived analytically. An analytical solution of the optimum number of frames in the presence of attacking signals that also minimize the tag loss ratio is devised. The technique for setting the optimum number of frames is also presented. The presented results in this paper with random DoS attacking signals is so general that those can be converted without DoS attacking signals by setting the DoS attacking signals equal to zero. The results of this paper can be used for mobile RFID system design with and without DoS attacking signals. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
15. Supporting conflict-free replicated data types in opportunistic networks.
- Author
-
Guidec, Frédéric, Mahéo, Yves, and Noûs, Camille
- Subjects
INFORMATION dissemination ,SYNCHRONIZATION - Abstract
Conflict-Free Replicated Data Types (CRDTs) are data types that can be used in distributed systems when optimistic replication is tolerable. Replicas can be updated locally, without coordination, and consistency is obtained eventually by asynchronously propagating updates among replicas. Because CRDTs can tolerate asynchronous transmissions, they can serve as software elements in opportunistic networks (OppNets), where the dissemination of information is dependent on unplanned transient radio contacts between mobile nodes. In this paper we investigate the problem of implementing operation-based, state-based, and delta-state-based CRDTs in OppNets. A contact-driven synchronization algorithm is proposed for each kind of CRDT, and experiments based on realistic tracesets are conducted in order to compare how these algorithms can perform in an OppNet. Experimental results show that delta-state-based CRDTs globally outperforms operation-based and pure state-based CRDTs, especially when considering the number of messages required to ensure the synchronization of replicas. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
16. Adaptive Multi-Path Routing Protocol in Autonomous Vehicular Networks.
- Author
-
Yoo, Joon
- Subjects
MULTICASTING (Computer networks) ,AD hoc computer networks ,DATA packeting ,VEHICULAR ad hoc networks ,SEARCH algorithms ,WIRELESS communications - Abstract
Vehicular ad hoc networks consist of self-organizing nodes using multi-hop wireless links for communication without any infrastructure support. Traditionally, ad hoc routing protocols use the minimum hop count for their routing metric since a smaller number of transmissions is typically equivalent to a higher throughput, lower delay, and minimal power consumption. However, with the muti-rate capability of emerging radio interfaces, e.g., 802.11ax/be standards, the min-hop metric no longer results in high throughput. For instance, if the higher data rate links are selected for the route, it could result in a higher throughput even if the route takes more hop counts. In this paper, we propose a high throughput routing scheme, called MARV, which makes two key contributions. MARV searches for high throughput paths using an on-demand route searching algorithm so that the routing overhead is smaller compared to other multi-rate-aware routing schemes. MARV also searches for multiple paths to maintain both min-hop and high-throughput paths to select the adequate path depending on the data packet size. We conduct simulations to demonstrate that MARV outperforms not only min-hop path metrics but also previously proposed high-throughput metrics. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
17. Ergodic Rate of Millimeter Wave Ad Hoc Networks.
- Author
-
Thornburg, Andrew and Heath, Robert W.
- Abstract
In this paper, we use a stochastic geometry approach to quantify the ergodic rate of each user in an outdoor mm-wave ad hoc network. For a variety of use cases, it is reasonable to assume users will be clustered around a central point (e.g., WiFi hotspot or clusterhead) rather than uniformly distributed. Our results indicate that, in contrast to sub-6-GHz networks, clustered mm-wave ad hoc networks tolerate the increased interference because directional antenna arrays reduce the interference. For certain antenna array configurations and user densities, uncoordinated users within a cluster outperform TDMA. Additionally, we derive a scaling law for uniform mm-wave ad hoc networks and propose a heuristic scaling for clustered networks. The per user ergodic rate remains constant if mm-wave antenna arrays scale sub-linearly with the number of users for uniform networks or linearly in clustered networks as users are added to the cluster. Last, we compute expressions that quantify the loss in ergodic rate per user when alignment error occurs at the receiver and transmitter. Our results show that even relatively small errors in alignment can lead to significant ergodic rate reduction. [ABSTRACT FROM PUBLISHER]
- Published
- 2018
- Full Text
- View/download PDF
18. Optimal Throughput–Delay Tradeoff in MANETs With Supportive Infrastructure Using Random Linear Coding.
- Author
-
Luo, Zhe, Gan, Xiaoying, Wang, Xinbing, and Luo, Hanwen
- Subjects
AD hoc computer networks ,COMMUNICATION infrastructure ,WIRELESS localization ,DATA transmission systems ,WIRELESS communications - Abstract
The performance of throughput, delay, and their tradeoff in mobile ad hoc networks (MANETs) has been investigated on different assumptions. Nevertheless, few papers consider the supportive infrastructure in MANETs. With the help of supportive infrastructure, i.e., cellular networks, the performance of throughput and delay in MANETs can be improved. The impact of supportive infrastructure on the throughput–delay tradeoff in MANETs is an open research point. In this paper, we are interested in the optimal throughput–delay tradeoff in MANETs with supportive infrastructure. We investigate the supportive infrastructure that only provides transmission pipes between distant nodes. We study the optimal throughput–delay tradeoff in MANETs on different assumptions such as different densities of nodes and base stations (BSs), discrete/continuous mobility models with various velocities, and the fast/slow mobility assumption. We obtain the asymptotically optimal throughput–delay tradeoff and propose transmission policies based on random linear coding (RLC) to achieve the optimal throughput–delay tradeoff asymptotically. From the obtained optimal throughput–delay tradeoff, we find that supportive infrastructure reduces the delay bound from velocity, which is a lower bound of delay caused by nodes' velocity. In particular, if supportive infrastructure can cover the entire network, then the delay bound from velocity vanishes when per-node throughput does not exceed a threshold. Moreover, we find that there also exists a delay bound from the transmission range of the instant transmission. In addition, we observe that, for the optimal throughput–delay tradeoff in the large throughput region, the case in the continuous mobility model outperforms the case in the discrete mobility model, and the case on the slow mobility assumption outperforms the case on the fast mobility assumption. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
19. Distributed Resource Management for Cognitive Ad Hoc Networks With Cooperative Relays.
- Author
-
Guan, Zhangyu, Melodia, Tommaso, Yuan, Dongfeng, and Pados, Dimitris A.
- Subjects
COGNITIVE radio ,ELECTRIC relays ,DISTRIBUTED resources (Electric utilities) ,DISTRIBUTED algorithms ,NASH equilibrium ,EQUIPMENT & supplies - Abstract
It is well known that the data transport capacity of a wireless network can be increased by leveraging the spatial and frequency diversity of the wireless transmission medium. This has motivated the recent surge of research in cooperative and dynamic-spectrum-access (which we also refer to as cognitive spectrum access) networks. Still, as of today, a key open research challenge is to design distributed control strategies to dynamically jointly assign: 1) portions of the spectrum and 2) cooperative relays to different traffic sessions to maximize the resulting network-wide data rate. In this paper, we make a significant contribution in this direction. First, we mathematically formulate the problem of joint spectrum management and relay selection for a set of sessions concurrently utilizing an interference-limited infrastructure-less wireless network. We then study distributed solutions to this (nonlinear and nonconvex) problem. The overall problem is separated into two subproblems: 1) spectrum management through power allocation with given relay selection strategy; and 2) relay selection for a given spectral profile. Distributed solutions for each of the two subproblems are proposed, which are then analyzed based on notions from variational inequality (VI) theory. The distributed algorithms can be proven to converge, under certain conditions, to VI solutions, which are also Nash equilibrium (NE) solutions of the equivalent NE problems. A distributed algorithm based on iterative solution of the two subproblems is then designed. Performance and price of anarchy of the distributed algorithm are then studied by comparing it to the globally optimal solution obtained with a newly designed centralized algorithm. Simulation results show that the proposed distributed algorithm achieves performance that is within a few percentage points of the optimal solution. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
20. Optimal Secrecy Capacity-Delay Tradeoff in Large-Scale Mobile Ad Hoc Networks.
- Author
-
Cao, Xuanyu, Zhang, Jinbei, Fu, Luoyi, Wu, Weijie, and Wang, Xinbing
- Subjects
AD hoc computer networks ,MOBILE communication systems ,EAVESDROPPING ,INFORMATION processing ,COMPUTER network architectures - Abstract
In this paper, we investigate the impact of information-theoretic secrecy constraint on the capacity and delay of mobile ad hoc networks (MANETs) with mobile legitimate nodes and static eavesdroppers whose location and channel state information (CSI) are both unknown. We assume n legitimate nodes move according to the fast i.i.d. mobility pattern and each desires to communicate with one randomly selected destination node. There are also n^\nu static eavesdroppers located uniformly in the network and we assume the number of eavesdroppers is much larger than that of legitimate nodes, i.e., \nu>1. We propose a novel simple secure communication model, i.e., the secure protocol model, and prove its equivalence to the widely accepted secure physical model under a few technical assumptions. Based on the proposed model, a framework of analyzing the secrecy capacity and delay in MANETs is established. Given a delay constraint D, we find that the optimal secrecy throughput capacity is \widetilde\Theta(W((D/n))^(2/3)), where W is the data rate of each link. We observe that: 1) the capacity-delay tradeoff is independent of the number of eavesdroppers, which indicates that adding more eavesdroppers will not degenerate the performance of the legitimate network as long as \nu>1; 2) the capacity-delay tradeoff of our paper outperforms the previous result \Theta((1/n\psie)) in refid="ref11"/, where \psie=n^{\nu-1}=\omega(1) is the density of the eavesdroppers. Throughout this paper, for functions f(n) and g(n), we denote f(n)=o(g(n)) if \limn\rightarrow\infty(f(n)/g(n))=0; f(n)=\omega(g(n)) if g(n)=o(f(n)); f(n)=O(g(n)) if there is a positive constant c such that f(n)\leq cg(n) for sufficiently large n; f(n)=\Omega(g(n)) if g(n)=O(f(n)); f(n)=\Theta(g(n)) if both f(n)=O(g(n)) and f(n)=\Omega(g(n)) hold. Besides, the order notation \widetilde\Theta omits the polylogarithmic factors for better readability. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
21. Mobility‐compatible cache controlled cluster networking protocol.
- Author
-
Sunhare, Priyank and Chattopadhyay, Manju K.
- Subjects
- *
COMPUTER network protocols , *WIRELESS sensor networks , *ENERGY consumption , *SENSOR networks , *RESOURCE management - Abstract
Summary The cluster networking protocols are the roots that embed intelligent decision‐making and enhance the lifespan of wireless sensor networks (WSNs). Wireless sensors with limited capabilities face several challenges due to the heterogeneous application environments. Especially, the mobility‐incorporated sensors in most situations trouble the cluster network's robustness. Many cluster networking protocols have been presented in the past to enhance the network lifespan and data delivery ratio. However, they lack a dedicated and efficient mechanism for mobility assistance, an adequate cluster management process and cluster head selection criteria. To overcome these issues and for the uniform energy load distribution, we propose a mobility‐compatible cache controlled cluster networking protocol (MC‐CCCNP) in this paper. It is an energy‐efficient cluster networking protocol that supports sensor movement. Network resource management and routing are controlled distributively by an optimal number of cache nodes. It defines a new strategy for cache node deployment based on neighbour density as well as a weight formula for cluster head selection and cluster formation based on the residual energy, the distance to the base station and the node velocity. It also includes techniques for detaching and reconnecting a mobile node to an appropriate cluster cache if it crosses the cluster boundary. We simulate and compare the performance of our protocol with the centralised energy‐efficient clustering routing, energy‐efficient mobility‐based cluster head selection protocol and dual tier cluster‐based routing protocols over different network configurations with varying mobility, scalability and heterogeneity. The MC‐CCCNP showed remarkable improvements in energy utilisation uniformity and energy consumption. With the improved network lifespan, it also maintains a higher data throughput rate of 95% or more in almost all network configurations. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
22. Secure Millimeter-Wave Ad Hoc Communications Using Physical Layer Security.
- Author
-
Zhang, Yuanyu, Shen, Yulong, Jiang, Xiaohong, and Kasahara, Shoji
- Abstract
Millimeter-wave (mmWave) communications are highly promising to improve the capacity of modern wireless networks, while the physical layer security (PLS) techniques hold great potential to enhance the critical secrecy performance therein. By carefully exploiting the significant signal difference between the Non-Light-of-Sight (NLoS) and Line-of-Sight (LoS) mmWave links, this paper proposes a Sight-based Cooperative Jamming (SCJ) scheme to improve the PLS performance of mmWave ad hoc communications. In this scheme, each potential jammer that has no LoS link to its nearest receiver but may have LoS links to eavesdroppers is selected with a certain probability to generate artificial noise such that channel advantages at legitimate receivers can be achieved. For performance modeling of the new jamming scheme, novel and efficient theoretical approximation approaches are firstly developed to enable the challenging issue of interference distribution modeling to be tackled, and then a theoretical framework based on stochastic geometry is proposed to capture the secrecy transmission capacity behavior under the SCJ scheme. Finally, extensive numerical results are provided to illustrate the SCJ scheme under various network scenarios. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
23. Hop Count Distribution for Minimum Hop-Count Routing in Finite Ad Hoc Networks.
- Author
-
Li, Silan, Hu, Xiaoya, Jiang, Tao, Zhang, Rongqing, Yang, Liuqing, and Hu, Hui
- Abstract
Hop count distribution (HCD), generally formulated as a discrete probability distribution of the hop count, constitutes an attractive tool for performance analysis and algorithm design. This paper devotes to deriving an analytical HCD expression for a finite ad hoc network under the minimum hop-count routing protocols. Formulating the node distribution with binomial point process, the network is provided as a bounded area with all nodes randomly and uniformly distributed. Considering an arbitrary pair of source node (SN) and destination node, an innovative and straightforward definition is presented for HCD. In order to derive HCD out, an original mathematical framework, named as the equivalent area replacement method (EARM), is proposed and verified. Under the EARM, HCD is derived by first considering the special case where SN locates at the network center and then extending to the general case where SN is randomly distributed. For each case, the accuracy of our HCD model is evaluated by simulation comparison. Results show that our model matches well with the simulation results over a wide range of parameters. Particularly, the derived HCD outperforms the existing formulations in terms of the Kullback Leibler divergence, especially when SN is randomly distributed. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
24. Providing Spectrum Information Service Using TV White Space via Distributed Detection System.
- Author
-
Chen, Zhenjia and Zhang, Yonghui
- Subjects
RADIO frequency allocation ,INFORMATION services ,ELECTROMAGNETIC spectrum ,DYNAMIC spectrum access ,COGNITIVE radio ,RADIO technology ,RADIO frequency - Abstract
Electromagnetic spectrum resources are a very important resource. With the rapid development of radio technology, electromagnetic spectrum resources have become scarce. Abuse of spectrum resources and interference with primary user often occur. Pre-sensing the electromagnetic environment and performing dynamic spectrum access is the direction of future wireless technology development. This paper focuses on the electromagnetic spectrum information service platform. We design a spectrum detection node in combination with an embedded system. The distributed spectrum detection network is constructed by using the TV White Space as the communication frequency band of the backbone network. From the perspective of signal source, research on detection and identification methods based on radio signal characteristics improves the efficiency of electromagnetic spectrum detection. A phase extreme range estimation method based on radio frequency I/Q data is proposed to improve signal estimation accuracy in a low signal-noise-ratio environment. The interquartile range is proposed to distinguish noise and signal. The experiment results show that distributed electromagnetic spectrum information service platform based on signal characteristics can improve detection accuracy and increase system flexibility. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
25. A New Distributed Predictive Congestion Aware Re-Routing Algorithm for CO2 Emissions Reduction.
- Author
-
Santamaria, Amilcare Francesco, Fazio, Peppino, Raimondo, Pierfrancesco, Tropea, Mauro, and De Rango, Floriano
- Subjects
VEHICULAR ad hoc networks ,IEEE 802.11 (Standard) ,WIRELESS communications ,TRAFFIC flow ,TRAFFIC congestion ,CARBON dioxide reduction - Abstract
In the last years, vehicular networking has grown up in terms of interest and transmission capability, due to the possibility of exploiting the distributed communication paradigm in a mobile scenario, where moving nodes are represented by vehicles. The different existing standards for vehicular ad-hoc networks, such as dedicate short range communication (DSRC), wireless access for vehicular environment (WAVE)/IEEE802.11p, have given to the research community the possibility of developing new medium access control (MAC) and routing schemes, in order to enhance the quality and the comfort of mobile users who are driving their vehicles. In this paper, we focus our attention on the optimization of traffic flowing in a vehicular environment with vehicle-2-roadside capability. As shown later, the proposed idea exploits the information that is gathered by road-side units to redirect traffic flows (in terms of vehicles) to less congested roads, with an overall system optimization, also in terms of carbon dioxide emissions reduction. An analytical model, as well as a set of pseudo-code instructions, have been introduced in the paper. A deep campaign of simulations has been carried out to give more effectiveness to our proposal. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
26. Improving Safety on Highways by Customizing Vehicular Ad Hoc Networks.
- Author
-
Rakhshan, Ali and Pishro-Nik, Hossein
- Abstract
This paper studies the need for individualizing vehicular communications in order to improve safety for a highway scenario. Adapting a vehicular ad hoc network to both its individual driver’s characteristic and traffic conditions enables it to transmit in a smart manner to other vehicles. This radical improvement is now possible due to the progress that is being made in vehicular ad hoc networks (VANET). In this paper, we first derive the packet success probability for a chain of vehicles by taking multi-user interference, path loss, and fading into account. Then, by considering the delay constraints and types of potential collisions, we approximate the optimal channel access probabilities. Lastly, we propose an algorithm for customizing channel access probabilities in VANET. Our Monte Carlo simulation results show that this approach achieves more than 25% reduction in traffic collision probability compared with the case with equal channel access probabilities in its optimal range. Therefore, it has a huge advantage over other non-optimal systems. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
27. AFLAS: An Adaptive Frame Length Aggregation Scheme for Vehicular Networks.
- Author
-
Zhou, Xiaoli and Boukerche, Azzedine
- Subjects
VEHICULAR ad hoc networks ,TELECOMMUNICATION access control ,TELECOMMUNICATION protocols ,DATA packeting ,INTERFERENCE channels (Telecommunications) - Abstract
Vehicular ad hoc networks (VANETs) experience large-scale high-speed mobility and volatile topology. VANETs may therefore experience intermittent connections and may occasionally be unable to guarantee end-to-end connections. This gives the medium access control (MAC) layer the opportunity to adapt its transmission strategy to the current unstable wireless connections to improve transmission efficiency. In this paper, we propose an adaptive frame length aggregation scheme (AFLAS) for VANETs, which is designed to improve transmission efficiency and increase data throughput. In our scheme, the incoming data packets from higher layers are queued separately in the MAC layer to wait for transmission opportunities. Suitable aggregation frame lengths are calculated according to the current wireless status and applied in the MAC layer at the onset of data transmissions. In this paper, we analyze and apply our AFLAS strategy to two current frame aggregation schemes in IEEE 802.11. We also report on the performance evaluation of our scheme. Our results exhibit significant improvement results in data throughput, retransmissions, overheads, and transmission efficiency in comparison with nonadaptive aggregation schemes. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
28. Performance Evaluation of an IEEE 802.15.4-Based Thread Network for Efficient Internet of Things Communications in Smart Cities.
- Author
-
Khattak, Sohaib Bin Altaf, Nasralla, Moustafa M., Farman, Haleem, and Choudhury, Nikumani
- Subjects
SMART cities ,INTERNET of things ,INTERNET protocol version 6 ,WIRELESS mesh networks ,MESH networks ,WIRELESS communications ,RASPBERRY Pi - Abstract
The increasing demand for Internet of Things (IoT) applications has resulted in vast amounts of data, requiring the utilization of big data analytics. The integration of big data analytics in IoT-based smart cities can greatly benefit from the development of wireless communication protocols, among which the Thread protocol has emerged as a promising option. Thread is IEEE 802.15.4 based and has advanced capabilities like mesh networking, IPv6 support, and multiple gateways providing no single point of failure. This paper presents the design and evaluation of a low-cost mesh network using Raspberry Pi, nRF52840 dongle, and OpenThread 1.2 (i.e., an open-source software implementation of the Thread protocol stack). The research elaborates on the hardware and software solutions used, as well as the network topologies adopted. To evaluate the performance of the developed system, extensive real-time tests are performed, considering parameters, such as jitter, packet loss, and round trip time. These tests effectively demonstrate the effectiveness of the Thread network. Furthermore, the impact of varying payload size and bitrate on the network is analyzed to understand its influence. The behavior of the multi-hop network is also examined under link failure scenarios, providing insights into the network's robustness. Our findings provide valuable insights for researchers interested in designing low-cost and efficient mesh networks for various IoT applications, including home automation, building/campus monitoring systems, distributed industrial IoT applications, and smart city infrastructure. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
29. M2M-Based Service Coverage for Mobile Users in Post-Emergency Environments.
- Author
-
Ahmed Surobhi, Nusrat and Jamalipour, Abbas
- Subjects
WIRELESS communications ,MOBILE communication systems ,MOBILE computing ,MACHINE-to-machine communications ,MACHINE theory - Abstract
In an infrastructure-based wireless network, including mobile users and vehicles, many crucial and important services are provisioned by a centralized server. However, due to damaged infrastructure and increased mobility caused by an emergency, maintaining continuous service coverage in such a network can be challenging. Although several prediction-based replication methods have been proposed to achieve service coverage through replication of the central server, they are unable to accurately predict future topological changes and thus maintain service coverage in a post-emergency network. These topological changes are, in fact, directly related to user mobility. Nevertheless, existing mobility models are unable to realistically represent post-emergency user movements. Consequently, at first, this paper proposes a realistic mobility model that includes users' post-emergency complex behavioral changes. Subsequently, this paper proposes a machine-to-machine (M2M) networking-based service coverage framework for post-emergency environments. The proposed framework performs not only accurate prediction of the proposed user mobility but also optimal replication, utilizing these predictions, of the central server to achieve continuous service coverage. In addition, the framework requires no supervision and fewer resources to perform these functions due to use of the M2M networking. Simulation results are further used to verify the effectiveness of proposals presented in this paper. [ABSTRACT FROM PUBLISHER]
- Published
- 2014
- Full Text
- View/download PDF
30. An Energy Based Dynamic AODV Routing Protocol in Wireless Ad Hoc Networks.
- Author
-
Wuyungerile Li, Baoyintu, Bing Jia, Junxiu Wang, and Takashi Watanabe
- Subjects
NETWORK routing protocols ,AD hoc computer networks ,WIRELESS Internet ,WIRELESS communications ,TELECOMMUNICATION ,ENERGY consumption ,RESEARCH methodology - Abstract
In recent years, with the rapid development of the Internet and wireless communication technology, wireless Ad hoc networks have received more attention. Due to the limited transmission range and energy of nodes in Ad hoc networks, it is important to establish a reliable and energy-balanced transmission path in Ad hoc networks. This paper proposes an energy-based dynamic routing protocol based on the existing AODV routing protocol, which has the following two aspects of improvement: (1) In the route discovery process, a node selects a suitable route from the minimum energy consumption route and the energy-balanced route designed in this paper according to a "Mark" bit that representing remaining energy of a node. (2) Based on (1), a route interruption update strategy was proposed to restart the route discovery process when node energy was used excessively. Simulation results demonstrate that compared with AODV and other existing routing protocols, proposed algorithm can reduce network energy consumption and balance node energy, thus extending the network lifetime. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
31. Optimal Two-Lane Placement for Hybrid VANET-Sensor Networks.
- Author
-
Lin, Chun-Cheng and Deng, Der-Jiunn
- Subjects
VEHICULAR ad hoc networks ,SENSOR networks ,WIRELESS communications ,DETECTORS ,LINEAR programming - Abstract
Vehicular ad hoc networks (VANETs) help improve traffic safety and lessen traffic congestion. Roadside units (RSUs) play a key role in serving as the event and data broker in the form of vehicle-to-infrastructure communication to supply wireless and mobile vehicle-to-vehicle communication. Recently, hybrid VANET-sensor networks have attracted much attention as events are detected by sensor nodes and are spread to a wider area via VANETs, in which the number of RSUs is restricted due to high cost. This paper investigates the problem of minimizing the total cost of deploying RSUs and sensor nodes along the two sides and the median island of a two-lane road to cover the whole road, represented as a grid, and to form a connected VANET-sensor network. This problem is NP-complete by reduction to the NP-complete placement problem for a single-lane road. Therefore, this paper formulates the problem as an integer linear program and then proposes a center particle swarm optimization approach, in which a center particle is adopted for increasing the convergence speed. Additionally, a theoretical analysis for the approach is provided. Experimental results show that the approach can perform well for moderate-sized problems. [ABSTRACT FROM PUBLISHER]
- Published
- 2015
- Full Text
- View/download PDF
32. Topology-Transparent Scheduling via the Chinese Remainder Theorem.
- Author
-
Su, Yi-Sheng
- Subjects
CHINESE remainder theorem ,AD hoc computer networks ,WIRELESS sensor nodes ,DATA packeting ,PACKET switching (Data transmission) - Abstract
This paper proposes a novel scheme for the design of topology-transparent scheduling (TTS) in mobile ad hoc networks (MANETs), based on the Chinese remainder theorem (CRT). TTS can provide each node with guaranteed success in each schedule without any detailed topology information and yields a guaranteed upper bound on the transmission delay of each packet at every node in a MANET. In general, TTS requires two global constraints on the number of nodes in the MANET and the maximum nodal degree of the graph representing connectivity of the MANET. Due to the inherent mobility of MANETs, the maximum nodal degree, however, cannot be available or easily estimated. To eliminate the requirement for the maximum nodal degree, this paper proposes TTS via the CRT. By the redundancy property of the Chinese remainder representation, the proposed CRT-based scheme not only preserves the advantages of providing guaranteed success in each schedule with only the global constraint on the number of nodes in the MANET, but also offers flexibility in constructing TTS. To have a better transmission delay bound for a node with lower interference, this paper also introduces two threaded counterparts of the proposed CRT-based scheme. This paper provides performance analyses for the proposed CRT-based scheme and its threaded counterparts. Numerical results demonstrate that TTS via the CRT can outperform existing schemes, especially in scenarios with harsh interference, and is a versatile approach for the design of TTS. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
33. A Sensing Contribution-Based Two-Layer Game for Channel Selection and Spectrum Access in Cognitive Radio Ad-hoc Networks.
- Author
-
Lu, Yuan and Duel-Hallen, Alexandra
- Abstract
In cognitive radio (CR) networks, the secondary users (SUs) sense the spectrum licensed to the primary users (PUs) to identify and possibly transmit over temporarily unoccupied channels. Cooperative sensing was proposed to improve the sensing accuracy, but in heterogeneous scenarios, SUs do not contribute equally to the cooperative sensing result because they experience different received PU signal quality at their sensors. In this paper, a two-layer cooperative game is developed for distributed sensing and access in multichannel CR ad hoc networks, where the SUs’ transmission opportunities are commensurate with their sensing contributions, thus fostering cooperation and eliminating free-riders. Numerical results show that the proposed two-layer game is computationally efficient and outperforms previously investigated collaborative sensing and spectrum access approaches in heterogeneous multichannel CR scenarios in terms of energy efficiency, throughput, SU fairness, and complexity. Moreover, it is demonstrated that this game is robust to changes in the network topology and the number of SUs. Finally, a new physical-layer approach is proposed to distribute the network-level miss-detection constraints fairly among the interfering SUs for guaranteed PU protection and demonstrate the performance advantages of the AND-rule combining of spectrum sensing results for heterogeneous SUs. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
34. Learning for Robust Routing Based on Stochastic Game in Cognitive Radio Networks.
- Author
-
Wang, Wenbo, Niyato, Dusit, Kwasinski, Andres, and Han, Zhu
- Subjects
COGNITIVE radio ,MARKOV processes ,DYNAMIC spectrum access ,RESOURCE allocation ,ELECTRIC network topology - Abstract
This paper studies the problem of spectrum-aware routing in a multi-hop, multi-channel cognitive radio network when malicious nodes in the secondary network attempt to block the path with mixed attacks. Based on the location and time-variant path delay information, we model the path discovery process as a non-cooperative stochastic game. By exploiting the structure of the underlying Markov Decision Process, we decompose the stochastic routing game into a series of stage games. For each stage game, we propose a distributed strategy learning mechanism based on stochastic fictitious play to learn the equilibrium strategies of joint relay-channel selection in the condition of both limited information exchange and potential routing-toward-primary attacks. We also introduce a trustworthiness evaluation mechanism based on a multi-arm bandit process for normal users to avoid relaying to the sink-hole attackers. Simulation results show that without the need of information flooding, the proposed algorithm is efficient in bypassing the malicious nodes with mixed attacks. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
35. End-to-End Throughput of Ad Hoc Multi-Hop Networks in a Poisson Field of Interferers.
- Author
-
Buratti, Chiara and Verdone, Roberto
- Subjects
AD hoc computer networks ,WIRELESS communications ,APPROXIMATION theory - Abstract
This paper proposes a novel approach to assess the performance in terms of end-to-end throughput of an ad hoc multi-hop wireless network, where each link is affected by interference coming from other multi-hop paths nearby. The approach captures the mutual impact of each path on all others. It can be applied to both, contention-based and scheduled, medium access control (MAC) protocols. Sources have data to send to destination nodes through $n$ relays. Nodes are assumed to be uniformly and randomly distributed in the 2-D infinite plane. The model shows the impact on the end-to-end throughput of $n$ ; it also captures the influence of node density, traffic generated, number of retransmissions, and other MAC parameters. Finally, the model provides the throughput-delay tradeoff. Unlike most previous approaches, the mathematical tool proposed appears to be scalable, allowing easy extension to any number of hops. Comparison with simulation results is provided to prove that the impact of the approximations introduced in the analysis is almost negligible. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
36. Statistical Properties of Transmissions Subject to Rayleigh Fading and Ornstein-Uhlenbeck Mobility.
- Author
-
Cika, Arta, Badiu, Mihai-Alin, and Coon, Justin P.
- Subjects
PROBABILITY density function ,AD hoc computer networks ,ORNSTEIN-Uhlenbeck process ,RANDOM variables ,CUMULATIVE distribution function ,SYMBOL error rate - Abstract
In this paper, we derive closed-form expressions for significant statistical properties of the link signal-to-noise ratio (SNR) and the separation distance in mobile ad hoc networks subject to Ornstein-Uhlenbeck (OU) mobility and Rayleigh fading. In these systems, the SNR is a critical parameter as it directly influences link performance. In the absence of signal fading, the distribution of the link SNR depends exclusively on the squared distance between nodes, which is governed by the mobility model. In our analysis, nodes move randomly according to an Ornstein-Uhlenbeck process, using one tuning parameter to control the temporal dependency in the mobility pattern. We derive a complete statistical description of the squared distance and show that it forms a stationary Markov process. Then, we compute closed-form expressions for the probability density function (pdf), the cumulative distribution function (cdf), the bivariate pdf, and the bivariate cdf of the link SNR. Next, we introduce small-scale fading, modeled by a Rayleigh random variable, and evaluate the pdf of the link SNR for rational path loss exponents. The validity of our theoretical analysis is verified by extensive simulation studies. The results presented in this work can be used to quantify link uncertainty and evaluate stability in mobile ad hoc wireless systems. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
37. FS-MOEA: A Novel Feature Selection Algorithm for IDSs in Vehicular Networks.
- Author
-
Liang, Junwei and Ma, Maode
- Abstract
For Intrusion Detection Systems (IDSs) in Vehicular Ad Hoc Networks (VANETs), single-objective optimization algorithm has inherited limitations for the feature selection problem with the multiple objectives. Moreover, the imbalanced problem commonly exists in various datasets. Thus, in this paper, a feature selection algorithm based on a many-objective optimization algorithm (FS-MOEA) is proposed for IDSs in VANETs, in which Adaptive Non-dominant Sorting Genetic (A-NSGA-III) serves as the many-objective optimization algorithm. Two improvements, called Bias and Weighted (B&W) niche-preservation and Information Gain (IG)-Analytic Hierarchy Process (AHP) prioritizing, are further designed in FS-MOEA. The former is used to counterbalance the imbalanced problem in datasets by assigning rare classes higher priorities, while the latter is employed to search the optimal feature subset for FS-MOEA. In IG-AHP prioritizing, a more distinct measurement, i.e. average IG, is used as the dominant factor to guide the decision analysis of AHP. Experimental results show that the proposed FS-MOEA can not only improve the performance of IDSs in VANETs but also alleviate the negative impact of the imbalanced problem. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
38. A Modified Firefly Optimization Algorithm-Based Fuzzy Packet Scheduler for MANET.
- Author
-
Devadas, Mercy Sharon, Bhalaji, N., and Xiao-Zhi Gao
- Subjects
AD hoc computer networks ,FIREFLIES ,FUZZY logic ,NETWORK performance ,FUZZY systems ,QUALITY of service - Abstract
In Mobile ad hoc Networks (MANETs), the packet scheduling process is considered the major challenge because of error-prone connectivity among mobile nodes that introduces intolerable delay and insufficient throughput with high packet loss. In this paper, a Modified Firefly Optimization Algorithm improved Fuzzy Scheduler-based Packet Scheduling (MFPA-FSPS) Mechanism is proposed for sustaining Quality of Service (QoS) in the network. This MFPA-FSPS mechanism included a Fuzzy-based priority scheduler by inheriting the merits of the Sugeno Fuzzy inference system that potentially and adaptively estimated packets' priority for guaranteeing optimal network performance. It further used the modified Firefly Optimization Algorithm to optimize the rules utilized by the fuzzy inference engine to achieve the potential packet scheduling process. This adoption of a fuzzy inference engine used dynamic optimization that guaranteed excellent scheduling of the necessitated packets at an appropriate time with minimized waiting time. The statistical validation of the proposed MFPAFSPS conducted using a one-way Analysis of Variance (ANOVA) test confirmed its predominance over the benchmarked schemes used for investigation. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
39. Distributed Algorithms for Sharing Spectrum Sensing Information in Cognitive Radio Networks.
- Author
-
Lunden, Jarmo, Motani, Mehul, and Poor, H. Vincent
- Abstract
Collaborative spectrum sensing in cognitive radio networks mitigates the negative propagation effects of the wireless channel and increases the sensing reliability. Collaborative sensing requires sensors to share their local spectrum sensing information (SSI) with other users. This paper proposes distributed iterative time slot allocation algorithms for SSI sharing on a dedicated common control channel in a cognitive radio ad hoc network scenario. The proposed algorithms are based on a collision detection and acknowledgment scheme. This scheme allows the network nodes to receive knowledge about collisions regarding their transmitted SSI packets. The nodes use this information to update their operating time slots using a probabilistic approach; each node maintains and updates a parameter representing the probability of switching the time slot in case of a collision. Both fixed and adaptive probability based schemes are proposed. The proposed algorithms are proven to converge to a collision-free allocation with probability one if such an allocation exists. Moreover, an analytical expression for the expected convergence time is established. Extensive simulation results illustrating the rapid convergence, excellent performance, and small reporting overhead of the proposed time slot allocation algorithms are provided. [ABSTRACT FROM PUBLISHER]
- Published
- 2015
- Full Text
- View/download PDF
40. Energy-Efficient Broadcast in Mobile Networks Subject to Channel Randomness.
- Author
-
Zhang, Zijie, Mao, Guoqiang, and Anderson, Brian D. O.
- Abstract
Wireless communication in a network of mobile devices is a challenging and resource-demanding task, due to the highly dynamic network topology and the wireless channel randomness. This paper investigates information broadcast schemes in 2-D mobile ad hoc networks where nodes are initially randomly distributed and then move following a random direction mobility model. Based on an in-depth analysis of the popular susceptible-infectious-recovered epidemic broadcast scheme, this paper proposes a novel energy and bandwidth-efficient broadcast scheme, named the energy-efficient broadcast scheme, which is able to adapt to fast-changing network topology and channel randomness. Analytical results are provided to characterize the performance of the proposed scheme, including the fraction of nodes that can receive the information and the delay of the information dissemination process. The accuracy of analytical results is verified using simulations driven by both the random direction mobility model and a real-world trace. [ABSTRACT FROM PUBLISHER]
- Published
- 2015
- Full Text
- View/download PDF
41. A New Approach to the Directed Connectivity in Two-Dimensional Lattice Networks.
- Author
-
Zhang, Lei, Cai, Lin, Pan, Jianping, and Tong, Fei
- Subjects
LATTICE networks ,ENERGY consumption ,PROBABILITY theory ,PERCOLATION theory ,INFORMATION theory ,COMPUTATIONAL complexity - Abstract
The connectivity of ad hoc networks has been extensively studied in the literature. Most recently, researchers model ad hoc networks with two-dimensional lattices and apply percolation theory for connectivity study. On the lattice, given a message source and the bond probability to connect any two neighbor vertices, percolation theory tries to determine the critical bond probability above which a giant connected component appears. This paper studies a related but different problem, directed connectivity: what is the exact probability of the connection from the source to any vertex following certain directions? The existing studies in math and physics only provide approximation or numerical results. In this paper, by proposing a recursive decomposition approach, we can obtain a closed-form polynomial expression of the directed connectivity of square lattice networks as a function of the bond probability. Based on the exact expression, we have explored the impacts of the bond probability and lattice size and ratio on the lattice connectivity, and determined the complexity of our algorithm. Further, we have studied a realistic ad hoc network scenario, i.e., an urban VANET, where we show the capability of our approach on both homogeneous and heterogeneous lattices and how related applications can benefit from our results. [ABSTRACT FROM AUTHOR]
- Published
- 2014
- Full Text
- View/download PDF
42. K-Hop Packet Forwarding Schemes for Cooperative Video Streaming over Vehicular Networks.
- Author
-
Lee, Chao-Hsien, Huang, Chung-Ming, Yang, Chia-Ching, and Lin, Hsiao-Yu
- Abstract
When a passenger in a vehicle wants to watch video during movement, he may request video through cellular network, e.g., 3G or 3.5G network. However, due to the characteristics of vehicular networks, the limited bandwidth of 3G/3.5G network is not enough to support high resolution or high video quality. In order to improve the quality of video playback, this vehicle, which is defined as requester in this paper, may try to ask other members of the same fleet to download video cooperatively. In other words, other members would download parts of requested video through their 3G/3.5G network individually and then forward video data hop by hop to the requester using the DSRC ad-hoc network. In order to smooth the DSRC ad-hoc network, we propose and discuss two k-hop packet forwarding schemes for the aforementioned cooperative video streaming over vehicular networks in this paper. Each intermediary node of the forwarding route must decide how to deliver buffered video data through the limited DSRC network. Finally, the NS2 simulation tool is adopted to evaluate the proposed schemes. Based on the simulation results, the Playback Priority First (PPF) scheme is performed better than the First-In First-Out (FIFO) scheme. [ABSTRACT FROM PUBLISHER]
- Published
- 2012
- Full Text
- View/download PDF
43. A distributed topology discovery algorithm for Linear Sensor Networks.
- Author
-
Jawhar, Imad, Mohamed, Nader, and Zhang, Liren
- Abstract
The technology of sensor devices and networks is evolving rapidly with significant advances in size, processing power, memory, and energy efficiency. In addition, the cost of sensors is constantly decreasing making it possible to use large quantities of these sensors in a wide variety of important applications in environmental, military, commercial, health care, and other fields. In order to monitor certain types of infrastructures. Many of these applications involve lining up the sensors in a linear form, making a special class of these networks which are defined in this work as Linear Sensor Networks (LSNs). In a previous paper, we introduced the concept of LSNs along with a classification of the different types of LSNs, a sample of their applications and the motivation for designing specialized protocols that take advantage of the linearity of the network to enhance their communication efficiency, reliability, fault tolerance, energy savings, and network lifetime. This paper presents a distributed topology discovery algorithm for a hierarchical two-level LSNs. New definitions for important structure and design parameters are introduced. The proposed protocol allows the nodes to construct an ordered list of the nodes in the network which can be used to create an efficient routing table. In addition, it would be useful for simplifying, and enhancing the reliability and robustness of the routing process by taking advantage of the linear alignments of the nodes. Furthermore, the protocol does not require the nodes to have location detection capabilities such as GPS, which would lead to a more complex design and higher cost of the sensor nodes. [ABSTRACT FROM PUBLISHER]
- Published
- 2012
- Full Text
- View/download PDF
44. Survey of cross-layer proposals for video streaming over Mobile Ad hoc Networks (MANETs).
- Author
-
Mantzouratos, Spyros, Gardikis, Georgios, Koumaras, Harilaos, and Kourtis, Anastasios
- Abstract
Efforts to realize video streaming over Mobile Ad hoc Networks (MANETs) meet many challenges, which are addressed by different techniques. In the highly dynamic and unpredictable environment of MANETs, cross-layer mechanisms seem to be the most suitable for optimising video streaming. This paper presents a survey of 44 studied papers on the area, comparing tools, parameters and metrics used for their evaluation. It also indicatively describes in more detail some of these proposals. [ABSTRACT FROM PUBLISHER]
- Published
- 2012
- Full Text
- View/download PDF
45. Full-Duplex Backscatter Interference Networks Based on Time-Hopping Spread Spectrum.
- Author
-
Liu, Wanchun, Huang, Kaibin, Zhou, Xiangyun, and Durrani, Salman
- Abstract
Future Internet-of-Things (IoT) is expected to wirelessly connect billions of low-complexity devices. For wireless information transfer (IT) in IoT, high density of IoT devices and their ad hoc communication result in strong interference, which acts as a bottleneck on wireless IT. Furthermore, battery replacement for the massive number of IoT devices is difficult if not infeasible, making wireless energy transfer (ET) desirable. This motivates: 1) the design of full-duplex wireless IT to reduce latency and enable efficient spectrum utilization and 2) the implementation of passive IoT devices using backscatter antennas that enable wireless ET from one device (reader) to another (tag). However, the resultant increase in the density of simultaneous links exacerbates the interference issue. This issue is addressed in this paper by proposing the design of full-duplex backscatter communication (BackCom) networks, where a novel multiple-access scheme based on time-hopping spread-spectrum is designed to enable both one-way wireless ET and two-way wireless IT in coexisting backscatter reader-tag links. Comprehensive performance analysis of BackCom networks is presented in this paper, including forward/backward bit-error rates and wireless ET efficiency and outage probabilities, which accounts for energy harvesting at tags, non-coherent and coherent detection at tags and readers, respectively, and the effects of asynchronous transmissions. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
46. On the Broadcast Capacity Scaling of Large Wireless Networks at Low SNR.
- Author
-
Haddad, Serj and Leveque, Olivier
- Subjects
WIRELESS communications ,BEAMFORMING ,BROADCASTING industry ,DECODING algorithms ,SIGNAL-to-noise ratio - Abstract
This paper focuses on the problem of broadcasting information in the most efficient manner in a large 2-D ad hoc wireless network at low SNR and under line-of-sight propagation. A new communication scheme is proposed, where source nodes first broadcast their data to the entire network, despite the lack of sufficient available power. The signal’s power is then reinforced via successive back-and-forth beamforming transmissions between different groups of nodes in the network, so that all nodes are able to decode the transmitted information at the end. This scheme is shown to achieve asymptotically the broadcast capacity of the network, which is expressed in terms of the largest singular value of the matrix of fading coefficients between the nodes in the network. A detailed mathematical analysis is then presented to evaluate the asymptotic behavior of this largest singular value. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
47. EcoTrec—A Novel VANET-Based Approach to Reducing Vehicle Emissions.
- Author
-
Doolan, Ronan and Muntean, Gabriel-Miro
- Abstract
There are interdependent increases in vehicle numbers, vehicular traffic congestion, and carbon emissions that cause major problems worldwide. These problems include direct negative influences on people's health, adverse economic effects, negative social impacts, local environmental damage, and risk of catastrophic global climate change. There is a drastic need to develop ways to reduce these emissions and EcoTrec, presented in this paper, is one of these innovative approaches. EcoTrec is a vehicular ad hoc network-based vehicle routing solution designed to reduce vehicle carbon emissions without significantly affecting the travel times of vehicles. The vehicles exchange messages related to traffic and road conditions, such as average speed on the road, road gradient, and surface condition. This information is used to build a fuel efficiency model of the routes, based on which the vehicles are recommended to take more efficient routes. By routing vehicles more efficiently, the greenhouse emissions are reduced while also maintaining low traffic congestion levels. This paper presents results of extensive simulations, which show how EcoTrec outperforms other state-of-the-art solutions with different number of vehicles, vehicle penetration, and compliance rates, and when considering different real world road maps from Dublin and Koln. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
48. Characterizing the 2.4 GHz Spectrum in a Hospital Environment: Modeling and Applicability to Coexistence Testing of Medical Devices.
- Author
-
Al Kalaa, Mohamad Omar, Balid, Walid, Refai, Hazem H., LaSorte, Nickolas J., Seidman, Seth J., Bassen, Howard I., Silberberg, Jeffrey L., and Witters, Donald
- Subjects
WIRELESS LANs ,HOSPITALS ,SPECTRAL energy distribution ,VALUE distribution theory ,SPORADIC groups (Mathematics) ,PROBABILITY theory - Abstract
The increasing use of shared, unlicensed spectrum bands by medical devices and nonmedical products highlights the need to address wireless coexistence to ensure medical device safety and effectiveness. This paper provides the first step to approximate the probability of a device coexisting in its intended environment by providing a generalized framework for modeling the environment. The application of this framework is shown through an 84-day spectrum survey of the 2.4–2.48 GHz industrial, scientific, and medical band in a hospital environment in the United States. A custom platform was used to monitor power flux spectral density and record received power. Channel utilization of three nonoverlapping channels of 20 MHz bandwidth—relative to IEEE 802.11 channels 1, 6, and 11—were calculated and fitted to a generalized extreme value distribution. Low channel utilization was observed ( $ <$10%) in the surveyed environment with sporadic occurrences of higher channel utilization ($ >$ 50%). Reported findings can be complementary to wireless coexistence testing. This paper can provide input to the development of a consensus standard for wireless device coexistence test methods and a consensus document focused on wireless medical device coexistence risk management. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
49. Relay Selection Analysis for an Opportunistic Two-Hop Multi-User System in a Poisson Field of Nodes.
- Author
-
Zanella, Alberto, Bazzi, Alessandro, and Masini, Barbara M.
- Abstract
In this paper, we consider a multi-user scenario where an arbitrary number of sources transmit their messages to the intended destinations by means of relays in a decode-and-forward two-hop mechanism. To minimize the interference generated in the scenario, two opportunistic relay selection mechanisms are proposed and investigated. The performance of the two selection mechanisms is analytically evaluated, in terms of outage probability and average achievable rate, under the assumption that relay nodes are distributed according to a Poisson point process. Asymptotical analysis is also presented for infinite node density. Numerical results show that the selection of the relays has a significant impact on the amount of interference generated and a suitable choice can improve the overall performance. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
50. Adaptive Rendezvous for Heterogeneous Channel Environments in Cognitive Radio Networks.
- Author
-
Paul, Rajib and Choi, Young-June
- Abstract
Rendezvous is the fundamental challenge in cognitive radio networks to find each other on a specific channel and establish a communication link. The primary focus of this paper is to design an algorithm for blind rendezvous, i.e., a rendezvous without a coordinator or common control channel. Channels to jump are assumed to be homogeneous in prior work; however, in the real world, channels exhibit different conditions. Therefore, we propose an adaptive jumping pattern such that a superior channel is considered more frequently based on its noise level and users have a greater possibility to rendezvous on such a channel. Furthermore, in this paper, we investigate the rendezvous problem with multiple radio interfaces. When multiple radio interfaces are available for users, the possibility of rendezvous increases; however, the number of channels to jump for each interface may not be the same as other users’ interfaces. We propose an adaptive rendezvous algorithm that can function for multiple interfaces and different sizes of channel lists and an adaptive jumping pattern for different channel conditions. We prove that the proposed algorithm provides guaranteed rendezvous and derive the maximum time-to-rendezvous (TTR), which is also verified via simulation results. Further, our algorithm outperforms jump-and-stay in terms of TTR while enabling users to rendezvous on a better channel. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.