scispace - formally typeset
Search or ask a question
Author

Isaac Woungang

Bio: Isaac Woungang is an academic researcher from Ryerson University. The author has contributed to research in topics: Routing protocol & Optimized Link State Routing Protocol. The author has an hindex of 27, co-authored 279 publications receiving 3186 citations. Previous affiliations of Isaac Woungang include University of Luxembourg & University of the South, Toulon-Var.


Papers
More filters
BookDOI
20 Feb 2009
TL;DR: This wide-ranging and highly useful guide will be a valuable reference/text in the field for researchers, engineers and strategists needing to know about wireless ad-hoc network communication.
Abstract: Wireless ad-hoc network communication technologies have experienced a steep growth in research and significant advancements in recent times due to their important advantages. These benefits help to set-up a network fast in situations where there is no existing network set-up, or when setting up a fixed infrastructure network is considered infeasible. However, there are challenges that still need to be addressed. This indispensable guidebook provides a comprehensive resource on the new ideas and results in the areas of mobile ad-hoc networks and other ad-hoc computing systems in the wireless communication technology field. Wireless ad-hoc networks are explored by leading experts in the field from both academia and industry, with discussions on various challenges in varied environments, standards, routing mechanisms, etc. This reader-friendly, broad-ranging text features in-depth descriptions of terminologies and concepts related to the diverse subject areas germane to wireless ad hoc communication. Features: Provides an accessible, comprehensive overview of the state-of-the-art technology of wireless ad-hoc networks Includes reader-friendly discussions for practitioners, directions for future research, and helpful lists of terms and definitions Offers a set of summary questions at the end of each chapter to help readers assess their understanding of the various concepts Presents insight into the practical significance of these topics in real-world scenarios Designed, in structure and content, to aid the learning process with the intension of making the book useful at all learning levels Supplies supportive PowerPoint presentation slides and solutions to aid lecturers at www.springer.com/978-1-84800-327-9 This wide-ranging and highly useful guide will be a valuable reference/text in the field for researchers, engineers and strategists needing to know about this technology. It is also an ideal textbook for graduate students wishing to learn more about the topic. Key Topics: Routing Mobility Management Quality of Service Support Congestion Control Security Trust Management

166 citations

Journal ArticleDOI
TL;DR: This paper attempts to resolve the issue of preventing or detecting malicious nodes launching grayhole or collaborative blackhole attacks by designing a dynamic source routing (DSR)-based routing mechanism, which is referred to as the cooperative bait detection scheme (CBDS), that integrates the advantages of both proactive and reactive defense architectures.
Abstract: In mobile ad hoc networks (MANETs), a primary requirement for the establishment of communication among nodes is that nodes should cooperate with each other. In the presence of malevolent nodes, this requirement may lead to serious security concerns; for instance, such nodes may disrupt the routing process. In this context, preventing or detecting malicious nodes launching grayhole or collaborative blackhole attacks is a challenge. This paper attempts to resolve this issue by designing a dynamic source routing (DSR)-based routing mechanism, which is referred to as the cooperative bait detection scheme (CBDS), that integrates the advantages of both proactive and reactive defense architectures. Our CBDS method implements a reverse tracing technique to help in achieving the stated goal. Simulation results are provided, showing that in the presence of malicious-node attacks, the CBDS outperforms the DSR, 2ACK, and best-effort fault-tolerant routing (BFTR) protocols (chosen as benchmarks) in terms of packet delivery ratio and routing overhead (chosen as performance metrics).

156 citations

