The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We define and study Euclidean and spatial network variants of a new path finding problem: given a set of safe zones, find paths that minimize the distance traveled outside the safe zones. In this problem, the entire space with the exception of the safe zones is unsafe, but passable, and it differs from problems that involve unsafe regions to be strictly avoided. As a result, existing algorithms are...
The open wireless medium in a mobile ad-hoc network (MANET) enables malicious traffic analysis to dynamically infer the network traffic pattern in hostile environments. The disclosure of the traffic pattern and its changes is often devastating in a mission-critical MANET. A number of anonymous routing protocols have been recently proposed as an effective countermeasure against traffic analysis in...
Session Initiation Protocol (SIP) plays an important role in VoIP, peer-to-peer (P2P) network has been used as virtual server in SIP, and however, it is difficult to authenticate with each other and to exchange session key because of missing central authority (CA). In this paper, the security threats in Peer-to-Peer SIP (P2PSIP) architecture are analyzed, then a new P2PSIP authenticated key exchange...
Because of the instability of link quality, traditional network routing protocols, which are mainly based on the condition of "Best Path", can not work very well over wireless mesh networks. Forwarding packets along the "Best Path" may also induce load imbalance among nodes. This paper presents a novel routing protocol named HPRP (Hierarchical Probabilistic Routing Protocol) for...
Collecting data from source sensor nodes to designated sinks is a common and challenging task in a wide spectrum of sensor network applications, ranging from animal monitoring to security surveillance. A number of approaches exploiting sink mobility have been proposed in recent years: some are proactive, in that sensor nodes push their readings to storage nodes from where they are collected by roaming...
This article presents an in-depth introduction and analysis of the low-data-rate portion of the IEEE standard 802.15.5 that targets on providing mesh capabilities to low-rate wireless personal area networks. As major contributors of this standard, we seek to share our insights and motivations of the approaches adopted in the major components of the standard instead of presenting a la carte items drawn...
Network operators connect their backbone networks together at peering points. It is well known that the peering points are the most congested parts of the backbone network. Network operators have little incentive to provision them well, and have few tools to decide how best to route traffic over them. In this paper we propose how peering networks can be congestion free, so long as we know the total...
Commercial backbone networks must continue to operate even when links and routers fail. Routing schemes such as OSPF, IS-IS, and MPLS reroute traffic, but they cannot guarantee that the resulting network will be congestion-free. As a result, backbone networks are grossly over-provisioned - sometimes running at a utilization below 10% so they can remain uncongested under failure. Yet even with such...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.