- Caching and Content Delivery
- Opportunistic and Delay-Tolerant Networks
- Network Traffic and Congestion Control
- Cooperative Communication and Network Coding
- Peer-to-Peer Network Technologies
- Advanced Data Storage Technologies
- Internet Traffic Analysis and Secure E-voting
- Mobile Ad Hoc Networks
- Software-Defined Networks and 5G
- Network Security and Intrusion Detection
- IPv6, Mobility, Handover, Networks, Security
- Network Packet Processing and Optimization
- Energy Efficient Wireless Sensor Networks
- Wireless Networks and Protocols
- Interconnection Networks and Systems
- IoT and Edge/Fog Computing
- Cryptography and Data Security
- Mobile Agent-Based Network Management
- Distributed systems and fault tolerance
- Advanced Malware Detection Techniques
- Security in Wireless Sensor Networks
- Advanced Optical Network Technologies
- Advanced Wireless Network Optimization
- Energy Harvesting in Wireless Networks
- Carbon and Quantum Dots Applications
China XD Group (China)
2024
Tianjin University of Technology and Education
2024
UCLA Health
2015-2024
University of California, Los Angeles
2015-2024
China University of Petroleum, Beijing
2024
China Energy Engineering Corporation (China)
2024
Antea Group (France)
2023
Xinjiang Normal University
2023
Institute of Electrical and Electronics Engineers
2023
State Grid Corporation of China (China)
2023
Named Data Networking (NDN) is one of five projects funded by the U.S. National Science Foundation under its Future Internet Architecture Program. NDN has roots in an earlier project, Content-Centric (CCN), which Van Jacobson first publicly presented 2006. The project investigates Jacobson's proposed evolution from today's host-centric network architecture (IP) to a data-centric (NDN). This conceptually simple shift far-reaching implications for how we design, develop, deploy, and use...
In recent years, a wide variety of mobile computing devices has emerged, including portables, palmtops, and personal digital assistants. Providing adequate network connectivity for these will require new generation wireless LAN technology. this paper we study media access protocols single channel being developed at Xerox Corporation's Palo Alto Research Center. We start with the MACA protocol first proposed by Karn [9] later refined Biba [3] which uses an RTS-CTS-DATA packet exchange binary...
Sink mobility brings new challenges to large-scale sensor networking. It suggests that information about each mobile sink's location be continuously propagated through the field keep all nodes updated with direction of forwarding future data reports. Unfortunately frequent updates from multiple sinks can lead both excessive drain sensors' limited battery power supply and increased collisions in wireless transmissions. In this paper we describe TTDD, a Two-Tier Data Dissemination approach...
In recent years, a wide variety of mobile computing devices has emerged, including portables, palmtops, and personal digital assistants. Providing adequate network connectivity for these will require new generation wireless LAN technology. this paper we study media access protocols single channel being developed at Xerox Corporation's Palo Alto Research Center. We start with the MACA protocol first proposed by Karn [9] later refined Biba [3] which uses an RTS-CTS-DATA packet exchange binary...
Security has become a primary concern in order to provide protected communication between mobile nodes hostile environment. Unlike the wireline networks, unique characteristics of ad hoc networks pose number nontrivial challenges security design, such as open peer-to-peer network architecture, shared wireless medium, stringent resource constraints, and highly dynamic topology. These clearly make case for building multifence solutions that achieve both broad protection desirable performance....
In this paper we present PEAS, a robust energy-conserving protocol that can build long-lived, resilient sensor networks using very large number of small sensors with short battery lifetime. PEAS extends the network lifetime by maintaining necessary set working nodes and turning off redundant ones. operations are based on individual node's observation local environment do not require any node to maintain per neighbor state. performance possesses high degree robustness in presence both power...
This paper considers the support of real-time applications in an Integrated Services Packet Network (ISPN). We first review characteristics applications. observe that, contrary to popular view that necessarily require a fixed delay bound, some are more flexible and can adapt current network conditions. then propose ISPN architecture supports two distinct kinds service: guaranteed service, which is traditional form service discussed most literature involves pre-computed worst-case bounds,...
This paper describes SRM (Scalable Reliable Multicast), a reliable multicast framework for application level framing and light-weight sessions. The algorithms of this are efficient, robust, scale well to both very large networks has been prototyped in wb, distributed whiteboard application, extensively tested on global with sessions ranging from few more than 1000 participants. the principles that have guided our design, including IP group delivery model, an end-to-end, receiver-based model...
Providing security support for mobile ad-hoc networks is challenging several reasons: (a) wireless are susceptible to attacks ranging from passive eavesdropping active interfering, occasional break-ins by adversaries may be inevitable in a large time window; (b) users demand "anywhere, anytime" services; (c) scalable solution needed large-scale network. In this paper, we describe that supports ubiquitous services hosts, scales network size, and robust against break-ins. our design,...
In a large-scale sensor network individual sensors are subject to security compromises. A compromised node can be used inject bogus sensing reports. If undetected, these reports would forwarded the data collection point (i.e., sink). Such attacks by nodes result in not only false alarms but also depletion of finite amount energy battery powered network. this paper, we present statistical en-route filtering (SEF) mechanism detect and drop during forwarding process. Assuming that same event...
One of the challenging research issues in building high-speed packet-switched networks is how to control transmission rate statistical data flows. This paper describes a new traffic algorithm, VirtualClock , for network applications. monitors average flows and provides every flow with guaranteed throughput low queueing delay. It firewall protection among individual flows, as TDM system, while retaining multiplexing advantages packet switching. Simulation results show that algorithm meets all...
The role of pricing policies in multiple service class networks is studied. An abstract formulation disciplines and that allows the interplay between determining overall network performance to be described more clearly presented. Effective multiclass allow focus resources on performance-sensitive applications, while effective benefits classes spread around all users. Furthermore, incentives formed by must carefully tuned so user self-interest leads optimal performance. These concepts are...
Small, inexpensive sensors with limited memory, computing power and short battery lifetimes are turning into reality. Due to adverse conditions such as high noise levels, extreme humidity or temperatures, even destructions from unfriendly entities, sensor node failures may become norms rather than exceptions in real environments. To be practical, networks must last for much longer times that of individual nodes, have yet robust against potentially frequent failures. This paper presents the...
Wireless sensor networks offer a wide range of challenges to networking research, including unconstrained network scale, limited computing, memory and energy resources, wireless channel errors. We study the problem delivering messages from any an interested client user along minimum-cost path in large network. propose new cost field based approach minimum forwarding. In design, we present novel backoff-based setup algorithm that finds optimal costs all nodes sink with one single message...
While the advantages of multicast delivery over multiple unicast deliveries is undeniable, deployment IP protocol has been limited to "islands" network domains under single administrative control. Deployment inter-domain slow due both technical and reasons. In this paper we propose a Host Multicast Tree Protocol (HMTP) that (1) automates interconnection IP-multicast enabled islands (2) provides end hosts where not available. With HMTP, end-hosts proxy gateways multicast-enabled can...
Many designs for integrated services networks offer a bounded delay packet delivery service to support real-time applications. To provide service, must use admission control regulate their load. Previous work on mainly focused algorithms that compute the worst case theoretical queueing guarantee an absolute bound all packets. In this paper, we describe measurement-based algorithm (ACA) predictive which allows occasional violations. We have tested our through simulations wide variety of...
Article Free Access Share on Observations the dynamics of a congestion control algorithm: effects two-way traffic Authors: Lixia Zhang Computer Science Laboratory, Xerox Palo Alto Research Center CenterView Profile , Scott Shenker Daivd D. Clark Laboratory for Science, Massachusetts Institute Technology TechnologyView Authors Info & Claims SIGCOMM '91: Proceedings conference Communications architecture protocolsAugust 1991Pages 133–147https://doi.org/10.1145/115992.116006Published:01 August...
Mobile ad hoc networking offers convenient infrastructureless communication over the shared wireless channel. However, nature of networks makes them vulnerable to security attacks. Examples such attacks include passive eavesdropping channel, denial service by malicious nodes and from compromised or stolen devices. Unlike their wired counterpart, do not have a clear line defense, every node must be prepared for encounters with an adversary. Therefore, centralized hierarchical network solution...
This paper presents the design of Named-data Link State Routing protocol (NLSR), a routing for Named Data Networking (NDN). Since NDN uses names to identify and retrieve data, NLSR propagates reachability name prefixes instead IP prefixes. Moreover, differs from IP-based link-state protocols in two fundamental ways. First, Interest/Data packets disseminate updates, directly benefiting NDN's data authenticity. Second, produces list ranked forwarding options each prefix facilitate adaptive...
As a proposed Internet architecture, Named Data Networking (NDN) takes fundamental departure from today's TCP/IP thus requiring extensive experimentation and evaluation. To facilitate such experimentation, we have developed ndnSIM, an open-source NDN simulator based on the NS-3 simulation framework. Since its first release in 2012, ndnSIM has gone through five years of active development integration with prototype implementations, become popular platform used by hundreds researchers around...