BookDOI
10 Jun 2009
TL;DR: This highly useful guide presents a comprehensive account of the fundamental concepts, new ideas and results in the field of WSNs, emerging as an attractive technology with great promise for the future.
Abstract: Wireless communication technologies continue to undergo rapid advancement. In recent years, there has been a steep growth in research in the area of wireless sensor networks (WSNs). In WSNs, communication takes place with the help of spatially distributed, autonomous sensor nodes equipped to sense specific information. WSNs can be found in a variety of both military and civilian applications worldwide. Examples include detecting enemy intrusion on the battlefield, object tracking, habitat monitoring, patient monitoring and fire detection. Sensor networks are emerging as an attractive technology with great promise for the future. However, challenges remain to be addressed in issues relating to coverage and deployment, scalability, quality-of-service, size, computational power, energy efficiency and security. This highly useful guide presents a comprehensive account of the fundamental concepts, new ideas and results in the field of WSNs.

155 citations

Journal ArticleDOI
TL;DR: In this paper, the authors provide a holistic view on wireless tactile Internet (TI) along with a thorough review of the existing state-of-the-art, to identify and analyze the involved technical issues, to highlight potential solutions and to propose future research directions.
Abstract: Tactile Internet (TI) is envisioned to create a paradigm shift from the content-oriented communications to steer/control-based communications by enabling real-time transmission of haptic information (i.e., touch, actuation, motion, vibration, surface texture) over Internet in addition to the conventional audiovisual and data traffics. This emerging TI technology, also considered as the next evolution phase of Internet of Things (IoT), is expected to create numerous opportunities for technology markets in a wide variety of applications ranging from teleoperation systems and Augmented/Virtual Reality (AR/VR) to automotive safety and eHealthcare towards addressing the complex problems of human society. However, the realization of TI over wireless media in the upcoming Fifth Generation (5G) and beyond networks creates various non-conventional communication challenges and stringent requirements in terms of ultra-low latency, ultra-high reliability, high data-rate connectivity, resource allocation, multiple access and quality-latency-rate tradeoff. To this end, this paper aims to provide a holistic view on wireless TI along with a thorough review of the existing state-of-the-art, to identify and analyze the involved technical issues, to highlight potential solutions and to propose future research directions. First, starting with the vision of TI and recent advances and a review of related survey/overview articles, we present a generalized framework for wireless TI in the Beyond 5G Era including a TI architecture, the main technical requirements, the key application areas and potential enabling technologies. Subsequently, we provide a comprehensive review of the existing TI works by broadly categorizing them into three main paradigms; namely, haptic communications, wireless AR/VR, and autonomous, intelligent and cooperative mobility systems. Next, potential enabling technologies across physical/Medium Access Control (MAC) and network layers are identified and discussed in detail. Also, security and privacy issues of TI applications are discussed along with some promising enablers. Finally, we present some open research challenges and recommend promising future research directions.

111 citations

Journal ArticleDOI
TL;DR: Simulation results show that MLProph outperforms PROPHET+, a probabilistic-based routing protocol for OppNets, in terms of number of successful deliveries, dropped messages, overhead, and hop count, at the cost of small increases in buffer time and buffer occupancy values.
Abstract: This paper proposes a novel routing protocol for OppNets called MLProph, which uses machine learning (ML) algorithms, namely decision tree and neural networks, to determine the probability of successful deliveries. The ML model is trained by using various factors such as the predictability value inherited from the PROPHET routing scheme, node popularity, node's power consumption, speed, and location. Simulation results show that MLProph outperforms PROPHET+, a probabilistic-based routing protocol for OppNets, in terms of number of successful deliveries, dropped messages, overhead, and hop count, at the cost of small increases in buffer time and buffer occupancy values.

106 citations


Cited by
More filters
Journal ArticleDOI

[...]

08 Dec 2001-BMJ
TL;DR: There is, I think, something ethereal about i —the square root of minus one, which seems an odd beast at that time—an intruder hovering on the edge of reality.
Abstract: There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality. Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

33,785 citations

