A5057455780- Mobile Ad Hoc Networks
- Opportunistic and Delay-Tolerant Networks
- Complex Network Analysis Techniques
- Caching and Content Delivery
- Cooperative Communication and Network Coding
- Tribology and Lubrication Engineering
- Wireless Networks and Protocols
- Optimization and Search Problems
- Peer-to-Peer Network Technologies
- Energy Efficient Wireless Sensor Networks
- Advanced Queuing Theory Analysis
- Gear and Bearing Dynamics Analysis
- IoT and Edge/Fog Computing
- Cloud Computing and Resource Management
- Distributed systems and fault tolerance
- Vehicular Ad Hoc Networks (VANETs)
- Algorithms and Data Compression
- Bioinformatics and Genomic Networks
- Facility Location and Emergency Management
- Network Traffic and Congestion Control
- Blockchain Technology Applications and Security
- Opinion Dynamics and Social Influence
- Mobile Crowdsensing and Crowdsourcing
- Human Mobility and Location-Based Analysis
- Advanced Graph Neural Networks
RTX (United States)
2014-2023
Istanbul Technical University
2021
IBM Research - Thomas J. Watson Research Center
2018
Buckingham Browne & Nichols
2011-2012
Raytheon Technologies (United Kingdom)
2011
Boston University
1997-2004
Medical Components (United States)
1992
Carnegie Mellon University
1986-1988
We present a novel relative mobility metric for mobile ad hoc networks (MANETs). It is based on the ratio of power levels due to successive receptions at each node from its neighbors. propose distributed clustering algorithm, MOBIC, use this selection clusterheads, and demonstrate that it leads more stable cluster formation than "least clusterhead change" version well known Lowest-ID algorithm (Chiang et al., 1997). show reduction as much 33% in rate changes owing proposed technique. In...
We describe PRioritized EPidemic (PREP) for routing in opportunistic networks. PREP prioritizes bundles based on costs to destination, source, and expiry time. Costs are derived from per-link "average availability" information that is disseminated an epidemic manner. maintains a gradient of replication density decreases with increasing distance the destination. Simulation results show outperforms AODV Epidemic Routing by factor about 4 1.4 respectively, gap widening decreasing storage....
Abstract Remote quantum entanglement can enable numerous applications including distributed computation, secure communication, and precision sensing. We consider how a network—nodes equipped with limited processing capabilities connected via lossy optical links—can distribute high-rate simultaneously between multiple pairs of users. develop protocols for such “repeater” nodes, which pair users to achieve large gains in rates over using linear chain repeaters, by exploiting the diversity...
Autonomous and semi-autonomous mobile multirobot systems require a wireless communication network in order to communicate with each other collaboratively accomplish given task. A multihop communications that is self-forming, self-healing, self-organizing ideally suited for such robot exist unpredictable constantly changing environments. However, since every node (or ad hoc) responsible forwarding packets nodes, the failure of critical can result partition. Hence, it ideal have an hoc...
This paper studies methods of quantitatively measuring semantic information in communication. We review existing work on quantifying information, then investigate a model-theoretical approach for data compression and reliable relate our to the statistical measurement by Shannon, show that Shannon's source channel coding theorems have counterparts.
Artificial intelligence, and in particular machine learning, is a fast-emerging field. Research on artificial intelligence focuses mainly image-, text- voice-based applications, leading to breakthrough developments self-driving cars, voice recognition algorithms recommendation systems. In this article, we present the research of an alternative graph-based learning system that deals with three-dimensional space, which more structured combinatorial than images, text or voice. Specifically,...
The application of complex network models to communication systems has led several important results: nonetheless, previous research often neglected take into account their temporal properties, which in many real scenarios play a pivotal role. At the same time, robustness come extensively under scrutiny. Understanding whether networked can undergo structural damage and yet perform efficiently is crucial both protection against failures design new applications. In spite this, it still unclear...
DARPA's Disruption-Tolerant Networking (DTN) program is developing technologies that enable access to information when stable end-to-end paths do not exist and network infrastructure cannot be assured. DTN technology makes use of persistence within nodes, along with the opportunistic mobility, overcome disruptions connectivity. In this paper, we describe SPINDLE system related being developed at BBN under program. Using an open-source, standards-based core a plugin architecture...
Energy efficiency is an important design criterion for the development of sensor networking protocols involving data dissemination and gathering. In-network processing data, aggregation, transmission power control in radios, periodic cycling node wake-up schedules are some techniques that have been roposed literature achieving energy efficiency. Owing to broadcast nature wireless channel many nodes vicinity a sender may overhear its packet transmissions even if they not intended reci ients...
The goal of this paper is to estimate the k most central nodes in a network through parsimonious sampling. Centrality determines relative importance particular node within network. Conventional measures centrality include degree, betweenness, and closeness.
Research on challenged or delay/disruption-tolerant networks has exploded in the past few years with a plethora of algorithms targeted at different versions problem. Yet, there have been formal studies fundamental nature routing problem networks. As step toward closing this gap, we introduce framework relating and solution spaces We define three types several classes mechanisms. then prove number results power each class mechanism terms network that it can solve. show simple variants MANET...
Stateless opportunistic forwarding is a simple fault-tolerant distributed scheme for packet delivery, data gathering, and information querying in intermittently connected networks by which packets are forwarded to the next available neighbors "random walk" fashion until they reach their intended destinations or expire. It has been employed diverse situations, instance, when: 1) global network topology not known highly dynamic; 2) availability of next-hop easily controllable; 3) relaying...
Efficient marketing or awareness-raising campaigns seek to recruit a small number, w, of influential individuals - where w is the campaign budget that are able cover largest possible target audience through their social connections. In this paper we assume topology gradually discovered thanks recruited disclosing We analyze performance variety online myopic algorithms (i.e. do not have priori information on topology) currently used sample and search large networks. also propose new greedy...
Opportunistic forwarding, by which data is randomly relayed to a neighbor based on local network information, fault-tolerant distributed algorithm particularly useful for challenged ad hoc and sensor networks where it difficult obtain global topology information because of frequent disruptions. Also, duty cycling common technique that constrains the RF operations wireless devices saving battery energy thus extending longevity network. The combination opportunistic forwarding approach are...
We live in a world increasingly dominated by networks -- communications, social, information, biological etc. A central attribute of many these is that they are dynamic, is, exhibit structural changes over time. While the practice dynamic has proliferated, we lag behind fundamental, mathematical understanding network dynamism. Existing research on time-varying graphs ranges from preliminary algorithmic studies (e.g., Ferreira's work evolving graphs) to analysis specific properties such as...
In practical military or first responder deployment scenarios, information flows need to adhere specified policies regardless of the physical connectivity nodes. Nodes in such networks are associated with various levels a command-and-control hierarchy, and therefore typically form logical hierarchical tree network that is used route both command data traffic. Associated this communication represents these nodes deployed scenario. Such composite introduce constraints can result having...
Extensive testing of conventional brush seals has identified the phenomena bristle `hysteresis` and `stiffening` with pressure as their two major drawbacks. Subsequent to any differential movement runner into pack due its radial excursions or centrifugal/thermal growths, displaced bristles do not recover against frictional forces between them backing plate. As a result, significant leakage increase is observed following movement. Furthermore, exhibits considerable stiffening effect...
While scheduling the nodes in a wireless network to sleep periodically can save energy, it also incurs higher latency and lower throughput. We consider problem of designing optimal schedules networks, show that finding minimize over given subset source-destination pairs is NP-hard. derive bound by d + O(1/p) for any schedule with required active rate (i.e., fraction slots each node) p, shortest path length d. offer novel solution using green-wave (GWSS), inspired coordinated traffic lights,...
Stateless opportunistic forwarding is a simple fault- tolerant distributed approach for data delivery and information querying in wireless ad hoc networks, where packets are forwarded to the next available neighbors "random walk" fashion, until they reach destinations or expire. This robust against topology changes amenable computation/bandwidth/energy-constrained devices; however, it generally difficult predict end-to-end latency suffered by such random walk given network. In this paper, we...