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.
With ASON network scale enlarging, many ASON networks often meet trouble for fastly setuping a service and restoration even in current ring network. It would be more serious trouble in mesh network. Firstly, the two part main time factor is proposed. Then the current methods are introduced to accelerate the speed for setuping a service. The first method is to keep network topology in every node by...
In this paper, we study the cost efficient topology design (CETD) problem in a predictable delay tolerant networks (DTN) where the time-evolving network topology is known a priori or can be predicted. We model such time-evolving network as a weighted space-time graph which includes both spacial and temporal information. The aim of CETD is to build a sparse structure from the original space-time graph...
Wireless sensor networks demand the implementation of energy-aware transmission protocols. Recently, cooperative protocols have been suggested for use in sensor networks since they typically require less transmit power than the direct transmission for the same error probability. For sensor networks with short range transmissions, however, the energy consumed in receiving transmissions from cooperative...
In a traditional wakeup scheduling, sensor nodes start up numerous times to communicate in a period, thus consuming extra energy due to state transitions (e.g. from the sleep state to the active state). In this paper, we address a novel wakeup scheduling problem called compact wakeup scheduling, in which a node needs to wake up only once to communicate bidirectionally with all its neighbors. However,...
Packets transmission over VANET is intermittent due to rapid change of network topology. This comes from both high mobility of mobile nodes and limitation of roads. Intermittent transmission causes inefficient packet delivery. Those routing protocols applicable to MANET might not be suitable for VANET. In this paper, we propose a Moving Direction Based Greedy (MDBG) routing algorithm for VANET that...
Numerous studies based on complex measurement platforms have been carried out for over ten years now in order to discover the Internet topology on domain level. It turns out that this topology exhibits certain invariant properties such as a distribution of node degree. This distribution follows a power law. Moreover, the revealed topology is hierarchical. The hierarchy is caused by commercial contracts...
Single-radio mesh routers operating on a single channel suffer from low throughput due to collisions. Equipping mesh routers with multiple radios operating on non-overlapping channels can significantly improve the throughput. However, the assignment of channels to radios in a multi-radio mesh network is a challenging task. In this paper, we propose a channel assignment algorithm, TICA (Topology-controlled...
In the maintenance of communication networks, nodes often need to be rebooted or brought off line for software updates, configuration updates or hardware maintenance. ISPs often run the same protocols and use equipment from the same vendor network-wide, increasing the probability that a maintenance window will be network wide. Some of the updates can be critical where we have to update fast, for example,...
Designing network topologies requires simultaneous consideration of multiple criteria, such as network cost and reliability. So, the author applied the analytic hierarchy process, a way to make a rational decision considering multiple criteria, to network topology evaluation. However, the time required to construct the candidate topology set greatly increases as the network scale grows. This paper...
How to assess the topology vulnerability of a network has attracted more and more attentions recently. Due to the rapid growing number of real- time internet applications developed since the last decade, the discovery of topology weakness related to its quality of service (QoS) is of more interest. In this paper, we provide a novel QoS-aware measurement for assessing the vulnerability of general network...
This paper describes CoZi, a new packet scheduling mechanism for large scale ZigBee networks. CoZi aims at enhancing the reliability of the data delivery and the bandwidth utilization of the network. Based on simple network coding, instead of the classic packet forwarding, our algorithm takes advantage of the shared nature of the wireless medium as well as the cluster-tree topology of IEEE 802.15...
Wireless communication technologies such as microwave radios are used to provide high-speed mobile backhaul connectivity for radio access networks in cases in which wire-based alternatives, e.g. cable or fiber, are not readily available and cannot be deployed in an economic or timely manner. Current mobile backhauls are predominantly deployed in tree or ring topologies, which simplify traffic management...
We will propose an adaptive distributed power management (DISPOW) algorithm that adaptively preserves network connectivity and cooperatively reduces interference for the dynamic environment and the changing network topology thereby improving the network performance. The proposed algorithm distributively builds a unique stable network topology tailored to its surrounding node density and propagation...
We investigate the challenging problem of joint topology design and load balancing in FSO networks. Important factors such as FSO link characteristics, cost constraints, traffic characteristics, traffic demand, and QoS requirements are considered in the problem formulation, along with objective functions of network-wide average traffic load and delay. We develop a fast heuristic algorithm to provide...
The ultimate objective of network planning is to achieve the best performance and profitability with the minimum network investment. In this paper, we investigate the use of the genetic algorithm in order to find "good" feasible solution for the global topology planning problem of Universal Mobile Telecommunications System (UMTS) networks. The latter has been shown to be NP-hard as it is...
This paper introduces a dynamic bandwidth assignment algorithm designed for ring topology (R-DBA) in order to meet the needs of the construction of Metropolitan Area Network (MAN).This algorithm targets ring topology, based on fair iteration, supports various Qos services and has previous assignment mechanism.
In view of the situation that wireless sensor networks have some features like limited resources, the vulnerability, the frequent changes in network topology, this paper puts forward a designed key management in WSN which is based on the geometric properties of circle. This scheme can guarantee that without changing the information stored in the nodes, it is possible to update the key. And compared...
In original Chord model,the semantic property of the content in the model is not taken into account. Besides,a node's logical ID is independent of its physical location,bringing tremendous delay to network routing.Aiming at the system instability of structured P2P model which is caused by the heterogeneity of nodes in model,this paper proposes a Structure P2P network based on the Chord (TI-CHORD)...
Employing channel state information at the network layer, an effective routing metric is obtained that minimizes the end-to-end outage probability in amplify-and-forward multihop wireless networks. A disadvantage of the routing metric obtained is that it cannot be optimized in distributed manner, i.e., it does not converge onto optimal routes. The disadvantage cannot be remedied by exhaustive search...
Topology adaptation is a vital operation in technological networks. It is frequently implemented as either an external process or a distributed online optimization that relies on gathering knowledge on the overall state of the system. In this work we propose MBO, a novel approach that uses network motifs (a local, stochastic metric) for distributed topology optimization of arbitrary, adaptable networks...
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.