Christopher M. Bishop1
01 Jan 2006
TL;DR: Probability distributions of linear models for regression and classification are given in this article, along with a discussion of combining models and combining models in the context of machine learning and classification.
Abstract: Probability Distributions.- Linear Models for Regression.- Linear Models for Classification.- Neural Networks.- Kernel Methods.- Sparse Kernel Machines.- Graphical Models.- Mixture Models and EM.- Approximate Inference.- Sampling Methods.- Continuous Latent Variables.- Sequential Data.- Combining Models.

10,141 citations

Proceedings Article
01 Jan 1991
TL;DR: It is concluded that properly augmented and power-controlled multiple-cell CDMA (code division multiple access) promises a quantum increase in current cellular capacity.
Abstract: It is shown that, particularly for terrestrial cellular telephony, the interference-suppression feature of CDMA (code division multiple access) can result in a many-fold increase in capacity over analog and even over competing digital techniques. A single-cell system, such as a hubbed satellite network, is addressed, and the basic expression for capacity is developed. The corresponding expressions for a multiple-cell system are derived. and the distribution on the number of users supportable per cell is determined. It is concluded that properly augmented and power-controlled multiple-cell CDMA promises a quantum increase in current cellular capacity. >

2,951 citations

Posted Content
TL;DR: This paper defines and explores proofs of retrievability (PORs), a POR scheme that enables an archive or back-up service to produce a concise proof that a user can retrieve a target file F, that is, that the archive retains and reliably transmits file data sufficient for the user to recover F in its entirety.
Abstract: In this paper, we define and explore proofs of retrievability (PORs). A POR scheme enables an archive or back-up service (prover) to produce a concise proof that a user (verifier) can retrieve a target file F, that is, that the archive retains and reliably transmits file data sufficient for the user to recover F in its entirety.A POR may be viewed as a kind of cryptographic proof of knowledge (POK), but one specially designed to handle a large file (or bitstring) F. We explore POR protocols here in which the communication costs, number of memory accesses for the prover, and storage requirements of the user (verifier) are small parameters essentially independent of the length of F. In addition to proposing new, practical POR constructions, we explore implementation considerations and optimizations that bear on previously explored, related schemes.In a POR, unlike a POK, neither the prover nor the verifier need actually have knowledge of F. PORs give rise to a new and unusual security definition whose formulation is another contribution of our work.We view PORs as an important tool for semi-trusted online archives. Existing cryptographic techniques help users ensure the privacy and integrity of files they retrieve. It is also natural, however, for users to want to verify that archives do not delete or modify files prior to retrieval. The goal of a POR is to accomplish these checks without users having to download the files themselves. A POR can also provide quality-of-service guarantees, i.e., show that a file is retrievable within a certain time bound.

1,783 citations

Journal ArticleDOI
TL;DR: CACM is really essential reading for students, it keeps tabs on the latest in computer science and is a valuable asset for us students, who tend to delve deep into a particular area of CS and forget everything that is happening around us.
Abstract: Communications of the ACM (CACM for short, not the best sounding acronym around) is the ACM’s flagship magazine. Started in 1957, CACM is handy for keeping up to date on current research being carried out across all topics of computer science and realworld applications. CACM has had an illustrious past with many influential pieces of work and debates started within its pages. These include Hoare’s presentation of the Quicksort algorithm; Rivest, Shamir and Adleman’s description of the first publickey cryptosystem RSA; and Dijkstra’s famous letter against the use of GOTO. In addition to the print edition, which is released monthly, there is a fantastic website (http://cacm.acm. org/) that showcases not only the most recent edition but all previous CACM articles as well, readable online as well as downloadable as a PDF. In addition, the website lets you browse for articles by subject, a handy feature if you want to focus on a particular topic. CACM is really essential reading. Pretty much guaranteed to contain content that is interesting to anyone, it keeps tabs on the latest in computer science. It is a valuable asset for us students, who tend to delve deep into a particular area of CS and forget everything that is happening around us. — Daniel Gooch U ndergraduate research is like a box of chocolates: You never know what kind of project you will get. That being said, there are still a few things you should know to get the most out of the experience.

856 citations